Tree structure compression with repair

Data Compression Conference Proceedings

Volumn , Issue , 2011, Pages 353-362

  Lohrey, Markus ^a   Maneth, Sebastian ^b   Mennicke, Roy ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

grammar based compression; tree compression; XML compression

Indexed keywords

COMPRESSION RATIOS; CONTEXT-FREE; GRAMMAR-BASED COMPRESSION; HUFFMAN; MEMORY CONSUMPTION; POINTER STRUCTURES; REPAIR ALGORITHMS; TREE COMPRESSION; TREE STRUCTURES; TREE TRAVERSAL; XML COMPRESSION; XML FILES;

ALGORITHMS; COMPRESSORS; TREES (MATHEMATICS); XML;

DATA COMPRESSION;

EID: 79955736670     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2011.42     Document Type: Conference Paper

References (20)

1. J. Adiego, G. Navarro, and P. de la Fuente. Using structural contexts to compress semistruc-tured text collections. Inf. Process. Manage., 43(3):769-790, 2007. (Pubitemid 46151784)
2. D. Arroyuelo, R. Cánovas, G. Navarro, and K. Sadakane. Succinct trees in practice. In ALENEX 2010, 84-97.
3. S. Böttcher, R. Hartel, and C. Krislin. CluX: Clustering XML sub-trees. In ICEIS 2010.
4. P. Buneman, M. Grohe, and C. Koch. Path queries on compressed XML. In VLDB 2003, 141-152.
5. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML document trees. Inf. Syst., 33:456-474, 2008.
6. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Trans. Inform. Theory, 51(7):2554-2576, 2005. (Pubitemid 41148951)
7. J. Cheney. Compressing XML with multiplexed hierarchical PPM models. In DCC 2001, 163-172. (Pubitemid 32490988)
8. F. Claude and G. Navarro. Self-indexed grammar-based compression. To appear in Fund. Inform.
9. P. Deutsch. DEFLATE compressed data format specification version 1.3. http://tools.ietf. org/html/rfc1951, 1996.
10. N. J. Larsson and A. Moffat. Offline dictionary-based compression. In DCC 1999, 296-305.
11. H. Liefke and D. Suciu. XMill: An efficient compressor for XML data. In SIGMOD Conference 2000, 153-164.
12. Y. Lifshits. Processing compressed texts: A tractability border. In CPM 2007, 228-240.
13. M. Lohrey and S. Maneth. The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci., 363:196-210, 2006. (Pubitemid 44486533)
14. M. Lohrey, S. Maneth, and R. Mennicke. Tree structure compression with RePair. Technical report, arXiv.org, 2010.
15. M. Lohrey, S. Maneth, and M. Schmidt-Schauß. Parameter reduction in grammar-compressed trees. In FOSSACS 2009, 212-226.
16. S. Maneth, N. Mihaylov, and S. Sakr. XML tree structure compression. In DEXA Workshops 2008, 243-247.
17. C. G. Nevill-Manning, I. H. Witten, and D. Maulsby. Compression by induction of hierarchical grammars. In DCC 1994, 244-253.
18. W. Plandowski. Testing equivalence of morphisms on context-free languages. In ESA 1994, 460-470.
19. W. Rytter. Grammar compression, LZ-encodings, and string algorithms with implicit input. In ICALP 2004, 15-27.
20. K. Sadakane and G. Navarro. Fully-functional succinct trees. In SODA 2010, 134-149.