Skip to main content
SpringerLink
Log in

Constraint-generating dependencies

  • 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

Traditionally, dependency theory has been developed for uninterpreted data. Specifically, the only assumption that is made about the data domains is that data values can be compared for equality. However, data is often interpreted and there can be advantages in considering it as such, for instance obtaining more compact representations as done in constraint databases. This paper considers dependency theory in the context of interpreted data. Specifically, it studies constraint-generating dependencies. These are a generalization of equality-generating dependencies where equality requirements are replaced by constraints on an interpreted domain. The main technical results in the paper are decision procedures for the implication and consistency problems for constraint-generating dependencies. These decision procedures proceed by reducing the dependency problem to a decision problem for the constraint theory of interest, and are applicable as soon as the underlying constraint theory is decidable. Furthermore, complexity results for specific constraint domains can be transferred quite directly to the dependency problem.

This work was supported by NATO Collaborative Research Grant CRG 940110 and by NSF Grant IRI-9110581.

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. M. Baudinet. On the expressiveness of temporal logic programming. To appear in Information and Computation.

    Google Scholar 

  2. M. Baudinet. Temporal logic programming is complete and expressive. In Sixteenth ACM Symp. on Principles of Programming Languages, pp. 267–280, Austin, TX, Jan. 1989.

    Google Scholar 

  3. M. Baudinet, J. Chomicki, and P. Wolper. Temporal deductive databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, eds., Temporal Databases. Theory, Design, and Implementation, chapter 13, pp. 294–320. Benjamin/Cummings, 1993.

    Google Scholar 

  4. M. Baudinet, M. Niézette, and P. Wolper. On the representation of infinite temporal data and queries. In Tenth ACM Symp. on Principles of Database Systems, pp. 280–290, Denver, CO, May 1991.

    Google Scholar 

  5. C. Beeri and M. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718–741, Oct. 1984.

    Google Scholar 

  6. A. Brodsky, J. Jaffar, and M. J. Maher. Toward practical constraint databases. In 19th Intl. Conf. on Very Large Data Bases, Dublin, Ireland, Aug. 1993.

    Google Scholar 

  7. A. Brodsky, C. Lassez, and J.-L. Lassez. Separability of polyhedra and a new approach to spatial storage. In Proc. of the First Workhop on Principles and Practice of Constraint Programming, Newport, Rhode Island, Apr. 1993.

    Google Scholar 

  8. J. Chomicki. Polynomial time query processing in temporal deductive databases. In Ninth ACM Symp. on Principles of Database Systems, pp. 379–391, Nashville, TN, Apr. 1990.

    Google Scholar 

  9. J. Chomicki and T. Imieliński. Temporal deductive databases and infinite objects. In Seventh ACM Symp. on Principles of Database Systems, pp. 61–73, Austin, TX, Mar. 1988.

    Google Scholar 

  10. J. Chomicki and T. Imieliński. Finite Representation of Infinite Query Answers. ACM Transactions on Database Systems, 18(2):181–223, June 1993.

    Google Scholar 

  11. J. Cox and K. McAloon. Decision procedures for constraint based extensions of Datalog. In F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming: Selected Research. MIT Press, 1993.

    Google Scholar 

  12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.

    Google Scholar 

  13. S. Ginsburg and R. Hull. Order dependency in the relational model. Theoretical Computer Science, 26:149–195, 1983.

    Google Scholar 

  14. S. Ginsburg and R. Hull. Sort sets in the relational model. J. ACM, 33(3):465–488, July 1986.

    Google Scholar 

  15. A. Gupta, Y. Sagiv, J. D. Ullman, and J. Widom. Constraint checking with partial information. In Thirteenth ACM Symp. on Principles of Database Systems, pp. 45–55, Minneapolis, MN, May 1994.

    Google Scholar 

  16. N. S. Ishakbeyoglu and Z. M. Ozsoyoglu. On the maintenance of implication integrity constraints. In Fourth Intl. Conf. on Database and Expert Systems Applications, pp. 221–232, Prague, Sept. 1993. LNCS 720, Springer-Verlag.

    Google Scholar 

  17. C. Jensen and R. Snodgrass. Temporal specialization. In Eighth Intl. Conf. on Data Enfineering, pp. 594–603, Tempe, AZ, Feb. 1992. IEEE.

    Google Scholar 

  18. F. Kabanza, J.-M. Stévenne, and P. Wolper. Handling infinite temporal data. In Ninth ACM Symp. on Principles of Database Systems, pp. 392–403, Nashville, TN, Apr. 1990.

    Google Scholar 

  19. P. C. Kanellakis, G. M. Kuper, and P. Revesz. Constraint query languages. In Ninth ACM Symp. on Principles of Database Systems, pp. 299–313, Nashville, TN, Apr. 1990.

    Google Scholar 

  20. P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. In Twelfth ACM Symp. on Principles of Database Systems, pp. 233–243, Washington, DC, May 1993.

    Google Scholar 

  21. M. Koubarakis. Dense time and temporal constraints with ≠. In Proc. of the Third Intl. Conf. On Principles of Knowledge Representation and Reasoning, pp. 24–35, Oct. 1992.

    Google Scholar 

  22. M. Koubarakis. Representation and querying in temporal databases: the power of temporal constraints. In Ninth Intl. Conf. on Data Engineering, Vienna, Apr. 1993.

    Google Scholar 

  23. D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.

    Google Scholar 

  24. P. Revesz. A closed form for Datalog queries with integer order. In S. Abiteboul and P. Kanellakis, eds., ICDT '90, Proc. of the Third Intl. Conf. on Database Theory, pp. 187–201, Paris, Dec. 1990. LNCS 470, Springer-Verlag.

    Google Scholar 

  25. D. Rosenkrantz and H. B. I. Hunt. Processing conjunctive predicates and queries. In Intl. Conf. on Very Large Data Bases, pp. 64–72, 1980.

    Google Scholar 

  26. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.

    Google Scholar 

  27. D. Srivastava. Subsumption in constraint query languages with linear arithmetic constraints. In Second Intl. Symp. on Artificial Intelligence and Mathematics, Fort Lauderdale, FL, Jan. 1992.

    Google Scholar 

  28. B. Thalheim. Dependencies in Relational Databases. Teubner-Texte zur Mathematik, Band 126. B.G. Teubner Verlagsgesellschaft, Stuttgart, 1991.

    Google Scholar 

  29. J. D. Ullman. Principles of Database and Knowledge-Base Systems — Volume II: The New Technologies. Computer Science Press, 1989.

    Google Scholar 

  30. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In Eleventh ACM Symp. on Principles of Database Systems, pp. 331–345, San Diego, CA, June 1992.

    Google Scholar 

  31. X. Zhang and Z. M. Ozsoyoglu. On efficient reasoning with implication constraints. In Third Intl. Conf. on Deductive and Object-Oriented Databases, Phoenix, AZ, Dec. 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Libre de Bruxelles, Informatique, 50 Avenue F.D. Roosevelt, C.P. 165, 1050, Brussels, Belgium

    Marianne Baudinet

  2. Kansas State University, Dept of Computing and Information Sciences, 234 Nichols Hall, 66506-2302, Manhattan, KS, USA

    Jan Chomicki

  3. Université de Liège, Institut Montefiore, B28 4000, Liège Sart-Tilman, Belgium

    Pierre Wolper

Authors
  1. Marianne Baudinet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Chomicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Wolper
    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

Baudinet, M., Chomicki, J., Wolper, P. (1994). Constraint-generating dependencies. 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_102

Download citation

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

  • 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