Measuring Innnite Relations

We deene a new aggregation operator n for constraint databases that makes it possible to measure innnite subsets of the n-dimensional space deened by constraints. We show that it is well deened for real linear arithmetic constraints and integer linear arithmetic constraints together with periodicity constraints. We also show that relational algebra augmented with n is closed in the real case and, under certain restrictions, in the integer case as well.

[1]  H. Paul Williams,et al.  Fourier-Motzkin Elimination Extension to Integer Programming Problems , 1976, J. Comb. Theory, Ser. A.

[2]  Anthony C. Klug.  Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions , 1982, JACM.

[3]  Pierre Wolper,et al.  Reasoning about Cryptographic Protocols , 1989, Distributed Computing And Cryptography.

[4]  P. .KabanzaJ-M.Stevenne,et al.  Handling In nite Temporal Data yF , 1990 .

[5]  Divesh Srivastava,et al.  Pushing constraint selections , 1992, J. Log. Program..

[6]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[7]  Jean-Louis Lassez,et al.  A Canonical Form for Generalized Linear Constraints , 1992, J. Symb. Comput..

[8]  Gabriel M. Kuper,et al.  Aggregation in Constraint Databases , 1993, PPCP.

[9]  Gabriel M. Kuper,et al.  Linear vs Polynomial Constraints in Database Query Languages , 1994, PPCP.

[10]  Peter Gritzmann,et al.  On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[11]  Jan Paredaens,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS.

[12]  Jan Chomicki,et al.  Datalog with Integer Periodicity Constraints , 1994, J. Log. Program..

[13]  Jianwen Su,et al.  Finitely Representable Databases , 1997, J. Comput. Syst. Sci..

[14]  Nicolas Beldiceanu,et al.  Constraint Logic Programming , 2010, 25 Years GULP.

[15]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[16]  Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data , 1999, Journal of Automated Reasoning.

[17]  Divesh Srivastava,et al.  Subsumption and indexing in constraint query languages with linear arithmetic constraints , 1993, Annals of Mathematics and Artificial Intelligence.