Partially persistent search trees with transcript operations
Résumé
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.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...