Data Warehouse Design: A Schema-Transformation Approach
SCCC '02 Proceedings of the XII International Conference of the Chilean Computer Science Society
Joe Celko's SQL for Smarties: Trees and Hierarchies
Joe Celko's SQL for Smarties: Trees and Hierarchies
Hierarchies in a multidimensional model: from conceptual modeling to logical representation
Data & Knowledge Engineering - Special issue: WIDM 2004
Building Generational Hierarchy Path by "Carry-Along Sort"
FITME '08 Proceedings of the 2008 International Seminar on Future Information Technology and Management Engineering
Proceedings of the International Conference on Advances in Computing, Communication and Control
SQL Design Patterns: Expert Guide to SQL Programming
SQL Design Patterns: Expert Guide to SQL Programming
Leveraging "Carry-Along Sort in Nested Intervals Tree Encoding
CSIE '09 Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 04
Extending visual OLAP for handling irregular dimensional hierarchies
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
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.