Discrete Mathematics & Theoretical Computer Science, DMTCS Special Issue: STACS'98

Font Size:  Small  Medium  Large

Partially persistent search trees with transcript operations

Kim S. Larsen


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.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page