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

在图查询中集成连接搜索

Integrating connection search in graph queries

Oracle(甲骨文公司);Ecole Polytechnique(巴黎综合理工学院);Inria(法国国家信息与自动化研究所);IPP(巴黎理工学院)

Angelos Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty

摘要:

图形数据管理和查询有很多实际应用。当图非常异构和/或用户不熟悉其结构时,他们可能需要找到两组或更多组节点在图中是如何连接的,即使用户无法描述这些连接。现有的查询语言只部分支持这一点,它们允许搜索路径,但不支持搜索连接三个或更多节点组的树。后者与NP-难群斯坦纳树问题有关,并且先前已被考虑用于数据库中的关键字搜索。在这项工作中,我们正式展示了如何将连接树模式(简称CTP)集成到图查询语言(如SPARQL或Cypher)中,从而形成扩展查询语言(简称EQL)。然后,我们研究了一套算法,用于评估CTP,我们概括了以前的关键字搜索工作,最重要的是(i)考虑双向边遍历和(ii)允许用户选择任何评分函数排名CTP结果。为了应付非常大的搜索空间,我们提出了一个有效的修剪技术,并正式建立了一个大的情况下,我们的算法,MOLESP,即使修剪是完整的。我们的实验验证了我们的CTP和EQL评估算法在大量合成和真实工作负载上的性能。

英文摘要:

Graph data management and querying has many practical applications. When graphs are very heterogeneous and/or users are unfamiliar with their structure, they may need to find how two or more groups of nodes are connected in a graph, even when users are not able to describe the connections. This is only partially supported by existing query languages, which allow searching for paths, but not for trees connecting three or more node groups. The latter is related to the NP-hard Group Steiner Tree problem, and has been previously considered for keyword search in databases. In this work, we formally show how to integrate connecting tree patterns (CTPs, in short) within a graph query language such as SPARQL or Cypher, leading to an Extended Query Language (or EQL, in short). We then study a set of algorithms for evaluating CTPs; we generalize prior keyword search work, most importantly by (i) considering bidirectional edge traversal and (ii) allowing users to select any score function for ranking CTP results. To cope with very large search spaces, we propose an efficient pruning technique and formally establish a large set of cases where our algorithm, MOLESP, is complete even with pruning. Our experiments validate the performance of our CTP and EQL evaluation algorithms on a large set of synthetic and real-world workloads.

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

↑