Integrating Connection Search in Graph Queries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2023

Integrating Connection Search in Graph Queries

Intégration de la recherche de connexion dans les requêtes de graphe

Abstract

When graph database users explore unfamiliar graphs, potentially with heterogeneous structure, users 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. In this work, we formally show how to integrate connecting tree patterns (CTPs, in short) with a graph query language such as GPML, SPARQL or Cypher, leading to Extended Queries (or EQs, in short). We then study a set of algorithms for evaluating CTPs; we generalize prior keyword search work to be complete, most importantly by (i) considering bidirectional edge traversal, (ii) allowing users to select any score function for ranking CTP results and (iii) returning all results. To cope with very large search spaces, we propose efficient pruning techniques and formally establish a large set of cases where our best algorithm, MOLESP, is complete even with pruning. Our experiments validate the performance of our algorithms on many synthetic and real-world workloads.
Fichier principal
Vignette du fichier
molesp-tech-report.pdf (749.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03923293 , version 1 (04-01-2023)
hal-03923293 , version 2 (06-01-2023)

Identifiers

  • HAL Id : hal-03923293 , version 2

Cite

Angelos Christos Anadiotis, Ioana Manolescu, Madhulika Mohanty. Integrating Connection Search in Graph Queries. Inria Saclay - Île de France. 2023. ⟨hal-03923293v2⟩
145 View
97 Download

Share

Gmail Facebook X LinkedIn More