Fixed-point query languages for linear constraint databases

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.

[1]  Marc Gyssens,et al.  On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases , 1999, J. Comput. Syst. Sci..

[2]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[3]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[4]  Stephan Kreutzer,et al.  Descriptive Complexity Theory for Constraint Databases , 1999, CSL.

[5]  Klaus Meer,et al.  Descriptive complexity theory over the real numbers , 1995, STOC '95.

[6]  Michael T. Goodrich,et al.  Constructing arrangements optimally in parallel , 1993, Discret. Comput. Geom..

[7]  G. Ziegler.  Lectures on Polytopes , 1994 .

[8]  Jan Van den Bussche,et al.  Termination Properties of Spatial Datalog Programs , 1996, Logic in Databases.

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, Inf. Comput..

[11]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[12]  Jianwen Su,et al.  Queries with Arithmetical Constraints , 1997, Theor. Comput. Sci..

[13]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[14]  Marc Gyssens,et al.  On Query Languages for Linear Queries Definable with Polynomial Constraints , 1996, CP.

[15]  Marc Gyssens,et al.  On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases (extended abstract) , 1997, PODS '97.

[16]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[17]  Bart Kuijpers,et al.  Expressing Topological Connectivity of Spatial Databases , 1999, DBPL.

[18]  Marc Gyssens,et al.  On the Desirability and Limitations of Linear Spatial Database Models , 1995, SSD.

[19]  Gabriel M. Kuper,et al.  Tractable Recursion over Geometric Data , 1997, CP.

[20]  David Harel,et al.  Towards a theory of Recursive Structures , 1998, Computer Science Today.

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