Abstract
Most queries that applied on database management systems (DBMS) depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature that is needed in performing DBMS queries. In this paper, we study a new Sorting Algorithm for Join Queries (SAJQ) that has both advantages of being efficient and stable. The proposed algorithm takes the advantage of using the
m-way-merge algorithm in enhancing its time complexity. SAJQ performs the sorting operation in a time complexity of
O(
n
log
m), where
n is the length of the input array and
m is number of sub-arrays used in sorting. An unsorted input array of length
n is arranged into
m sorted sub-arrays. The
m-way-merge algorithm merges the sorted
m sub-arrays into the final output sorted array. The proposed algorithm keeps the stability of the keys intact. An analytical proof has been conducted to prove that, in the worst case, the proposed algorithm has a complexity of
O(
n
log
m). Also, a set of experiments has been performed to investigate the performance of the proposed algorithm. The experimental results have shown that the proposed algorithm outperforms
other Stable–Sorting algorithms that are designed for join-based queries.