Abstract
Many multi-dimensional indexing structures have been proposed in the literature [12, 69]. In particular, it has been observed that the performance of hierarchical tree index structures such as R-trees [46] and R*-trees [5] deteriorates rapidly with the increase in the dimensionality of data. This phenomenon is caused by two factors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). Indexing the Edges — A Simple and Yet Efficient Approach to High-Dimensional Range Search. In: Yu, C. (eds) High-Dimensional Indexing. Lecture Notes in Computer Science, vol 2341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45770-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-45770-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44199-1
Online ISBN: 978-3-540-45770-1
eBook Packages: Springer Book Archive