Skip to main content
SpringerLink
Log in

Indexing, X-Tree

  • Reference work entry
Encyclopedia of GIS

Synonyms

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

Definition

The X‑tree (eXtended node tree) [1] is a spatial access method [2] 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

Figure 1
figure 1

Structure of the X‑tree

Full size image

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Berchtold, S., Keim, D., Kriegel, H.P.: The X‑tree: An index structure for high‐dimensional data. In: Proc. 22th International Conference on Very Large Databases (VLDB'96), pp. 28–39. Morgan Kaufmann, San Francisco, CA, USA (1996)

    Google Scholar 

  2. Böhm, C., Berchtold, S., Keim, D.: Searching in high‐dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys 33(3), 322–373 (2001)

    Article  Google Scholar 

  3. Guttman, A.: R‑trees: A dynamic index structure for spatial searching. In: Proc. ACM International Conference on Management of Data (SIGMOD'84), pp 47–57. ACM Press, New York, NY, USA (1994)

    Google Scholar 

  4. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*‑tree: An efficient and robust access method for points and rectangles. In: Proc. ACM International Conference on Management of Data (SIGMOD'90), pp. 322–331. ACM Press, New York, NY, USA (1990)

    Google Scholar 

  5. Faloutsos, C.: Searching Multimedia Databases by Content. Kluwer Academic Publishers, Norwell, MA, USA (1996)

    Book  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Shoichet, B.K., Bodian, D.L., Kuntz, I.D.: Molecular docking using shape descriptors. Journal of Computational Chemistry 13(3), 380–397 (1992)

    Article  Google Scholar 

  9. Keim, D.: Efficient geometry-based similarity search of 3D spatial databases. In: Proc. ACM International Conference on Management of Data (SIGMOD'99), pp. 419–430. ACM Press, New York, NY, USA (1999)

    Google Scholar 

  10. Altschul, S. F., Gish, W., Miller, W., Myers, E.W., Lipman D.J.: A basic local alignment search tool. Journal of Molecular Biology 215(3), 403–410 (1990)

    Google Scholar 

  11. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co. Inc., Boston, MA, USA (1999)

    Google Scholar 

  12. Shawney, H., Hafner, J.: Efficient Color Histogram Indexing. In: Proc. International Conference on Image Processing, pp. 66–70. IEEE Computer Society, Los Alamitos, CA, USA (1994)

    Chapter  Google Scholar 

  13. Jagadish, H.V.: A retrieval technique for similar shapes. In: Proc. ACM International Conference on Management of Data (SIGMOD'91), pp. 208–217. ACM Press, New York, NY, USA (1991)

    Google Scholar 

  14. Wallace, T., Wintz, P.: An efficient three‐dimensional aircraft recognition algorithm using normalized fourier descriptors. Computer Graphics and Image Processing 13, 99–126 (1980)

    Article  Google Scholar 

  15. Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys 24(4), 377–440 (1992)

    Article  Google Scholar 

  16. Murase, H., Nayar, S.K.: Three‐dimensional object recognition from appearance‐parametric eigenspace method. Systems and Computers in Japan 26(8), 45–54 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, University of Konstanz, Konstanz, Germany

    Daniel Keim

  2. Department of Computer Science, University of Chile, Santiago, Chile

    Benjamin Bustos

  3. stb ag, Augsburg, Germany

    Stefan Berchtold

  4. Institute for Computer Science, Ludwig‐Maximilians‐University Munich, Munich, Germany

    Hans-Peter Kriegel

Authors
  1. Daniel Keim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Bustos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Berchtold
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hans-Peter Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Shashi Shekhar (McKnight Distinguished University Professor) (McKnight Distinguished University Professor)

  2. Management Science and Information Systems Department, Rutgers Business School Newark and New Brunswick Rutgers, the State University of New Jersey, Newark, NJ, 07102, USA

    Hui Xiong (Assistant Professor) (Assistant Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Keim, D., Bustos, B., Berchtold, S., Kriegel, HP. (2008). Indexing, X-Tree. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_620

Download citation

Publish with us

Policies and ethics

Search

Navigation