Introduce Radix Sort for Optimized Sorting Performance in GeaFlow

[ftljk]

Description:
Propose the introduction of Radix Sort into TuGraph-Analytics to achieve improved sorting performance under specific data types and scales. The solution will dynamically select the optimal sorting algorithm — Radix Sort or the existing Heap Sort — based on factors such as data type, dataset size, and value distribution characteristics.

This feature includes:

• A complete implementation of Radix Sort.
• Seamless integration with the existing Heap Sort.
• An intelligent strategy to choose the most efficient algorithm for a given scenario.
• Performance tuning to maximize efficiency in diverse workloads.
• Comprehensive documentation and test cases to ensure stability and maintainability.

Timeline:
The development will be completed within 10 weeks, delivering a fully integrated high-performance sorting solution. This enhancement will provide robust performance support for enterprise-grade applications of TuGraph-Analytics.

Design Documentation: Design.pdf
Performance Test Report: PerformanceTest.pdf

[yaozhongq]

pr has merged.