Indexing management for distributed linear hash files

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