par Collette, Sébastien 
;Iacono, John ;Langerman, Stefan
Editeur scientifique Rabani, Yuval
Référence Annual Symposium on Discrete Algorithms (SODA)(XXIII: January 17-19, 2012: Kyoto, Japan), Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, page (593-601)
Publication Publié, 2012
;Iacono, John ;Langerman, Stefan Editeur scientifique Rabani, Yuval
Référence Annual Symposium on Discrete Algorithms (SODA)(XXIII: January 17-19, 2012: Kyoto, Japan), Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, page (593-601)
Publication Publié, 2012
Publication dans des actes
| Résumé : | 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 |
