M.P. Atkinson and O.P. Buneman, "Types and Persistence in Database Systems", ACM Computing Surveys, Volume 19, June 1987.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Persistence, Programming Languages and Supercomputing. Where is.. - Oudshoorn   (Correct)

....In its broadest sense, the term covers conventional and object oriented databases, execution checkpointing and data structure pickling as well as more sophisticated mechanisms. There are several possible schemes for supporting persistence for application systems; for a comprehensive survey see [AB87]. The form of persistence followed in our research is persistence by reachability whereby an object s lifetime depends on whether or not a future program execution may be able to see it. The persistence system designates a special object as a persistent root and provides applications with a ....

....a snapshot of their current state to the store in a single atomic action. Modern software engineering and programming language research has convinced us that strongly typed languages are beneficial. The same is true of persistent systems and much work has been done in the areas of type safety [AB87, CBC90, Con88]. A type safe persistent system relieves the programmer of tedious type checking when binding to an object from the persistent store. 2. Recent History The University of Adelaide has been involved in research into persistence almost from the time of its inception. Staff have been involved in the ....

M.P. Atkinson and O.P. Buneman, "Types and Persistence in Database Systems", ACM Computing Surveys, Volume 19, June 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC