TREECHOP: A Tree-based Query-able Compressor for XML
暂无分享,去创建一个
[1] Ian H. Witten,et al. Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..
[2] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[3] Jayant R. Haritsa,et al. XGrind: a query-friendly XML compressor , 2002, Proceedings 18th International Conference on Data Engineering.
[4] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[5] Yanlei Diao,et al. Towards an Internet-Scale XML Dissemination Service , 2004, VLDB.
[6] Michael J. Franklin,et al. Efficient Filtering of XML Documents for Selective Dissemination of Information , 2000, VLDB.
[7] S. Golomb. Run-length encodings. , 1966 .
[8] Tomasz Müldner,et al. A Grammar-based Approach for Compressing XML , 2005 .
[9] Dan Suciu,et al. XMill: an efficient compressor for XML data , 2000, SIGMOD '00.
[10] James Cheney. Compressing XML with multiplexed hierarchical PPM models , 2001, Proceedings DCC 2001. Data Compression Conference.
[11] Chin-Wan Chung,et al. XPRESS: a queriable compression for XML data , 2003, SIGMOD '03.
[12] Tomasz Müldner,et al. AXECHOP: a grammar-based compressor for XML , 2005, Data Compression Conference.