By Topic

Concurrency control of bulk access transactions on shared nothing parallel database machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Ohmori ; Dept. of Electr. Eng., Tokyo Univ., Japan ; M. Kitsuregawa ; H. Tanaka

New concurrency control schemes are proposed for bulk access transactions (BATs) on shared-nothing database machines. A BAT is a transaction accessing a large bulk of data, such as a transaction updating a whole file. BATs are used for batch jobs in database services, and many BATs should be finished in a short time. Thus it is necessary to execute BATs concurrently on a database machine. When scheduling BATs, the performance is degraded by very high contention of both data and resources. Therefore, the strategy for scheduling BATs is to reduce the contention as much as possible. A weighted transaction precedence graph (WTPG) and two schedulers using it are proposed. A WTPG is used to estimate the degree of contention in a serializable schedule. Using a WTPG, the proposed schedulers reduced the contention by optimization. In the simulation, both schedulers achieve from 1.2 to 1.8 times higher throughput than atomic static lock and two-phase lock

Published in:

Data Engineering, 1990. Proceedings. Sixth International Conference on

Date of Conference:

5-9 Feb 1990