On the expressiveness of query languages with linear constraints; capturing desirable spatial properties

  • Foto Afrati
  • Theodore Andronikos
  • Theodore Kavalieros
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1191)


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.


Linear Constraint Query Language Expressive Power Spatial Database Winning Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AAK95]
    F. Afrati, T. Andronikos, T. Kavalieros. On the Expressiveness of First-Order Constraint Languages. First CONTESSA Workshop on Constraint Databases, pp. 22–39.Google Scholar
  2. [ACGK94]
    F. Afrati, S. Cosmadakis, S. Grumbach, G. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. PPCP 1994.Google Scholar
  3. [BDLW96]
    M. Benedikt, G. Dong, L. Libkin, L. Wong Relational Expressive Power of Constraint Query Languages PODS 1996 Google Scholar
  4. [GS94]
    S. Grumbach and J. Su. Finitely representable databases. PODS 1994, pp. 289–300.Google Scholar
  5. [GS95]
    S. Grumbach and J. Su. Dense-Order Constraint Databases. Proc. 14th ACM PODS, 1995Google Scholar
  6. [GST94]
    S. Grumbach, J. Su, and C. Tollu. Linear constraint databases. Proceedings of Logic and Computational Complexity, 1994, pp. 426–446Google Scholar
  7. [HJLL90]
    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.Google Scholar
  8. [KKR90]
    P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, pp. 299–313, 1990. To appear in JCSS.Google Scholar
  9. [Kup90]
    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.Google Scholar
  10. [PSV96]
    C.H. Papadimitriou, D. Suciu, V. Vianu. Topological Queries in Spatial Databases. PODS'96 Google Scholar
  11. [PBG95]
    J. Paredaens, J. Van den Bussche, D. Van Gucht. First-order queries on finite structures over the reals. LICS '95, pp. 79–87.Google Scholar
  12. [VGG95]
    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.Google Scholar
  13. [VGG96]
    L. Vandeurzen, M. Gyssens, D. Van Gucht. On Query Languages for Linear Queries Definable with Polynomial Constraints PPCP'96 Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Foto Afrati
    • 1
  • Theodore Andronikos
    • 1
  • Theodore Kavalieros
    • 1
  1. 1.National Technical University of AthensGreece

Personalised recommendations