查看文章

In this paper, we present a version of the linear hash structure algorithm to increase concurrency using multi-level transaction model. We exploit the semantics of the linear hash operations at each level of nesting to allow more concurrency. We consider locks at both vertex (page) and key level (tuple) to further increase concurrency. As undo based recovery is not possible with multi-level transactions and therefore, we have used compensating based undo to achieve atomicity.