Concurrency control for resilient nested transactions

A formal framework is developed for providing correctness of algorithms which implement nested transactions. In particular, a simple action tree data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transaction...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Lynch, Nancy A. 1948- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1983
Schlagworte:	Algebra Algorithms Computer Programming and Software Computer programming Control theory Corrections Data bases Data management Data processing Maps Simulation Theoretical Mathematics Trees Datenverarbeitung Verteiltes Datenbanksystem
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!