Indexing the edges—a simple and yet efficient approach to high-dimensional indexing

Authors:
Beng Chin Ooi;Kian-Lee Tan;Cui Yu;Stephane Bressan
Affiliations:
Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543
Venue:
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2000

Citing 6
Cited 27

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
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Indexing Techniques for Advanced Database Systems

Indexing Techniques for Advanced Database Systems
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

Towards self-tuning data placement in parallel database systems

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
B-trees: bearing fruits of all kinds

ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Image Mining: Trends and Developments

Journal of Intelligent Information Systems
Compressing the Index - A Simple and yet Efficient Approximation Approach to High-Dimensional Indexing

WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Indexing the Distance: An Efficient Method to KNN Processing

Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation

Proceedings of the 27th International Conference on Very Large Data Bases
An Information-Driven Framework for Image Mining

DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Effective Management of Hierarchical Storage Using Two Levels of Data Clustering

MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Indexing for progressive skyline computation

Data & Knowledge Engineering
Making the Pyramid Technique Robust to Query Types and Workloads

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Querying high-dimensional data in single-dimensional space

The VLDB Journal — The International Journal on Very Large Data Bases
On accessing data in high-dimensional spaces: a comparative study of three space partitioning strategies

Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search

ACM Transactions on Database Systems (TODS)
Generalized multidimensional data mapping and query processing

ACM Transactions on Database Systems (TODS)
Toward Efficient Multifeature Query Processing

IEEE Transactions on Knowledge and Data Engineering
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing

The VLDB Journal — The International Journal on Very Large Data Bases
An efficient indexing structure for multimedia data

MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches

High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Matching query processing in high-dimensional space

Proceedings of the 20th ACM international conference on Information and knowledge management
Indexing text and visual features for WWW images

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
A new indexing method for high dimensional dataset

DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Indexing RFID data using the VG-curve

ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
A comprehensive study of idistance partitioning strategies for kNN queries and high-dimensional data indexing

BNCOD'13 Proceedings of the 29th British National conference on Big Data
Extending high-dimensional indexing techniques pyramid and iminmax(θ): lessons learned

BNCOD'13 Proceedings of the 29th British National conference on Big Data
PL-Tree: an efficient indexing method for high-dimensional data

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new tunable index scheme, called iMinMax(&Ogr;), 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” &Ogr;, 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(&Ogr;) can outperform the more complex Pyramid technique by a wide margin.