The Challenge Posed by Long Transactions

Dimitris N. Chorafas

Chapter 3 in Transaction Management, 1998, pp 45-64 from Palgrave Macmillan

Abstract: Abstract In Chapter 1 we said that a transaction is both a concept and a mechanism in full evolution. Unlike the conventional short transaction, it typically involves lengthy interactions with the database spanning minutes, hours, or even days. Long transactions are covering an increasingly wider topology which may involve shared-nothing, shared-disk or shared-everything approaches, or even all of them at the same time.

Keywords: Consistency; integrity; shared-nothing; shared-disk; shared-everything; conversational mode; atomic transaction; competitiveness; high performance computing; guided style; interactive style; parallel access; recoverable operation; federated approach; federated databases; primitives; negotiated procedures; integrity constraints; nesting; locking; matching; nested transactions; two-phase locking; lock conflicts; multiple updates (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_3

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

DOI: 10.1057/9780230376533_3

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 ().