By Topic

Indexing management for distributed linear hash files

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
$31 $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)
Shang-Sheng Tung ; Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA ; Hongyuan Zha ; Keefe, T.

LH* is a scalable distributed data structure that extends linear hashing to support file manipulations in a distributed environment. The purpose of the paper is to investigate the behavior of concurrent transactions in the context of LH*. We present an algorithm to synchronize concurrent transactions in LH*. The algorithm exploits the semantics of LH* and verifies the valves of the addressing parameters during two consecutive reads to detect any harmful interference. After an operation completes its manipulation, it still holds the key lock till the transaction commits or aborts. However, to simply move the lock information along with the relocated keys cannot ensure correctness during a split. A locking protocol is therefore proposed to solve the inconsistency. Furthermore, a causal relationship is formed by associating a timestamp with each range query to eliminate the necessity of atomic broadcast

Published in:

Database and Expert Systems Applications, 1996. Proceedings., Seventh International Workshop on

Date of Conference:

9-10 Sep 1996