Labelling-Scheme-based Subgraph Query Processing on Graph Data

Graph Data Management Pub Date : 1900-01-01 DOI:10.4018/978-1-61350-053-8.ch007

Hongzhi Wang, Jianzhong Li, Hong Gao

引用次数: 1

Abstract

When data are modeled as graphs, many research issues arise. In particular, there are many new challenges in query processing on graph data. This chapter studies the problem of structural queries on graph data. A hash-based structural join algorithm, HGJoin, is first proposed to handle reachability queries on graph data. Then, it is extended to the algorithms to process structural queries in form of bipartite graphs. Finally, based on these algorithms, a strategy to process subgraph queries in form of general DAGs is proposed. It is notable that all the algorithms above can be slightly modified to process structural queries in form of general graphs. DOI: 10.4018/978-1-61350-053-8.ch007

查看原文本刊更多论文

基于标记方案的图数据子图查询处理

当数据被建模为图形时，会产生许多研究问题。特别是在图数据的查询处理方面，出现了许多新的挑战。本章研究图数据的结构查询问题。首先提出了一种基于散列的结构连接算法HGJoin，用于处理图数据的可达性查询。然后，将其扩展到处理二部图形式的结构查询的算法。最后，在这些算法的基础上，提出了一种以通用dag形式处理子图查询的策略。值得注意的是，上述所有算法都可以稍加修改，以处理一般图形式的结构查询。DOI: 10.4018 / 978 - 1 - 61350 - 053 - 8. - ch007

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Graph Data Management

自引率

0.00%

发文量