Skip to main content
SpringerLink
Log in

Foundations of indefinite constraint databases

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (PPCP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 874))

Abstract

We lay the foundations of a theory of constraint databases with indefinite information based on the relational model. We develop the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the proposal of Kanellakis, Kuper and Revesz to include indefinite information in the style of Imielinski and Lipski. We propose declarative and procedural query languages for the new scheme and study the semantics of query evaluation.

Most of this research was carried out while the author was with the Computer Science Division, Dept. of Electrical and Computer Engineering, National Technical University of Athens, Greece.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Afrati, S. Cosmadakis, S. Grumbach, and G. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. In this volume.

    Google Scholar 

  2. J. Cox and K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993. Originally appeared as Technical Report No. 90-09, Dept. of Computer and Information Sciences, Brooklyn College of C.U.N.Y.

    Google Scholar 

  3. H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

    Google Scholar 

  4. Gosta Grahne. The Problem of Incomplete Information in Relational Databases. Technical Report Report A-1989-1, Department of Computer Science, University of Helsinki, Finland, 1989. Also published as Lecture Notes in Computer Science 554, Springer Verlag, 1991.

    Google Scholar 

  5. S. Grumbach and J. Su. Finitely representable databases. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 289–300, 1994.

    Google Scholar 

  6. T. Imielinski and W. Lipski. Incomplete Information in Relational Databases. Journal of ACM, 31(4):761–791, 1984.

    Google Scholar 

  7. T. Imielinski. Incomplete Information in Logical Databases. Data Engineering, 12(2):29–39, 1989.

    Google Scholar 

  8. Paris Kanellakis. Elements of Relational Database Theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 17. North-Holland, 1990.

    Google Scholar 

  9. P.C. Kanellakis and D. Goldin. Constraint Programming and Database Query Languages. In Proceedings of Theoretical Aspects of Computer Software (TACS), volume 789 of Lecture Notes in Computer Science, pages 96–120. Springer-Verlag, April 1994.

    Google Scholar 

  10. Paris C. Kanellakis, Gabriel M. Kuper, and Peter Z. Revesz. Constraint Query Languages. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 299–313, 1990. Long version to appear in Journal of Computer and System Sciences.

    Google Scholar 

  11. Manolis Koubarakis. Representation and Querying in Temporal Databases: the Power of Temporal Constraints. In Proceedings of the 9th International Conference on Data Engineering, pages 327–334, April 1993.

    Google Scholar 

  12. M. Koubarakis. Foundations of Temporal Constraint Databases. PhD thesis, Computer Science Division, Dept. of Electrical and Computer Engineering, National Technical University of Athens, February 1994.

    Google Scholar 

  13. Manolis Koubarakis. Complexity Results for First-Order Theories of Temporal Constraints. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR '94), pages 379–390. Morgan Kaufmann, San Francisco, CA, May 1994.

    Google Scholar 

  14. Manolis Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, 19(2):141–173, March 1994.

    Google Scholar 

  15. F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling Infinite Temporal Data. In Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 392–403, 1990.

    Google Scholar 

  16. H.J. Levesque. Foundations of a Functional Approach to Knowledge Representation. Artificial Intelligence, 23:155–212, 1984.

    Google Scholar 

  17. Witold Jr. Lipski. On Semantic Issues Connected with Incomplete Information Databases. ACM Transcactions on Database Systems, 4(3):262–296, September 1979.

    Google Scholar 

  18. M. Maher. A Logic Programming View of CLP. In Proceedings of the 10th International Conference on Logic Programming, pages 737–753, 1993.

    Google Scholar 

  19. David Maier. The theory of relational databases. Computer Science Press, 1983.

    Google Scholar 

  20. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 279–288, 1994.

    Google Scholar 

  21. M.O. Rabin. Decidable theories. In Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 595–629. North-Holland, 1977.

    Google Scholar 

  22. Ray Reiter. On Integrity Constraints. In Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge, pages 97–111, Asilomar, CA, 1988.

    Google Scholar 

  23. Peter Z. Revesz. A Closed Form for Datalog Queries with Integer Order. In Proceedings of the 3rd International Conference on Database Theory, pages 187–201, 1990. Long version to appear in Theoretical Computer Science.

    Google Scholar 

  24. D. Srivastava, R. Ramakrishnan, and P. Revesz. Constraint Objects. In this volume.

    Google Scholar 

  25. P.J. Stuckey. Constructive Negation for Constraint Logic Programming. In Proceedings of Symposium on Logic in Computer Science, pages 328–339, 1991.

    Google Scholar 

  26. Ron van der Meyden. The Complexity of Querying Indefinite Data About Linearly Ordered Domains (Preliminary Version). In Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 331–345, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IC-Parc, Imperial College, SW7 2AZ, London, UK

    Manolis Koubarakis

Authors
  1. Manolis Koubarakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan Borning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koubarakis, M. (1994). Foundations of indefinite constraint databases. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-58601-6_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58601-2

  • Online ISBN: 978-3-540-49032-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation