O'Reilly logo

Readings in Multimedia Computing and Networking by Hong Jiang Zhang, Kevin Jeffay

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

The X-tree: An Index Structure for High-Dimensional Data

Stefan Berchtold, Daniel A. Keim and Hans-Peter Kriegel,     Institute for Computer Science, University of Munich, Oettingenstr. 67, D-80538 Munich, Germany; Proceedings of the 22nd VLDB Conference; Mumbai (Bombay), India, 1996. E-mail address: berchtol@informatik.uni-muenchen.de, keim@informatik.uni-muenchen.de, kriegel@informatik.uni-muenchen.de

Abstract

In this paper, we propose a new method for indexing large amounts of point and spatial data in high-dimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures is the overlap of the bounding boxes in the ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required