Efficient Search of Multidimensional B-Trees
Summary: Efficient search for multidimensional B-Trees enabling selective retrieval on concatenated keys with partial keys, ranges, or disjuncts. Reduces need for secondary indexes, lowering storage and maintenance while avoiding full table scans. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Harry Leslie
- 2. Rohit Jain
- 3. Dave Birdsall
- 4. Hedieh Yaghmai
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,076 | Factorizing Complex Predicates in Queries to Exploit Indexes | 2003 | SIGMOD | 5.2207439e-05 |
| 9,279 | Efficient Bulk Deletes for Multi Dimensional Clustered Tables in DB2 | 2007 | VLDB | 4.3607717e-05 |
| 12,299 | Visualizing the robustness of query execution | 2009 | CIDR | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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.0032118946 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018380955 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016113151 |
| 24 | The R+-Tree: A Dynamic Index For Multi-Dimensional Objects | 1987 | VLDB | 0.00083300888 |
| 833 | The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems | 1990 | VLDB | 0.00016085787 |
| 1,707 | A Dynamic Clustering Technique For Physical Database Design | 1980 | SIGMOD | 0.00010803302 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,756 | Fast High-Dimensional Data Search in Incomplete Databases | 1998 | VLDB | 4.1905499e-05 |
| 1,524 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR | 0.00011509464 |
| 3,259 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD | 7.3101573e-05 |
| 14,292 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD | - |
| 217 | A Class of Data Structures for Associative Searching | 1984 | PODS | 0.00033533621 |
| 7,225 | Efficient Search in Very Large Databases | 1988 | VLDB | 4.7910249e-05 |
| 4,669 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0039237e-05 |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018380955 |
| 14,362 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD | - |