期刊文献+

不确定XML序列匹配关键技术研究

Research on Key Technologies of Uncertain XML Sequence-Based Matching
下载PDF
导出
摘要 不确定XML小枝模式匹配的关键技术包括不确定XML文档格式,互斥节点识别,实例树概率计算和概率阈值过滤.目前,不确定XML二元结构连接和整体匹配方法无法充分利用算法的特点解决关键技术问题,针对这一不足,将序列匹配应用到不确定XML小枝模式匹配,并对不确定XML序列匹配关键技术问题进行分析和证明,理论分析和实验结果表明序列匹配方法应用到不确定XML小枝模式匹配是有效的. Key technologies of uncertain XML twig pattern matching include uncertain XML document format, recognition of exclusive distribution nodes, calculation of the probabilities of witness tree and probabilistic threshold filtering. At present, binary structure join and holistic matching over uncertain XML can~ t make full use of the characteristics of algorithms to solve key technology issues. In order to overcome this limitation, this paper proposes an uncertain XML twig pattern matching method based on sequence-based matching. We also analyze and prove key technologies of uncertain XML sequence-based matching. The theory research and the results of experiment show the effectiveness of this method.
作者 张晓琳 王鹏
出处 《微电子学与计算机》 CSCD 北大核心 2014年第4期123-127,共5页 Microelectronics & Computer
基金 国家自然科学基金项目(61163015) 内蒙古自然科学基金项目(2013MS0909)
关键词 不确定XML 小枝模式匹配 序列匹配 概率阈值过滤 uncertain XML twig pattern matching sequence-based matching probabilistic threshold filtering
  • 相关文献

参考文献6

  • 1Yun J H, Chung C W. Efficient probabilistic XML query processing using an extended labeling scheme and a lightweight index[J]. Information Processing Management, 2012,48(6) : 1181-1202.
  • 2张晓琳,吕庆,刘立新,郑春红.一种高效的连续不确定XML小枝模式匹配算法[J].计算机应用研究,2013,30(2):364-366. 被引量:4
  • 3Tatikonda S, Parthasarathy S, Goyder M. I:S-TRIM: dynamic programming meets XML indexing and querying EC:// Koch C, Gehrke J, Garofalakis M N, et al. Pro- ceedings of the 33rd International Conference on Very Large Data Bases. New York: ACM Press,2007:63-74.
  • 4. Kimelfeld B, Sagiv Y. Modeling and querying probabi- listic XML data I-J3. ACM SIGMOD Record, 2009,37 (4) : 69-77.
  • 5Nierman A, Jagadish H V. ProTDB: Probabilistic da- ta in XML[-C-]//Proceedings of the 28th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann, 2002 : 646-657.
  • 6Merialdo P. ACM SIGMOD Record: XML version /-EB/OL3. (1999-12-07) E2013-06-063. http.//www. dia. uniroma3, it/Araneus/Sigmod/.

二级参考文献9

  • 1ZHANG C,NAUGHTON J,DeWITT D. On supporting containment queries in relational database management systems[A].New York:acm Press,2001.425-426.
  • 2AI-KHALIFA S,JAGADISH H V,KOUDAS N. Structural joins:a primitive for efficient XML query pattern matching[A].Washington,DC:IEEE Computer Society,2002.141-152.
  • 3NICOLAS B,NICK K,DIVESH S. Holistic twig joins:optimal XML pattern matching[A].New York:acm Press,2002.310-321.
  • 4LI Ya-wen,WANG Guo-ren,XIN Jun-chang. Holistically twig matching in probabilistic XML[A].Washington,DC:IEEE Computer Society,2009.1649-1656.
  • 5CHEN Song-ting,LI Hua-gang,TATEMURA J C. Twig2Stack:bottom-up processing of generalized-tree-pattern queries over XML documents[A].2006.283-294.
  • 6QIN Lu,YU J X,DING Bo-lin. TwigList:make twig pattern matching fast[A].2006.313-324.
  • 7ABITEBOUL S,CHANT H,KHARLAMOV E. Aggregate queries for discrete and continuous probabilistic XML[A].New York:acm Press,2010.50-61.
  • 8王建卫,郝忠孝.一种概率XML数据树的化简算法[J].计算机应用研究,2010,27(12):4541-4543. 被引量:4
  • 9王建卫,郝忠孝.概率关系模式与概率XML模式转换算法的研究[J].计算机应用研究,2011,28(2):609-612. 被引量:2

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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