Parallel query processing on distributed clustering indexes
From MaRDI portal
Publication:1013068
DOI10.1016/j.jda.2008.09.010zbMath1162.68012OpenAlexW2063907387MaRDI QIDQ1013068
Mauricio Marin, Veronica Gil-Costa, Nora Reyes
Publication date: 16 April 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.010
Searching and sorting (68P10) Database theory (68P15) Parallel algorithms in computer science (68W10) Data structures (68P05) Distributed systems (68M14)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering to minimize the maximum intercluster distance
- Satisfying general proximity/similarity queries with metric trees
- Fixed queries array: A fast and economical data structure for proximity searching
- Similarity search. The metric space approach.
- Some approaches to best-match file searching
- A Data Structure and an Algorithm for the Nearest Point Problem
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
- On the Least Cost for Proximity Searching in Metric Spaces
- Computational Science – ICCS 2005
This page was built for publication: Parallel query processing on distributed clustering indexes