Transactions on the multiversion B
            <sup>+</sup>
            -tree

Haapasalo, Tuukka; Jaluta, Ibrahim; Seeger, Bernhard; Sippu, Seppo; Soisalon-Soininen, Eljas

doi:10.1145/1516360.1516482

Cited by 26 publications

(15 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we briefly review our transactional extension (TMVBT) [7] to the multiversion B + -tree (MVBT) by Becker et al [3]. The MVBT is an asymptotically optimal multiversion index structure.…”

Section: Transactional Mvbtmentioning

confidence: 99%

“…Also, concurrency-control and recovery algorithms were not discussed. Our transactional extension to the MVBT, called the transactional multiversion B + -tree, or TMVBT [7,8], extends the transaction model to allow multiple updates to be applied within a single transaction. We described an efficient concurrency-control and recovery scheme that allows a single updating transaction to operate concurrently with multiple read-only transactions.…”

Section: Transactional Mvbtmentioning

confidence: 99%

“…An example of a TMVBT index is given in Figure 3. More detailed examples can be found in our previous article on the structure [7].…”

Section: Transactional Mvbtmentioning

confidence: 99%

“…As an initial step, we have extended the MVBT to support multi-action transactions and designed concurrency-control algorithms that allow a single updating transaction to operate concurrently with multiple read-only transactions [7,8]. Our extension is called the transactional multiversion B + -tree, or TMVBT.…”

Section: Introductionmentioning

confidence: 99%

“…As described in our TMVBT article [7], the TMVBT structure cannot directly support multiple updating transactions without compromising its optimality guarantees. We have thus designed a two-level index structure composed of a permanent TMVBT index used as the main storage of committed versioned data and a temporary B + -tree index called the versioned B + -tree (VBT) used to store the versions created by active or recently committed transactions.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Concurrent updating transactions on versioned data

Haapasalo¹,

Sippu

Jaluta³

et al. 2009

Proceedings of the 2009 International Database Engineering &Amp; Applications Symposium on - IDEAS '09

Self Cite

View full text Add to dashboard Cite

Modern database applications increasingly often require access to historical versions of the database. Storing such multiversion data in a single-version B + -tree database index is inefficient, especially for key-range queries. In this article, we present an index structure called the concurrent multiversion B + -tree (CMVBT) for efficiently storing and querying multiversion data.The CMVBT structure uses an asymptotically optimal transactional multiversion B + -tree (TMVBT) index as the main data storage, and a separate B + -tree index called the versioned B + -tree (VBT) to hold the updates of active transactions. The updates of committed transactions are moved, one transaction at a time, from the VBT into the TMVBT. This organization of two separate index structures allows us to maintain the asymptotic optimality guarantees of the TMVBT even in the presence of concurrent updating transactions.We provide concurrent algorithms for updating and reading the CMVBT structure. Our CMVBT algorithms can be used with the standard snapshot isolation concurrencycontrol and ARIES-based recovery algorithms to allow multiple read-only and updating transactions to operate concurrently on the structure. Transaction rollback is also supported for all updating transactions, either entirely or up to a preset savepoint.

show abstract

Section: Transactional Mvbtmentioning

confidence: 99%

Section: Transactional Mvbtmentioning

confidence: 99%

“…An example of a TMVBT index is given in Figure 3. More detailed examples can be found in our previous article on the structure [7].…”

Section: Transactional Mvbtmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%