Next Article in Journal
Realization of Fuzzy Logic Controlled Brushless DC Motor Drives Using Matlab/Simulink
Previous Article in Journal
Pade Embedded Piecewise Differential Transform Method for the Solution of ODE's
Article Menu

Article Versions

Export Article

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Articles in this Issue were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence. Articles are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
Open AccessArticle
Math. Comput. Appl. 2010, 15(2), 208-217; https://doi.org/10.3390/mca15020208

A New Sorting Algorithm for Accelerating Join-Based Queries

Department of Computer Science King Saud University Riyadh, 11543, Saudi Arabia
Published: 1 August 2010
Download PDF [294 KB, uploaded 4 April 2016]

Abstract

The performance of several Database Management Systems (DBMSs) and Data Stream Management Systems (DSMSs) queries is dominated by the cost of the sorting algorithm. Sorting is an integral component of most database management systems. Stable sorting algorithms play an important role in DBMS queries since such operations requires stable sorting outputs. In this paper, we present a new stable sorting algorithm for internal sorting that scans an unsorted input array of length n and arranges it into m sorted sub-arrays. By using the m-way merge algorithm, the sorted m subarrays will be merged into the final output sorted array. The proposed algorithm keeps the stability of the keys intact. The scanning process requires linear time complexity (O(n)) in the best case, and O(n log m) in the worst case, and the m-way merge process requires O (n log m) time complexity. The proposed algorithm has a time complexity of O (n log m) element comparisons. The performed experimental results have shown that the proposed algorithm outperforms other stable sorting algorithms that are designed for join-based queries.
Keywords: Sorting; Stable sorting; Auxiliary storage sorting; Merging Sorting; Stable sorting; Auxiliary storage sorting; Merging
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Mathkour, H.I. A New Sorting Algorithm for Accelerating Join-Based Queries. Math. Comput. Appl. 2010, 15, 208-217.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top