Premium
Implementing persistent data structures using C++
Author(s) -
Parrish Allen,
Dixon Brandon,
Cordes David,
Vrbsky Susan,
Lusth John
Publication year - 1998
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(19981225)28:15<1559::aid-spe214>3.0.co;2-7
Subject(s) - class (philosophy) , computer science , data structure , persistent data structure , software , data access , mechanism (biology) , programming language , artificial intelligence , philosophy , epistemology
Persistent data structures allow efficient access to, and modification of, previous values of the data structure. In this paper, we illustrate a class‐based implementation of persistence. Our implementation provides a mechanism to transform a given (non‐persistent) class to a persistent form without making any significant modifications to the class. We then demonstrate how our implementation may be used to improve the efficiency of a previously devised procedure for class testing of object‐oriented software. © 1998 John Wiley & Sons, Ltd.