Real Time Observation of “Carry-along Sort” Algorithm: Performance Study

This paper describes a performance evaluation study of ―Carry-along Sort‖ algorithm. We first discuss the performance measures employed to evaluate this algorithm. Next, we describe the benchmarks and interpret their results. The preliminary results of our tests indicate the viability and promise in performance gains and reduce I/O cost and to leverage this algorithm both in OLTP and OLAP to generate hierarchies.