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.
CITATION STYLE
Afrati, F., Andronikos, T., & Kavalieros, T. (1996). On the expressiveness of query languages with linear constraints; capturing desirable spatial properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1191, pp. 105–115). Springer Verlag. https://doi.org/10.1007/3-540-62501-1_28
Mendeley helps you to discover research relevant for your work.