期刊文献+

基于扩展Dewey编码的XML文档关键字查询算法研究

Research on the Algorithm of Keyword Search in XML Document Based on Extended Dewey Encoding
下载PDF
导出
摘要 为实现XML关键字查询,提出一种基于扩展Dewey编码快速求解SLCA的新算法:FEDA.算法利用Dewey扩展编码快速命中含有N个关键字的集合,将最终交集看做一棵简化的XML树,所有的叶节点即为求解的SLCA.该算法与经典的ILE算法进行对比,效率优于ILE算法. For XML query keywords, a new algorithm FEDA based on extended Dewey encoding for fast solving SLCA is proposed. The algorithm gets a collection of N key words quickly by extended Dewey encoding,and the final intersection can be as a simplified XML tree, and the solution to SLCA is all of the leaf nodes. Compared with the classical ILE algorithm, the experimental results showed that the FEDA efficiency was better than the ILE algorithm.
出处 《海南师范大学学报(自然科学版)》 CAS 2015年第4期381-384,共4页 Journal of Hainan Normal University(Natural Science)
基金 安徽省高校自然科学研究一般项目(113052015KJ09) 蚌埠学院自然科学项目(2013ZR06) 安徽电子信息职业技术学院自然科学项目(ADZX1303)
关键词 XML文档 扩展编码 Dewey SLCA XML document Dewey Extended encoding SLCA
  • 相关文献

参考文献9

  • 1Xpath, Xquery [EB/OL]. [2011-05-11].http://www.w3sc- hool.com.cn/.
  • 2Guo L, Shao F, Botev C, et al. XR.ANK:Randed keyword search over XML Documents. In:Halevy AIves ZG, Doan A,eds.Proc. of the 2003 ACM SIGMOD Int' 1 Conf. on Management of Data(SIGMOD)[M]. San diego:ACM Press, 2003:16-27.
  • 3Liu ZY, Walker J, Chen Y. X seek:A Semantic XML Search Engine Using Keywords[C]//VLDB Conference,2007.
  • 4Hristidis V, Koudas N, Papakonstantitinou Y, et al. Key- word proximity search in XML trees[J]. IEEE Tram on Knowledge and Data Engineering,2006,18(4):525-539.
  • 5Xu Y, Papakonstantinou Y. Efficient keyword search for smallest LCAs in XML databases. In:ozcan F,ed.Proc.of the ACM SIGMOD Int'l Conf. on Management of Data(SIG2 MOD)[M]. Baltimore:ACM Press,2005:537-538.
  • 6Li G L, Feng J H, Wang J Y, et al. Effective Keyword Search for Valuable LCAs over XML[C]//SIGMOD Confer- ence,2007.
  • 7Liu Z, Chen Y. Identifying meaningful return information for xml keyword search[C]//SIGMOD Conference,2007.
  • 8李思莉,李娟.XML文档到关系数据库的映射策略[J].计算机工程,2010,36(5):40-42. 被引量:12
  • 9王磊,姚保峰,朱洪浩,郭有强.一种无DTD变化约束的XML与关系数据库映射方法[J].辽宁科技大学学报,2011,34(6):588-593. 被引量:6

二级参考文献14

  • 1Florescu D, Kossmann D. Storing and Querying XML Data Using an RDMBS[J]. IEEE Data Engineering Bulletin, 1999, 22(3): 27-34.
  • 2Schmidt A, Kersten M, Windhouwer M, et al. Efficient Relational Storage and Retrieval of XML Documents[C]//Proceedings of the 3rd International Workshop on Web and Databases. [S. l.]: ACM Press, 2000.
  • 3Tatarinov l, Viglas S, Beyer K, et al. Storing and Query Ordered XML Using a Relational Database System[C]//Proceedings of the ACM SIGMOD International Conference on Management of Data. [S. l.]: ACM Press, 2002.
  • 4Li Changqing, Wang Tok-Ling, Hu Min. Efficient Updates in Dynamic XML Data: From Binary String to Quaternary String[J]. International Journal on Very Large Data Bases, 2008, 17(3): 573-601.
  • 5Bhome T, Rahm E. Supporting Efficient Streaming and Insertion of XML Data in RDBMS[C]//Proceedings of the 3rd International Workshop on Data Integration over the Web. [S. l.]: ACM Press, 2004.
  • 6YOSHIKAWA M, AMAGASA T. XRel : A path-based approach to storage and rertieval of XML documents using relational da- tabases [ C ]//ACM Transaction on Intennet Technology, August 2001, Vol. 1:110-141.
  • 7BOHANNON P, FREIREJ, ROY P, et al. From XML schema to relations: a cost-based approach to XML storage[ C]// Proc of the 18th International Conference on Data Engineering. 2002:64-75.
  • 8SHANMUGA SUNDARAM J, TUFTE K, ZHANG Chun, et al. Relational database for querying XML documents: limita- tions and opportunities[ C]//Proc of the 25th International Conference on Very Large Data Bases. 1999:302-314.
  • 9LEE D, CHU W W. CPI: constraint-preserving inlining algorithm for mapping XML to relational schema [ J ]. Data and Knowledge Engineering,2001,39 ( 1 ) :3-25.
  • 10FLORESCU D, KOSSMANN D. Storing and querying XML data using an RDMBS [ J ]. IEEE Data Engineering Bulletin, 1999,22(3 ) :27-34.

共引文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部