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 ⊑.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
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.
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.
R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. Journal of Logic Programming, 11(3):189–216, 1991.
P. J. Stuckey and S. Sudarshan. Compiling query constraints. In Proceedings of the ACM Symposium on Principles of Database Systems, May 1994.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srivastava, D., Ramakrishnan, R., Revesz, P.Z. (1994). Constraint objects. 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_103
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_103
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