Confluent Persistence Revisited

Details Confluent Persistence Revisited Confluent Persistence Revisited

2011-04-15

arxiv.org/abs/1104.3045v1

Computer Science

Data Structures and Algorithms

Scientific paper

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(\log n)$ amortized time, and following a pointer takes $O(\log c \log n)$ 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/\log n)$-factor improvement over the previous known transform to make a data structure confluently persistent.

Affiliated with

Also associated with

No associations

Rating

Confluent Persistence Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Confluent Persistence Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confluent Persistence Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8901