arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.07911cs.DBcs.LO
收藏

含数据图的可表达路图

Expressive Path Queries on Graph with Data

Pablo Barcelo, Gaelle Fontaine, Anthony Widjaja Lin

摘要:

图数据模型由于其应用近来已经变得流行,例如,在社交网络和语义网中。图数据库上的典型导航查询语言-例如合取正则路径查询(CRPQ)-不能表达底层数据和拓扑之间的交互的相关属性。最近提出了两种语言来克服这个问题:遍历逻辑(WL)和带内存的正则表达式(REM)。在本文中,我们首先研究WL和REM的基本性质,即,评价问题的复杂性和表达能力。我们首先表明,WL的数据复杂性是非初等的,这排除了它的实用性。另一方面,虽然REM具有较低的数据复杂性,我们指出,许多自然的数据/拓扑性质的图表示在WL不能表示在REM。为此,我们提出了寄存器逻辑,REM的扩展,我们表明,能够表达许多自然的图形属性可在WL中表达,而在同一时间保留的元素的数据复杂性的REM。在表现力方面也是WL无法比拟的。

英文摘要:

Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases - such as Conjunctive Regular Path Queries (CRPQs) - cannot express relevant properties of the interaction between the underlying data and the topology. Two languages have been recently proposed to overcome this problem: walk logic (WL) and regular expressions with memory (REM). In this paper, we begin by investigating fundamental properties of WL and REM, i.e., complexity of evaluation problems and expressive power. We first show that the data complexity of WL is nonelementary, which rules out its practicality. On the other hand, while REM has low data complexity, we point out that many natural data/topology properties of graphs expressible in WL cannot be expressed in REM. To this end, we propose register logic, an extension of REM, which we show to be able to express many natural graph properties expressible in WL, while at the same time preserving the elementariness of data complexity of REMs. It is also incomparable to WL in terms of expressive power.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑