Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)
Xiaolong Wan, Hongzhi Wang · 2023
Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often corresponds to the r eachability queries with l abel and s ubstructure c onstraints (LSCR queries). Specifically, for a search path p , LSCR queries not only require that the labels of the edges passed by p are in a label set, but also claim that a vertex in p could satisfy a substructure constraint.