Loading...
Please wait, while we are loading the content...
Similar Documents
Making data structures persistent (1989)
| Content Provider | CiteSeerX |
|---|---|
| Author | Driscoll, James R. Sarnak, Neil Tarjan, Robert E. Sleator, Daniel D. |
| 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 U(1) space bounds for insertion and deletion. |
| File Format | |
| Publisher Date | 1989-01-01 |
| Access Restriction | Open |
| Subject Keyword | Effiient Technique Persistent Structure Old Version Space Bound Deletion Time Logarithmic Access Binary Search Tree Ordinary Data Structure Persistent Form |
| Content Type | Text |
| Resource Type | Article |
