Abstract

Graph data models are widely employed in different areas of computer science, e.g., graph databases, bioinformatics, social network analysis, and static code analysis. Querying for specific paths is one of the main problems solved in graph data analysis. Path queries are usually performed by means of a formal grammar that describes admissible edge labeling of the paths. A path query is said to be calculated using relational query semantics if it is evaluated to a triple (A, \({{{v}}_{1}}\), \({{{v}}_{2}}\)) such that there is a path from \({{{v}}_{1}}\) to \({{{v}}_{2}}\) and the concatenation of the edge labels along this path forms a string derivable from the nonterminal A. With the regular and context-free languages having limited expressive power, we focus on more expressive languages, namely, Boolean languages that use Boolean grammars to describe path labeling. Even though path querying using relational query semantics and Boolean grammars is known to be undecidable, in this paper, we propose a path querying algorithm on acyclic directed graphs that uses relational query semantics and Boolean grammars for approximate solution of the path querying problem. To achieve better performance as compared to the naive algorithm, the classes of graphs considered in this paper are limited to acyclic graphs.

中文翻译：

---

使用布尔文法在非循环图上进行路径查询

摘要

图形数据模型广泛应用于计算机科学的不同领域，例如图形数据库，生物信息学，社交网络分析和静态代码分析。查询特定路径是图形数据分析中解决的主要问题之一。路径查询通常通过描述路径的可接受边缘标记的形式语法来执行。如果将路径查询评估为三元组（A，\（{{{v}} _ {1}} \），\（{{{v}} _ {2} } \）），这样就存在从\（{{{v}} _ {1}} \）到\（{{{vv}} _ {2}} \\）的路径，并且边缘标签沿着此路径形成可从非终端A派生的字符串。在具有有限表达能力的常规语言和无上下文语言的情况下，我们将重点放在更具表达力的语言上，即使用布尔语法描述路径标签的布尔语言。尽管已知使用关系查询语义和布尔语法的路径查询是不确定的，但在本文中，我们还是针对非循环有向图提出了一种路径查询算法，该算法使用关系查询语义和布尔语法来近似解决路径查询问题。与朴素算法相比，为了获得更好的性能，本文考虑的图类仅限于非循环图。