Abstract
We propose the study of query languages for databases involving real numbers as data (called real number databases in the sequel). As main new aspect our approach is based on real number complexity theory as introduced in [8] and descriptive complexity for the latter developed in [17]. Using this formal framework a uniform treatment of query languages for such databases is obtained. Precise results about both the data- and the expression-complexity of several such query languages are proved. More explicitly, relying on descriptive complexity theory over ℝ gives the possibility to derive a hierarchy of complete languages for most of the important real number complexity classes. A clear correspondence between different logics and such complexity classes is established. In particular, it is possible to formalize queries involving in a uniform manner real spaces of different dimensions. This can be done in such a way that the logical description exactly reflects the computational complexity of a query. The latter might circumvent a problem appearing in some of the former approaches dealing with semi-algebraic databases (see [20] , [18]), where the use of first-order logic over real-closed fields can imply inefficiency as soon as the dimension of the underlying real space is not fixed - no matter whether the query under consideration is easy to compute or not.
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
S. Abiteboul, R. Hull, V. Vianu: Foundations of Databases. Addison-Wesley (1995).
S. Abiteboul, V. Vianu: Generic Computation and its Complexity. Proc. 23rd STOC (1991), 209–219.
S. Abiteboul, C.H. Papadimitriou, V. Vianu: The Power of Reflectional Relational Machines. Proc. LICS (1994).
M. Benedikt, G. Dong, L. Libkin, L. Wong: Relational Expressive Power of Constraint Query Languages. Journal of the ACM 45, No.l (1998), 1–34.
M. Benedikt, L. Libkin: On the Structure of Queries in Constraint Query Languages, Proc. LICS 1996, 25–34.
M. Benedikt, L. Libkin: Languages for Relational Databases over Interpreted Structures, Proc. PODS 1997, 87–98.
L. Blum, F. Cucker, M. Shub, S. Smale: Complexity and Real Computation. Springer-Verlag (1998).
L. Blum, M. Shub, S. Smale: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin American Mathematical Society 21 (1989), 1–46.
A.K. Chandra, D. Harel: Computable Queries for Relational Data Bases. Journal of Computer and System Sciences 21 (1980), 156–178.
F. Cucker: On the complexity of quantifier elimination: the structural approach. The Computer Journal 36 (1993), 400–408.
F. Cucker and M. Matamala: On digital nondeterminism. Mathematical Systems Theory 29 (1996), 635–647.
F. Cucker, K. Meer: Logics which capture complexity classes over the reals. To appear in: Journal of Symbolic Logic.
F. Cucker, A. Torrecillas: Two P-complete Problems in the Theory of the Reals. Journal of Complexity 8 (1992), 454–466.
F. Dumortier, M. Gyssens, L. Vandeurzen, D. van Gucht: On the decidability of Semi-Linearity for Semi-Algebraic Sets and its Implications for Spatial Databases. Proc. PODS (1997), 68–77.
H.D. Ebbinghaus, J. Flum: Finite Model Theory. Springer-Verlag (1995).
E. Grädel and Y. Gurevich. Metafinite model theory. In: D. Leivant (ed.), Logic and Computational Complexity. Springer-Verlag (1996), 313–366.
E. Grädel, K. Meer: Descriptive complexity theory over the real numbers. Proc. STOC (1995) 315–324. Full paper version in: J. Renegar, M. Shub, and S. Smale (editors): The Mathematics of Numerical Analysis, Lectures in Applied Mathematics 32, American Mathematical Society (1996), 381–404.
S. Grumbach, J. Su: Queries with arithmetical constraints. Theoretical Computer Science 173 (1997), 151–181.
M. Gyssens, J. van den Bussche, D. van Gucht: Complete geometrical query languages. Proc. PODS (1997), 62–67.
P.C. Kanellakis, G.M. Kuper, P.Z. Revesz: Constraint Query Languages, Journal of Computer and System Sciences 51 (1995), 26–52.
N. Lynch: Logspace recognition and translation of parenthesis languages. Journal of the ACM 24 (1977), 583–590.
K. Meer: Counting Problems over ℝ; extended abstract. In: Proc. 22nd International Symposium on Mathematical Foundations of Computer Science, Bratislava, Lecture Notes in Computer Science 1295, Springer 1997, 398–407; full version to appear in: Theoretical Computer Science.
K. Meer, C. Michaux: A Survey on Real Structural Complexity Theory. Bulletin of the Belgian Mathematical Society Simon Stevin 4 (1997), 113–148.
C. Michaux: Une remarque à propos des machines sur ℝ introduites par Blum, Shub et Smale. C. R. Acad. Sci. Paris, 309, Série I (1989), 435–437.
J. Paredaens, J. Van den Bussche, D. van Gucht: First-order queries on finite structures over the reals. SIAM Journal on Computing 27, no.6 (1998), 1747–1763.
M. Vardi: Complexity of relational query languages. Proc. 14th STOC (1982), 137–146.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (1999). Query Languages for Real Number Databases Based on Descriptive Complexity over R. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive