Abstract : When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided.
https://hal.inria.fr/hal-00958929
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : jeudi 13 mars 2014 - 16:47:51
Dernière modification le : mercredi 29 novembre 2017 - 10:26:20
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:00:15
Kim S. Larsen. Partially persistent search trees with transcript operations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1999, 3 (3), pp.95-107. 〈hal-00958929〉
