Skip to main content

Spatial Indexing Techniques

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Spatial access methods

Definition

A spatial index is a data structure designed to enable fast access to spatial data. Spatial data come in various forms, the most common being points, lines, and regions in n-dimensional space (practically, n = 2 or 3 in geographical information system (GIS) applications). Typical “selection” queries include the spatial range query (“find all objects that lie within a given query region”) and the spatial point query (“find all objects that contain a given query point”). In addition, multidimensional data introduce spatial relationships (such as overlapping and disjointness) and operators (e.g., nearest neighbor), which need to be efficiently supported as well. Example queries are the spatial join query (“find all pairs of objects that intersect each other”) and the nearest neighbor query (“find the five objects nearest to a given query point”). It should be noted that traditional indexing approaches (B+-trees, hashing, etc.) are not...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.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

Institutional subscriptions

Recommended Reading

  1. Beckmann N, Kriegel H-P, Schneider R, Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.

    Google Scholar 

  2. Finkel RA, Bentley JL. Quad Trees: a data structure for retrieval on composite keys. Acta Informatica. 1974;4(1):1–9.

    Article  MATH  Google Scholar 

  3. Freeston MA. General solution of the n-dimensional B-tree problem. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 80–91.

    Article  Google Scholar 

  4. Gaede V, Guenther O. Multidimensional access methods. ACM Comput Surv. 1998;30(2):170–231.

    Article  Google Scholar 

  5. Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984. p. 47–57.

    Google Scholar 

  6. Hadjieleftheriou M, Hoel E, Tsotras VJ. SaIL: a spatial index library for efficient application integration. GeoInformatica. 2005;9(4):367–89.

    Article  Google Scholar 

  7. Henrich A, Six H-W, Widmayer P. The LSD tree: spatial access to multidimensional point and non point objects. In: Proceedings of the 15th International Conference on Very Large Data Bases; 1989. p. 43–53.

    Google Scholar 

  8. Kamel I, Faloutsos C. Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 500–09.

    Google Scholar 

  9. Lomet DB, Salzberg B. The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans Database Syst. 1990;15(4): 625–58.

    Article  Google Scholar 

  10. Nievergelt J, Hinterberger H, Sevcik KC. The grid file: an adaptable symmetric multikey file structure. ACM Trans Database Syst. 1984;9(1): 38–71.

    Article  Google Scholar 

  11. Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1985. p. 17–31.

    Article  Google Scholar 

  12. Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 71–9.

    Google Scholar 

  13. Samet H. The design and analysis of spatial data structures. Addison-Wesley; Reading, MA, 1990.

    Google Scholar 

  14. Seeger B, Kriegel H-P. The Buddy-tree: an efficient and robust access method for spatial database systems. In: Proceedings of the 16th International Conference on Very Large Data Bases; 1990. p. 590–601.

    Google Scholar 

  15. Sellis T, Roussopoulos N, Faloutsos C. The R+-tree: a dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 507–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yannis Manolopoulos .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J. (2018). Spatial Indexing Techniques. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_355

Download citation

Publish with us

Policies and ethics