Compressing graphs by grammars

Maneth, Sebastian; Peternek, Fabian

doi:10.1109/icde.2016.7498233

Cited by 22 publications

(12 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In any case, our solution can be regarded as a modular system, where each part can be replaced with other compact data structures that improve the space/time trade-off. For instance, instead of k 2 -trees, one could explore other promising representations that have appeared recently for graph compression Peters 2016, Maneth andPeternek 2016), as soon as they become mature enough to compete with k 2 -tree not only in terms of space, but also in terms of scalability and extended functionality.…”

Section: Discussionmentioning

confidence: 99%

“…In many cases, the graph models used to represent the relevant information for a domain are simple directed graphs. Many compact and efficient proposals have appeared to represent this kind of graph (Jacobson 1989, Boldi and Vigna 2004, Chierichetti et al 2009, Claude and Navarro 2010, Hernández and Navarro 2014, Fischer and Peters 2016, Maneth and Peternek 2016. However, in many cases, this model is not enough, because nodes and edges contain complex information that must be stored and accessed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compact and Efficient Representation of General Graph Databases

Álvarez-García,

Freire,

Ladra

et al. 2018

Preprint

View full text Add to dashboard Cite

In this paper, we propose a compact data structure to store labeled attributed graphs based on the k 2 -tree, which is a very compact data structure designed to represent a simple directed graph. The idea we propose can be seen as an extension of the k 2 -tree to support property graphs. In addition to the static approach, we also propose a dynamic version of the storage representation, which allows flexible schemas and insertion or deletion of data. We provide an implementation of a basic set of operations, which can be combined to form complex queries over these graphs with attributes. We evaluate the performance of our proposal with existing graph database systems and prove that our compact attributed graph representation obtains also competitive time results.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Compact and Efficient Representation of General Graph Databases

Álvarez-García,

Freire,

Ladra

et al. 2018

Preprint

View full text Add to dashboard Cite

show abstract

“…Though the sizes of compressed documents via top trees are experimentally about twice as large as those by TreeRePair (see [18]), basic information (e.g., reachability between specified node pairs) can be maintained efficiently through updates in top trees [19]. Recently, a compression method of graphs via graph grammars was proposed based on graph digrams [20]. Extending our method to graph compression is another interesting future work.…”

Section: Copyright C 2018 the Institute Of Electronics Information Amentioning

confidence: 98%

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

“…• The idea of grammar-based string compression can be generalised to other data types as long as suitable grammar formalisms are known for them. See for instance the recent work on grammar-based graph compression [32]. The last point is the most important one for this work.…”

Section: Introductionmentioning

confidence: 97%

Approximation of smallest linear tree grammar

Jeż

Lohrey

2016

Information and Computation

View full text Add to dashboard Cite

A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(rg + rg log(n/rg)) for a given input tree T of size n is presented, where g is the size of a minimal linear context-free tree grammar for T , and r is the maximal rank of symbols in T (which is a constant in many applications). This is the first example of a grammar-based tree compression algorithm with a good, i.e. logarithmic in terms of the size of the input tree, approximation ratio. The analysis of the algorithm uses an extension of the recompression technique from strings to trees.

show abstract

Compressing graphs by grammars

Cited by 22 publications

References 34 publications

Compact and Efficient Representation of General Graph Databases

Compact and Efficient Representation of General Graph Databases

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

Approximation of smallest linear tree grammar

Contact Info

Product

Resources

About