Database Paper Browser

Back to papers

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)

Paper ID
8322
Venue
VLDB
Year
1995
Pagerank
5.0475112e-05
Overall Rank
6,480 | 54.93%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,072 Factorizing Complex Predicates in Queries to Exploit Indexes 2003 SIGMOD 5.2257599e-05
9,275 Efficient Bulk Deletes for Multi Dimensional Clustered Tables in DB2 2007 VLDB 4.3645459e-05
12,291 Visualizing the robustness of query execution 2009 CIDR 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers