期刊文献+

XML查询优化的面向路径可扩展模型 被引量:2

An oriented extensible model for XML query optimization
在线阅读 下载PDF
导出
摘要 通过XQuery中的路径表达式的处理提出了一种更为完整和灵活的查询优化模型 ,称之为POEM (面向路径的可扩展模型 ) .与现有的解决方案不同 ,模型先给出路径表达式的形式化描述———查询路径图 ,并根据路径表达式查询中影响性能的关键因素———结构连接建立了POEM查询优化模型 . This paper presented a new flexible model called POEM (Path Oriented Extensible Model). Unlike the existing solutions, the formal description of the path expression was focused on and the POEM optimization model was built according to the structural join. This model was the key factor of the query performance issues in the path expression evaluation. The performance of POEM was analyzed and compared with original non-optimization approach.The experimental results were presented.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2004年第3期62-64,共3页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家高技术研究发展计划资助项目 (2 0 0 2AA4Z3110 )
关键词 路径表达式 结构连接 查询路径图 面向路径的可扩展模型 path expression structural join query path graph POEM
  • 相关文献

参考文献3

  • 1[1]Gottlob G, Koch C, Pichler R. Efficient algorithms for processing XPath queries. In: Proceedings of VLDB, Hongkong, 2002, 95~106
  • 2[2]Deutsh A, Fernandez M, Suciu D. Storing semistructured data with STORED. In: ACM SIGMOD, Record 2001, 28(2): 431~442
  • 3[3]Tian F, Dewitt D J, Chen J. et al. The design and performance evaluation of alternative XML storage. In: ACM SIGMOD, Record 2002, 31(3): 5~10

同被引文献7

  • 1王静,孟小峰,王宇,王珊.以目标节点为导向的XML路径查询处理[J].软件学报,2005,16(5):827-837. 被引量:21
  • 2Tansley D.Linux and Unix Shell Programming[M].[s.l.]:Addison Wesley/Pearson,2000.
  • 3Bray T,Paoli J,Sperberg-McQueen C M,et al.Extensible markup language (XML) 1.0 (2nd Edition)[EB/OL].W3CRecommendation,2000.http://www.w3.org/TR/2000/REC-xml-20001006.
  • 4Clark J,DeRose S.XML Path Language (XPath),Version 1.0[EB/OL].W3C Recommendation,1999-11.http://www.w3.org/TR/xpath.
  • 5Boag S,Chamberlin D,Robie J,et al.XQuery 1.0:An XML Query Language[EB/OL].W3C Candidate Recommendation,2005-11-03.http://www.w3.org/TR/xquery/.
  • 6Yazdani N,Min P S.Prefix Trees:New Efficient Data Structures for Matching Strings of Different Lengths[C]//2001 International Database Engineering & Applications Symposium(IDEAS ' 01).Grenoble,France:IEEE Computer Society,2001:76-85.
  • 7王强,武港山.对XPath模式定位能力的扩充[J].计算机研究与发展,2001,38(6):674-678. 被引量:4

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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