Skip to main content

Adaptive Processing Scheme of Overflowed Buckets for Bucket Sort Algorithm

  • Chapter
Book cover Theoretical Advances and Applications of Fuzzy Logic and Soft Computing

Part of the book series: Advances in Soft Computing ((AINSC,volume 42))

  • 1334 Accesses

Abstract

Bucket sort algorithm is an effective approach to sort very large files, whereas the probability of bucket overflow hinders its efficiency. The paper puts forward a more effective bucket sort algorithm, THShort2, which subtly handles the overflowed buckets. For a different degree of bucket overflow, we propose a corresponding processing scheme. The correctness and efficiency of THShort2 is proofed theoretically. The experiment results show that the performance of THSort2 is about triple times of NTSort, and 50% faster than THSort.

This work was supported by the National Science Foundation of China under the grant No. 60403043.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Knuth, D.E.: The Art of Computer Programming, vol. 3: Sorting and Searching, 2nd edn., pp. 114–116. Addison-Wesley, Reading (1973)

    Google Scholar 

  2. Baase, S.: Computer Algorithms: Introduction to Design and Analysys, 3rd edn., pp. 182–197. HIGHER EDUCATION PRESS, Beijing (2001)

    Google Scholar 

  3. Neubert, K.D.: The flash sort algorithm. Dr. Dobb’s Journal 23(2), 123–129 (1998)

    Google Scholar 

  4. Chen, J.C.: Proportion extend sort (in Chinese). SIAM Journal on Computing 31(1), 323–330 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tang, X.Y.: Fast sorting method of separating segment (in Chinese). Journal of Software 4(2), 53–57 (1993)

    Google Scholar 

  6. Wang, X.Y.: A new sorting method by nase distribution and linking (in Chinese). Chinese Journal of Computers 23(7), 774–777 (2000)

    MathSciNet  Google Scholar 

  7. Elmasri, R., Navathe, S.B.: Fundamental of Database Systems, 2nd edn., pp. 83–84. Benjamin/Cummings, Redwood City (1994)

    Google Scholar 

  8. Shi, Y., Zhang, L., Liu, P.: THSort: A Single-Processor Parallel Sorting Algorithm (in Chinese). Journal of Software 14(2), 159–165 (2003)

    MATH  MathSciNet  Google Scholar 

  9. Sort Benchmark, http://research.microsoft.com/barc/SortBenchmark/

  10. Yang, L., Huang, H., Song, T.: The Sample-Seperators Based Distributing Scheme of the External Bucket Sort Algorithm (in Chinese). Journal of Software 16(5), 643–651 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Oscar Castillo Patricia Melin Oscar Montiel Ross Roberto Sepúlveda Cruz Witold Pedrycz Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Liu, P., Ma, Yp., Dong, Js. (2007). Adaptive Processing Scheme of Overflowed Buckets for Bucket Sort Algorithm. In: Castillo, O., Melin, P., Ross, O.M., Sepúlveda Cruz, R., Pedrycz, W., Kacprzyk, J. (eds) Theoretical Advances and Applications of Fuzzy Logic and Soft Computing. Advances in Soft Computing, vol 42. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72434-6_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72434-6_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72433-9

  • Online ISBN: 978-3-540-72434-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics