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: 2670
Venue: SIGMOD
Year: 1992
Pagerank: 7.7405805e-05
Overall Rank: 3,114 | 78.64%
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,227	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD	8.9111106e-05
2,968	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	7.9149281e-05
3,057	High-Concurrency Locking in R-Trees	1995	VLDB	7.807389e-05
5,104	Redo Recovery after System Crashes	1995	VLDB	6.3641018e-05
5,173	High-Performance Extensible Indexing	1999	VLDB	6.3341007e-05
5,493	Principles of Transaction-Based On-Line Reorganization	1992	VLDB	6.1999067e-05
7,310	The hB-Pi-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation	1995	VLDB	5.6494751e-05
7,804	Online B-Tree Merging	2005	SIGMOD	5.5415082e-05
9,357	Repeating History Beyond ARIES	1999	VLDB	5.2827941e-05
9,903	Recovery Protocols for Shared Memory Database Systems	1995	SIGMOD	5.1997534e-05
10,093	AB-tree: Index for Concurrent Random Sampling and Updates	2022	VLDB	5.1530576e-05
13,004	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB	5.093636e-05
13,069	Exploiting A History Database for Backup	1993	VLDB	5.093636e-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
464	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00018055592
681	Access Methods For Multiversion Data	1989	SIGMOD	0.0001502579
958	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00012956148
1,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00010073735

Semantically Similar Papers

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