Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract).
IEEE Transactions on Knowledge and Data Engineering(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.
更多查看译文
关键词
Knowledge graph,reachability query,label constraint,substructure constraint
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要