8 search results - page 1 / 2 » Concurrency control and recovery for balanced B-link trees |
VLDB
2005
ACM
14 years 4 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
IPPS
1994
IEEE
13 years 8 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
CASCON
2004
13 years 6 months ago
2004
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
VCHCI
1993
13 years 8 months ago
1993
The interaction history of a document can be modelled as a tree of command objects. This model does not only support recovery (undo/redo), but is also suitable for cooperation betw...