TY - JOUR
T1 - Making data structures confluently persistent
AU - Fiat, Amos
AU - Kaplan, Haim
N1 - Funding Information:
✩ A preliminary version of this paper has appeared in the Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001. * Corresponding author. E-mail addresses: fiat@math.tau.ac.il (A. Fiat), haimk@math.tau.ac.il (H. Kaplan). 1 Research supported in part by the Israel Science Foundation, Grant 548.
PY - 2003/8
Y1 - 2003/8
N2 - We address a longstanding open problem of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124, J. Driscoll, D. Sleator, R. Tarjan, J. ACM, 41 (5) (1994) 943-959], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transformations for fully persistent data structures are given in [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124], greatly improving the performance compared to the naive scheme of simply copying the inputs. Unlike fully persistent data structures, where both the naive scheme and the fully persistent scheme of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124] are feasible, we show that the naive scheme for confluently persistent data structures is itself infeasible (requires exponential space and time). Thus, prior to this paper there was no feasible method for making any data structure confluently persistent at all. Our methods give an exponential reduction in space and time compared to the naive method, placing confluently persistent data structures in the realm of possibility.
AB - We address a longstanding open problem of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124, J. Driscoll, D. Sleator, R. Tarjan, J. ACM, 41 (5) (1994) 943-959], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transformations for fully persistent data structures are given in [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124], greatly improving the performance compared to the naive scheme of simply copying the inputs. Unlike fully persistent data structures, where both the naive scheme and the fully persistent scheme of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124] are feasible, we show that the naive scheme for confluently persistent data structures is itself infeasible (requires exponential space and time). Thus, prior to this paper there was no feasible method for making any data structure confluently persistent at all. Our methods give an exponential reduction in space and time compared to the naive method, placing confluently persistent data structures in the realm of possibility.
UR - http://www.scopus.com/inward/record.url?scp=0041426758&partnerID=8YFLogxK
U2 - 10.1016/S0196-6774(03)00044-0
DO - 10.1016/S0196-6774(03)00044-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0041426758
VL - 48
SP - 16
EP - 58
JO - Journal of Algorithms
JF - Journal of Algorithms
SN - 0196-6774
IS - 1
ER -