Skip to main content

Indexing, X-Tree

  • Reference work entry
  • First Online:
Encyclopedia of GIS
  • 183 Accesses

Synonyms

Access method, high-dimensional; Extended node tree; R-tree; Rectangle, hyper-; Rectangle, minimum bounding; Split, overlap-free

Definition

The X-tree (eXtended node tree) (Berchtold et al. 1996) is a spatial access method (Böhm et al. 2001) that supports efficient query processing for high-dimensional data. It supports not only point data but also extended spatial data. The X-tree provides overlap-free split whenever it is possible without allowing the tree to degenerate; otherwise, the X-tree uses extended variable size directory nodes, so-called supernodes. The X-tree may be seen as a hybrid of a linear array-like and a hierarchical R-tree-like directory.

Historical Background

The R-tree (Guttman 1994) and the R*-tree (Beckmann et al. 1990), spatial access methods with a hierarchically structured directory that use minimum bounding rectangles (MBRs) as page regions, have primarily been designed for the management of spatially extended, two-dimensional objects, but have...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

References

  • Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) A basic local alignment search tool. J Mol Biol 215(3):403–410

    Article  Google Scholar 

  • Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley Longman Publishing Co. Inc., Boston

    Google Scholar 

  • Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM international conference on management of data (SIGMOD’90). ACM, New York, pp 322–331

    Google Scholar 

  • Berchtold S, Keim D, Kriegel HP (1996) The X-tree: an index structure for highdimensional data. In: Proceedings of 22th international conference on very large databases (VLDB’96). Morgan Kaufmann, San Francisco, pp 28–39

    Google Scholar 

  • Berchtold B, Keim D, Kriegel H-P (1997) Using extended feature objects for partial similarity retrieval. VLDB J 6(4):333–348

    Article  Google Scholar 

  • Böhm C, Berchtold S, Keim D (2001) Searching in highdimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322–373

    Article  Google Scholar 

  • Bustos B, Keim D, Saupe D, Schreck T, Vranić D (2005) Feature-based similarity search in 3D object databases. ACM Comput Surv 37(4):345–387

    Article  Google Scholar 

  • Faloutsos C (1996) Searching multimedia databases by content. Kluwer Academic Publishers, Norwell

    Book  MATH  Google Scholar 

  • Guttman A (1994) R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM international conference on management of data (SIGMOD’84). ACM, New York, pp 47–57

    Google Scholar 

  • Jagadish HV (1991) A retrieval technique for similar shapes. In: Proceedings of ACM international conference on management of data (SIGMOD’91). ACM, New York, pp 208–217

    Google Scholar 

  • Keim D (1999) Efficient geometry-based similarity search of 3D spatial databases. In: Proceedings of ACM international conference on management of data (SIGMOD’99). ACM, New York, pp 419–430

    Google Scholar 

  • Kukich K (1992) Techniques for automatically correcting words in text. ACM Comput Surv 24(4):377–440

    Article  Google Scholar 

  • Murase H, Nayar SK (1995) Three-dimensional object recognition from appearance-parametric eigenspace method. Syst Comput Jpn 26(8):45–54

    Article  Google Scholar 

  • Shawney H, Hafner J (1994) Efficient color histogram indexing. In: Proceedings of international conference on image processing. IEEE Computer Society, Los Alamitos, pp 66–70

    Google Scholar 

  • Shoichet BK, Bodian DL, Kuntz ID (1992) Molecular docking using shape descriptors. J Comput Chem 13(3):380–397

    Article  Google Scholar 

  • Wallace T, Wintz P (1980) An efficient three-dimensional aircraft recognition algorithm using normalized fourier descriptors. Comput Graph Image Process 13: 99–126

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Keim, D., Bustos, B., Berchtold, S., Kriegel, HP. (2017). Indexing, X-Tree. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_620

Download citation

Publish with us

Policies and ethics