Transaction Locks, Two-Phase Commit and Deadlocks

Dimitris N. Chorafas

Chapter 11 in Transaction Management, 1998, pp 215-237 from Palgrave Macmillan

Abstract: Abstract Access to the database occurs within the framework of short and long transactions. As we have seen, each transaction consists of a sequence of operations on the database, with practically no pre-established limits to the time spent in a transaction or number of operations performed for its execution.

Keywords: Database consistency; commit; abort; read/write; log-out; root page; transaction complexity; serialization; locking; conflict resolution; global level; local level; data consistency; two-phase commit; atomicity; fault tolerance; optimistic protocol; prudent protocol; hash function; deadly embrace; linear commit; tree commit; decentralized commit; central-site commit; communications failure; site failure; blocking; time complexity; message complexity; concurrency control; lock manager; primary copy; contention; deadlock; rollback; metalayer; metalevel; deadlock-free; livelock-free; savepoints; flexible transaction; prepared-to-commit; locking protocol; root object; directory node; directory; shared transaction; object-level locking; aggregatelevel locking. (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-0-230-37653-3_11

Ordering information: This item can be ordered from
http://www.palgrave.com/9780230376533

DOI: 10.1057/9780230376533_11

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().