An Efficient Indexing Technique for the improvement of search performance in High - Dimensional Data


The KIPS Transactions:PartD, Vol. 8, No. 2, pp. 145-153, Apr. 2001
10.3745/KIPSTD.2001.8.2.145,   PDF Download:

Abstract

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expressing it as B -tree；and by solving the problem of search time complexity the pyramid technique also prevents the effect of "phenomenon of dimensional curse" which is caused by treatment of hypercube range query in n-dimensional data space. The Spherical Pyramid-Technique applies the pyramid method's space division strategy, uses spherical range query and improves the search performance to make it suitable for similarity search. However, depending on the size of data and change in dimensions, the two above techniques demonstrate significantly inferior search performance for data sizes greater than one million and dimensions greater than sixteen. In this paper, we propose a new index-structured PdR-Tree to improve the search performance for high dimensional data such as multimedia data. Test results using simulation data as well as real data demonstrate that PdR-Tree surpasses both the Pyramid-Technique and Spherical Pyramid-Technique in terms of search performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. S. Joh and Y. B. Park, "An Efficient Indexing Technique for the improvement of search performance in High - Dimensional Data," The KIPS Transactions:PartD, vol. 8, no. 2, pp. 145-153, 2001. DOI: 10.3745/KIPSTD.2001.8.2.145.

[ACM Style]
Beom Seok Joh and Young Bae Park. 2001. An Efficient Indexing Technique for the improvement of search performance in High - Dimensional Data. The KIPS Transactions:PartD, 8, 2, (2001), 145-153. DOI: 10.3745/KIPSTD.2001.8.2.145.