The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes
Summary: Introduces the K-D-B-tree, a disk-resident index for large, dynamic multikey workloads with interleaved inserts, deletes, and queries. It fuses K-D-tree multidimensional search with B-tree I/O efficiency to approximate both goals, with preliminary results supporting the approach. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. John T. Robinson (Carnegie Mellon University)
BibTeX Citation
@inproceedings{robinson_sigmod81,
title = {{The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes}},
author = {Robinson, John T.},
series = {{SIGMOD} '81},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/582318.582321},
url = {https://dl.acm.org/doi/10.1145/582318.582321},
year = {1981}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 66 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,786 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD |
| 2 | 14,847 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD |
| 3 | 9,100 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 4 | 1,559 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 5 | 14,793 | Performance Comparison Of Index Structures For Multi-Key Retrieval | 1984 | SIGMOD |
| 6 | 13,507 | MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES | 1985 | SIGMOD |
| 7 | 12,779 | Worst-Case Efficient Range Search Indexing | 2009 | PODS |
| 8 | 5,023 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD |
| 9 | 264 | A Class of Data Structures for Associative Searching | 1984 | PODS |
| 10 | 6,584 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |