Constraint databases: A survey

  • Peter Z. Revesz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1358)

Abstract

Constraint databases generalize relational databases by finitely representable infinite relations. This paper surveys the state of the art in constraint databases: known results, remaining open problems and current research directions. The paper also describes a new algebra for databases with integer order constraints and a complexity analysis of evaluating queries in this algebra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul, C. Beeri. On the Power of Languages for the Manipulation of Complex Objects. INRIA Research Report 846, 1988.Google Scholar
  2. 2.
    S. Abiteboul and P. Kanellakis. Database Theory Column: Query Languages for Complex Object Databases. SIGACT News, 21, pp. 9–18, 1990.CrossRefGoogle Scholar
  3. 3.
    S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1994.Google Scholar
  4. 4.
    S. Abiteboul and V. Vianu. Datalog Extensions for Database Queries and Updates. J. Comput. System Sci., 43 (1991), pp. 62–124.CrossRefGoogle Scholar
  5. 5.
    A. Aiken. Set Constraints: Results, Applications and Future Directions. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 171–179, 1994.Google Scholar
  6. 6.
    F. Afrati, S.S. Cosmadakis, S. Grumbach, G.M. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 152–160, 1994.Google Scholar
  7. 7.
    A.V. Aho, J.D. Ullman. Universality of Data Retrieval Languages. Proc. 6th ACM Symp. on Principles of Programming Languages, 110–117, 1979.Google Scholar
  8. 8.
    H. Aït-Kaci, A. Podelski. Towards a Meaning of LIFE. Journal of Logic Programming, 16, 195–234,1993.CrossRefGoogle Scholar
  9. 9.
    M. Ajtai, Y. Gurevich. Datalog vs. First Order. Journal of Computer and Systems Sciences, 1994.Google Scholar
  10. 10.
    K.R. Apt. Logic Programming. Handbook of Theoretical Computer Science, Vol. B, chapter 10, (J. van Leeuwen editor), North-Holland, 1990.Google Scholar
  11. 11.
    K.R. Apt, M.H. van Emden. Contributions to the Theory of Logic Programming. J. ACM, Vol. 29 (3), 841–862, 1982.CrossRefGoogle Scholar
  12. 12.
    K.R. Apt, H.A. Blair, A. Walker. Towards a Theory of Declarative Knowledge, in: J. Minker, ed., Foundation of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.Google Scholar
  13. 13.
    A.K. Aylamazyan, M.M. Gilula, A.P. Stolboushkin, G.F. Schwartz. Reduction of the Relational Model with Infinite Domain to the Case of Finite Domains (in Russian). Proc. USSR Acad. of Science (Doklady), 286(2):308–311, 1986.Google Scholar
  14. 14.
    D.A. Barrington, N. Immerman, H. Straubing. On Uniformity within NC1. Journal of Computer and System Sciences, 41:274–306,1990.CrossRefGoogle Scholar
  15. 15.
    M. Baudinet, J. Chomicki, P. Wolper. Constraint-Generating Dependencies. Proc. 5th Int. Conf. on Database Theory, 322–337, 1995.Google Scholar
  16. 16.
    M. Baudinet, M. Niezette, P. Wolper. On the Representation of Infinite Temporal Data and Queries. Proc. 10th ACM Symp. on Principles of Database Systems, 280–290, 1991.Google Scholar
  17. 17.
    R. Bayer, E. McCreight. Organization of Large Ordered Indexes. Acta Informatica, 1:173–189, 1972.CrossRefGoogle Scholar
  18. 18.
    M. Benedikt, G. Dong, L. Libkin, L. Wong. Relational Expressive Power of Constraint Query Languages. Proc. 15h ACM Symp. on Principles of Database Systems, 5–16, 1996.Google Scholar
  19. 19.
    M. Ben-Or, D. Kozen, J. Reif. The Complexity of Elementary Algebra and Geometry. Journal of Computer and System Sciences, 32:251–264, 1986.CrossRefGoogle Scholar
  20. 20.
    C. Bell, A. Nerode, R. Ng, V.S. Subrahmanian. Implementing Deductive Databases by Linear Programming. Proc. 11h ACM Symp. on Principles of Database Systems, 283–292, 1992.Google Scholar
  21. 21.
    L. Berman. Precise Bounds for Presburger Arithmetic and the Reals with Addition. Proc. 18th IEEE FOCS, pp. 95–99, 1977.Google Scholar
  22. 22.
    A.H. Borning. The Programming Language Aspects of ThingLab, A Constraint-Oriented Simulation Laboratory. ACM TOPLAS 3:4:353–387, 1981.CrossRefGoogle Scholar
  23. 23.
    A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Constraint Databases. Proc. 19th VLDB, 322–331, 1993.Google Scholar
  24. 24.
    A. Brodsky, Y. Kornatzky. The Lyric Language: Querying Constraint Objects. Proc. SIGMOD, 35–46, 1995.Google Scholar
  25. 25.
    J. Byon, P.Z. Revesz. DISCO: A Constraint Database System with Sets. Proc. Workshop on Constraint Databases and Applications, Springer-Verlag LNCS 1034, 68–83, 1995.Google Scholar
  26. 26.
    A. Brodsky, C. Lassez, J.L. Lassez, M.J. Maher. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. Proc. 14th Symp. on Principles of Database Systems, 1995.Google Scholar
  27. 27.
    A. Brodsky, Y. Sagiv. Inference of Inequality Constraints in Logic Programs. Proc. 10th ACM Symp. on Principles of Database Systems, 227–241, 1991.Google Scholar
  28. 28.
    A. Brodsky and V. Segal. The C 3 Constraint Object-Oriented Database System: An Overview, 134–159, In: [61].Google Scholar
  29. 29.
    A.R. Bruss, A.R. Meyer. On Time-Space Classes and their Relation to the Theory of Real Addition. Proc. 10th ACM STOC, pp. 233–239, 1978.Google Scholar
  30. 30.
    S.R. Buss. The Formula Value Problem is in ALOGTIME. Proc. 19th ACM STOC pp. 123–131, 1987.Google Scholar
  31. 31.
    A.K. Chandra, D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, vol. 21, 156–178, 1980.CrossRefGoogle Scholar
  32. 32.
    A.K. Chandra, D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, vol. 25, 99–128, 1982.CrossRefGoogle Scholar
  33. 33.
    A.K. Chandra, D. Harel. Horn Clause Queries and Generalizations. Journal of Logic Programming, vol. 2, 1–15, 1985.CrossRefGoogle Scholar
  34. 34.
    A.K. Chandra, P.M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Databases. Proc. ACM STOC, 77–90, 1977.Google Scholar
  35. 35.
    J. Chomicki. Polynomial Time Query Processing in Temporal Deductive Databases. Proc. 9th ACM Symp. on Principles of Database Systems, 379–391, 1990.Google Scholar
  36. 36.
    J. Chomicki. Functional Deductive Databases: Query Processing in the Presence of Limited Function Symbols, Ph.D. Thesis. Rutgers University, 1990.Google Scholar
  37. 37.
    J. Chomicki, D. Goldin, G. Kuper. Variable Independence and Aggregation Closure. Proc. 15th ACM Symp. on Principles of Database Systems, 40–48, 1996.Google Scholar
  38. 38.
    J. Chomicki, T. Imielinski. Relational Specifications of Infinite Query Answers. Proc. ACM SIGMOD, 174–183, 1989.Google Scholar
  39. 39.
    J. Chomicki, T. Imielinski. Finite Representation of Infinite Query Answers. ACM Transactions of Database Systems, 181–223, vol. 18, no. 2, 1993.CrossRefGoogle Scholar
  40. 40.
    J. Chomicki, G. Kuper. Measuring Infinite Relations. Proc. 14th ACM Symp. on Principles of Database Systems, 78–85, 1995.Google Scholar
  41. 41.
    E.F. Codd. A Relational Model for Large Shared Data Banks. CACM, 13:6:377–387, 1970.Google Scholar
  42. 42.
    J. Cohen. Constraint Logic Programming Languages. CACM, 33:7:52–68, 1990.Google Scholar
  43. 43.
    A. Colmerauer. An Introduction to Prolog III. CACM, 33:7:69–90, 1990.Google Scholar
  44. 44.
    A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, Bases Th'eoriques et D'evelopements Actuels. Techniques et Sciences Informatiques, 2:4:271–311, 1983.Google Scholar
  45. 45.
    G.E. Collins. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Proc. 2nd GI conference on Automata Theory and Languages, LNCS 33, pp. 512–532, Springer-Verlag, 1975.Google Scholar
  46. 46.
    D. Comer. The Ubiquitous B-Tree. Computing Surveys, 11:2:121–137, 1979.CrossRefGoogle Scholar
  47. 47.
    J. Cox, K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In: Constraint Logic Programming, MIT Press, 1993.Google Scholar
  48. 48.
    J. Cox, K. McAloon, C. Tretkoff. Computational Complexity and Constraint Logic Programming. Annals of Math. and AI, 5:163–190, 1992.Google Scholar
  49. 49.
    M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthiei. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, Tokyo Japan, 1988.Google Scholar
  50. 50.
    K. Doets, From Logic to Logic Programming. MIT PRess, 1994.Google Scholar
  51. 51.
    A. Ehrenfeucht. An application of games to the completeness problem formalized theories. Fund. Math, 49, 1961.Google Scholar
  52. 52.
    M.H. van Emden, R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. J. ACM, Vol. 23 (4), 733–742, 1976.CrossRefGoogle Scholar
  53. 53.
    H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.Google Scholar
  54. 54.
    J. Ferrante, J.R. Geiser. An Efficient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4:227–233, 1977.CrossRefGoogle Scholar
  55. 55.
    J. Ferrante, C. Rackoff. A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM J. Comp, 4:1:69–76, 1975.CrossRefGoogle Scholar
  56. 56.
    J. Ferrante, C.W. Rackoff. The Computational Complexity of Logical Theories, Springer-Verlag (No. 718), 1979.Google Scholar
  57. 57.
    M.J. Fischer, M.O. Rabin. Super-Exponential Complexity of Presburger Arithmetic. SIAM-AMS Proc. volume VII, American Mathematical Society, 1974.Google Scholar
  58. 58.
    J-B.J. Fourier. Reported in: Analyse des travaux de l'Acadamie Royale des Sciences, pendant l'annee 1824, Partie mathematique, Histoire de l'Academie Royale des Sciences de l'Institut de France, Vol. 7, xlvii–lv, 1827. (Partial English translation in: D.A. Kohler. Translation of a Report by Fourier on his work on Linear Inequalities. Opsearch, Vol. 10, 38–42, 1973.)Google Scholar
  59. 59.
    R. Fraïssé. Sur les classifications des systèmes de relations. Publ. Sci. Univ Alger, I:1, 1954.Google Scholar
  60. 60.
    E. Freuder. Synthesizing Constraint Expressions. CACM 21:11, 1978.Google Scholar
  61. 61.
    V. Gaede, A. Brodsky, O. Günther, D. Srivastava, V. Vianu, M. Wallace, (Eds.), Constraint Databases and Applications, Proc. Second Int. Workshop on Constraint Database Systems, Delphi, Greece, January 1997, and Workshop on Constraints and Databases, Cambridge, MA August 1996, Springer-Verlag LNCS 1191.Google Scholar
  62. 62.
    K. Gödel. Über formal unentscheidbare Sätze der Principia Mathernatica und verwandter Systeme I. Monatshefte für Mathematik und Physik. vol. 38, 173–198, 1931.CrossRefGoogle Scholar
  63. 63.
    R. Gross, R Marti. Compile-time Constraint Solving in a Constraint Database System. Proc. Post-ILPS'9l, Workshop on Constraints and Databases, 13–25, 1994.Google Scholar
  64. 64.
    Y. Gurevich, S. Shelah. Fixed-Point Extensions of First-Order Logic. Annals of Pure and Applied Logic, 32, 265–280, 1986.CrossRefGoogle Scholar
  65. 65.
    S. Grumbach, J Su. Finitely Representable Databases. Proc. 13th ACM Symp. on Principles of Database Systems, 289–300, 1994.Google Scholar
  66. 66.
    S. Grumbach, J Su. Dense-Order Constraint Databases. Proc. 14th ACM Symp. on Principles of Database Systems, 66–77, 1995.Google Scholar
  67. 67.
    S. Grumbach, J Su. Towards Practical Constraint Databases. Proc. 15h ACM Symp. on Principles of Database Systems, 28–39, 1996.Google Scholar
  68. 68.
    S. Grumbach, J Su, C. Tollu. Linear Constraint Databases. Proc. LCC, 1994.Google Scholar
  69. 69.
    M.R. Hansen, B.S. Hansen, P. Lucas, P. van Emde Boas. Integrating Relational Databases and Constraint Languages. Computer Languages, 14:2:63–82,1989.CrossRefGoogle Scholar
  70. 70.
    N. Heintze, J. Jaffar. Set Constraints and Set-Based Analysis. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 1–17, 1994.Google Scholar
  71. 71.
    R. Helm, K. Marriott, M. Odersky. Constraint-based Query Optimization for Spatial Databases. Proc. 10th ACM Symp. on Principles of Database Systems, 181–191, 1991.Google Scholar
  72. 72.
    R. Hull, J. Su. Domain Independence and the Relational Calculus. Acta Informatica, 31, 513–524, 1994.CrossRefGoogle Scholar
  73. 73.
    N. Immerman. Relational Queries Computable in Polynomial Time. Information and Control, 68:86–104, 1986.CrossRefGoogle Scholar
  74. 74.
    J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111–119, 1987.Google Scholar
  75. 75.
    J. Jaffar, M.J. Maher. Constraint Logic Programming: A Survey. J. Logic Programming, 19 & 20, 503–581, 1994.CrossRefGoogle Scholar
  76. 76.
    J. Jaffar, S. Michaylov, P.J. Stuckey, R.H. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14:3, 339–395, 1992.CrossRefGoogle Scholar
  77. 77.
    D.S. Johnson. A Catalogue of Complexity Classes. Handbook of Theoretical Computer Science, Vol. A, chapter 2, (J. van Leeuwen editor), North-Holland, 1990.Google Scholar
  78. 78.
    F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM Symp. on Principles of Database Systems, 392–403, 1990. Final version to appear in Journal of Computer and System Sciences.Google Scholar
  79. 79.
    P.C. Kanellakis. Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Vol. B, chapter 17, (J. van Leeuwen editor), North-Holland, 1990.Google Scholar
  80. 80.
    P.C. Kanellakis. Tutorial: Constraint Programming and Database Languages. Proc. 14th ACM Symp. on Principles of Database Systems, 46–53, 1995.Google Scholar
  81. 81.
    P.C. Kanellakis, D.Q. Goldin. Constraint Programming and Database Query Languages. Proc. 2nd TACS, 1994.Google Scholar
  82. 82.
    P.C. Kanellakis, G.M. Kuper, P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, vol. 51, no. 1, pp. 26–52, August 1995. (Preliminary version in Proc. 9th ACM Symp. on Principles of Database Systems, 299–313, 1990.)CrossRefGoogle Scholar
  83. 83.
    P.C. Kanellakis, J.L. Lassez, V.J. Saraswat, eds., Proc. Workshop on the Principles and Practice of Constraint Programming, 1993.Google Scholar
  84. 84.
    P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, J. S. Vitter. Indexing for Data Models with Constraints and Classes. Proc. 12th ACM Symp. on Principles of Database Systems, 233–243, 1993.Google Scholar
  85. 85.
    L.G. Khachian. A Polynomial Algorithm in Linear Programming. Soviet Math. Dokl., 20(1), 191–194, 1979.Google Scholar
  86. 86.
    M. Kifer. On Safety, Domain Independence, and Capturability of Database Queries. Proc. International Conference on Databases and Knowledge Bases, Jerusalem Israel, 1988.Google Scholar
  87. 87.
    A. Klug: Equivalence of Relational Algebra and Relational Calculus Query Languages having Aggregate Functions. JACM, 29:3:699–717, 1982.CrossRefGoogle Scholar
  88. 88.
    A. Klug. On Conjunctive Queries Containing Inequalities. JACM, 35:1:146–160, 1988.CrossRefGoogle Scholar
  89. 89.
    P. Kolaitis, C.H. Papadimitriou. Why not Negation by Fixpoint? Proc. 7th ACM Symp. on Principles of Database Systems, 231–239, 1988.Google Scholar
  90. 90.
    M. Koubarakis. Representing and Querying in Temporal Databases: the Power of Temporal Constraints. Proc. Ninth International Conference on Data Engineering, 1993.Google Scholar
  91. 91.
    M. Koubarakis. Complexity Results for First-Order Theories of Temporal Constraints. Int. Conf. on Knowledge Representation and Reasoning, 1994.Google Scholar
  92. 92.
    D. Kozen, C. Yap. Algebraic Cell Decomposition in NC. Proc. 26th IEEE FOGS, 515–521, 1985.Google Scholar
  93. 93.
    B. Kuipers, J. Paredaens, Jan Van den Bussche. On Topological Elementary Equivalence of Spatial Databases. Proc. 6th Int. Conf. on Database Theory, 432–446, Springer-Verlag LNCS 1186, 1997.Google Scholar
  94. 94.
    G.M. Kuper. On the Expressive Power of the Relational Calculus with Arithmetic Constraints. Proc. 3rd Int. Conf. on Database Theory, 202–211, 1990.Google Scholar
  95. 95.
    G.M. Kuper. Aggregation in Constraint Databases. Proc. Workshop on the Principles and Practice of Constraint Programming, 176–183, 1993.Google Scholar
  96. 96.
    W. Leler. Constraint Programming Languages. Addison Wesley, 1987.Google Scholar
  97. 97.
    A. Levy, I.S. Mumick, Y. Sagiv, O. Shmueli. Equivalence, Query Reachability and Satisfiability in Datalog Extensions. Proc. 12h ACM Symp. on Principles of Database Systems, 109–122, 1993.Google Scholar
  98. 98.
    A. Levy, Y. Sagiv. Constraints and Redundancy in Datalog. Proc. 11h ACM Symp. on Principles of Database Systems, 67–80, 1992.Google Scholar
  99. 99.
    C. Langford. Some Theorems on Deducibility. Annals of Mathematics. vol. 28, 16–40, 459–471, 1927.MathSciNetGoogle Scholar
  100. 100.
    L. Libkin, L. Wong. New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions. Proc. 13h ACM Symp. on Principles of Database Systems, 155–166, 1994.Google Scholar
  101. 101.
    J.W. Lloyd. Foundations of Logic Programming. Spring, Berlin, 2nd ed., 1987Google Scholar
  102. 102.
    A.K. Mackworth. Consistency in Networks of Relations. AI, 8:1, 1977.Google Scholar
  103. 103.
    M. J. Maher and D. Srivastava. Chasing Constraint-Tuple Generating Dependencies. Proc. 15h ACM Symp. on Principles of Database Systems, 128–138, 1996.Google Scholar
  104. 104.
    Y. Matiyasevich. Enumerable Sets are Diophantine. Doklady Akademii Nauk SSR. vol. 191, 279–282, 1970.Google Scholar
  105. 105.
    U. Montanari. Networks of Constraints: Fundamental Properties and Application to Picture Processing. Information Science, 7, 1974.Google Scholar
  106. 106.
    I. S. Mumick, S. J. Finkelstein, H. Pirahesh, R. Ramakrishnan. Magic Conditions. Proc. 9th ACM Symp. on Principles of Database Systems, 314–330, 1990.Google Scholar
  107. 107.
    I.S. Mumick, O. Shmueli. Universal Finiteness and Satisfiability. Proc. 13h ACM Symp. on Principles of Database Systems, 190–200, 1994.Google Scholar
  108. 108.
    C.H. Papadimitriou, D. Suciu, V. Vianu. Topological Queries in Spatial Databases. Proc. 15h ACM Symp. on Principles of Database Systems, 81–92, 1996.Google Scholar
  109. 109.
    J. Paredaens, J.V.D. Bussche, D.V. Gucht. Towards A Theory of Spatial Database Queries. Proc. 13h ACM Symp. on Principles of Database Systems, 279–288, 1994.Google Scholar
  110. 110.
    J. Paredaens. Spatial Databases: The Final Frontier. Proc. 5th Int. Conf. on Database Theory, Springer-Verlag LNCS 893, 1995.Google Scholar
  111. 111.
    J. Paredaens, J.V.D. Bussche, D.V. Gucht. First-Order Queries on Finite Structures over the Reals. Proc. LICS, 1995.Google Scholar
  112. 112.
    F.P. Preparata, M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.Google Scholar
  113. 113.
    M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes Rendus, I. Congrès des Math. des Pays Slaves, Warsaw, 192–201, 395, 1929.Google Scholar
  114. 114.
    R. Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. Proc. 5th International Conference on Logic Programming, 141–159, 1988.Google Scholar
  115. 115.
    R. Ramakrishnan, D. Srivastava, S. Sudarshan. CORAL: Control, Relations and Logic. Proc. VLDB, 1992.Google Scholar
  116. 116.
    R. Ramaswamy. Efficient Indexing for Constraint and Temporal Databases. Proc. 6th Int. Conf. on Database Theory, 419–431, Springer-Verlag LNCS 1186, 1997.Google Scholar
  117. 117.
    R. Ramaswamy, S. Subramanian. Path Caching: A Technique for Optimal External Searching Proc. 13h ACM Symp. on Principles of Database Systems, 25–35, 1994.Google Scholar
  118. 118.
    C.R. Reddy, D.W. Loveland. Presburger Arithmetic with Bounded Quantifier Alternation. Proc. ACM Symp. on Theory of Comp., 320–325, 1978.Google Scholar
  119. 119.
    J. Renegar. On the Computational Complexity and Geometry of the Firstorder Theory of the Reals: Parts I–III. Journal of Symbolic Computation, 13:255–352, 1992.Google Scholar
  120. 120.
    P. Z. Revesz. Constraint Query Languages. Ph.D. Thesis. Brown University, 1991.Google Scholar
  121. 121.
    P. Z. Revesz. A Closed Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints, Theoretical Computer Science, vol. 116, no. 1, 117–149, 1993. (Preliminary version in Proc. Third International Conference on Database Theory, Springer-Verlag LNCS 470, 187–201, 1990.)CrossRefGoogle Scholar
  122. 122.
    P. Z. Revesz. Datalog Queries of Set Constraint Databases. Proc. Fifth International Conference on Database Theory, Springer-Verlag LNCS 893, 425–438, 1995.Google Scholar
  123. 123.
    P. Z. Revesz. Safe Stratified Datalog with Integer Order Programs. Proc. First International Conference on Principles and Practice of Constraint Programming, Springer-Verlag LNCS 976, 154–169, 1995.Google Scholar
  124. 124.
    P. Z. Revesz. Safe Query Languages for Constraint Databases. ACM Transactions on Database Systems, March, 1998, to appear.Google Scholar
  125. 125.
    P. Z. Revesz. The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases, International Journal of Algebra and Computation, to appear.Google Scholar
  126. 126.
    P. Z. Revesz. Model-Theoretic Minimal Change Operators for Constraint Databases. Proc. 6th Int. Conf. on Database Theory, 447–460, Springer-Verlag LNCS 1186, 1997.Google Scholar
  127. 127.
    P. Z. Revesz. Refining Restriction Enzyme Genome Maps. Constraints, vol. 2, no. 3–4, pp. 361–375, December 1997. (Preliminary version in [61].)CrossRefGoogle Scholar
  128. 128.
    J. Robinson. Definability and Decision Problems in Arithmetic. Journal of Symbolic Logic, Vol. 14, pp. 98–114, 1949.Google Scholar
  129. 129.
    H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading MA, 1990.Google Scholar
  130. 130.
    H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading MA, 1990.Google Scholar
  131. 131.
    V.A. Saraswat. Concurrent Constraint Programming Languages. Ph.D. thesis, Carnegie Mellon University, 1989.Google Scholar
  132. 132.
    D. Srivastava. Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints. Proc. 2nd International Symposium on Artificial Intelligence and Mathematics, 1992.Google Scholar
  133. 133.
    D. Srivastava, R. Ramakrishnan. Pushing Constraint Selections. Proc. 11h ACM Symp. on Principles of Database Systems, 301–315, 1992.Google Scholar
  134. 134.
    D. Srivastava, R. Ramakrishnan, P.Z. Revesz. Constraint Objects. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, Springer-Verlag LNCS 874, 274–284, 1994.Google Scholar
  135. 135.
    G.L. Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. Ph.D. Thesis, MIT, AI-TR 595, 1980.Google Scholar
  136. 136.
    A. Stolboushkin and M.A. Taitslin. Finite Queries do not have Effective Syntax. Proc. 14th ACM Symp. on Principles of Database Systems, 277–285, 1995.Google Scholar
  137. 137.
    A. Stolboushkin and M.A. Taitslin. Linear vs. Order Constraint Queries over Rational Databases. Proc. 15h ACM Symp. on Principles of Database Systems, 17–27, 1996.Google Scholar
  138. 138.
    P.J. Stuckey, S. Sudarshan. Compiling Query Constraints. Proc. 13h ACM Symp. on Principles of Database Systems, 56–67, 1994.Google Scholar
  139. 139.
    I.E. Sutherland. SKETCHPAD: A Man-Machine Graphical Communication System. Spartan Books, 1963.Google Scholar
  140. 140.
    B.A. Trakhtenbrot. The Impossibility of an Algorithm for the Decision Problem on Finite Models. (In Russian) Doklady Akademii Nauk SSR, 70, 569–572, 1950.Google Scholar
  141. 141.
    A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, California, 1951.Google Scholar
  142. 142.
    A. Tarski, F.B. Thompson. Some General Properties of Cylindrical Algebras. Bulletin of the AMS, 58:65, 1952.Google Scholar
  143. 143.
    B. Thalheim. Dependencies in Relational Databases. Teubner Verlagsgesellschaft, Stuttgart and Leipzig, 1991.Google Scholar
  144. 144.
    D. Toman. Top-Down Beats Bottom-Up for Constraint Based Extensions of Datalog. Proc. ILPS, 98–112, 1995.Google Scholar
  145. 145.
    D. Toman. Foundations of Temporal Query Languages., Ph.D. Thesis. Kansas State University, 1995.Google Scholar
  146. 146.
    D. Toman. Point vs. Interval-Based Query Languages for Temporal Databases. Proc. 15h ACM Symp. on Principles of Database Systems, 58–67, 1996.Google Scholar
  147. 147.
    D. Toman, J. Chomicki, D.S. Rogers. Datalog with Integer Periodicity Constraints. Proc. ILPS, 1994.Google Scholar
  148. 148.
    S. Tsur and C. Zaniolo. LDL: A Logic-Based Data-Language. Proc. VLDB, pp 33–41, 1986.Google Scholar
  149. 149.
    J.D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, vol. 1&2, 1989.Google Scholar
  150. 150.
    R. van den Dries. Remarks on Tarski's problem concerning (R, +,*,exp). In Logic Colloquium, North-Holland, 1982. Elsevier.Google Scholar
  151. 151.
    R. van der Meyden. The Complexity of Querying Indefinite Data about Linearly Ordered Domains. Proc. 11th ACM Symp. on Principles of Database Systems, 331–346, 1992.Google Scholar
  152. 152.
    A. Van Gelder. Deriving Constraints among Argument Sizes in Logic Programs. Proc. 9th ACM Symp. on Principles of Database Systems, 47–60, 1990.Google Scholar
  153. 153.
    P. Van Hentenryck. Constraint Logic Programming, The Knowledge Engineering Review, 6, 165–180,1989.Google Scholar
  154. 154.
    P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.Google Scholar
  155. 155.
    M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM STOC, 137–146, 1982.Google Scholar
  156. 156.
    P. Voda. Types of Trilogy. Proc. 5th International Conference on Logic Programming, 580–589, 1988.Google Scholar
  157. 157.
    H.P. Williams. Fourier-Motzkin Elimination Extension to Integer Programming Problems. In Journal of Combinatorial Theory (A). vol. 21, 118–123, 1976.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Z. Revesz
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Nebraska-LincolnUSA

Personalised recommendations