arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0701cs.DB
收藏

GraphChi-DB:一个可伸缩图数据库系统的简单设计--基于一个PC

GraphChi-DB: Simple Design for a Scalable Graph Database System -- on Just a PC

Aapo Kyrola, Carlos Guestrin

摘要:

我们提出了一种新的数据结构,并行邻接表(PAL),有效地管理图与磁盘上的数十亿条边。PAL结构基于GraphChi的图存储模型(Kyrola et.例如,OSDI 2012),但我们对其进行了扩展,以支持在线数据库功能,如查询和快速插入。此外,我们扩展了模型的边和顶点属性。与以前的数据结构相比,PAL可以更复杂地存储图形,同时允许快速访问顶点的传入和传出边,而不复制数据。在PAL的基础上,我们设计了一个图形数据库管理系统GraphChi-DB,它也可以执行强大的分析图形计算。我们通过实验评估了我们的设计,并证明GraphChi-DB在比可用内存大得多的图形上实现了最先进的性能。GraphChi-DB使任何只有笔记本电脑或PC的人都可以处理非常大的图形。

英文摘要:

We propose a new data structure, Parallel Adjacency Lists (PAL), for efficiently managing graphs with billions of edges on disk. The PAL structure is based on the graph storage model of GraphChi (Kyrola et. al., OSDI 2012), but we extend it to enable online database features such as queries and fast insertions. In addition, we extend the model with edge and vertex attributes. Compared to previous data structures, PAL can store graphs more compactly while allowing fast access to both the incoming and the outgoing edges of a vertex, without duplicating data. Based on PAL, we design a graph database management system, GraphChi-DB, which can also execute powerful analytical graph computation. We evaluate our design experimentally and demonstrate that GraphChi-DB achieves state-of-the-art performance on graphs that are much larger than the available memory. GraphChi-DB enables anyone with just a laptop or a PC to work with extremely large graphs.

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

↑