DocumentCode
279008
Title
Persistence+undoability=transactions
Author
Nettles, Scott M. ; Wing, Jeannette M.
Author_Institution
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
Volume
ii
fYear
1992
fDate
7-10 Jan 1992
Firstpage
832
Abstract
Persistence means objects live potentially forever. Undoability means that any change to a program´s store can potentially be undone. In their design and implementation of support for single-threaded nested transactions in Standard ML of New Jersey (SML/NJ), the authors provide persistence and undoability as orthogonal features and combine them in a simple and elegant manner. They provide support for persistence through an SML interface that lets users manipulate a set of persistent roots and provides a save function that causes all data reachable from the persistent roots to be moved into the persistent heap. They provide support for undoability through an SML interface that exports two functions: checkpoint, which checkpoints the current store, and restore, which undoes all changes made to the previously checkpointed store. Finally, they succinctly define a higher-order function transact completely in terms of the interfaces for persistence and undoability
Keywords
data structures; database management systems; transaction processing; SML/NJ; Standard ML of New Jersey; checkpoint; higher-order function transact; persistence; restore; save function; single-threaded nested transactions; transactions; undoability; Aerospace electronics; Application software; Atomic layer deposition; Banking; Computer science; Machine vision; Operating systems; Research and development; Time measurement; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 1992. Proceedings of the Twenty-Fifth Hawaii International Conference on
Conference_Location
Kauai, HI
Print_ISBN
0-8186-2420-5
Type
conf
DOI
10.1109/HICSS.1992.183335
Filename
183335
Link To Document