Fixed-point query languages for linear constraint databases

Authors:
Stephan Kreutzer
Affiliations:
LuFG Mathematische Grundlagen der Informatik, RWTH Aachen, D-52056 Aachen, Germany
Venue:
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2000

Citing 13
Cited 5

Theory of linear and integer programming

Theory of linear and integer programming
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries with arithmetical constraints

Theoretical Computer Science - Special issue: principles and practice of constraint programming
On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finitely representable databases

Journal of Computer and System Sciences - Special issue on principles of database systems
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
Metafinite model theory

Information and Computation - Special issue: logic and computational complexity
Constraint query languages (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint Databases

Constraint Databases
Towards a Theory of Recursive Structures

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Desirability and Limitations of Linear Spatial Database Models

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Termination Properties of Spatial Datalog Programs

LID '96 Proceedings of the International Workshop on Logic in Databases

Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Reachability and connectivity queries in constraint databases

Journal of Computer and System Sciences - Special issue on PODS 2000
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases

Theoretical Computer Science - Database theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a family of query languages for linear constraint databases over the reals. The languages are defined over two-sorted structures, the first sort being the real numbers and the second sort consisting of a decomposition of the input relation into regions. The languages are defined as extensions of first-order logic by transitive closure or fixed-point operators, where the fixed-point operators are defined over the set of regions only. It is shown that the query languages capture precisely the queries definable in various standard complexity classes including PTIME.