Access Method Concurrency with Recovery

Summary: Introduces a concurrency-optimized access method for a Blink-tree generalization, compatible with multiple recovery schemes. Decomposes changes into levelwise atomic actions; leaf actions are transactional, upper levels are non-transactional, keeping the tree well-formed and enabling crash-resilient, short updates. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h305822390a92b6b8
Venue: SIGMOD
Year: 1992
Pagerank: 7.5432668e-05
Overall Rank: 3,180 | 78.69%
DOI: 10.1145/130283.130336

Incoming Non-self Citations Over Time

Authors

1. David Lomet (Digital Equipment Corporation)
2. Betty Salzberg (Northeastern University)

BibTeX Citation

@inproceedings{lomet_sigmod92,
        title = {{Access Method Concurrency with Recovery}},
        author = {Lomet, David and Salzberg, Betty},
        series = {{SIGMOD} '92},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/130283.130336},
        url = {https://dl.acm.org/doi/10.1145/130283.130336},
        year = {1992}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,279	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD	8.6989205e-05
3,035	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	7.7099361e-05
3,121	High-Concurrency Locking in R-Trees	1995	VLDB	7.6094637e-05
5,243	Redo Recovery after System Crashes	1995	VLDB	6.2004506e-05
5,302	High-Performance Extensible Indexing	1999	VLDB	6.1759848e-05
5,639	Principles of Transaction-Based On-Line Reorganization	1992	VLDB	6.0381153e-05
7,477	The hB-Pi-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation	1995	VLDB	5.5022037e-05
7,979	Online B-Tree Merging	2005	SIGMOD	5.3978271e-05
9,092	Repeating History Beyond ARIES	1999	VLDB	5.2088581e-05
10,115	Recovery Protocols for Shared Memory Database Systems	1995	SIGMOD	5.065109e-05
10,345	AB-tree: Index for Concurrent Random Sampling and Updates	2022	VLDB	5.0197268e-05
13,341	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB	4.9605343e-05
13,406	Exploiting A History Database for Backup	1993	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
475	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00017634372
686	Access Methods For Multiversion Data	1989	SIGMOD	0.00014736882
985	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00012661135
1,698	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	9.8232497e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	985	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD
2	13,512	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS
3	7,979	Online B-Tree Merging	2005	SIGMOD
4	7,187	Operation Specific Locking In B-Trees	1987	PODS
5	2,311	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS
6	5,675	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS
7	7,477	The hB-Pi-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation	1995	VLDB
8	1,698	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
9	2,279	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
10	13,373	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB