Abstract
As a very promising new data model, constraint database is attracting a growing interest recently. For better applications, we need to study its design theory. But to the best of our knowledge, no papers about the design of constraint databases could be found. So we hope to extend the well-developed design theory in relational databases to constraint databases. We introduce the notions such as variable independence, functional dependency, decomposition, lossless join and canonical form, etc. in the context of constraint databases. We present an algorithm to compute the canonical form of a dense-order constraint relation over a variable set, which preserve a variable independence of every generalized tuple and prove its correctness. Our main result is to prove that the existence of variable independence and functional dependency under some conditions, can decide whether a dense-order constraint relation scheme has a lossless-join decomposition. Our work provides basic theoretic results and an algorithm for the scheme design which is central in the design of dense-order constraint databases.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong. Relational Expressive Power of Constraint Query Languages. PODS (1996) 5–16.
J.Chomicki, Dina.Q. Goldin, Gabriel.M.Kuper. Variable Independence and Aggregation Closure. PODS (1996) 40–48.
J.Chomicki, G. Kuper. Measuring infinite relations. PODS (1995) 78–85.
Dina Q. Goldin, Paris C. Kanellakis. Constraint Query Algebras. To appear in Constraints Journal, 1st issue. (1996).
Stephane Grumbach, Jianwen Su. Finitely Representable Databases. PODS (1994) 289–300.
Stephane Grumbach, Jianwen Su. Dense-order Constraint Databases. PODS (1995) 66–77.
Stephane Grumbach, Jianwen Su, Christophe Tollu. Linear Constraint Query Languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity Workshop, Indianapolis, 1994. Springer Verlag. (to appear in LNCS).
Paris C. Kanellakis. Tutorial: Constraint Programming and Database Languages. PODS (1995) 46–53.
Paris C. Kanellakis, Dina Q. Goldin. Constraints Programming and Database Query Languages. In Proc. 2nd Conference on Theoretical Aspects of Computer Software(TACS). (1994).
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. Constraint Query Languages (Preliminary version). PODS (1990) 299–313.
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz. Constraint Query Languages. JCSS 51 (1995) 26–52.
Paris C. Kanellakis, Sridhar Ramaswamy, Darren Vengroff and Jeffrey Vitter. Indexing for Data Models with Constraints and Classes. PODS (1993).
J.D. Ullman. Principles of Database and Knowledge-base Systems. Vol 1. Computer Science Systems. (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Shi, B., Qu, Y. (1996). Decomposition and lossless join in constraint databases. In: Gaede, V., Brodsky, A., Günther, O., Srivastava, D., Vianu, V., Wallace, M. (eds) Constraint Databases and Applications. CDB 1997. Lecture Notes in Computer Science, vol 1191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62501-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-62501-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62501-8
Online ISBN: 978-3-540-68049-9
eBook Packages: Springer Book Archive