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: 2608
Venue: SIGMOD
Year: 1992
Pagerank: 7.3262881e-05
Overall Rank: 3,244 | 77.44%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. David Lomet
2. Betty Salzberg

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,982	On-line Reorganization of Sparsely-populated B+-trees	1996	SIGMOD	9.8662834e-05
2,516	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD	8.6106981e-05
3,039	High-Concurrency Locking in R-Trees	1995	VLDB	7.6708607e-05
4,231	Redo Recovery after System Crashes	1995	VLDB	6.3387846e-05
5,354	Principles of Transaction-Based On-Line Reorganization	1992	VLDB	5.5518586e-05
5,390	High-Performance Extensible Indexing	1999	VLDB	5.5346145e-05
6,764	The hBII-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation	1995	VLDB	4.9330419e-05
7,200	Online B-Tree Merging	2005	SIGMOD	4.8030945e-05
9,270	Repeating History Beyond ARIES	1999	VLDB	4.3653385e-05
9,755	Recovery Protocols for Shared Memory Database Systems	1995	SIGMOD	4.2897489e-05
9,949	AB-tree: Index for Concurrent Random Sampling and Updates	2022	VLDB	4.2421586e-05
12,810	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB	4.1945683e-05
12,875	Exploiting A History Database for Backup	1993	VLDB	4.1945683e-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
282	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00029057817
685	Access Methods For Multiversion Data	1989	SIGMOD	0.00018179465
1,088	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00014161003
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,088	ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging	1992	SIGMOD	0.00014161003
12,977	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS	4.1945683e-05
7,200	Online B-Tree Merging	2005	SIGMOD	4.8030945e-05
6,250	Operation Specific Locking In B-Trees	1987	PODS	5.1383127e-05
1,243	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS	0.00013096387
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6106291e-05
6,764	The hBII-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation	1995	VLDB	4.9330419e-05
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081
2,516	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD	8.6106981e-05
12,843	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.1945683e-05