Transaction Chopping: Algorithms and Performances Studies (1995)
| Venue: | ACM Transactions on Database Systems |
| Citations: | 27 - 4 self |
BibTeX
@ARTICLE{Shasha95transactionchopping:,
author = {Dennis Shasha and Dennis Shasha and Francois Llirbat and Francois Llirbat and Eric Simon and Eric Simon and Patrick Valduriez and Patrick Valduriez},
title = {Transaction Chopping: Algorithms and Performances Studies},
journal = {ACM Transactions on Database Systems},
year = {1995},
volume = {20},
pages = {325--363}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Chopping transactions into pieces is good for performance but may lead to non-serializable executions. Many researchers have reacted to this fact by either inventing new concurrency control mechanisms, weakening serializability, or both. We adopt a different approach. We assume a user who -- has access only to user-level tools such as (i) choosing between degree 2 and degree 3 isolation levels (degree 2 corresponds to level 1 in the new ANSI SQL terminology) (ii) the ability to execute a portion of a transaction using multiversion read consistency, and (iii) the ability to reorder the instructions in transaction programs; and -- knows the set of transactions that may run during a certain interval (users are likely to have such knowledge for online or real-time transactional applications).
