This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Leveraging "Carry-Along Sort" in Nested Intervals Tree Encoding
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Index Terms:
Tree Encoding, Materialized Path, Database, Data Mining, Hierarchy Path
Citation:
Prabhakaran Sethuraman, Lakshmi Rajamani, "Leveraging "Carry-Along Sort" in Nested Intervals Tree Encoding," csie, vol. 4, pp.143-147, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.