Open Access Open Access  Restricted Access Subscription or Fee Access

Survey Paper On Divide & Conquer Algorithm

Anjali D. Jaiswal, Kunal R. More

Abstract


To manage data in database system insertion, deletion, sorting, searching, update etc. operation have to be performed. The sorting algorithm helps data to make in order and helps to search data faster, if the sorting algorithm is better then it increases the performance of database management system. Divide and conquer algorithm helps the database management system to increase the performance of sorting. It helps in many aspects such as space, time. Divide and conquer algorithm also follows iterative as well as recursive method for sorting. This paper aimed to discuss different sorting algorithm and comparison between them. It analyses algorithm with respect to time and space.


Full Text:

PDF

References


Smita Paira, Sourabh Chandra, et al. A Review Report on Divide and Conquer Sorting Algorithm IEEE CALCON2014. 2014.

J.L. Wolf, D.M. Dias, et al. A Parallel Sort Merge Join Algorithm for Managing Data Skew. IEEE Transactions on Parallel and Distributed Systems. 1993;4(1):70-86.

Horowitz, Zorat. Divide-and-Conquer for Parallel Processing. IEEE Transactions on Computers. 1993;C-32(6):582-585.

J. Lopez, E.L. Zapata. Unified Architecture for Divide and Conquer Based Tridiagonal System Solvers. IEEE Transactions on Computers. 1994;43(12):1413-1425.

J.-T. Yan. Hierarchical bubble-sorting-based non-Manhattan channel routing. IEE Proc.-Comput. Digit. Tech. 2000;147(4):215-220.

K.C. Tan, Y.J. Yang, et al. A Distributed Cooperative Coevolutionary Algorithm for Multiobjective Optimization. IEEE Transactions on Evolutionary Computation. 2006;10(5):527-549.

T.A. Mueck and M.J. Schauer. Optimizing Sort Order Query Execution in Balanced and Nested Grid Files. IEEE Transactions on Knowledge and Data Engineering. 1995;7(2):246-260.


Refbacks

  • There are currently no refbacks.