Abstract
Constraint databases use constraints to model and query data. In particular, constraints allow a finite representation of infinite sets of relational tuples (also called generalized tuples). The choice of different logical theories to express constraints inside relational languages leads to the definition of constraint languages with different expressive power. Practical constraint database languages typically use linear constraints. This choice allows the use of efficient algorithms but, at the same time, some useful queries, needed by the considered application, may not be represented inside the resulting languages (for example, the convex hull cannot be computed [19]). These additional queries can only be modeled by changing the theory (thus, loosing the advantages of the linear theory), or extending the language, or using external functions. In this paper we consider the last approach and we propose an algebra and a calculus for constraint relational databases extended with external functions, formally proving their equivalence. In doing that, we use an approach similar to the one used by Klug to prove the equivalence between the relational algebra and the relational calculus extended with aggregate functions [14]. As far as we know, this is the first approach to introduce external functions in constraint query languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Afrati, S.S. Cosmadakis, S. Grumbach, and G.M. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. In LNCS 874: Proc. of the 2nd Int. Workshop on Principles and Practice of Constraint Programming, pages 181–192, 1994.
M. Baudinet, M. Niezette, and P. Wolper. On the Representation of Infinite Temporal Data and Queries. In Proc. of the 10th ACM SIGACT-SIGMOD-SIGART Int. Symp. on Principles of Database Systems, pages 280–290, 1991.
A. Belussi, E. Bertino, and B. Catania. An Extended Algebra for Constraint Databases. IEEE Trans. on Knowledge and Data Engineering, to appear.
A. Belussi, E. Bertino, and B. Catania. Manipulating Spatial Data in Constraint Databases. In LNCS 1262: Proc. of the 5th Symp. on Spatial Databases, pages 115–141, 1997.
M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational Expressive Power of Constraint Query Languages. In Proc. of the 15th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 5–16, 1996.
A. Brodsky. Constraint Databases: Promising Technology or Just Intellectual Exercize?. Constraints Journal, 2(1), 1997. Also ACM Computing Surveys, 28(4) (online), 1997.
B. Catania. Constraint Databases: Data Models and Architectural Issues. Ph.D. Thesis, University of Milano, Italy, 1998.
J. Chomicki, D. Goldin, and G. Kuper. Variable Independence and Aggregation Closure. Proc. of the 15th ACM SIGACT-SIGMOD-SIGART Int. Symp. on Principles of Database Systems, pages 40–48, 1996.
J. Chomicki and G. Kuper. Measuring Infinite Relations. Proc. of the 14th ACM SIGACT-SIGMOD-SIGART Int. Symp. on Principles of Database Systems, pages 78–94, 1995.
E.F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 6(13):377–387, 1970.
S. Grumbach, P. Rigaux, and L. Segoufin. The DEDALE System for Complex Spatial Queries. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 89–98, 1998.
P.C. Kanellakis and D.Q. Goldin. Constraint Programming and Database Query Languages. In LNCS 789: Proc. of the Int. Symp. on Theoretical Aspects of Computer Software, pages 96–120, 1994.
P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, 51(1):25–52, 1995.
A. Klug. Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. Journal of the ACM, 29(3):699–717.
G.M. Kuper. Aggregation in Constraint Databases. In Proc. of the 1st Int. Workshop on Principles and Practice of Constraint Programming, pages 171–172, 1993.
G. Ozsoyoglu, Z.M. Ozsoyoglu, and V. Matos. Extending Relational Algebra and Relational Calculus with Set-Valued Attributes and Aggregated Functions. ACM Transactions on Database Systems, 12(4):566–592, 1987.
J. Paredaens, B. Kuijpers, G. Kuper, and L. Vandeurzen. Euclid, Tarski, and Engeler Encompassed. In Proc. of the 1Int. Workshop on Database Programming Languages, 1997.
J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a Theory of Spatial Database Queries. In Proc. of the 13th ACM SIGACT-SIGMOD-SIGART Int. Symp. on Principles of Database Systems, pages 279–288, 1994.
L. Vandeurzen, M. Gyssens, and D. Van Gucht On the Desirability and Limitations of Linear Spatial Database Models. In LNCS 951: Proc. of the Int. Symp. on Advances in Spatial Databases, pages 14–28, 1995.
L. Vandeurzen, M. Gyssens, and D. Van Gucht On Query Languages for Linear Queries Definable with Polynomial Constraints. In LNCS 1118: Proc. of the Second Int. Conference on Principles and Practice of Constraint Programming, pages 468–481, 1996.
L. Vandeurzen, M. Gyssens, and D. Van Gucht An Expressive Language for Linear Spatial Database Queries. In Proc. of the ACM SIGACT-SIGMOD-SIGART Int. Symp. on Principles of Database Systems, pages 109–118, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Catania, B., Belussi, A., Bertino, E. (1998). Introducing External Functions in Constraint Query Languages. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive