Research and implementation of database high performance sorting algorithm with big data

According to the demand of large data sorting algorithm, a new efficient algorithm for large data sorting is proposed. The algorithm by constructing the equivalent sort keys, optimized quicksort algorithm; through the technology of task driven, AIO and double buffer mechanism to make full use of system resources; in algorithm implementation, using multi thread processing tasks, by controlling the number of threads of control parallelism. Comprehensive utilization of these technologies, the algorithm will achieve the separation of database connections and threads, and improve the concurrency of database support, so that the ranking of big data performance close to the theoretical limit value.