Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures
Summary: Provably-efficient MPC/MapReduce algorithms to build and query kd-trees, range trees, and BBD-trees for range and approximate nearest-neighbor search. O(1) communication rounds for preprocessing and querying, competitive runtimes/workloads; randomized with deterministic variants at modest extra cost. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pankaj K. Agarwal (Duke University)
- 2. Kyle Fox (Duke University)
- 3. Kamesh Munagala (Duke University)
- 4. Abhinandan Nath (Duke University)
BibTeX Citation
@inproceedings{agarwal_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902303},
doi = {10.1145/2902251.2902303},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Agarwal, Pankaj K. and Fox, Kyle and Munagala, Kamesh and Nath, Abhinandan},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,464 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 8.4260608e-05 |
| 7,303 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 5.5598057e-05 |
| 10,101 | Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations | 2025 | PODS | 5.0789354e-05 |
| 11,115 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD | 4.9793485e-05 |
| 11,480 | Topology-aware Parallel Joins | 2024 | PODS | 4.9793485e-05 |
| 11,941 | Algorithms for a Topology-aware Massively Parallel Computation Model | 2021 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 325 | The Dataflow Model: A Practical Approach to Balancing Correctness, Latency, and Cost in Massive-Scale, Unbounded, Out-of-Order Data Processing | 2015 | VLDB | 0.00020964941 |
| 1,231 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.00011410373 |
| 1,281 | Automatic Optimization for MapReduce Programs | 2011 | VLDB | 0.00011213384 |
| 1,545 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB | 0.00010302384 |
| 3,066 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.6877117e-05 |
| 4,219 | Spatial Partitioning Techniques in SpatialHadoop | 2015 | VLDB | 6.7262869e-05 |
| 7,765 | TAREEG: A MapReduce-Based Web Service for Extracting Spatial Data from OpenStreetMap | 2014 | SIGMOD | 5.4560963e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,887 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD |
| 2 | 2,176 | Efficient Processing of k Nearest Neighbor Joins using MapReduce | 2012 | VLDB |
| 3 | 10,370 | Faster Relational Algorithms Using Geometric Data Structures | 2026 | PODS |
| 4 | 6,748 | (Almost) Optimal Parallel Block Access for Range Queries | 2000 | PODS |
| 5 | 264 | A Class of Data Structures for Associative Searching | 1984 | PODS |
| 6 | 11,232 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 7 | 2,388 | Parallel R-trees | 1992 | SIGMOD |
| 8 | 7,303 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB |
| 9 | 4,163 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD |
| 10 | 11,115 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD |