Parallel kd-tree with Batch Updates
Summary: Parallel kd-tree (Pkd-tree) for in-memory multi-dimensional data with high parallelism and cache efficiency. Parallel construction and reconstruction-based batch updates (insert/delete) keep the tree weight-balanced, enabling kNN, range, and range-count queries with strong work/span/cache bounds; outperforms baselines; code released. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ziyang Men
- 2. Zheqi Shen
- 3. Yan Gu
- 4. Yihan Sun
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 716 | Query-based Workload Forecasting for Self-Driving Database Management Systems | 2018 | SIGMOD | 0.00017723171 |
| 2,246 | Parallel R-trees | 1992 | SIGMOD | 9.2075292e-05 |
| 4,021 | Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures | 2016 | PODS | 6.5225987e-05 |
| 7,250 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB | 4.78908e-05 |
| 11,477 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next