An efficient algorithm for hyperspherical range query processing in high-dimensional data space

Authors:
Dong-Ho Lee;Shin Heu;Hyoung-Joo Kim
Affiliations:
Department of Computer Engineering, Seoul National Univrsity, San 56-1m Shilim-dong, Gwanak-gu, Seoul, Republic of Korea;Department of Computer Science, Hanyang Univrsity, Seoul, Republic of Korea;Department of Computer Engineering, Seoul National Univrsity, San 56-1m Shilim-dong, Gwanak-gu, Seoul, Republic of Korea
Venue:
Information Processing Letters
Year:
2002

The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases

Hi-index	0.89