Fast Index Filtering in Vector Approximation File

Authors:
Władysław Skarbek;Thomas Sikora;Grzegorz Galinski
Affiliations:
Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, Warsaw, Poland;Communications Systems Department, Technical University of Berlin, Germany;Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, Warsaw, Poland
Venue:
Fundamenta Informaticae
Year:
2004

Citing 7
Cited 0

The design and analysis of algorithms

The design and analysis of algorithms
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Vector approximation based indexing for non-uniform high dimensional data sets

Proceedings of the ninth international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd 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
Introduction to MPEG-7: Multimedia Content Description Interface

Introduction to MPEG-7: Multimedia Content Description Interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several fast filtering attributes are analysed for vector interval (cell) pruning while querying the vector approximation file. Beside distance range, sum and median features their deviation forms are introduced. Range and K-NN queries are considered and appropriate acceptance intervals are designed. The impact of feature space dimensionality on index design is discussed, too.