Aamer, H. and Hidders, Jan and Paredaens, J. and Van den Bussche, J. (2025) Expressiveness within Sequence Datalog. ACM Transactions on Database Systems , ISSN 0362-5915.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
sequenceDatalog.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (471kB) |
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: | Article |
|---|---|
| Keyword(s) / Subject(s): | path variables, solving word equations, stratified negation |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab, Data Analytics, Birkbeck Institute for |
| Depositing User: | Jan Hidders |
| Date Deposited: | 27 Jun 2025 16:01 |
| Last Modified: | 05 Sep 2025 09:11 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/55831 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
