Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.844
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 “Carry-along Sort” to generate hierarchies dynamically. “Carry-along Sort” is an algorithm to build a generational hierarchy (materialized)path dynamically from the outline number column. It could be considered as a “Mix-in” between adjacency and Materialized path. There is no algorithm provides such flexibility to generate Nested Intervals as well materialized path together except “Carry-along Sort” algorithm. The implementation of this new algorithm was done in SQL Server and the complete algorithm was tested.
Tree Encoding, Materialized Path, Database, Data Mining, Hierarchy Path
Prabhakaran Sethuraman, Lakshmi Rajamani, "Leveraging "Carry-Along Sort" in Nested Intervals Tree Encoding", CSIE, 2009, Computer Science and Information Engineering, World Congress on, Computer Science and Information Engineering, World Congress on 2009, pp. 143-147, doi:10.1109/CSIE.2009.844