8 search results - page 1 / 2 » Concurrency and Recovery in Generalized Search Trees |
SIGMOD
1997
ACM
13 years 11 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...
VLDB
2005
ACM
14 years 7 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 ...
PPOPP
2012
ACM
12 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
PVLDB
2010
13 years 1 months ago
2010
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...