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.
Domains
Discrete Mathematics [cs.DM]| Origin | Files produced by the author(s) |
|---|
Loading...