Skip to main content
SpringerLink
Log in

Skip Lift: A Probabilistic Alternative to Red-Black Trees

  • Conference paper
Combinatorial Algorithms (IWOCA 2010)

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

Included in the following conference series:

  • 729 Accesses

Abstract

We present the Skip lift, a randomized dictionary data structure inspired by the skip list [Pugh ’90, Comm. of the ACM]. Similar to the skip list, the skip lift has the finger search property: Given a pointer to an arbitrary element f, searching for an element x takes expected O(logδ) time where δ is the rank distance between the elements x and f. The skip lift uses nodes of O(1) worst-case size and it is one of the few efficient dictionary data structures that performs an O(1) worst-case number of structural changes during an update operation. Given a pointer to the element to be removed from the skip lift the deletion operation takes O(1) worst-case time.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aragon, C.R., Seidel, R.: Randomized search trees. Algorithmica 16, 464–497 (1996)

    Article  MATH  Google Scholar 

  2. Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31–48 (2005)

    Article  MATH  Google Scholar 

  3. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173–189 (1972)

    Article  MATH  Google Scholar 

  4. Bent, S.W., Sleator, D., Tarjan, R.: Biased search trees. SIAM Journal on Computing 14(3), 545–568 (1985)

    Article  MATH  Google Scholar 

  5. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1106–1114 (2008)

    Google Scholar 

  6. Brodal, G.S., Lagogiannis, G., Makris, C., Tsakalidis, A.K., Tsichlas, K.: Optimal finger search trees in the pointer machine. J. Comput. Syst. Sci. 67(2), 381–418 (2003)

    Article  MATH  Google Scholar 

  7. Brönnimann, H., Cazals, F., Durand, M.: Randomized jumplists: A jump-and-walk dictionary data structure. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 283–294. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Cho, S., Sahni, S.: Weight-biased leftist trees and modified skip lists. J. Exp. Algorithmics 3, 2 (1998)

    Article  MATH  Google Scholar 

  9. Feigenbaum, J., Tarjan, R.: Two new kinds of biased search trees. Bell System Technical Journal 62(10), 3139–3158 (1983)

    Article  MATH  Google Scholar 

  10. 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 

  11. Haeupler, B., Sen, S., Tarjan, R.E.: Rank-balanced trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 351–362. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Leonidas, R.S., Guibas, J.: A dichromatic framework for balanced trees. In: Proc. 19th IEEE Symp. on Foundations of Computer Science, pp. 8–21 (1978)

    Google Scholar 

  13. Levcopoulos, C., Overmars, M.: A balanced search tree with O(1) worst-case update time. Acta Informatica 26(3), 269–277 (1988)

    Article  MATH  Google Scholar 

  14. Martinez, C., Roura, S.: Optimal and nearly optimal static weighted skip lists. Technical report, LSI-95-34-R, Dept. Llenguatges i Sistemes Informàtics (Universitat Politèchnica de Catalunya) (1995)

    Google Scholar 

  15. Martínez, C., Roura, S.: Randomized binary search trees. J. ACM 45(2), 288–323 (1998)

    Article  MATH  Google Scholar 

  16. Munro, I., Papadakis, T., Sedgewick, R.: Deterministic skip lists. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 367–375 (1992)

    Google Scholar 

  17. Papadakis, T.: Skip lists and probabilistic analysis of algorithms. PhD thesis, University of Waterloo, Department of Computer Science and Faculty of Mathematics (Available as Tech. Report CS-93-28) (1993)

    Google Scholar 

  18. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM 33(6), 668–676 (1990)

    Article  Google Scholar 

  19. Tarjan, R.E.: Updating a Balanced Search Tree in O(1) Rotations. Inf. Process. Lett. 16(5), 253–257 (1983)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada

    Prosenjit Bose, Karim Douïeb & Pat Morin

Authors
  1. Prosenjit Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karim Douïeb
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pat Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of London, King’s College, The Strand, WC2R 2LS, London, UK

    Costas S. Iliopoulos

  2. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bose, P., Douïeb, K., Morin, P. (2011). Skip Lift: A Probabilistic Alternative to Red-Black Trees. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2010. Lecture Notes in Computer Science, vol 6460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19222-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19222-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19221-0

  • Online ISBN: 978-3-642-19222-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation