Compact O-Complete Trees

Summary: Log2 M-bit surrogate encoding for index keys yields a B-tree–like, high-fanout retrieval with minimal storage, independent of key type or length. From a binary trie, it derives a compact multi-way search tree via recurrence and replaces it with a simple search algorithm and a secondary-index scheme. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7868
Venue: VLDB
Year: 1988
Pagerank: 4.4520434e-05
Overall Rank: 8,770 | 39.05%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ratko Orlandic
2. John L. Pfaltz

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
12,938	Indexing in a Hypertext Database	1990	VLDB	4.1905499e-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
726	Trie Hashing	1981	SIGMOD	0.00017466406

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
217	A Class of Data Structures for Associative Searching	1984	PODS	0.00033533621
12,302	Worst-Case Efficient Range Search Indexing	2009	PODS	4.1905499e-05
1,807	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	0.0001047644
9,499	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD	4.3300131e-05
5	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.0018380955
14,292	An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees	1984	SIGMOD	-
4,317	Compact B-Trees	1979	SIGMOD	6.2824978e-05
1,113	Cache-Oblivious String B-trees	2006	PODS	0.00013885755
6,473	Efficient Search of Multidimensional B-Trees	1995	VLDB	5.0427056e-05
14,362	Multi-Table Search For B-Tree Files	1979	SIGMOD	-