The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Advanced database indexing
Indexing the edges—a simple and yet efficient approach to high-dimensional indexing
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
Database Management Systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Extensible Buffer Management of Indexes
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Fast image retrieval using color-spatial information
The VLDB Journal — The International Journal on Very Large Data Bases
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
A fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
Journal of Systems and Software
An efficient skyline framework for matchmaking applications
Journal of Network and Computer Applications
Indexing structures for content-based retrieval of large image databases: a review
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Nearest neighbor search on vertically partitioned high-dimensional data
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Roogle: supporting efficient high-dimensional range queries in p2p systems
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
MUD: Mapping-based query processing for high-dimensional uncertain data
Information Sciences: an International Journal
Extending high-dimensional indexing techniques pyramid and iminmax(θ): lessons learned
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Hi-index | 0.00 |
In this paper, we propose a new tunable index scheme, called iMinMax($\theta$), that maps points in high-dimensional spaces to single-dimensional values determined by their maximum or minimum values among all dimensions. By varying the tuning “knob”, $\theta$, we can obtain different families of iMinMax structures that are optimized for different distributions of data sets. The transformed data can then be indexed using existing single-dimensional indexing structures such as the B+-trees. Queries in the high-dimensional space have to be transformed into queries in the single-dimensional space and evaluated there. We present efficient algorithms for evaluating window queries as range queries on the single-dimensional space. We conducted an extensive performance study to evaluate the effectiveness of the proposed schemes. Our results show that iMinMax($\theta$) outperforms existing techniques, including the Pyramid scheme and VA-file, by a wide margin. We then describe how iMinMax could be used in approximate K-nearest neighbor (KNN) search, and we present a comparative study against the recently proposed iDistance, a specialized KNN indexing method.