Cache Efficient Radix Sort for String Sorting(Algorithms and Data Structures)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we propose CRadix sort, a new string sorting algorithm based on MSD radix sort. CRadix sort causes fewer cache misses than MSD radix sort by uniquely associating a small block of main memory called the key buffer to each key and temporarily storing a portion of each key into its corresponding key buffer. Experimental results in running time comparisons with other string sorting algorithms are provided for showing the effectiveness of CRadix sort.

• 2007-02-01

著者

• Ng Waihong

  Graduate School Of Fundamental Science And Engineering Waseda University

• Kakehi Katsuhiko

  School Of Science And Engineering Waseda University

• Ng Waihong

  Graduate School Of Science And Engineering Waseda University

関連論文

• Cache Efficient Radix Sort for String Sorting(Algorithms and Data Structures)
• Merging String Sequences by Longest Common Prefixes(Algorithm Theory)
• Merging String Sequences by Longest Common Prefixes

スポンサーリンク