Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results

DOI10.1007/S10878-015-9927-1MaRDI QIDQ346495zbMATH OpenOpenAlexFDO

Authors Tim Wylie, Michael A. Schuh, 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 datanearest neighborrange queries\(k\)nnidistanceindexingsphere coverwildcard search

Mathematics Subject Classification ID

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

Recommendations

• Approximating high-dimensional range queries with \(k\)NN indexing techniques
• High-dimensional indexing. Transformational approaches to high-dimensional range and similarity searches
• Efficient indexing of high-dimensional data through dimensionality reduction
• An encoding-based dual distance tree high-dimensional index
• SPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces

Cites work

• scientific article; zbMATH DE number 3168214 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A PTAS for a disc covering problem using width-bounded separators
• Approximating high-dimensional range queries with \(k\)NN indexing techniques
• Computational geometry. Algorithms and applications.
• Foundations of multidimensional and metric data structures.
• Historical overview of the Kepler conjecture
• Least squares quantization in PCM
• Lower bounds for orthogonal range searching: I. The reporting case
• Organization and maintenance of large ordered indexes
• Packing cubes into a cube is NP-complete in the strong sense
• Satisfying general proximity/similarity queries with metric trees

Cited in

(8)

• An encoding-based dual distance tree high-dimensional index
• Approximating high-dimensional range queries with \(k\)NN indexing techniques
• High-dimensional indexing. Transformational approaches to high-dimensional range and similarity searches
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Region clustering based multiple range query optimization in relational databases
• Efficient indexing of high-dimensional data through dimensionality reduction
• scientific article; zbMATH DE number 2080488 (Why is no real title available?)
• PROM: efficient matching query processing on high-dimensional data

Describes a project that uses

Uses Software

• Flyspeck

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346495)