重新审视数据图查询的表达力格局
Revisiting the Expressiveness Landscape of Data Graph Queries
AI总结：
本文通过研究三种主要图查询语言家族（正则路径查询、游走逻辑、带传递闭包的一阶逻辑）在数据图上的表达力，并证明带正则路径比较和传递闭包的正则路径查询扩展能统一它们的表达力。
摘要：
数据库理论中对图查询的研究已跨越三十多年，产生了众多图查询语言的提议。我们可以识别出三个主要的语言家族，其典型代表为：(1) 正则路径查询，(2) 游走逻辑，以及 (3) 带传递闭包算子的一阶逻辑。本文提供了这些语言在数据图上下文中表达力的完整图景。具体来说，我们考虑一种支持对数据和拓扑进行查询的图数据模型。例如，“社交网络中是否存在两个不同姓氏的人之间的路径？”。我们还表明，(1) 的扩展——带有正则路径比较并增加传递闭包算子——能够统一 (1)-(3) 的表达力。
英文摘要：
The study of graph queries in database theory has spanned more than three decades, resulting in a multitude of proposals for graph query languages. We can identify three main families of languages, with the canonical representatives being: (1) regular path queries, (2) walk logic, and (3) first-order logic with transitive closure operators. This paper provides a complete picture of the expressive power of these languages in the context of data graphs. Specifically, we consider a graph data model that supports querying over both data and topology. For example, ``Does there exist a path between two different persons in a social network with the same last name?''. We also show that an extension of (1) with regular path comparisons, augmented with transitive closure operators, can unify the expressivity of (1)--(3).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
