Skip to Main content Skip to Navigation
Journal articles

Partially persistent search trees with transcript operations

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958929
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:47:51 PM
Last modification on : Friday, August 23, 2019 - 3:20:03 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:00:15 PM

File

dm030302.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kim S. Larsen. Partially persistent search trees with transcript operations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1999, Vol. 3 no. 3 (3), pp.95-107. ⟨10.46298/dmtcs.253⟩. ⟨hal-00958929⟩

Share

Metrics

Record views

39

Files downloads

635