Abstract
We formally define the constraint database model, the concept of query in this model, and the basic constraint query languages provided by the relational calculus, the relational algebra, and Datalog. We show how a computationally complete constraint query language can be obtained by augmenting the constraint relational calculus with basic programming language features. We look into some basic model-theoretic issues concerning the constraint relational calculus, in particular the equivalence problem. The notion of an o-minimal structure turns out to be a useful abstraction to discuss these issues in some generality. We shall see that equivalence of relational calculus queries on constraint databases is typically undecidable, but that that equivalence is decidable in the special case of conjunctive queries on constraint databases.
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
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.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Undergraduate Texts in Mathematics. Springer-Verlag, 2nd edition, 1994.
C. C. Chang and H. J. Keisler. Model Theory, volume 73 of Studies in Logic and the Foundations of Mathematics. North-Holland, 3rd edition, 1990.
W. A. Hodges. Model Theory. Cambridge University Press, 1993.
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
L. van den Dries. Alfred Tarski’s elimination theory for real closed fields. Journal of Symbolic Logic (JSL), 53: 7–19, 1988.
J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts I—III. Journal of Symbolic Computation (JSC), 13: 255–352, 1992.
B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindric Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer-Verlag, 1998.
S. Basu. Algorithms in Semi-Algebraic Geometry. PhD thesis, New York University, 1996.
J. E. Hoperoft and J. D. Ullman. Introduction to Automata Theory and Formal Languages. Addison-Wesley, 1979.
L. Berman. The complexity of logical theories. Theoretical Computer Science (TCS), 11: 71–77, 1980.
J. Ferrante and J. R. Geiser. An efficient decision procedure for the theory of rational order. Theoretical Computer Science (TCS), 4 (2): 227–233, 1977.
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. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge. Springer-Verlag, 1998.
R. Benedetti and J.-J. Risler. Real algebraic and semi-algebraic sets. Hermann, Editeurs des sciences et des arts, 1990.
L. van den Dries. Tame Topology and O-minimal Structures Cambridge University Press, 1998.
M. Gyssens, J. Van den Bussche, and D. Van Gucht. Complete geometric query languages. Journal of Computer and System Sciences (JCSS), 58 (3): 483–511, 1999.
S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences (JCSS), 55 (2): 273–298, 1997.
O. H. Ibarra and J. Su. On the containment and equivalence of database queries with linear constraints. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 32–43. ACM Press, 1997.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Van den Bussche, J. (2000). Constraint Databases, Queries, and Query Languages. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-04031-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08542-0
Online ISBN: 978-3-662-04031-7
eBook Packages: Springer Book Archive