Share Email Print

Proceedings Paper

Angle-Tree: a new index structure for high-dimensional point data
Author(s): Daoguo Dong; Xiangyang Xue; Hangzai Luo; Yingqiang Lin
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Many multi-dimensional index structures, such as R-Tree, R*-Tree, X-Tree, SS-Tree, VA-File, etc. have been proposed to support similarity search with l1, l2 or l(infinity ) distance as similarity measure. But they can not support such similarity search with cosine as the similarity measure. In this paper, an index structure Angle-Tree is introduced to resolve the problem. It first projects all the high dimensional points onto the unit hyper-spherical surface, i.e. normalize each original vector in the database into a unit one. Then an index structure similar to R-Tree is built for those projected points. The experimental results show that the Angle-Tree can decrease the cost of disk I/O and support fast similarity search.

Paper Details

Date Published: 19 December 2001
PDF: 8 pages
Proc. SPIE 4676, Storage and Retrieval for Media Databases 2002, (19 December 2001); doi: 10.1117/12.451114
Show Author Affiliations
Daoguo Dong, Fudan Univ. (China)
Xiangyang Xue, Fudan Univ. (China)
Hangzai Luo, Fudan Univ. (China)
Yingqiang Lin, Univ. of California/Riverside (United States)

Published in SPIE Proceedings Vol. 4676:
Storage and Retrieval for Media Databases 2002
Minerva M. Yeung; Chung-Sheng Li; Rainer W. Lienhart, Editor(s)

© SPIE. Terms of Use
Back to Top