Complexity study on "Carry-along Sort" algorithm

Abstract

Hierarchy generation is the very familiar and evolving concept in Relational database management system. There are so many methods currently available to generate as well manage hierarchies. But, carry along sort algorithm is the new method which is used to generate hierarchies dynamically and it is the subset of materialized path. In this paper, we are going to perform the complexity study against "Carry-along Sort" Algorithm in terms of time and space so that the efficiency of this algorithm can be compared with other existing methods. Complexity is about performance measures, NOT about the intricacy of programs. The choice of which operations are time critical and what constitutes a space cell varies according to application, as we shall see. Complexity study plays a vital role at the time of choosing an algorithm to solve a given problem.