XML tree structure compression using RePair
Authors:
- Markus LohreyMLMarkus Lohrey
- Sebastian ManethSMSebastian Maneth
- Roy MennickeRMRoy Mennicke
- 1 November 2013
- journal article
- Published by Elsevier in Information Systems
- Vol. 38 (8) , 1150-1167
Abstract
No abstract availableAll Related Versions
This publication has 28 references indexed in Scilit:
- Parameter reduction and automata evaluation for grammar-compressed treesJournal of Computer and System Sciences, 2012
- Unification and matching on compressed termsACM Transactions on Computational Logic, 2011
- A bisection algorithm for grammar-based compression of ordered treesInformation Processing Letters, 2010
- Efficient memory representation of XML document treesInformation Systems, 2008
- Using structural contexts to compress semistructured text collectionsInformation Processing & Management, 2007
- The complexity of tree automata and XPath on grammar-compressed treesTheoretical Computer Science, 2006
- Taxonomy of XML schema languages using formal language theoryACM Transactions on Internet Technology, 2005
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Automata theory for XML researchersACM SIGMOD Record, 2002
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980