面向图数据的结构化正则路径查询方法

正则路径查询是一种应用正则表达式在图数据上进行查询的技术，通常利用有限状态自动机实现查询匹配。现有正则路径查询方法的匹配结果为顶点对的序列，未能充分保留图的结构，为了解决这一问题，提出了一种面向图数据的结构化正则路径查询方法，通过在不同的序列间加以结构化约束，使得查询结果由路径转变为子图。为了实现这一目的，首先定义了一种结构化的正则路径查询语言，并设计了结构化的查询解析以及基于此结构的匹配算法。实验在模拟数据集和真实数据集上进行了测试与分析，验证了网络规模对查询速度的影响，并设置了对照实验。实验结果表明，提出方法能够在保证满足正则表达式约束的前提下实现结构化查询。

Efficient method of structured regular path query for graph data

Regular path query is a technique of using regular expressions to query graph data, usually uses finite state automata to achieve query matching. The matching result of the existing regular path query method is a sequence of vertex pairs, and the structure of the graph is not fully preserved. In order to solve this problem, this paper proposed a method of structured regular path query for graph data. By structuring constraints between different sequences, the query results could be transformed from paths to subgraphs. For this purpose, the method firstly defined a structured regular path query language, and then designed a structured query parsing and a matching algorithm based on this structure. Experimental results on simulated and real datasets verify the influence of network size on query speed. This paper compared the proposed method with the control group. Experimental results show that the proposed method can realize structured query under the premise of satisfying regular expression constraints.