Database Paper Browser

Back to papers

A Framework for the Performance Analysis of Concurrent B-tree Algorithms

Summary: Framework to analytically model concurrent B-tree algorithms' response time and throughput, validated by simulations on real B-trees. Evaluates Naive lock‑coupling, Optimistic Descent, Lehman–Yao; gives practical rules‑of‑thumb and quantifies recovery's concurrency cost. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
908
Venue
PODS
Year
1990
Pagerank
5.6106291e-05
Overall Rank
5,239 | 63.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
2,238 Lazy Updates for Distributed Search Structure 1993 SIGMOD 9.2209967e-05
7,200 Online B-Tree Merging 2005 SIGMOD 4.8030945e-05
12,810 Index Concurrency Control in Firm Real-Time DBMS 1995 VLDB 4.1945683e-05
12,886 Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking 1992 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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
2,092 Concurrency Control In B+-Trees Databases Using Preparatory Operations 1985 VLDB 9.560141e-05
2,975 Utilization of B-trees with Inserts, Deletes and Modifies 1989 PODS 7.7893243e-05
Previous Page 1 / 1 Next

Semantically Similar Papers