Database Paper Browser

Back to papers

Concurrency Control of Nested Transactions Accessing B-Trees

Summary: Introduces a concurrency control algorithm for nested transactions on B-trees that integrates B-link tree traversal with resilient two-phase locking to support concurrent structural modifications. Proves correctness via I/O automata and a novel “strongly-serially correct” schedule criterion. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
873
Venue
PODS
Year
1989
Pagerank
0.00013096387
Overall Rank
1,243 | 91.36%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

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
1,276 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012883569
1,523 Concurrency and Linear Hashing 1985 PODS 0.00011518774
1,642 Transaction Synchronisation In Object Bases 1988 PODS 0.00011044566
Previous Page 1 / 1 Next

Semantically Similar Papers