论文标题
在知识图上具有标签和子结构约束的可及性查询
Reachability Queries with Label and Substructure Constraints on Knowledge Graphs
论文作者
论文摘要
由于知识图（kgs）描述并模拟了现实世界中实体和概念之间的关系，因此kgs的推理通常与标签和下结构约束（LSCR）的可及性查询相对应。特别是，对于搜索路径P，LSCR查询不仅要求P传递的边缘的标签在某个标签集中，而且还声称P中的顶点可以满足某些子结构约束。 LSCR查询比标签构成可达性（LCR）查询要复杂得多，并且据我们所知，在KGS上没有有效的LSCR查询解决方案。在此激励的情况下，我们引入了有关KGS，UIS和INS的此类查询的两种解决方案。前者也可以用于一般的边缘标记图，并且对于实际实现非常方便。后者是一种有效的基于本地索引的知情搜索策略。对合成和实际kgs进行了广泛的实验评估，表明我们的解决方案可以有效地处理KGS上的LSCR查询。
Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often correspond to the reachability queries with label and substructure constraints (LSCR). Specially, for a search path p, LSCR queries not only require that the labels of the edges passed by p are in a certain label set, but also claim that a vertex in p could satisfy a certain substructure constraint. LSCR queries is much more complex than the label-constraint reachability (LCR) queries, and there is no efficient solution for LSCR queries on KGs, to the best of our knowledge. Motivated by this, we introduce two solutions for such queries on KGs, UIS and INS. The former can also be utilized for general edge-labeled graphs, and is relatively handy for practical implementation. The latter is an efficient local-index-based informed search strategy. An extensive experimental evaluation, on both synthetic and real KGs, illustrates that our solutions can efficiently process LSCR queries on KGs.
