Fixed queries array: A fast and economical data structure for proximity searching
From MaRDI portal
Recommendations
- Dynamic data structures for \(k\)-nearest neighbor queries
- scientific article; zbMATH DE number 437552
- A dynamic data structure for approximate range searching
- A unified approach to approximate proximity searching
- Sequential and MapReduce-based algorithms for constructing an in-place multidimensional quad-tree index for answering fixed-radius nearest neighbor queries
- scientific article; zbMATH DE number 1696644
- Efficient computation of a proximity matching in spatial databases
Cited in
(6)- Parallel query processing on distributed clustering indexes
- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
- Sequential and MapReduce-based algorithms for constructing an in-place multidimensional quad-tree index for answering fixed-radius nearest neighbor queries
- scientific article; zbMATH DE number 1865433 (Why is no real title available?)
This page was built for publication: Fixed queries array: A fast and economical data structure for proximity searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857244)