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
- 2. Kyle Fox
- 3. Kamesh Munagala
- 4. Abhinandan Nath
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,833 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 6.7173578e-05 |
| 7,054 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 4.8496866e-05 |
| 9,761 | Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations | 2025 | PODS | 4.2856106e-05 |
| 10,387 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD | 4.1945683e-05 |
| 10,911 | Topology-aware Parallel Joins | 2024 | PODS | 4.1945683e-05 |
| 11,436 | Algorithms for a Topology-aware Massively Parallel Computation Model | 2021 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 538 | The Dataflow Model: A Practical Approach to Balancing Correctness, Latency, and Cost in Massive-Scale, Unbounded, Out-of-Order Data Processing | 2015 | VLDB | 0.00020678804 |
| 1,280 | Automatic Optimization for MapReduce Programs | 2011 | VLDB | 0.0001285503 |
| 1,308 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB | 0.00012661651 |
| 1,411 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.0001212565 |
| 3,129 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.5008242e-05 |
| 4,217 | Spatial Partitioning Techniques in SpatialHadoop | 2015 | VLDB | 6.3514771e-05 |
| 7,537 | TAREEG: A MapReduce-Based Web Service for Extracting Spatial Data from OpenStreetMap | 2014 | SIGMOD | 4.7176029e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,133 | Parallel Algorithms for High-dimensional Proximity Joins | 1997 | VLDB | 4.8226285e-05 |
| 3,555 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD | 6.9772546e-05 |
| 1,931 | Efficient Processing of k Nearest Neighbor Joins using MapReduce | 2012 | VLDB | 0.00010040427 |
| 6,516 | (Almost) Optimal Parallel Block Access for Range Queries | 2000 | PODS | 5.0321577e-05 |
| 216 | A Class of Data Structures for Associative Searching | 1984 | PODS | 0.00033542705 |
| 10,556 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB | 4.1945683e-05 |
| 2,246 | Parallel R-trees | 1992 | SIGMOD | 9.2075292e-05 |
| 7,054 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 4.8496866e-05 |
| 3,804 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD | 6.7525564e-05 |
| 10,387 | Parallel kd-tree with Batch Updates | 2025 | SIGMOD | 4.1945683e-05 |