arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.01504cs.DS
收藏

基于模式匹配技术的图形压缩

Graph Compression Using Pattern Matching Techniques

Rushabh Jitendrakumar Shah

摘要:

图可以用来表示属于不同域的各种数据。图可以有效地捕捉数据之间的关系,得到了广泛的应用。近年来,随着大数据的出现,需要有效地存储和计算大型数据集。然而,考虑到所讨论的数据集的大小,找到存储和处理数据的最佳方法一直是一个挑战。因此,在本文中,我们研究了不同的图压缩技术,并提出了新的算法来做同样的。具体来说,给定一个图G =(V,E),其中V是一组顶点和E是一组边,和|V| = n,我们提出的技术来压缩的邻接矩阵表示的图。我们的算法是基于在邻接矩阵数据中找到模式,并用特定的标记替换常见的模式。这里提出的所有技术都是图形的无损压缩。基于实验结果,据观察,我们提出的技术实现了近70%的压缩相比,邻接矩阵表示。结果表明,大型图可以有效地存储在较小的内存中,并利用计算节点的并行处理能力,以及有效地传输资源之间的数据。

英文摘要:

Graphs can be used to represent a wide variety of data belonging to different domains. Graphs can capture the relationship among data in an efficient way, and have been widely used. In recent times, with the advent of Big Data, there has been a need to store and compute on large data sets efficiently. However, considering the size of the data sets in question, finding optimal methods to store and process the data has been a challenge. Therefore, in this paper, we study different graph compression techniques and propose novel algorithms to do the same. Specifically, given a graph G = (V, E), where V is the set of vertices and E is the set of edges, and |V| = n, we propose techniques to compress the adjacency matrix representation of the graph. Our algorithms are based on finding patterns within the adjacency matrix data, and replacing the common patterns with specific markers. All the techniques proposed here are lossless compression of graphs. Based on the experimental results, it is observed that our proposed techniques achieve almost 70% compression as compared to adjacency matrix representation. The results show that large graphs can be efficiently stored in smaller memory and exploit the parallel processing power of compute nodes as well as efficiently transfer data between resources.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑