arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.01241cs.DB
收藏

时间正则路径

Temporal Regular Path Queries

Marcelo Arenas, Pedro Bahamondes, Amir Aghasadeghi, Julia Stoyanovich

摘要:

在过去的十年中,在图查询语言的语法标准化以及理解其语义和评估复杂性方面取得了实质性进展。在本文中,我们考虑时间属性图(TPG),并提出时间定期路径查询(TRPQ),将时间TPG导航。从设计原则开始,我们提出了一个自然的语法扩展的流行的图查询语言的MATCH子句。然后,我们正式提出的语义的TRPQ,并研究其评估的复杂性。我们表明,TRPQ可以在多项式时间进行评估,如果TPG的时间戳与时间点,并确定片段的TRPQ语言,承认有效的评价更简洁的间隔注释表示。最后,我们实现了一个片段的语言在一个国家的最先进的Escallow框架,并通过实验证明,TRPQ可以有效地进行评估。

英文摘要:

In the last decade, substantial progress has been made towards standardizing the syntax of graph query languages, and towards understanding their semantics and complexity of evaluation. In this paper, we consider temporal property graphs (TPGs) and propose temporal regular path queries (TRPQs) that incorporate time into TPG navigation. Starting with design principles, we propose a natural syntactic extension of the MATCH clause of popular graph query languages. We then formally present the semantics of TRPQs, and study the complexity of their evaluation. We show that TRPQs can be evaluated in polynomial time if TPGs are time-stamped with time points, and identify fragments of the TRPQ language that admit efficient evaluation over a more succinct interval-annotated representation. Finally, we implement a fragment of the language in a state-of-the-art dataflow framework, and experimentally demonstrate that TRPQ can be evaluated efficiently.

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

↑