Compact O-Complete Trees

Summary: Introduces compact O-complete trees, a key-type/length-independent B-tree variant encoding index keys with log₂M-bit surrogates to maximize fanout and reduce index space. Derives it from binary tries and supplies a simple search algorithm plus a secondary-index access scheme. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 8058
Venue: VLDB
Year: 1988
Pagerank: 5.3483178e-05
Overall Rank: 8,943 | 38.65%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ratko Orlandic (University of Virginia)
2. John L. Pfaltz (University of Virginia)

BibTeX Citation

@article{orlandic_vldb88,
        title = {{Compact O-Complete Trees}},
        author = {Orlandic, Ratko and Pfaltz, John L.},
        journal = {PVLDB},
        series = {{VLDB} '88},
        pages = {372},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
13,123	Indexing in a Hypertext Database	1990	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
1,221	Trie Hashing	1981	SIGMOD	0.00011605619

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	13,036	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
2	12,489	Worst-Case Efficient Range Search Indexing	2009	PODS
3	1,813	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD
4	9,635	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
5	8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD
6	14,479	An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees	1984	SIGMOD
7	6,246	Compact B-Trees	1979	SIGMOD
8	1,112	Cache-Oblivious String B-trees	2006	PODS
9	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
10	14,549	Multi-Table Search For B-Tree Files	1979	SIGMOD