A Schema Extraction Algorithm for External Memory Graphs Based on Novel Utility Function
A Schema Extraction Algorithm for External Memory Graphs Based on Novel Utility Function
复制标题
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Yoshiki Sekine;Nobutaka Suzuki
中科院分区：
文献类型：
--
作者：
Yoshiki Sekine;Nobutaka Suzuki
近年来，图形数据的规模急剧增长。与关系数据库相比，大多数图没有自己的模式。如果我们能有效地从图中提取模式，我们就可以利用提取的模式进行查询优化、结构浏览、查询公式化等。该算法的设计，使每个文件被顺序读取在大多数情况下，很少的随机访问模式提取所需的，这使得我们的算法I/O效率。
In recent years, the size of graph data is drastically growing. In contrast to relational databases, most of graphs do not have their own schemas. If we can extract a schema from a graph efficiently, we can take advantage of the extracted schema for query optimization, structure browsing, query formulation, and so on. In this paper, we propose an external memory algorithm for extracting a schema from a graph. The algorithm is designed so that each file is read sequentially in most cases and very few random accesses are required for schema extraction, which makes our algorithm I/O efficient.