期刊文献+

基于树自动机的XPath在XML数据流上的高效执行 被引量:33

Tree Automata Based Efficient XPath Evaluation over XML Data Stream
下载PDF
导出
摘要 如何在 XML 数据流上高效地执行大量的 XPath 查询成为数据流应用中一个迫切需要解决的关键问题.目前提出的算法或者不能完全支持 XPath 的常规特性,或者在算法的执行效率和空间代价上不能满足数据流应用的要求.提出了基于树自动机的XEBT机来解决这个问题.与传统方法相比,XEBT机具备如下特征:首先,XEBT机基于表达能力丰富的树自动机,无须附加中间状态,或保存中间结果,就能处理支持{[]}操作符的 XPath;其次,XEBT 机支持多种优化策略,包括基于DTD的XPath查询自动机的构造;在空间代价有限增加的情况下采用局部确定化减少并发执行的状态;采用自上而下和自下而上相结合的查询处理策略.实验结果表明,提出的方法能够支持复杂的XPath 查询,在执行效率和空间代价方面优于传统算法. How to efficiently evaluate massive XPaths set over an XML stream is a fundamental problem in applications of the data stream. The current methods can not fully support the commonly used features of XPath, or can not meet the space and time requirement of the data stream applications. In this paper, a new tree automata based machine, XEBT, is proposed to solve the problem. Different from traditional ones, XEBT has the following features: First, it is based on tree automata with a powerful expressiveness, which can support Xpath {[]} without extra states or intermediate results; Second, XEBT supports many optimization strategies, including DTD based XPath tree automata construction, partial determination to reduce the concurrent states at running time with limited extra space costs, and the combination of bottom-up and top-down evaluation. Experimental results show that XEBT supports the complex Xpath and outperforms the former work in both efficiency and space cost.
出处 《软件学报》 EI CSCD 北大核心 2005年第2期223-232,共10页 Journal of Software
基金 国家高技术研究发展计划(863) 国家重点基础研究发展规划(973)~~
关键词 XP 自动机 XML数据 查询 算法 执行效率 操作符 法能 局部 中间状态 Algorithms Automata theory Data communication systems Database systems Internet Trees (mathematics)
  • 相关文献

参考文献12

  • 1高军,杨冬青,唐世渭,王腾蛟.一种基于DTD的XPath逻辑优化方法[J].软件学报,2004,15(12):1860-1868. 被引量:17
  • 2Diao Y, Fischer P. YFilter: Efficient and scalable filtering of XML documents. In: Proc of the 18th Int'l Conf on Data Engineering. 2002. 341-345.
  • 3Chan C, Felber P, Garofalakis M, Rastogi R. Efficient filtering of XML document with XPath expressions. In: Proc of the Int'l Conf on Data Engineering. San Jose: IEEE Computer Society, 2002. 235-244.
  • 4Green T J, Miklau G, Onizuka M, Suciu D. Processing XML streaming with deterministic automata. Irt Calvanese D, Lenzerini M,Motwani R, eds. Proc of the Int'l Conf on Data Theory. LNCS 2572, Springer-Verlag, 2003. 173-189.
  • 5Gupta AK, Suciu D. Stream processing of XPath queries with predicates. In: Halevy AY, Ives ZG, Doan AH, eds. Proc of the 2003ACM SIGMOD Int'l Conf on Management of Data. ACM, 2003.419-430.
  • 6Nguyen B, Abiteboul S, Cobena G, Preda M. Monitoring XML data on the Web. In: Aref WG, ed. Proc of the ACM/SIGMOD Conf on Management of Data. 2001. 437--448.
  • 7Chen J, Dewitt D, Tian F, Wang Y. NiagaraCQ: A scalable continuous query system for internet databases. In: Chen WD,Naughton JF, Bernstein PA, eds. Proc of the ACM/SIGMOD Conf Management of Data. ACM, 2000. 379-390.
  • 8Clark J. XML Path language (XPath). 1999. Available from the W3C, http://www.w3.org/TR/XPath.
  • 9Milo T, Suciu D, Vianu V. Typechecking for XML Transformers. In: Proc of the PODS 2000. ACM, 2000. 11-22.
  • 10Miklau G, Suciu D. Containment and equivalence for an XPath fragment. In: Popa L, ed. Proc of the 21 Symp. on Principle of Database Systems. ACM, 2002.65-76.

二级参考文献13

  • 1Clark J. XML path language (XPath). 1999. http://www.w3.org/TR/XPath
  • 2Georg G, Christoph K, Reinhard P. Efficient algorithms for processing XPath queries. In Stéphane B, Akmal B. eds. Proc. of the VLDB 2002. Heidelberg: Springer-Verlag, 2002.95-106.
  • 3Mary F, Dan S. Optimizing regular path expressions using graph schemas. In: Proc. of the ICDE'98. Florida: IEEE Computer Society, 1998. 14-23. http://www.cs.washington.edu/homes/suciu/file33_paper.ps
  • 4Sihem A, SungRan C, Laks VS. Minimization of tree pattern queries. In Walid GA, eds. Proc. of the SIGMOD. Santa Barbara,2001. http://www.research.att.com/-sihem/publications/SIGMOD01 .pdf
  • 5Peter W. Minimising simple XPath expressions. In: Giansalvatore M, Jérome S, eds. Proc. of the WebDB. ACM, 2001. 13-18.
  • 6Frank N, Thomas S. XPath containment in the presence of disjunction, DTDs, and variables. In: Diego C, Maurizio L, eds. Proc. of the ICDE. Heidelberg: Springer-Verlag, 2003.315-329.
  • 7Gerome M, Dan S. Containment and equivalence for an XPath fragment. In Lucian P, eds. Proc. of the PODS. ACM, 2002. 65-76.
  • 8Michael B, Wenfei F, Gabriel M. Structural properties of XPath fragment. In: Diego C, Maurizio L, eds. Proc. of the ICDE.Heidelberg: Springer, 2003.79-95.
  • 9Hubert C, Max D, Remi G, Florent J, Denis L, Sophie T, Marc T. Tree automata techniques and applications.http://www.grappa.univ-lille3.fr/tata/tata.pdf
  • 10Frank N. Automata, logic, and XML. In: Julian C, ed. Proc. of the Int'l Workshop on Computer Science Logic. LNCS 2471,Heidelberg: Springer-Verlag, 2002.2-26.

共引文献16

同被引文献290

引证文献33

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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