Please use this identifier to cite or link to this item:
|Title:||Indexing the edges - a simple and yet efficient approach to high-dimensional indexing|
|Authors:||Ooi, Beng Chin |
|Citation:||Ooi, Beng Chin,Tan, Kian-Lee,Yu, Cui,Bressan, Stephane (2000). Indexing the edges - a simple and yet efficient approach to high-dimensional indexing. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems : 166-174. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we propose a new tunable index scheme, called iMinMax(θ), that maps points in high dimensional spaces to single dimension values determined by their maximum or minimum values among all dimensions. By varying the tuning `knob' θ, we can obtain different family of iMinMax structures that are optimized for different distributions of data sets. For a d-dimensional space, a range query need to be transformed into d subqueries. However, some of these subqueries can be pruned away without evaluation, further enhancing the efficiency of the scheme. Experimental results show that iMinMax(θ) can outperform the more complex Pyramid technique by a wide margin.|
|Source Title:||Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.