期刊文献+

一种XML数据流小枝模式查询算法 被引量:1

Twig Pattern Query Algorithm for XML Data Stream
下载PDF
导出
摘要 针对传统XML文档小枝模式查询算法系统开销大的问题,提出一种XML数据流小枝模式查询算法。该算法结合SAX数据流解析技术,将层次关系队列结构应用于XML文档查询中,采用动态生成区间编码的方式,免除建立编码索引文件的步骤。实验结果表明,在对相关数据集进行查询时,该算法可减少I/O操作,缩短查询响应时间,提高查询效率。 Aiming at the system overhead problem of traditional twig pattern query algorithm for XML document, this paper proposes a twig pattern query algorithm for XML data stream. By integrating a type of data structure of multi-layer related queues with SAX data stream parse technology, it uses the method of dynamic gernerating the region code for the querying and avoids the creation of index file. Experimental results show that the algorithm promotes the querying efficiency through reducing I/O operation and querying time on certain data set.
作者 白山 陶世群
出处 《计算机工程》 CAS CSCD 2012年第6期69-71,共3页 Computer Engineering
关键词 可扩展标记语言 小枝模式 区间编码 数据流 SAX解析 eXtensive Makeup Language(XML) twig pattern region encoding data stream Simple API for XML(SAX) parse
  • 相关文献

参考文献7

  • 1AI-Khalifa S, Jagadish H V, Patel J M, et al. Structural Joins: A Primitive for Efficient XML Query Pattern Matching[C]//Proc. of the 18th Int’l Conf. on Data Engineering. [S. l.]: IEEE Press, 2002.
  • 2Bruno N, Koudas N, Srivastava D. Holistic Twig Joins: Optimal XML Pattern Matching[C]//Proc. of the SIGMOD Int'l Conf. on Management of Data. Madison, USA: ACM Press, 2002.
  • 3Liu Zheng, Jeffrey X Y, Ding Bolin. TwigList: Make Twig Pattern Matching Fast[C]//Proc. of DASFAA'07. Bangkok, Thailand: [s. n.], 2007.
  • 4Official Website for SAX[EB/OL]. [2011-06-21]. http://www.sax project.org/.
  • 5Zhang Chun, Naughton J F, DeWitt D J, et al. On Supporting Containment Queries in Relational Database Management Systems[C]//Proc. of ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 2001.
  • 6朱晓娟.基于扩展区间编码的XML结构连接算法[J].计算机工程,2010,36(22):49-51. 被引量:3
  • 7Xmark: The XML Benchmark Project[EB/OL]. [2011-06-21]. http://www.xml-benchmark.org/downloads.html.

二级参考文献4

  • 1门爱华,周立柱,张亚鹏.XML数据库结构连接算法之分析[J].计算机科学,2007,34(6):136-138. 被引量:1
  • 2Chien Shuyao,Vagena Z, Zhang Donghui, et al. Efficient Structural Joins on Indexed XML Documents[C]//Proceedings of VLDB'02. Hong Kong, China: [s. n.], 2002: 263-274.
  • 3Zhang Chun, Naaghton J, De W, et al. On Supporting Containment Queries in Relational Database Management Systems[C]// Proceedings of ACM SIGMOD'01. New York, USA: ACM Press, 2001: 425-436.
  • 4Al-Khalifa S, Jagadish H V, Koudas N, et al. Structural Joins: A Primitive for Efficient XML Query Pattern Matching[C]// Proceedings of IEEE ICDE'02. San Jose, California, USA: [s. n.], 2002: 141-152.

共引文献2

同被引文献13

  • 1苏航,廖湖声.XQuery语言的部分求值技术的研究[J].计算机工程与科学,2006,28(z2):160-160. 被引量:1
  • 2高红雨,廖湖声.面向对象程序设计语言的部分求值动作分析[J].计算机工程,2006,32(9):72-74. 被引量:1
  • 3Jagadish H, Lakshmanan L, Srivastava D, et al. TAX : A Tree Algebra for XML I C l//Proceedings of the 8th International Workshop on Databases and Programming Languages. Berlin, Germany: Springer-Verlag, 2001: 149-164.
  • 4Zhang Chun, Naughton J, DeWitt D, et al. On Supporting Containment Queries in Relational Database Manage- ment Systems I C ]//Proceedings of the 20th ACM SIGMOD International Conference on Management of Data. New York, USA : ACM Press ,2001:425-436.
  • 5Bruno N,Koudas N, Srivastava D. Holistic Twig Joins: Optimal XML Pattern Matching I C ]//Proceedings of the 21st ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 2002:310-321.
  • 6Qin Lu,Yu J X,Ding Bolin. TwigList:Make Twig Pattern Matching Fast[ C ]//Proceedings of DASFAA' 07. Berlin, Germany : Springer-Vertag ,2007:850-862.
  • 7Lu Jianheng,Ling T W, Chan C, et al. From Region Encoding to Extended Dewey:On Efficient Processing of XML Twig Pattern Matching I C l//Proceedings of the 31st Conference in the Series of the Very Large Data Bases. I S. 1. I :VLDB Endowment,2005:193-204.
  • 8Lu Jiaheng,Ling T W, Bao Zhifeng, et al. Extended XML Tree Pattern Matching: Theories and Algorithms I J 1. IEEE Transactions on Knowledge and Data Engineering, 2011, 23(3) :402-416.
  • 9Bondorf A. Improving Binding Times Without Explicit CPS-conversion ~ C ]//Proceedings of ACM Conference on LISP and Functional Programming. New York, USA : ACM Press, 1992 : 1-10.
  • 10Buneman P,Cong Gao,Fan Wenfei, et al. Using Partial Evaluation in Distributed Query Evaluation ~ C ~//Pro- ceedings of VLDB 2006. [ S. 1. I : VLDB Endowment, 2006:211-222.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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