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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. J Ian Munro (University of Waterloo)
- 2. Patricio V. Poblete (University of Chile; University of Waterloo)
BibTeX Citation
@inproceedings{munro_pods83,
address = {New York, NY, USA},
series = {{PODS} '83},
title = {{A Discipline for Robustness or Storage Reduction in Binary Search Trees}},
url = {https://dl.acm.org/doi/10.1145/588058.588069},
doi = {10.1145/588058.588069},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Munro, J Ian and Poblete, Patricio V.},
year = {1983}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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 |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,451 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |
| 2 | 13,274 | Experiments With B-Tree Reorganization | 1980 | SIGMOD |
| 3 | 4,914 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD |
| 4 | 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB |
| 5 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 6 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 7 | 8,657 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD |
| 8 | 14,013 | Relaxed Multi-Way Trees with Group Updates | 2001 | PODS |
| 9 | 12,901 | Group Updates for Relaxed Height-Balanced Trees | 1999 | PODS |
| 10 | 13,103 | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees | 1991 | PODS |