{"title":"利用“随进排序”算法生成嵌套集","authors":"P. Sethuraman, L. Rajamani","doi":"10.1109/CISS.2009.5054733","DOIUrl":null,"url":null,"abstract":"This paper studies the latest research concept in Database Tree Encoding namely leveraging Carry-along Sort in Nested Set. To start with, the paper gives an introduction to the concept called “Carry-along Sort” and then applies this concept in Nested Set for generating hierarchies dynamically. There is no algorithm provides a flexibility to generate Nested Set as well materialized path together except “Carry-along Sort” algorithm. The paper also highlights on the future work that can be carried over in this area. The implementation of this new algorithm was done in Oracle and the complete algorithm was tested.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Generating nested sets by leveraging “Carry-along Sort” algorithm\",\"authors\":\"P. Sethuraman, L. Rajamani\",\"doi\":\"10.1109/CISS.2009.5054733\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the latest research concept in Database Tree Encoding namely leveraging Carry-along Sort in Nested Set. To start with, the paper gives an introduction to the concept called “Carry-along Sort” and then applies this concept in Nested Set for generating hierarchies dynamically. There is no algorithm provides a flexibility to generate Nested Set as well materialized path together except “Carry-along Sort” algorithm. The paper also highlights on the future work that can be carried over in this area. The implementation of this new algorithm was done in Oracle and the complete algorithm was tested.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054733\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generating nested sets by leveraging “Carry-along Sort” algorithm
This paper studies the latest research concept in Database Tree Encoding namely leveraging Carry-along Sort in Nested Set. To start with, the paper gives an introduction to the concept called “Carry-along Sort” and then applies this concept in Nested Set for generating hierarchies dynamically. There is no algorithm provides a flexibility to generate Nested Set as well materialized path together except “Carry-along Sort” algorithm. The paper also highlights on the future work that can be carried over in this area. The implementation of this new algorithm was done in Oracle and the complete algorithm was tested.