Skip to main content
SpringerLink
Log in

Massive Concurrent Deletion of Keys in B*-Tree

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2005)

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

  • 808 Accesses

Abstract

B*-tree is an improved variant of well known B-tree data structure which has extensive applications in data storage and retrieval systems including parallel database systems. In this paper, we present an algorithm for deleting keys of B*-tree concurrently in the case that the number of to-be-deleted keys is more than a half of the total keys in the tree. The proposed algorithm can be implemented on CREW PRAM model in optimal O(log2 n + Blog B n) time with the total processors equal to the keys to be deleted. n is the total number of keys in B*-tree and B is equal to half of the keys in an internal node containing maximum keys. It counts as an improvement upon the previous comparable known algorithms by a reduction of factor B in the (log2 n)-term of the time complexity.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Batory, D.S.: B + -trees and indexed sequential files: A performance comparison. ACM SIGMOD, 30–39 (1981)

    Google Scholar 

  2. Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. on Database System 2(1), 11–26 (1977)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Berliner, H.: The B*-tree search algorithm: a best first proof procedure, Tech. Rep. CMU-CA-78-112 Computer Sci. Depart. Carnegie-Mellon Univ., Pittsburg (1978)

    Google Scholar 

  5. Comer, D.: The ubiquitous B-tree. ACM Comput. Surveys 11(2) (June 1979)

    Google Scholar 

  6. Das, S., Demuynck, M.: Concurrent algorithms for B-trees, Tech. Rep. CRPDC-92-9, Center for Research in Parallel and Distributed Comput., Dept. Of Computer Sci., Univ. of North Texas, 3 (1992)

    Google Scholar 

  7. Hankins, R.A., Patel, J.M.: Effect of node size on the performance of cache-conscious B + -trees. In: ACM SIGMETRICS 2003 (2003)

    Google Scholar 

  8. Higham, L., Schenk, E.: Maintaining B-trees on an EREW PRAM. J. Parallel Distributed Comput. 22(2), 329–335 (1994)

    Article  MATH  Google Scholar 

  9. Johnson, T., Shasha, D.: The performance of concurrent B-tree algorithms. ACM Trans. Database Systems 18(1), 51–101 (1993)

    Article  Google Scholar 

  10. Knuth, D.E.: The Art of Computer programming, sorting and searching, 2nd edn. Addison-Wesley Publ. Co., Reading (1998)

    MATH  Google Scholar 

  11. Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831–838 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lanin, V., Shasha, D.: A Symmetric concurrent B-tree algorithm. In: Proc. of fall joint computer conference, pp. 380–389 (1986)

    Google Scholar 

  13. McCreight, E.: Pagination of B-trees with variable length records. Comm. of the ACM 20(9) (September 1977)

    Google Scholar 

  14. Park, H., Park, K., Cho, Y.: Deleting keys of B-trees in parallel. J Parallel Distributed Comput. 64, 1041–1050 (2004)

    Article  MATH  Google Scholar 

  15. Qui, K., Akl, S.G.: Parallel Maximum Sum Algorithms on Interconnection Network, Tech. Rep. No. 99-431

    Google Scholar 

  16. Rao, J., Ross, K.A.: Making B + -tree cache conscious in main memory. In: SIGMOD 2000, pp. 475–486 (2000)

    Google Scholar 

  17. Rosenberg, A.L., Synder, L.: Time and Space Optimality in B-trees. ACM Trans. on Database System 6(1) (March 1981)

    Google Scholar 

  18. Sagiv, Y.: Concurrent operation on B*-tree with overtaking. J. Comput. System Sci. (33), 275–296 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  19. Srinivasan, V., Carey, M.: Performance of B-tree concurrency control algorithms. In: Proceedings of SIGMOD 1991, pp. 416–425 (1991)

    Google Scholar 

  20. Wang, B., Chen, G.: Cost-optimal parallel algorithms for constructing B-trees. In: Proceedings of the 20th Annual International Conference on Parallel Processing, pp. 294–295 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Islamic Azad University of Mashhad, Ostad Yousefi St. Ghasem Abad, Mashhad, Iran

    S. Arash Ostadzadeh

  2. Young Researchers Club, Islamic Azad University of Mashhad, Mashhad, Iran

    M. Amir Moulavi & Zeinab Zeinalpour

Authors
  1. S. Arash Ostadzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Amir Moulavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zeinab Zeinalpour
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology, Poland

    Roman Wyrzykowski

  2. Computer Science Department,, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Poznan Supercomputing and Networking Center, Poland

    Norbert Meyer

  4. Informatics & Mathematical Modeling, Technical University of Denmark, 2800, Lyngby, DK, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostadzadeh, S.A., Moulavi, M.A., Zeinalpour, Z. (2006). Massive Concurrent Deletion of Keys in B*-Tree. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_11

Download citation

  • DOI: https://doi.org/10.1007/11752578_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

  • Online ISBN: 978-3-540-34142-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation