.png){kind=icon}
返回
Pool Compression for Undirected Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3179505.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new graph compression scheme that intrinsically exploits the similarity and locality of references in a graph by first ordering the nodes and then merging the contiguous adjacency lists of the graph into blocks to create a pool of nodes. The nodes in the adjacency lists of the graph are encoded by their position in the pool. This simple yet powerful scheme achieves compression ratios better than the previous methods for many datasets tested in this paper and, on average, surpasses all the previous methods. The scheme also provides an easy and efficient access to neighbor queries, e.g., finding the neighbors of a node, and reachability queries, e.g., finding if node u is reachable from node v. We test our scheme on publicly available graphs of different sizes and show a significant improvement in the compression ratio and query access time compared to the previous approaches.
Keyword:
Graph compression
merging adjacency lists
node ordering
Elias-Gamma encoding
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Erratum to: Orthorexia nervosa and self-attitudinal aspects of body image in female and male university students勘误：神经性正食症与女性和男性大学生身体意象的自我态度方面
OAAI
OAAI分享收藏分享收藏分享收藏分享收藏分享收藏
查看更多内容