Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/39943
Title: Indexing the edges - a simple and yet efficient approach to high-dimensional indexing
Authors: Ooi, Beng Chin 
Tan, Kian-Lee 
Yu, Cui
Bressan, Stephane 
Issue Date: 2000
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/39943
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

50
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.