Approximating high-dimensional range queries with kNN indexing techniques

DOI10.1007/978-3-319-08783-2_32zbMATH Open1423.68556OpenAlexW63126705MaRDI QIDQ2920474FDOQ2920474

Authors: Michael A. Schuh, Tim Wylie, Chang Liu, Rafal A. Angryk 

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_32

Recommendations

• Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results
• scientific article; zbMATH DE number 1753922
• Efficient indexing of high-dimensional data through dimensionality reduction
• scientific article; zbMATH DE number 2033273
• scientific article; zbMATH DE number 2080488

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (7)

• High-dimensional indexing. Transformational approaches to high-dimensional range and similarity searches
• Multidimensional segment trees can do range updates in poly-logarithmic time
• PROM: efficient matching query processing on high-dimensional data
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Use of the spatial \(k\)D-tree in computational physics applications
• Exact \(k\)-NN queries on clustered SVD datasets
• Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results

This page was built for publication: Approximating high-dimensional range queries with \(k\)NN indexing techniques

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