Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Partially persistent ...
Article

Partially persistent search trees with transcript operations

Kim S. Larsen ORCID (1)
(1) Department of Mathematics and Computer Science [Odense]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 1999
Last modified on
March 31, 2025
Volume 3
vol. 3:3, Special Issue STACS'98
DOI
10.46298/dmtcs.253
License
https://about.hal.science/hal-authorisation-v1
Indicators
649
Views
499
Downloads

Partially persistent search trees with transcript operations

Kim S. Larsen ORCID (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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Complexity
  • Data structures
  • Search trees
  • Persistence
  • Complexity.
Preview
Loading PDF preview...