Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions.
Vladimir PestovPublished in: SISAP (2011)
Keyphrases
- indexing schemes
- high dimensions
- similarity search
- lower bound
- high dimensional data
- metric space
- high dimensional
- distance function
- triangle inequality
- metric access methods
- multimedia databases
- nearest neighbor
- similarity queries
- high dimensional spaces
- indexing structure
- similarity searching
- indexing techniques
- data sets
- access methods
- high dimensionality
- r tree
- similarity measure
- low dimensional
- dynamic time warping
- knn
- dimensionality reduction
- neural network
- indexing scheme
- data partitioning
- euclidean distance
- vector space
- dimensional data
- poor quality
- data points
- query processing
- data analysis
- database systems