Abstract
We explore the expressive power of the query language of first order logic with linear constraints. Natural queries are shown to be expressible in this language in a non-trivial fashion. We further investigate the ability of the language to capture certain properties that seem desirable in spatial databases. We show that, although these properties are captured in a certain extent, there are still cases where the language has counter-intuitive behavior. In this context, we show that FO+linear cannot distinguish between databases that carry similar spatial characteristics, e.g., two different ellipses.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Afrati, T. Andronikos, T. Kavalieros. On the Expressiveness of First-Order Constraint Languages. First CONTESSA Workshop on Constraint Databases, pp. 22–39.
F. Afrati, S. Cosmadakis, S. Grumbach, G. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. PPCP 1994.
M. Benedikt, G. Dong, L. Libkin, L. Wong Relational Expressive Power of Constraint Query Languages PODS 1996
S. Grumbach and J. Su. Finitely representable databases. PODS 1994, pp. 289–300.
S. Grumbach and J. Su. Dense-Order Constraint Databases. Proc. 14th ACM PODS, 1995
S. Grumbach, J. Su, and C. Tollu. Linear constraint databases. Proceedings of Logic and Computational Complexity, 1994, pp. 426–446
T. Huynh, L. Joskowicz, C. Lassez and J-L. Lassez. Reasoning About Linear Constraints Using Parametric Queries. Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Springer-Verlag vol. 472, 1990.
P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, pp. 299–313, 1990. To appear in JCSS.
G.M. Kuper. On the expressive power of the relational calculus with arithmetic constraints. In Proc. Int. Conf. on Database Theory, pp. 202–211, 1990.
C.H. Papadimitriou, D. Suciu, V. Vianu. Topological Queries in Spatial Databases. PODS'96
J. Paredaens, J. Van den Bussche, D. Van Gucht. First-order queries on finite structures over the reals. LICS '95, pp. 79–87.
L. Vandeurzen, M. Gyssens, D. Van Gucht. On the Desirability and Limitations of Linear Spatial Query Languages. em Proceedings of 4th Symposium on Advances in Spatial Databases, 1995.
L. Vandeurzen, M. Gyssens, D. Van Gucht. On Query Languages for Linear Queries Definable with Polynomial Constraints PPCP'96
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Andronikos, T., Kavalieros, T. (1996). On the expressiveness of query languages with linear constraints; capturing desirable spatial properties. In: Gaede, V., Brodsky, A., Günther, O., Srivastava, D., Vianu, V., Wallace, M. (eds) Constraint Databases and Applications. CDB 1997. Lecture Notes in Computer Science, vol 1191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62501-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-62501-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62501-8
Online ISBN: 978-3-540-68049-9
eBook Packages: Springer Book Archive