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

System G分布式图形数据库

System G Distributed Graph Database

Gabriel Tanase, Toyotaro Suzumura, Jinho Lee, Chun-Fu Chen, Jason Crawford, Hiroki Kanezashi, Song Zhang, Warut D. Vijitbenjaronk

摘要:

由于需要从互联数据中提取知识和价值,大数据的图形分析是工业界和学术界非常活跃的研究领域。为了有效地支持图形分析,出现了大量的内存图形库、图形处理系统和图形数据库。这些类别中的每一个项目都集中在特定的方面,如静态与动态图形,离线与在线处理,小与大图形等,虽然在过去的几十年中,图形处理有很大的进步,仍然需要一个快速的图形处理,使用一个集群的机器与分布式存储。在本文中,我们讨论了一种新的分布式图形数据库称为系统G设计的高效的图形数据存储和处理的现代计算架构。特别是,我们描述了一个单节点的图形数据库和运行时和通信层,使我们能够组成一个分布式的图形数据库,从多个单节点的实例。从各种行业的需求,我们发现,快速插入和大量并发查询的图形数据库的关键部分,我们优化我们的数据库,这样的功能。我们的实验表明,系统G的效率存储数据和处理图形查询的最先进的平台上。

英文摘要:

Motivated by the need to extract knowledge and value from interconnected data, graph analytics on big data is a very active area of research in both industry and academia. To support graph analytics efficiently a large number of in memory graph libraries, graph processing systems and graph databases have emerged. Projects in each of these categories focus on particular aspects such as static versus dynamic graphs, off line versus on line processing, small versus large graphs, etc. While there has been much advance in graph processing in the past decades, there is still a need for a fast graph processing, using a cluster of machines with distributed storage. In this paper, we discuss a novel distributed graph database called System G designed for efficient graph data storage and processing on modern computing architectures. In particular we describe a single node graph database and a runtime and communication layer that allows us to compose a distributed graph database from multiple single node instances. From various industry requirements, we find that fast insertions and large volume concurrent queries are critical parts of the graph databases and we optimize our database for such features. We experimentally show the efficiency of System G for storing data and processing graph queries on state-of-the-art platforms.

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

↑