Oct 12, 2001 · A search-tree transaction is modelled as a two-level transaction containing structure modifications as open nested subtransactions that can ...

We consider transactions running on a database that consists of records with unique totally-ordered keys and is organized as a sparse primary search tree such ...

A Theory of Transactions on Recoverable Search Trees. Seppo Sippu, Eljas Soisalon-Soininen: A Theory of Transactions on Recoverable Search Trees.

A search-tree transaction is modelled as a two-level transaction containing structure modifications as open nested subtransactions that can commit even though ...

A Theory of Transactions on Recoverable Search Trees. Peer-reviewed. 2001. Supporting cooperative inter-organizational Business Transactions. Peer ...

Two solutions to ARIES-based recovery of transactions on R-trees are presented, which guarantee that an R-tree will remain in a consistent and balanced ...

The classical theory of concurrency control and recovery defines transactions as strings of abstract read and write operations. In our model, the logical ...

A Theory of Transactions on Recoverable Search Trees ; Автор: Sippu S. · Soisalon-Soininen E. ; Количество экземпляров: 1 ; Вид: Статья из сборника или журнала ; Год ...

Jan 4, 2001 · A Theory of Transactions on Recoverable Search Trees · Author Picture Seppo Sippu,; Author Picture Eljas Soisalon-Soininen. Pages 83–98. We ...

A theory of transactions on recoverable search trees. In ICDT 2001, Proceedings of the 8th International Conference on Database Theory. 83--98.]] Digital ...