DBScholar

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
872
Venue
PODS
Year
1989
Pagerank
8.8573263e-05
Overall Rank
2,257 | 84.52%
DOI
10.1145/73721.73749

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fu_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Concurrency Control of Nested Transactions Accessing B-Trees}},
        url = {https://dl.acm.org/doi/10.1145/73721.73749},
        doi = {10.1145/73721.73749},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fu, Ada and Kameda, Tiko},
        year = {1989}
}

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
464 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.00018055592
2,084 Transaction Synchronisation In Object Bases 1988 PODS 9.1973681e-05
2,526 Semantically-based Concurrency Control for Search Structures 1985 PODS 8.463742e-05
2,801 Concurrency and Linear Hashing 1985 PODS 8.1117099e-05
Previous Page 1 / 1 Next

Semantically Similar Papers