Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results

DOI10.1007/s10878-015-9927-1zbMath1386.68048OpenAlexW2485478349MaRDI QIDQ346495

Michael A. Schuh, Tim Wylie, Rafal A. Angryk

Publication date: 29 November 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9927-1

zbMATH Keywords

high-dimensional dataindexingnearest neighborrange queries\(k\)nnidistancesphere coverwildcard search

Mathematics Subject Classification ID

Database theory (68P15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Information storage and retrieval of data (68P20)

Uses Software

• Flyspeck

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Historical overview of the Kepler conjecture
• Satisfying general proximity/similarity queries with metric trees
• Packing cubes into a cube is NP-complete in the strong sense
• Foundations of multidimensional and metric data structures.
• A PTAS for a disc covering problem using width-bounded separators
• Organization and maintenance of large ordered indexes
• Approximating High-Dimensional Range Queries with kNN Indexing Techniques
• Lower bounds for orthogonal range searching: I. The reporting case
• Least squares quantization in PCM

This page was built for publication: Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results