Title :
Performance analysis of AB-tree
Author :
Pramanik, Sakti ; Li, Jinhua ; Ruan, Jiandong
Author_Institution :
Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA
Abstract :
We present the performance analysis of AB-tree, an efficient indexing scheme for high dimensional databases. AB-tree is based on a few interesting data distribution properties, such as the angle and the distance, which were observed in experiments for large databases with high dimensional data. We have shown a significant performance gain of the AB-tree (about 57 times) over the SS-tree. We have also shown that the AB-tree performs better than VA-file, the best known sequential access method
Keywords :
database indexing; software performance evaluation; tree data structures; very large databases; AB-tree; SS-tree; VA-file; data distribution; database indexing; high dimensional databases; large databases; performance analysis; sequential access method; Computer science; Data engineering; Indexes; Indexing; Nearest neighbor searches; Neural networks; Performance analysis; Performance gain; Spatial databases;
Conference_Titel :
Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on
Conference_Location :
New York, NY
Print_ISBN :
0-7803-6536-4
DOI :
10.1109/ICME.2000.871099
