On Transactional Concurrency Control

Erscheinungsjahr 2019
ISBN: 978-1-68173-548-1
Verlag: Morgan & Claypool Publishers

Buch, Englisch, 404 Seiten, Paperback, Format (B × H): 191 mm x 235 mm

Reihe: Synthesis Lectures on Data Management

This book contains a number of chapters on transactional database concurrency control.A two-sentence summary of the volume's entire sequence of chapters is this: traditional locking techniques can be improved in multiple dimensions, notably in lock scopes (sizes), lock modes (increment, decrement, and more), lock durations (late acquisition, early release), and lock acquisition sequence (to avoid deadlocks). Even if some of these improvements can be transferred to optimistic concurrency control, notably a fine granularity of concurrency control with serializable transaction isolation including phantom protection, pessimistic concurrency control is categorically superior to optimistic concurrency control, i.e., independent of application, workload, deployment, hardware, and software implementation.

Autoren/Hrsg.

Fachgebiete

• Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken
• Mathematik | Informatik EDV | Informatik Technische Informatik Grid-Computing & Paralleles Rechnen

Inhaltsverzeichnis

- On Transactional Concurrency Control
- A Survey of B-Tree Locking Techniques
- Hierarchical Locking in B-Tree Indexes
- Concurrent Queries and Updates in Summary Views and Their Indexes
- Controlled Lock Violation
- Orthogonal Key-Value Locking
- Orthogonal Key-Value Validation
- Serializable Timestamp Validation
- Repairing Optimistic Concurrency Control
- Avoiding Index-Navigation Deadlocks
- A Problem in Two-Phase Commit
- Deferred Lock Enforcement
- The End of Optimistic Concurrency Control
- Author's Biography

Über Autor(innen)

Goetz Graefe has been a professor, product architect, and industrial researcher since 1987. Like other database vendors, Microsoft SQL Server adopted his designs for query optimization and query execution. He has published tutorial surveys on query execution, sorting, b-tree indexing, concurrency control, logging and recovery, as well as numerous novel techniques and research results in query processing and transactional data storage. He is the 2017 recipient of the ACM SIGMOD Edgar F. Codd Innovation award.

H. V. Jagadish is Bernard A Galler Collegiate Professor of Electrical Engineering and Computer Science, and Distinguished Scientist at the Institute for Data Science, at the University of Michigan in Ann Arbor. Prior to 1999, he was Head of the Database Research Department at AT&T Labs, Florham Park, NJ. Professor Jagadish is well known for his broad-ranging research on information management, and has approximately 200 major papers and 37 patents. He is a fellow of the ACM, "The First Society in Computing," (since 2003) and serves on the board of the Computing Research Association (since 2009). He has been an Associate Editor for the ACM Transactions on Database Systems (1992-1995), Program Chair of the ACM SIGMOD annual conference (1996), Program Chair of the ISMB conference (2005), a trustee of the VLDB (Very Large DataBase) foundation (2004-2009), Founding Editor-in-Chief of the Proceedings of the VLDB Endowment (2008-2014), and Program Chair of the VLDB Conference (2014). Among his many awards, he won the ACM SIGMOD Contributions Award in 2013 and the David E Liddle Research Excellence Award (at the University of Michigan) in 2008.