Abstract
Recursion is an important feature to express many natural queries. The most studied recursive query language for databases is called Datalog, an abbreviation for “Database logic programs.” In Section 2.8 we gave the basic definitions for Datalog, and we also saw that the language is not closed for important constraint classes such as linear equalities. We have also seen some results on restricting the language, and the resulting expressive power, in Section 4.4.1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL’87), pages 111–119. ACM Press, 1987.
P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. In Proceedings of the 9th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS’90), pages 299–313. ACM Press, 1990.
P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1): 26–52, 1995.
S. Grumbach and J. Su. Dense-order constraint databases. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’95), pages 66–77. ACM Press, 1995.
P. Z. Revesz. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science (TCS), 116 (1/2): 117–149, 1993.
J. Cox and K. McAloon. Decision procedures for constraint based extensions of Datalog. In Constraint Logic Programming. MIT Press, 1993.
P. Z. Revesz. Safe stratified Datalog with integer order programs. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP’95), volume 976 of Lecture Notes in Computer Science, pages 154–169. Springer-Verlag, 1995.
P. Z. Revesz. Safe query languages for constraint databases. ACM Transactions on Databases Systems (TODS), 23 (1): 58–99, 1998.
A. P. Stolboushkin and M. A. Taitslin. Finite queries do not have effective syntax. In Proceedings of the 14th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS’95), pages 277–285. ACM Press, 1995.
A. P. Stolboushkin and M. A. Taitslin. Safe stratified Datalog with integer order does not have syntax. ACM Transactions on Databases Systems (TODS), 23 (1): 100–109, 1998.
P. Z. Revesz. Safe stratified Datalog with integer order programs. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP’95), volume 976 of Lecture Notes in Computer Science, pages 154–169. Springer-Verlag, 1995.
P. Z. Revesz. Safe query languages for constraint databases. ACM Transactions on Databases Systems (TODS), 23 (1): 58–99, 1998.
P. Z. Revesz. Datalog programs with difference constraints. In Proceedings of the Twelfth International Conference on Applications of Prolog, pages 69–76, 1999.
P. Z. Revesz. Safe Datalog queries with linear constraints. In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP’98), volume 1520 of Lecture Notes in Computer Science, pages 355–369. Springer-Verlag, 1998.
B. Kuijpers, J. Paredaens, M. Smits, and J. Van den Bussche. Termination properties of spatial Datalog programs. In International Workshop on Logic in Databases (LID’96), volume 1154 of Lecture Notes in Computer Science, pages 101–116. Springer-Verlag, 1996.
B. Kuijpers and M. Smits. On expressing topological connectivity in spatial Datalog. In Proceedings of the 2nd Workshop on Constraint Databases and Applications (CDB’97), volume 1191 of Lecture Notes in Computer Science, pages 116–133. Springer-Verlag, 1997.
F. Geerts and B. Kuijpers. Expressing topological connectivity of spatial databases. In Proceedings of the 7th International Workshop on Database Programming Languages (DBPL’99), Lecture Notes in Computer Science. Springer-Verlag, 1999.
J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Transactions on Databases Systems (TODS), 18 (2): 181–223, 1993.
D. Toman, J. Chomicki, and D. S. Rogers. Datalog with integer periodicity constraints. In Proceedings of the 11th International Symposium on Logic Programming (ILPS’g4), pages 189–203. MIT Press, 1994.
L. Fribourg and H. Olsén. A decompositional approach for computing least fixed-points of Datalog programs with Z-counters. Constraints, 2 (3/4): 305–335, 1997.
W. Biittner and H. Simonis. Embedding Boolean expressions into logic programming Journal of Symbolic Computation (JSC), 4 (2): 191–205, 1987.
P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1): 26–52, 1995.
J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19 /20: 503–581, 1994.
P. Z. Revesz. Constraint databases: A survey. In L. Libkin and B. Thalheim, editors, Semantics in Databases, volume 1358 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Revesz, P.Z. (2000). Datalog and Constraints. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-04031-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08542-0
Online ISBN: 978-3-662-04031-7
eBook Packages: Springer Book Archive