Leveraging “Carry-Along Sort” in Nested Intervals Tree Encoding

Concept hierarchies are important for generalization across database/data mining applications. From store catalogs and news services, to community classifieds, hierarchies are ubiquitous. We introduce a new variation of tree encoding with nested intervals by leveraging ldquocarry-along sortrdquo to generate hierarchies dynamically. ldquoCarry-along sortrdquo is an algorithm to build a generational hierarchy (materialized)path dynamically from the outline number column. It could be considered as a ldquomix-inrdquo between adjacency and materialized path. There is no algorithm provides such flexibility to generate nested intervals as well materialized path together except ldquocarry-along sortrdquo algorithm. The implementation of this new algorithm was done in SQL server and the complete algorithm was tested.