It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in O(logn) amortized time, and following a pointer takes O(logclogn) time where c is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved at a logarithmic cost in the bounded in-degree model used widely in previous work. This is a O(n/logn)-factor improvement over the previous known transform to make a data structure confluently persistent.info:eu-repo/semantics/publishe
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
Usually, a data structure is ephemeral, namely, once updated (with an insertion or a deletion), the ...
It is shown how to enhance any data structure in the pointer model to make it confluently persistent...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
Pointer information, indispensable for static analysis tools, is expensive to compute and query. We ...
extended abstractA data structure is partially persistent if previous versions remain available for ...
A data structure is said to be persistent when any update operation returns a new structure without ...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
The thesis describes how to achieve partial and full persitence for graph data structures of bounded...
We study the design of efficient data structures. In particular we focus on the design of data struc...
We present a dynamic data structure for maintaining the persistent homology of a time series of real...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
Usually, a data structure is ephemeral, namely, once updated (with an insertion or a deletion), the ...
It is shown how to enhance any data structure in the pointer model to make it confluently persistent...
This thesis discusses persistent data structures, that is structures which preserve their own histor...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
Pointer information, indispensable for static analysis tools, is expensive to compute and query. We ...
extended abstractA data structure is partially persistent if previous versions remain available for ...
A data structure is said to be persistent when any update operation returns a new structure without ...
The problem of making bounded in-degree and out-degree data structures partially persistent is consi...
The thesis describes how to achieve partial and full persitence for graph data structures of bounded...
We study the design of efficient data structures. In particular we focus on the design of data struc...
We present a dynamic data structure for maintaining the persistent homology of a time series of real...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for per...
Usually, a data structure is ephemeral, namely, once updated (with an insertion or a deletion), the ...