Adaptive Sorting Algorithms for Large-Scale Database Systems
DOI:
https://doi.org/10.63282/3050-9416.IJAIBDCMS-V5I4P102Keywords:
Adaptive sorting algorithms, HybridSort, data distribution, memory management, system load, scalability, largescale datasets, performance optimization, dynamic algorithm selection, real-world applicationsAbstract
Sorting algorithms are fundamental to the efficient management and retrieval of data in database systems. As the scale of data continues to grow exponentially, traditional sorting algorithms often struggle to maintain performance and efficiency. This paper explores the development and implementation of adaptive sorting algorithms specifically designed for large-scale database systems. These algorithms dynamically adjust their behavior based on the characteristics of the data and the system environment, providing significant improvements in performance and resource utilization. We present a comprehensive overview of existing adaptive sorting techniques, propose a novel adaptive sorting algorithm, and evaluate its performance through extensive experiments. The results demonstrate that our proposed algorithm outperforms traditional sorting methods in various scenarios, making it a valuable addition to the toolkit of large-scale database systems
References
1. Algorithm Examples. (n.d.). Top 15 sorting algorithms for large datasets. Retrieved from https://blog.algorithmexamples.com/sorting-algorithm/top-15-sorting-algorithms-for-large-datasets/
2. International Journal of Computer Science and Information Technology (IJCSIT). (2016). Comparative analysis of sorting algorithms for large datasets. IJCSIT, 7(2), 87–94. Retrieved from https://www.ijcsit.com/docs/Volume%207/vol7issue2/ijcsit2016070209.pdf
3. Propulsion Technology Journal. (2024). High-performance sorting techniques for big data analytics. Propulsion Technology Journal, 12(4), 56–78. Retrieved from https://www.propulsiontechjournal.com/index.php/journal/article/download/6887/4501/11817
4. Wikipedia contributors. (n.d.). Adaptive sort. Wikipedia, The Free Encyclopedia. Retrieved from https://en.wikipedia.org/wiki/Adaptive_sort
5. Smith, J., & Brown, K. (2024). Advanced sorting techniques for real-time applications. Journal of Computational Algorithms, 14(3), 112–130. https://www.scirp.org/journal/paperinformation?paperid=130818
6. Kumar, R., & Gupta, A. (2016). AdaSort: Adaptive sorting using machine learning. ResearchGate. Retrieved from https://www.researchgate.net/publication/305362015_AdaSort_Adaptive_Sorting_using_Machine_Learning
7. Le, T., & Zhang, Y. (2019). A study on the complexity and efficiency of sorting algorithms in large datasets. arXiv preprint arXiv:1909.08006. Retrieved from https://arxiv.org/abs/1909.08006
8. Powell, W. B., & Topaloglu, H. (2005). An approximate dynamic programming algorithm for large-scale fleet management: A case application. ResearchGate. Retrieved from https://www.researchgate.net/publication/220413283_An_Approximate_Dynamic_Programming_Algorithm_for_Large-Scale_Fleet_Management_A_Case_Application
