Combining Two Types of Database System for Managing Property Graph Data
Combining Two Types of Database System for Managing Property Graph Data
复制标题
结合两种类型的数据库系统来管理房产图数据
DOI：
10.1109/bigdata.2018.8622050
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Hatano Kenji
中科院分区：
文献类型：
--
作者：
Kusu Kazuma;Hatano Kenji
一种称为图的数据结构由节点和边组成;节点表示数据中的实体，边表示两个实体之间的关系。此外，接受属性图模型（PGM）的图可以提供诸如人的性别、年龄、家庭地址等信息。所有的图数据库（GDB）都支持这种图模型。当客户端发出查询时，传统的GDB无法避免扫描数据库中的所有节点或指定的标记节点。此过程效率不高，因为当执行具有使用图组件的属性的条件的查询时，查询扫描不必要的节点。为了解决这个问题，我们分析了如何节点和边缘属性可以更有效地查询，同时保持图的结构。因此，在这项研究中，我们只是提出了一种方法，图数据管理，它分别存储节点/边信息和属性信息到单独的数据结构。此外，我们描述了一个计划进行评估我们的方法，因为它是提案阶段。
A data structure called a graph consists of nodes and edges; a node represents an entity in data, and an edge represents a relationship between two entities. Moreover, graphs accepting the property graph model (PGM) can provide information such as a person's gender, age, home address. All graph database (GDB) generally support this graph model. Conventional GDBs cannot avoid scanning all the nodes or specified labeled ones from the database when the clients issue a query. This process is not efficient because queries scan unnecessary nodes when an executing a query that has conditions that it uses properties of graph components. In order to resolve this problem, we analyze how node and edge properties can be queried more efficiently while maintaining the structure of the graph. Therefore, in this study, we just propose an approach for graph data management, which separately stores nodes/edges information and property information into separate data structures. In addition, we describe a plan for conducting an evaluation of our approach because it is the proposal stage.