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

开源图形数据库初探

A Brief Study of Open Source Graph Databases

Rob McColl, David Ediger, Jason Poovey, Dan Campbell, David Bader

摘要:

随着大型不规则稀疏关系数据集的激增,出现了新的存储和分析平台,以填补基于传统数据库技术和查询语言的常规方法在性能和能力方面留下的空白。这些平台中的许多应用图形结构和分析技术以使得用户能够摄取、更新、查询和计算这些关系的拓扑结构,这些关系被表示为顶点集合之间的边集合。为了存储和处理Facebook规模的数据集,它们必须能够支持具有数十亿条边的数据源,每秒数百万次更新的更新速率以及复杂的分析内核。这些平台必须提供直观的界面,使图形专家和新手程序员能够编写通用图形算法的实现。在本文中,我们探讨了各种图形分析和存储平台。我们比较他们的能力,接口和性能的实现和计算一组现实世界的图形算法的合成图高达2.56亿边。本着充分披露的精神,几位作者参与了毒刺的开发。

英文摘要:

With the proliferation of large irregular sparse relational datasets, new storage and analysis platforms have arisen to fill gaps in performance and capability left by conventional approaches built on traditional database technologies and query languages. Many of these platforms apply graph structures and analysis techniques to enable users to ingest, update, query and compute on the topological structure of these relationships represented as set(s) of edges between set(s) of vertices. To store and process Facebook-scale datasets, they must be able to support data sources with billions of edges, update rates of millions of updates per second, and complex analysis kernels. These platforms must provide intuitive interfaces that enable graph experts and novice programmers to write implementations of common graph algorithms. In this paper, we explore a variety of graph analysis and storage platforms. We compare their capabil- ities, interfaces, and performance by implementing and computing a set of real-world graph algorithms on synthetic graphs with up to 256 million edges. In the spirit of full disclosure, several authors are affiliated with the development of STINGER.

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

↑