Partially Persistent B-trees with Constant Worst Case Update Time | SpringerLink
Skip to main content
Springer Nature Link
Log in

Partially Persistent B-trees with Constant Worst Case Update Time

  • Conference paper
  • First Online:
Computer and Information Sciences

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 62))

Abstract

A partially persistent B-tree is presented, with a worst case constant update time, in the case that the position of the update is given. This is achieved by the use of the fat node method, which enables the transformation of an ephemeral (a, b) tree with constant update time into a partially persistent tree. Such a structure can be usZeful in persistent databases for applications in which the update time is critical. The model of computation is the external memory model.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 28599
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Becker B., Gschwind S., Ohler T., Seeger B., Widmayer P.: An asymptotically optimal multiversion B-tree. The VLDB Journal. 5, 264–275 (1996).

    Article  Google Scholar 

  2. Brodal G.S.: Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, Vol. 3, No. 3, 238–255 (1996).

    MathSciNet  Google Scholar 

  3. Clancy M. J. and. Knuth D. E.: A programming and problem-solving seminar. Technical Report STAN- CS-77-606, Department of Computer Science, Stanford University, Palo Alto (1977).

    Google Scholar 

  4. Dietz P. And Raman R.: Persistence, amortization and randomization. In: 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 78–88, (1991).

    Google Scholar 

  5. Driscoll R., Sarnak N., Sleator D. and Tarjan R.E.: Making Data Structures Persistent. JCSS, 38, 86–124 (1989).

    MATH  MathSciNet  Google Scholar 

  6. Fleischer R.: A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science. 7, 137–149 (1996).

    Article  MATH  Google Scholar 

  7. Kaplan H. and Tarjan R. E.: New heap data structures. Technical Report TR-597-99, Princeton University (1999).

    Google Scholar 

  8. Lagogiannis G., Lorentzos N.: Partially Persistent B-trees with Constant Worst Case Update Time. TR-184, Informatics Laboratory, Department of Science, Agricultural University of Athens (http://infolab.aua.gr/people.php?lang=en&id=14).

Download references

Author information

Authors and Affiliations

  1. Dept. of Science, Informatics Laboratory, Agricultural University of Athens, 75 Iera Odos str., Botanikos, GR-118 55, Athens, Greece

    George Lagogiannis & Nikos Lorentzos

Authors
  1. George Lagogiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikos Lorentzos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Lagogiannis .

Editor information

Editors and Affiliations

  1. , EEE Dept., Imperial College, Exhibition Road, London, SW72BT, United Kingdom

    Erol Gelenbe

  2. , EEE Dept., Imperial College, Exhibition Rd., London, SW72AZ, United Kingdom

    Ricardo Lent

  3. , EEE Dept., Imperial College, Exhibition Rd., London, SW72AZ, United Kingdom

    Georgia Sakellari

  4. , School of Biomedical Eng., Sci. and Heal, Drexel University, Bossone 702, 3120 Market Street, Philadelphia, 19104, Pennsylvania, USA

    Ahmet Sacan

  5. , Dept. of Computer Engineering, Middle East Technical University, Ankara, 06531, Turkey

    Hakki Toroslu

  6. Fac. Engineering, Dept. Computer Engineering, Middle East Technical University - METU, Ankara, 06531, Turkey

    Adnan Yazici

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this paper

Cite this paper

Lagogiannis, G., Lorentzos, N. (2011). Partially Persistent B-trees with Constant Worst Case Update Time. In: Gelenbe, E., Lent, R., Sakellari, G., Sacan, A., Toroslu, H., Yazici, A. (eds) Computer and Information Sciences. Lecture Notes in Electrical Engineering, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9794-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-9794-1_1

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-9793-4

  • Online ISBN: 978-90-481-9794-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation