一种新的XML查询结构连接算法研究

2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI:10.1109/IUCE.2009.75

Shaofei Wu, Yuan Huang

{"title":"一种新的XML查询结构连接算法研究","authors":"Shaofei Wu, Yuan Huang","doi":"10.1109/IUCE.2009.75","DOIUrl":null,"url":null,"abstract":"With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isn’t limited to any external index is proposed and implemented. The experiment results indicate that it out performs Stack-Tree-Desc algorithm.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on a New Structural Join Algorithm for XML Query\",\"authors\":\"Shaofei Wu, Yuan Huang\",\"doi\":\"10.1109/IUCE.2009.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isn’t limited to any external index is proposed and implemented. The experiment results indicate that it out performs Stack-Tree-Desc algorithm.\",\"PeriodicalId\":153560,\"journal\":{\"name\":\"2009 International Symposium on Intelligent Ubiquitous Computing and Education\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Symposium on Intelligent Ubiquitous Computing and Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IUCE.2009.75\",\"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 International Symposium on Intelligent Ubiquitous Computing and Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCE.2009.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

针对大多数XML结构连接方法中针对输入数据集无索引或索引乱序而进行临时排序或创建索引成本过高的问题，分析了经典的Stack-Tree-Desc算法和B+树索引优化算法。提出并实施了一种不受任何外部指标限制的新策略。实验结果表明，该算法优于Stack-Tree-Desc算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Study on a New Structural Join Algorithm for XML Query

With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isn’t limited to any external index is proposed and implemented. The experiment results indicate that it out performs Stack-Tree-Desc algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Symposium on Intelligent Ubiquitous Computing and Education

自引率

0.00%

发文量