Skip to main content

Euclidean Query Languages

  • Chapter
  • 100 Accesses

Abstract

As discussed in Chapter 8, linear constraint databases are an appropriate model for many types of spatial data. In certain regards, however, the expressive power of language FO + Lin is too limited. One of these limitations is that FO + Lin is incapable of expressing queries involving Euclidean distance, betweenness, and collinearity. For example, a query such as “Return all cities in Belgium that are further than 100 km away from Brussels” cannot be expressed in FO + Lin, despite being of importance in spatial database applications. On the other hand, FO + Poly is probably too powerful for these purposes, having very high complexity.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes

  1. T. Heath. The Thirteen Books of Euclid’s Elements. Dover, 1956.

    Google Scholar 

  2. D. Hilbert. Grundlagen der Geometrie. Springer-Verlag, 1930.

    Google Scholar 

  3. H. Eves. College Geometry. Jones and Barlett, 1995.

    Google Scholar 

  4. E. Engeler. Foundations of Mathematics. Springer-Verlag, 1992.

    Google Scholar 

  5. B. Kuijpers, G. M. Kuper, J. Paredaens, and L. Vandeurzen. First order languages expressing constructible spatial database queries. Journal of Computer and System Sciences (JCSS), 2000.

    Google Scholar 

  6. G. M. Kuper and J. Su. Representation independence and effective syntax of Euclidean based constraint query languages. Technical Report 981116–13, Bell Labs, 1998.

    Google Scholar 

  7. G. M. Kuper and J. Su. A representation independent language for planar spatial databases with Euclidean distance. In Proceedings of the 7th International Workshop on Database Programming Languages (DBPL’99), 1999.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kuijpers, B., Kuper, G., Paredaens, J. (2000). Euclidean Query Languages. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04031-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08542-0

  • Online ISBN: 978-3-662-04031-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics