Partially persistent search trees with transcript operations
Kim S. Larsen (1)
(1) Department of Mathematics and Computer Science [Odense]
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.