Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Partially persistent search trees with transcript operations

  • Algorithms and Data Structures III
  • Conference paper
  • First Online:
STACS 98 (STACS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1373))

Included in the following conference series:

  • 180 Accesses

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.

This work was carried out while the author was visiting the Department of Computer Sciences, University of Wisconsin at Madison. Supported in part by SNF (Denmark), in part by NSF (U.S.) grant CCR-9510244, and in part by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM-IT).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. M. Adel'son-Vel'skii and E. M. Landis. An Algorithm for the Organisation of Information. Soviet Math. Doklady, 3:1259–1263, 1962.

    Google Scholar 

  2. A. Andersson. Improving Partial Rebuilding by Using Simple Balance Criteria. In Lecture Notes in Computer Science, Vol. 382: 1st Workshop on Algorithms and Data Structures, pages 393–402. Springer-Verlag, 1989.

    Google Scholar 

  3. C. R. Aragon and R. G. Seidel. Randomized Search Trees. In Proc. 30th Ann. IEEE Symp. on the Foundations of Comp. Sci., pages 540–545, 1989.

    Google Scholar 

  4. N. Blum and K. Mehlhorn. On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theoretical Computer Science, 11:303–320, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making Data Structures Persistent. Journal of Computer and System Sciences, 38:86–124, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  6. I. Galperin and R. L. Rivest. Scapegoat Trees. In 4th ACM-SIAM Symp. on Discrete Algorithms, pages 165–174, 1993.

    Google Scholar 

  7. L. J. Guibas and R. Sedgewick. A Dichromatic Framework for Balanced Trees. In Proc. 19th Ann. IEEE Symp. on the Foundations of Comp. Sci., pages 8–21, 1978.

    Google Scholar 

  8. K. Mehlhorn. Sorting and Searching. Springer-Verlag, 1986.

    Google Scholar 

  9. J. Nievergelt and M. Reingold. Binary Search Trees of Bounded Balance. SIAM Journal on Computing, 2(1):33–43, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. D. Sleator and R. E. Tarjan. Self-Adjusting Binary Trees. In Proc. 15th Ann. ACM Symp. on the Theory of Computing, pages 235–245, 1983.

    Google Scholar 

  11. M. A. Weiss. Data Structures and Algorithm Analysis. The Benjamin/Cummings Publishing Company, Inc., 2nd edition, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230, Odense M, Denmark

    Kim S. Larsen

Authors
  1. Kim S. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Larsen, K.S. (1998). Partially persistent search trees with transcript operations. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028570

Download citation

  • DOI: https://doi.org/10.1007/BFb0028570

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64230-5

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation