Advertisement

Constraint objects

  • Divesh Srivastava
  • Raghu Ramakrishnan
  • Peter Z. Revesz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 874)

Abstract

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based, language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and a fixpoint semantics based on the notions of constraint entailment and “proofs in all possible worlds”. We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses ε and ⊑.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and P. C. Kanellakis. Object identity as a query language primitive. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 159–173, Portland, Oregon, June 1989.Google Scholar
  2. 2.
    B. N. Freeman-Benson and A. Borning. The design and implementation of Kaleidoscope'90: A constraint imperative programming language. In Proceedings of the International Conference on Computer Languages, pages 174–180, Apr. 1992.Google Scholar
  3. 3.
    B. N. Freeman-Benson and A. Borning. Integrating constraints with an object-oriented language. In Proceedings of the European Conference on Object-Oriented Programming, pages 268–286, June 1992.Google Scholar
  4. 4.
    T. Imielinski, S. Naqvi, and K. Vadaparty. Incomplete objects—a data model for design and planning applications. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 288–297, Denver, CO, May 1991.Google Scholar
  5. 5.
    P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 299–313, Nashville, Tennessee, Apr. 1990.Google Scholar
  6. 6.
    M. Kifer, W. Kim, and Y. Sagiv. Querying object-oriented databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 393–402, San Diego, California, 1992.Google Scholar
  7. 7.
    R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. Journal of Logic Programming, 11(3):189–216, 1991.Google Scholar
  8. 8.
    P. J. Stuckey and S. Sudarshan. Compiling query constraints. In Proceedings of the ACM Symposium on Principles of Database Systems, May 1994.Google Scholar
  9. 9.
    J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Divesh Srivastava
    • 1
  • Raghu Ramakrishnan
    • 2
  • Peter Z. Revesz
    • 3
  1. 1.AT&T Bell LaboratoriesMurray HillUSA
  2. 2.University of WisconsinMadisonUSA
  3. 3.University of NebraskaLincolnUSA

Personalised recommendations