Concurrency control and recovery for balanced B-link trees

Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas

doi:10.1007/s00778-004-0140-6

Cited by 53 publications

(18 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then T performs the structure modifications bottom-up on these pages, where the U locks on these pages are upgraded to X locks. Each tree structure modification is logged using physiological redo-undo log records [10,12,14,15,16]. Hence, in the event of a system failure, all incomplete structure modifications must be undone first so that aborted transactions can be rolled back during the undo phase of the restart recovery.…”

Section: Introductionmentioning

confidence: 99%

Concurrent multidimensional index algorithms in page-server DBMS

Jaluta

2013

2013 World Congress on Computer and Information Technology (WCCIT)

Self Cite

View full text Add to dashboard Cite

In this paper, we present new concurrent R-tree algorithms for page-server database management systems. The algorithms allow for inter-transaction caching of data and index pages, so that a page can reside in a client cache even when no transaction is currently active at the client which reduces the number of client-server interactions and offload server resources (CPU and disks), thus improving clienttransaction response time. Cache consistency is guaranteed by an enhanced callback-read locking protocol. Both the concurrency-control and the replica-management protocols operate at the page level.

show abstract

Section: Introductionmentioning

confidence: 99%

Concurrent multidimensional index algorithms in page-server DBMS

Jaluta

2013

2013 World Congress on Computer and Information Technology (WCCIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [39], the balance of the B-link tree is maintained at all times, leading to logarithmic time bounds for search, update, and deletion operations. However, this algorithm does not consider parallel B-tree structures.…”

Section: B Link -Treementioning

confidence: 99%

Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node

Yoshihara

Kobayashi

Yokota

2018

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYMany concurrency control protocols for B-trees use latchcoupling because its execution is efficient on a single machine. Some studies have indicated that latch-coupling may involve a performance bottleneck when using multicore processors in a shared-everything environment, but no studies have considered the possible performance bottleneck caused by sending messages between processing elements (PEs) in sharednothing environments. We propose two new concurrency control protocols, "LCFB" and "LCFB-link", which require no latch-coupling in optimistic processes. The LCFB-link also innovates B-link approach within each PE to reduce the cost of modifications in the PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree. The B-link algorithm is well known as a protocol without latch-coupling, but Blink has the difficulty of guaranteeing the consistency of the side pointers in a parallel B-tree. Experimental results in various environments indicated that the system throughput of the proposed protocols was always superior to those of the conventional protocols, particularly in large-scale configurations, and using LCFB-link was effective for higher update ratios. In addition, to mitigate access skew, data should migrate between PEs. We have demonstrated that our protocols always improve the system throughput and are effective as concurrency controls for data migration.

show abstract

“…In [10], the balance of of the B-link tree is maintained at all times, so that a logarithmic time bound for a search or an update operation and deletions. This algorithm also does not consider parallel B-tree structures.…”

mentioning

confidence: 99%

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content

Yoshihara

Kobayashi

Yokota

2008

Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

While shared-nothing parallel infrastructures provide fast processing of explosively growing digital content, managing data efficiently across multiple nodes is important. The value-range partitioning method with parallel B-tree structures in a shared-nothing environment is an efficient approach for handling large amounts of data. To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree. Many studies have proposed concurrency control protocols for Btrees, which use latch-coupling. None of these studies has considered that latch-coupling contains a performance bottleneck of sending of messages between processing elements (PEs) in distributed environments because latch-coupling is efficient for a B-tree on a single machine. The only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the consistency of the side pointers. We propose a new concurrency control protocol named LCFB that requires no latch-coupling in optimistic processes. LCFB reduces the amount of communication between PEs during a B-tree traversal. To detect access path errors in the LCFB protocol caused by removal of latch-coupling, we assign boundary values to each index page. Because a page split may cause page deletion in a Fat-Btree, we also propose an effective method for handling page deletions without latch-coupling. We then combine LCFB with the B-link algorithm within each PE to reduce the cost of Structure Modification Operations (SMOs) in a PE, as a solution to the difficulty of * This work was done while the author was with Tokyo Institute of Technology. The author is now working at Systems Development Laboratory, Hitachi, Ltd. † The author is a JSPS Research Fellow (DC).Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. EDBT'08, March 25-30, 2008, Nantes, France. Copyright 2008 consistency management for the side pointers in a parallel B-tree structure. To compare the performance of the proposed protocol with conventional protocols MARK-OPT, INC-OPT, and ARIES/IM, we implemented them on an autonomous disk system with a Fat-Btree structure. Experimental results in various environments indicate that the system throughput of the proposed protocols is always superior to those of the other protocols, especially in large-scale configurations, and LCFB with the B-link algorithm is effective at higher update ratios.

show abstract

Concurrency control and recovery for balanced B-link trees

Cited by 53 publications

References 18 publications

Concurrent multidimensional index algorithms in page-server DBMS

Concurrent multidimensional index algorithms in page-server DBMS

Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content

Contact Info

Product

Resources

About