Definition
Transaction chopping is a technique for improving the concurrent performance of a database system by reducing the time locks are held. The idea is to break up each transaction into smaller “pieces,” such that each piece executes as a transaction, but the effect is as if the original transactions executed serializably.
Key Points
Imagine an application that locks the entire database and then accesses a few rows in a table that does not fit into memory. If one looked at the resource statistics, one would find low CPU consumption and low disk utilization, yet the throughput would be very bad. For example, if ten pages were accessed even at 1 ms per page, then throughput would be only 100 transactions per second. The point is that it is possible to slow down performance greatly just because of a poor locking strategy, even if there are plenty of resources.
One might consider a less extreme case: a transaction that processes an order. The transaction might check whether there is...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Fekete A., Liarokapis D., O’Neil E., O’Neil P., and Shasha D. Making Snapshot Isolation Serializable. ACM Trans. Database Syst., 30(2):492–528, 2005.
Shasha D. and Bonnet P. Database Tuning : Principles Experiments and Troubleshooting Techniques. Morgan Kaufmann, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Shasha, D. (2009). Transaction Chopping. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_434
Download citation
DOI: https://doi.org/10.1007/978-0-387-39940-9_434
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35544-3
Online ISBN: 978-0-387-39940-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering