Updates on Grammar-Compressed XML Data

Bätz, Alexander; Böttcher, Stefan; Hartel, Rita

doi:10.1007/978-3-642-24577-0_17

Cited by 5 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A grammar path GP = [A 0 , p 0 , …, A n , p n ] is defined as follows (c.f. [5]). Each grammar path GP contains an alternating sequence of non-terminals A i , 0 ≤ i ≤ n, and index positions p i which refer to a symbol within rhs(A i ), which is a non-terminal calling the next grammar rule A i+1 for 0 ≤ i < n, and which is a terminal symbol with the same label as the node V for i = n. A 0 is the start symbol S of grammar G. For example, if we apply the XPath query Q = //od/child::ad to Grammar 1, the selected node can be described by GP1: = [S,3,A1,1].…”

Section: An Example Using Cslt Grammar-based Compressionmentioning

confidence: 93%

See 1 more Smart Citation

ECST – Extended Context-Free Straight-Line Tree Grammars

et al. 2015

Self Cite

View full text Add to dashboard Cite

Abstract. Grammar-based compressors like e.g. CluX [1], BPLEX [2], TreeRePAIR [3] transform an XML tree X into a context-free straight-line linear tree (CSLT) grammar G and yield strong compression ratios compared to other classes of XML-specific compressors. However, CSLT grammars have the disadvantage that simulating on G update operations like inserting, deleting, or re-labeling a node V of X requires to isolate the path from X's root to V from all the paths represented by G. Usually, this leads to an increased redundancy within G, as grammar rules are copied and modified, but the original and the modified grammar rules often differ only slightly. In this paper, we propose extended context-free straight-line tree (ECST) grammars that allow reducing the redundancy created by path isolation. Furthermore, we show how to query and how to update ECST compressed grammars.

show abstract

Section: An Example Using Cslt Grammar-based Compressionmentioning

confidence: 93%

“…Furthermore, in order to simplify the presentation, we describe path isolation only for a single path to a node V to be updated. Note however that the ideas of [5] on how to update multiple paths in parallel can be used for ECST grammars as well.…”

Section: Assumptions and Problem Definitionmentioning

confidence: 99%

ECST – Extended Context-Free Straight-Line Tree Grammars

et al. 2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…Path isolation has been extended in various ways. [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.…”

Section: Copyright C 2018 the Institute Of Electronics Information Amentioning

confidence: 99%

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

Hashimoto

Ryunosuke

Seki

2018

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

One of the most promising compression methods for XML documents is the one that translates a given document to a tree grammar that generates it. A feature of this compression is that the internal structures are kept in production rules of the grammar. This enables us to directly manipulate the tree structure without decompression. However, previous studies assume that a given XML document does not have data values because they focus on direct retrieval and manipulation of the tree structure. This paper proposes a direct update method for XML documents with data values and shows the effectiveness of the proposed method based on experiments conducted on our implemented tool.

show abstract