再论图模式的包容性
Revisited Containment for Graph Patterns
摘要:
我们考虑一类条件图模式(\emph{CGPs}),允许用户查询数据图与复杂的模式,包含否定和谓词。为了克服子图同构的代价过高,我们考虑在二次时间内进行的模拟语义下的\emph{CGPs}匹配。在新兴的应用中,人们希望减少更多的匹配时间,并且模式的静态分析可以允许确保部分减少。我们研究\emph{CGPs}的包含问题,旨在检查任何数据图上某些模式$P_1$的匹配是否包含在另一个模式$P_2$(写为$P_1\sqsubseteq P_2$)的匹配中。优化过程包括仅从$P_2$的匹配中提取$P_1$的匹配,而不查询(可能很大的)数据图。我们证明了传统的包含语义在二次时间上是可判定的,但在否定和谓词存在的情况下,它不能满足优化目标。为了克服这一限制,我们提出了一个新的语义遏制,称为\emph{strong containment},这是更适合于\emph{CGPs},并允许减少匹配时间。我们表明,\emph{strong containment}可以决定在立方时间,通过提供这样的算法。我们计划使用本文的结果来回答\emph{CGPs}使用视图。本文是一个正在进行的项目,旨在设计一个复杂的图形模式的缓存系统的一部分。
英文摘要:
We consider the class of conditional graph patterns (\emph{CGPs}) that allow user to query data graphs with complex patterns that contain negation and predicates. To overcome the prohibitive cost of subgraph isomorphism, we consider matching of \emph{CGPs} under simulation semantics which can be conducted in quadratic time. In emerging applications, one would like to reduce more this matching time, and the static analysis of patterns may allow ensuring part of this reduction. We study the containment problem of \emph{CGPs} that aims to check whether the matches of some pattern $P_1$, over any data graph, are contained in those of another pattern $P_2$ (written $P_1\sqsubseteq P_2$). The optimization process consists to extract matches of $P_1$ only from those of $P_2$ without querying the (possibly large) data graph. We show that the traditional semantics of containment is decidable in quadratic time, but it fails to meet the optimization goal in the presence of negation and predicates. To overcome this limit, we propose a new semantics of containment, called \emph{strong containment}, that is more suitable for \emph{CGPs} and allows to reduce their matching time. We show that \emph{strong containment} can be decided in cubic time by providing such an algorithm. We are planing to use results of this paper to answer \emph{CGPs} using views. This paper is part of an ongoing project that aims to design a caching system for complex graph patterns.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。