Fast Multi-update Operations on Compressed XML Data

ECST – Extended Context-Free Straight-Line Tree Grammars

“…Note however that like our previous XML database system simulated on CSLT grammars [6], this approach simulating XML queries on an ECST grammar G could be adapted to handle backward axes and predicate filters as well. Furthermore, in order to simplify the presentation, we describe path isolation only for a single path to a node V to be updated.…”

“…CluX [1], BPLEX [2], and TreeRePAIR [3] that not only combine identical subtrees, but recognize similar patterns within the XML tree, and therefore allows a higher degree of compression. The approaches [6], [19] and [20] follow different approaches on how to compute updates on grammar-compressed XML data. A generalization of grammar-based compression to functional programs representing the compressed tree data was presented in [21].…”

Implementing Efficient Updates in Compressed Big Text Databases

“…Furthermore, we have combined DICIRT with XML compression techniques like DAG compression [3], Succinct [4], and Repair [5], each of which allows updates on compressed XML structures and can identify the node IDs of XML text nodes that have to be updated as a consequence of an update operation on a compressed XML tree. Therefore, for each of these XML compression techniques, using CIRT as compressed text format and using DICIRT as update processor for XML text nodes is considered to be superior to text compression with bzip2 for text inserts up to 8% and text deletions up to 15% of the total size of all text nodes.…”

Direct Update of XML Documents with Data Values Compressed by Tree Grammars

“…[5] proposed a parallelization of path isolation in updating grammars. [2] further optimized an updating algorithm by representing queries by DAGs and [6] proposed an extension of SLCFTG so that redundancies appearing in path isolation can be reduced. In [7], a recompression method is proposed such that tree digrams across more than one rules are searched in an SLCFTG updated by path isolation, and the detected digrams are locally compressed by TreeRePair.…”

“…In compression a) E-mail: k-hasimt@i.nagoya-u.ac.jp b) E-mail: seki@i.nagoya-u.ac.jp DOI: 10.1587/transinf.2017FOP0002 methods based on tree grammars, such a direct manipulation is possible because the internal structures are kept in production rules of the grammar. Along this line, some direct manipulation tools have been already reported [2]- [8]. However, previous studies on compression and direct manipulation assume that a given XML document does not have data values such as attribute values and PCDATA because those studies focus on investigating an efficient compression and direct retrieval of the structure.…”