Database Paper Browser

Back to papers

A Compact B-tree

Summary: Patricia-tree on-page inside a B-tree for OLTP workloads, replacing the per-page sorted key array with a local Patricia index for compact node storage. Prototype in iAnywhere ASA 8.0 shows substantial space savings and performance gains over existing ASA indexes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3378
Venue
SIGMOD
Year
2002
Pagerank
4.3086973e-05
Overall Rank
9,664 | 32.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,404 Revisiting B-tree Compression: An Experimental Study 2024 SIGMOD 4.3441378e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
415 A Fast Index for Semistructured Data 2001 VLDB 0.00023814619
1,184 On Effective Multi-Dimensional Indexing for Strings 2000 SIGMOD 0.00013455208
1,809 Main-Memory Index Structures with Fixed-Size Partial Keys 2001 SIGMOD 0.00010483957
Previous Page 1 / 1 Next

Semantically Similar Papers