Compressing the Index - A Simple and yet Efficient Approximation Approach to High-Dimensional Indexing

Authors:
Shuguang Wang;Cui Yu;Beng Chin Ooi
Affiliations:
-;-;-
Venue:
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Year:
2001

Citing 8
Cited 0

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
Efficient query processing in geographic information systems

Efficient query processing in geographic information systems
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
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
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd 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

Quantified Score

Hi-index	0.01

Visualization

Abstract

An efficient tunable high-dimensional indexing scheme called the iMinMax(θ) was proposed to map high-dimensional data points into single dimension value based on the minimum or maximum values among all dimensions [7]. Unfortunately, the number of leaf nodes needs to be scanned remains large. To reduce the number of leaf nodes, we propose to use the compression technique proposed in the Vector Approximation File (VA-file) [10] to represent vectors. We call the hybrid method, the iMinMax(θ)*. While the marriage is straight forward, the gain in performance is significant. In our extensive performance study, the results clearly indicate that iMinMax(θ)* outperforms the original iMinMax(θ) index scheme and the VA-file. iMinMax(θ)* is also attractive from a practical view point for its implementation cost is only slightly higher than that of the original iMinMax(θ). The approximation concept that is incorporated in iMinMax(θ)* can be integrated in other high-dimensional index structures without much difficulty.