A Discipline for Robustness or Storage Reduction in Binary Search Trees

Summary: Fault-tolerant BST encoding that detects any two field corruptions and corrects one with O(n) repair time and negligible storage overhead. Also provides a single-pointer-per-key BST preserving search/update costs and compatible with balancing, often shortening paths. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 647
Venue: PODS
Year: 1983
Pagerank: -
Overall Rank: 14,313 | 0.53%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. J Ian Munro
2. Patricio V. Poblete

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,355	Efficient Search of Multidimensional B-Trees	1995	VLDB	5.9660428e-05
13,086	Experiments With B-Tree Reorganization	1980	SIGMOD	5.1725247e-05
4,864	A General Solution of the n-dimensional B-tree Problem	1995	SIGMOD	6.5381219e-05
3,120	Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs	2022	VLDB	7.7925965e-05
10,380	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD	5.1725247e-05
10,565	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB	5.1725247e-05
9,625	An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs	2025	SIGMOD	5.3018378e-05
13,826	Relaxed Multi-Way Trees with Group Updates	2001	PODS	-
12,717	Group Updates for Relaxed Height-Balanced Trees	1999	PODS	5.1725247e-05
12,918	Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees	1991	PODS	5.1725247e-05