Dynamic Multi-probe LSH: An I/O Efficient Index Structure for Approximate Nearest Neighbor Search.
Shaoyi YinMehdi BadrDan VodislavPublished in: DEXA (1) (2013)
Keyphrases
- approximate nearest neighbor search
- index structure
- kd tree
- nearest neighbor
- locality sensitive hashing
- nearest neighbor search
- data structure
- range queries
- multi dimensional
- r tree
- main memory
- indexing techniques
- query processing
- access methods
- data distribution
- metric space
- efficient query processing
- k nearest neighbor
- knn
- b tree
- database management systems
- space partitioning
- approximate nearest neighbor
- space efficient
- quadtree
- data points
- distance function
- high dimensional spaces
- similarity queries
- high dimensional feature vectors
- data sets
- hash functions
- tree structure
- high dimensional data
- search algorithm
- databases