New Concurrency Control Algorithms for Accessing and Compacting B-Trees

نویسندگان

  • V. W. Setzer
  • Andrea Zisman
چکیده

This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characterized by the use of variable-length indices, the employment of a single lock type for the usual access operations and preemptive splits as well as delayed catenations and subdivisions. We also introduce a new compaction algorithm and its concurrent execution, using a new lock

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

Concurrent B-trees with Lock-free Techniques

B-trees and their variants are efficient data structures for finding records in a large collection (e.g., databases). The efficiency of B-trees increases when a number of users can manipulate the tree simultaneously. Many algorithms have been developed over the last three decades to achieve both concurrency and consistency in B-trees. However, current lock-based concurrency-control techniques l...

متن کامل

Effects of Autonomy on Maintaining Global Serializability in Heterogeneous Database Systems

A heterogeneous database system (HDBS) is a system which integrates preexisting database systems to support global applications accessing more than one database. In this paper, we study the difficulties and general approaches of global concurrency control in HDBSs. In particular, we discuss the difficulties of maintaining global serializabHity in HDBSs. This paper was originally motivated by th...

متن کامل

Concurrent Data Access in Mobile Heterogeneous Systems

A mobile computing environment involves accessing information through a wireless network connection. The mobile unit may be stationary, in motion, and/or intermittently connected to a fixed (wired) network. As technology advances are made in software and hardware, the feasibility of accessing information “anytime, anywhere” is becoming a reality. There are similarities involved in accessing inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994