Aamer, H. and Hidders, Jan and Paredaens, J. and Bussche, J.V.d. (2021) Expressiveness within Sequence Datalog. In: UNSPECIFIED (ed.) PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, pp. 70-81. ISBN 9781450383813.
|
Text
seq-datalog.pdf - Author's Accepted Manuscript Download (4MB) | Preview |
Abstract
Motivated by old and new applications, we investigate Datalog as a language for sequence databases. We reconsider classical features of Datalog programs, such as negation, recursion, intermediate predicates, and relations of higher arities. We also consider new features that are useful for sequences, notably, equations between path expressions, and "packing''. Our goal is to clarify the relative expressiveness of all these different features, in the context of sequences. Towards our goal, we establish a number of redundancy and primitivity results, showing that certain features can, or cannot, be expressed in terms of other features. These results paint a complete picture of the expressiveness relationships among all possible Sequence Datalog fragments that can be formed using the six features that we consider.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | SIGMOD/PODS '21: International Conference on Management of Data Virtual Event China June 20 - 25, 2021 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Jan Hidders |
| Date Deposited: | 22 May 2024 11:38 |
| Last Modified: | 23 May 2024 01:59 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/53502 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
