期刊文献+

面向XPath执行的XML数据流压缩方法 被引量:17

XPath Evaluation Oriented XML Data Stream Compression
下载PDF
导出
摘要 由于XML(extensible markup language)本身是自描述的,所以XML数据流中存在大量冗余的结构信息.如何压缩XML数据流,使得在减少网络传输代价的同时有效支持压缩数据流上的查询处理,成为一个新的研究领域.目前已有的XML数据压缩技术,都需要扫描数据多遍,或者不支持数据流之上的实时查询处理.提出了一种XML数据流的压缩技术XSC(XML stream compression),实时完成XML数据流的压缩和解压缩,XSC动态构建XML元素事件序列字典并输出相关索引,能够根据XML数据流所遵从的DTD,产生XML元素事件序列图,在压缩扫描之前,产生更加合理的结构序列编码.压缩的XML数据流能够直接解压缩用于XPath的执行.实验表明,在XML数据流环境中,XSC在数据压缩率和压缩时间上要优于传统算法.同时,在压缩数据之上查询的执行代价是可以接受的. Because XML (extensible markup language) is self-described, there is much redundant structural information in XML data stream. How to compress XML data so as to reduce the network transfer cost and support XPath evaluation on the compressed data is a new area of research. The existing methods on XML compression require the multi-pass scan on data or can not support real time query processing on compressed data. In this paper, a novel compression method XSC (XML stream compression) is proposed to compress and decompress XML stream in real time. XSC constructs XML element event sequence dictionary and outputs the related index dynamically. When DTD is available, XSC can generate the XML element event sequence graph for producing more reasonable encoding before XML data stream is processed. The compressed XML data stream can be decomposed directly for XPath evaluation. Experimental results show that XSC outperforms other methods in compression ratio and compression efficiency, and the cost of XPath evaluation on compressed data stream is acceptable.
出处 《软件学报》 EI CSCD 北大核心 2005年第5期869-877,共9页 Journal of Software
基金 国家高技术研究发展计划(863) 国家重点基础研究发展规划(973)~~
关键词 XML 数据流 压缩 DTD XPATH Algorithms Data compression Data handling Encoding (symbols) Optimization Performance Theorem proving
  • 相关文献

参考文献10

  • 1Hartmut L, Dan S. XMill: An efficient compressor for XML data. In: Weidong C, Jeffrey F, eds. Proc. of the SIGMOD 2000. Texas;ACM Press, 2000. 153-164.
  • 2Pankaj MT, Jayant RH. XGRIND: A query friendly XML compressor. In: Proc. of the ICDE 2002. San Jose: IEEE Computer Society, 2002. 225-234.
  • 3Jun KM, Myung JP, Chin WC. XPRESS: A queriable compression for XML data. In: Alon Y, Zachary G, eds. Proc. of the SIGMOD 2003. San Diego: ACM Press, 2003. 122-133.
  • 4Jacob Z, Abraham L. A universal algorithm for sequence data compression. IEEE Trans. on Information Theory, 1977,23(3):337-343.
  • 5Jeffery SV. Design and analysis of dynamic Huffman codes. Journal of the ACM, 1987,34(4):825-845.
  • 6Jean LG. GZIP. 2003. HTTP://www.gzip.com
  • 7SwissProt Data Set. 1998. http://www.cs.washington.edu/research/xmldatasets/data/SwissProt/SwissProt.xml
  • 8NASA Data Set. 2001. http://www.cs.washington.edu/research/xmldatasets/data/nasa/nasa.xml
  • 9Tree Bank Data Set. 2002. http://www.cs.washington.edu/research/xmldatasets/data/treebank/treebank_e.xml
  • 10Angel LD, Douglas L. XML generator. 1999. http://www.alphaworks.ibm.com/tech/xmlgenerator

同被引文献124

引证文献17

二级引证文献106

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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