Skip to Main content Skip to Navigation
Conference papers

Regular Path Query Evaluation on Streaming Graphs

Anil Pacaci 1 Angela Bonifati 2, 3 Tamer Özsu 1
2 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
3 TYREX - Types and Reasoning for the Web
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We study persistent query evaluation over streaming graphs, which is becoming increasingly important. We focus on navigational queries that determine if there exists a path between two entities that satisfies a user-specified constraint. We adopt the Regular Path Query (RPQ) model that specifies navigational patterns with labeled constraints. We propose deterministic algorithms to efficiently evaluate persistent RPQs under both arbitrary and simple path semantics in a uniform manner. Experimental analysis on real and synthetic streaming graphs shows that the proposed algorithms can process up to tens of thousands of edges per second and efficiently answer RPQs that are commonly used in real-world workloads.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03118350
Contributor : Angela Bonifati Connect in order to contact the contributor
Submitted on : Friday, January 22, 2021 - 10:25:23 AM
Last modification on : Wednesday, November 3, 2021 - 6:45:50 AM

Links full text

Identifiers

Citation

Anil Pacaci, Angela Bonifati, Tamer Özsu. Regular Path Query Evaluation on Streaming Graphs. SIGMOD 2020 - ACM International Conference on Management of Data, Jun 2020, Portland, United States. pp.1415-1430, ⟨10.1145/3318464.3389733⟩. ⟨hal-03118350⟩

Share

Metrics

Les métriques sont temporairement indisponibles