Haim Kaplan
Tel Aviv University
33.2Algorithmic Applications of Persistent Data Structures
33.3General Techniques for Making Data Structures Persistent
The Fat Node Method•Node Copying and Node Splitting•Handling Arrays•Making Data Structures Confluently Persistent
33.4Making Specific Data Structures More Efficient
Redundant Binary Counters•Persistent Deques
33.5Concluding Remarks and Open Questions
Think of the initial configuration of a data structure as version zero, and of every subsequent update operation as generating a new version of the data structure. Then a data structure is called persistent if it supports access to all versions and it is called ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
