Skip to main content
SpringerLink
Log in

On New Rebalancing Algorithm

  • Conference paper
  • First Online:
Analysis of Experimental Algorithms (SEA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11544))

Included in the following conference series:

  • 616 Accesses

Abstract

This paper proposes a new algorithm for rebalancing a binary search tree, called qBalance, by a certain analogy. The running time of this algorithm is proportional to the number of keys in the tree. To compare qBalance with existing rebalancing algorithms, several versions of the algorithm are implemented. We compare qBalance with the well-known DSW algorithm on binary search trees (BSTs), with the Sedgewick algorithm on an ordered tree, with the modified Sedgewick algorithm on Red-Black (RB) trees with the specific structure of the node. For RB trees whose nodes have a standard (typical) structure, qBalance is implemented using asynchronous mode. This version of the algorithm is considerably complicated, but it is twice as fast as the serial implementation. The results of numerical experiments confirm the advantage of the new algorithm compared to DSW. The Sedgewick algorithm and its modification retain advantage by 30% in terms of running time on ordered trees. On red-black trees, the advantage of the new algorithm is significant. This especially applies to the asynchronous version of the algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Day, C.: Comput. J. XIX, 360–361 (1976)

    Google Scholar 

  2. Stout, Q.F., Warren, B.L.: Commun. ACM 29(9), 902–908 (1986)

    Article  Google Scholar 

  3. Sedgewick, R.: Algorithms in C, Parts 1–5. Addison-Wesley Professional, Boston (2001)

    Google Scholar 

  4. Gelashvili, K., Grdzelidze, N., Shvelidze, G.: The modification of the Sedgewick’s balancing algorithm. Bull. Georgian Acad. Sci. 10(3), 60–67 (2016)

    MathSciNet  MATH  Google Scholar 

  5. Pfaff, B.: An Introduction to Binary Search Trees and Balanced Trees. Libavl Binary Search Tree Library, vo.1.1: Source Code Ver. 2.0.2 (2004)

    Google Scholar 

  6. Rolfe, J.T.: One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithm. SIGCSE Bull. 34, 85–88 (2002)

    Article  Google Scholar 

  7. Amdahl, G.M.: Validity of the single processor approach to achieving large-scale computing capabilities. In: AFIPS Conference Proceedings, pp. 483–485. AFIPS Press, Atlantic City (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business, Computing and Social Sciences, St. Andrew the First-Called Georgian University of the Patriarchate of Georgia, 53a Chavchavadze Ave., Tbilisi, 0179, Georgia

    Koba Gelashvili

  2. Department of Computer Sciences, Faculty of Exact and Natural Sciences, Tbilisi State University, 2, University St., Tbilisi, 0143, Georgia

    Nikoloz Grdzelidze

  3. Institute of Applied Physics, Ilia State University, 3/5 Kakutsa Cholokashvili Ave., Tbilisi, 0162, Georgia

    Mikheil Tutberidze

Authors
  1. Koba Gelashvili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikoloz Grdzelidze
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikheil Tutberidze
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikheil Tutberidze .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias Kotsireas

  2. University of Florida, Gainesville, FL, USA

    Panos Pardalos

  3. University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

  4. Delft University of Technology, Delft, The Netherlands

    Dimitris Souravlias

  5. University of Florida, Gainesville, FL, USA

    Arsenis Tsokas

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gelashvili, K., Grdzelidze, N., Tutberidze, M. (2019). On New Rebalancing Algorithm. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34029-2_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34028-5

  • Online ISBN: 978-3-030-34029-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation