正则路径查询的细粒度复杂度
Fine-Grained Complexity of Regular Path Queries
AI总结:
本文研究了正则路径查询(RPQ)评估中乘积图(PG)方法的最优性,通过细粒度复杂度框架分析了其上下界,并探索了实现次线性延迟枚举的三种方法。
摘要:
正则路径查询(RPQ)是一个正则表达式 q,它从图数据库中返回所有由一个带有 L(q) 中单词标记的任意路径连接的节点对 (u, v)。评估 RPQ 的明显算法方法(称为 PG 方法),即在一个 q 的 NFA 和图数据库之间构建乘积图,因其简单性而具有吸引力,并且也产生了高效的算法。然而,目前尚不清楚 PG 方法是否是最优的。我们通过彻底调查 PG 方法可以实现哪些上限复杂度界限来解决这个问题,并且我们用条件性下限(在细粒度复杂度框架的意义上)来补充这些界限。特别关注枚举和延迟界限,以及数据复杂度视角。一个主要见解是,我们可以用 PG 方法实现最优(或接近最优)的算法,但枚举的延迟相当高(与数据库成线性关系)。我们探索了三种成功的实现具有次线性延迟的枚举方法:超线性预处理,解决方案集的近似,以及受限的 RPQ 类。
英文摘要:
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q). The obvious algorithmic approach to RPQ-evaluation (called PG-approach), i.e., constructing the product graph between an NFA for q and the graph database, is appealing due to its simplicity and also leads to efficient algorithms. However, it is unclear whether the PG-approach is optimal. We address this question by thoroughly investigating which upper complexity bounds can be achieved by the PG-approach, and we complement these with conditional lower bounds (in the sense of the fine-grained complexity framework). A special focus is put on enumeration and delay bounds, as well as the data complexity perspective. A main insight is that we can achieve optimal (or near optimal) algorithms with the PG-approach, but the delay for enumeration is rather high (linear in the database). We explore three successful approaches towards enumeration with sub-linear delay: super-linear preprocessing, approximations of the solution sets, and restricted classes of RPQs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。