Making Data Structures Persistent

Making Data Structures Persistent (1989)

by James R. Driscoll , Neil Sarnak , Daniel D. Sleator , Robert E. Tarjan

Citations:

231 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	Making Data Structures Persistent	user correction
AUTHOR NAME	James R. Driscoll	user correction
AUTHOR AFFIL	Computer Science Department, Carnegie-Mellon University	user correction
AUTHOR ADDR	Pittsburgh, Pennsylvania 15218	user correction
AUTHOR NAME	Neil Sarnak	user correction
AUTHOR AFFIL	IBM T.J. Watson Research Center	user correction
AUTHOR ADDR	Yorktown Heights, New York 10598	user correction
AUTHOR NAME	Daniel D. Sleator	user correction
AUTHOR AFFIL	Computer Science Department, Carnegie-Mellon University,	user correction
AUTHOR ADDR	Pittsburgh, Pennsylvania 15218	user correction
AUTHOR NAME	Robert E. Tarjan	user correction
AUTHOR AFFIL	Computer Science Department, Princeton University	user correction
AUTHOR ADDR	Princeton, New Jersey 08544	user correction
ABSTRACT	This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in the sense that a change to the structure destroys the old version, leaving only the new version available for use. In contrast, a persistent structure allows access to any version, old or new, at any time. We develop simple, systematic, and effiient techniques for making linked data structures persistent. We use our techniques to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion times and O(1) space bounds for insertion and deletion.	user correction
YEAR	1989	user correction
CITATIONS	36 found	ParsCit 1.0