Access the full text.
Sign up today, get DeepDyve free for 14 days.
Jean-François Baget, Meghyn Bienvenu, M. Mugnier, M. Thomazo (2017)
Answering Conjunctive Regular Path Queries over Guarded Existential Rules
P. Barceló, L. Libkin, Juan Reutter (2014)
Querying Regular Graph PatternsJ. ACM, 61
r m ′ ) is inal, if, • for every i ∈ [m ′ ], r i is the inal state of M i , • for every i, i ′ ∈ [m ′ ], y i = y i ′ implies v i = v i ′ , • for every i
Dominik Freydenberger, Nicole Schweikardt (2013)
Expressiveness and Static Analysis of Extended Conjunctive Regular Path QueriesJ. Comput. Syst. Sci., 79
Renzo Angles, Juan Reutter, H. Voigt (2019)
Graph Query LanguagesEncyclopedia of Big Data Technologies
Markus Schmid, Nicole Schweikardt (2020)
A Purely Regular Approach to Non-Regular Core Spanners
H. Fernau, Markus Schmid (2013)
Pattern matching with variables: A multivariate complexity analysis
Diego Calvanese, Giuseppe Giacomo, M. Lenzerini, Moshe Vardi (2003)
Reasoning on regular path queriesSIGMOD Rec., 32
W. Martens, Matthias Niewerth, T. Trautner (2019)
A Trichotomy for Regular Trail QueriesArXiv, abs/1903.00226
A. Mendelzon, P. Wood (1989)
Finding Regular Simple Paths in Graph DatabasesSIAM J. Comput., 24
Renzo Angles, M. Arenas, P. Barceló, A. Hogan, Juan Reutter, D. Vrgoc (2016)
Foundations of Modern Query Languages for Graph DatabasesACM Computing Surveys (CSUR), 50
P. Wood (2012)
Query languages for graph databasesSIGMOD Rec., 41
W. Martens, T. Trautner (2019)
Bridging Theory and Practice with Query Log AnalysisSIGMOD Rec., 48
Dominik Freydenberger, Markus Schmid (2018)
Deterministic Regular Expressions with Back-References
I. Cruz, A. Mendelzon, P. Wood (1987)
A graphical query language supporting recursion
D. Vrgoc (2016)
Querying Graphs with DataJournal of the ACM (JACM), 63
Meghyn Bienvenu, Magdalena Ortiz, M. Simkus (2013)
Conjunctive Regular Path Queries in Lightweight Description Logics
Grzegorz Gluch, J. Marcinkowski, Piotr Ostropolski-Nalewaja (2018)
The First Order Truth behind Undecidability of Regular Path Queries Determinacy
Diego Calvanese, Giuseppe Giacomo, M. Lenzerini, Moshe Vardi (2000)
Containment of Conjunctive Regular Path Queries with Inverse
(x i , α i , y i ) is matched to a long sub-path of (v 0 , v 1 , . . . , v t ) of length at least 2p + 1 if i ∈ L and to a short sub-path of
Meghyn Bienvenu, Magdalena Ortiz, M. Simkus (2015)
Regular Path Queries in Lightweight Description Logics: Complexity and AlgorithmsJ. Artif. Intell. Res., 53
Benjamin Carle, P. Narendran (2009)
On Extended Regular Expressions
Alin Deutsch, V. Tannen (2001)
Optimization Properties for Classes of Conjunctive Regular Path Queries
MartensWim, TrautnerTina (2019)
Dichotomies for Evaluating Simple Regular Path QueriesACM Transactions on Database Systems
Meghyn Bienvenu, M. Thomazo (2016)
On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
(2013)
S . C . Kleene . 1956 . Representation of events in nerve nets and inite automata . In Automata Studies , C . E . Shannon and J . McCarthy ( Eds . )
M. Consens, A. Mendelzon (1990)
GraphLog: a visual formalism for real life recursion
P. Barceló, Diego Figueira, M. Romero (2019)
Boundedness of Conjunctive Regular Path QueriesArXiv, abs/1904.00850
[ (2013)
SPARQL 1W3C Recommendation. Technical Reporthttps://www.w3.org/TR/sparql11-query/. W3C.
P. Barceló, Pablo Muñoz (2014)
Graph logics with rational relations: the role of word combinatoricsProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
P. Barceló, M. Romero, Moshe Vardi (2013)
Semantic acyclicity on graph databasesSIAM J. Comput., 45
A. Bonifati, W. Martens, Thomas Timm (2017)
An analytical study of large SPARQL query logsThe VLDB Journal, 29
J. Doleschal, B. Kimelfeld, W. Martens, Yoav Nahshon, F. Neven (2018)
Split-Correctness in Information ExtractionProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Diego Figueira, Adwait Godbole, S. Krishna, W. Martens, Matthias Niewerth, T. Trautner (2020)
Containment of Simple Regular Path QueriesArXiv, abs/2003.04411
D. Florescu, A. Halevy, Dan Suciu (1998)
Query containment for conjunctive queries with regular expressions
Katrin Casel, Markus Schmid (2021)
Fine-Grained Complexity of Regular Path Queries
(2016)
The Neo4j cypher manual v3
Markus Schmid (2014)
Characterising REGEX languages by regular languages equipped with factor-referencingInf. Comput., 249
Analogously as Theorem 5.1 can be obtained by using Lemma 8.4 and the transformation of Section 5.2, we can now prove an equivalent of Theorem 5.1 with respect to checking tuples
Angles Renzo (2017)
68:1–68:40ACM Comput. Surv., 50
Katja Losemann, W. Martens (2013)
The complexity of regular expressions and property paths in SPARQLACM Trans. Database Syst., 38
S. Flesca, S. Greco (2000)
Querying Graph Databases
For simplicity, we add two additional vertices s and t to G q , D with an edge (s,ū) and an edge (v, t ) for every initial vertexū and final vertexv
Markus Schmid (2019)
Conjunctive Regular Path Queries with String VariablesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
[ (2013)
Gremlin languageRetrieved from https://tinkerpop.apache.org/gremlin.html.
K. Thompson (1968)
Programming Techniques: Regular expression search algorithmCommunications of the ACM, 11
[ (2006)
Mastering Regular Expressions - Understand Your Data and Be More Productive: For Perl, PHP, Java,O’Reilly.
P. Barceló, Leonid Libkin, Anthony Lin, Peter Wood (2012)
Expressive Languages for Path Queries over Graph-Structured DataACM Trans. Database Syst., 37
Article 5. Publication date
Dominik Freydenberger (2018)
A Logic for Document SpannersTheory of Computing Systems, 63
[ (2017)
Graph logics with rational relations: The role of word combinatoricsACM Trans. Comput. Log. (TOCL), 18
Diego Figueira (2020)
Containment of UC2RPQ: The Hard and Easy Cases
Dominik Freydenberger (2012)
Extended Regular Expressions: Succinctness and DecidabilityTheory of Computing Systems, 53
Jeffrey Friedl (2006)
Mastering regular expressions - understand your data and be more productive: for Perl, PHP, Java, .NET, Ruby, and more (3. ed.)
Markus Schmid, Nicole Schweikardt (2021)
Spanner Evaluation over SLP-Compressed DocumentsProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
(2018)
Matthias Niewerth, and Pawel Parys
Wojciech Czerwinski, W. Martens, Matthias Niewerth, P. Parys (2018)
Minimization of Tree PatternsJournal of the ACM (JACM), 65
Dominik Freydenberger, B. Kimelfeld, L. Peterfreund (2017)
Joining Extractions of Regular ExpressionsProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
(2013)
SPARQL 1.1 Query Language. W3C Recommendation
Guillaume Bagan, A. Bonifati, B. Groz (2012)
A trichotomy for regular simple path queries on graphsArXiv, abs/1212.6857
[ (2019)
Deterministic regular expressions with back-referencesJ. Comput. Syst. Sci, 105
W. Martens, T. Trautner (2018)
Evaluation and Enumeration Problems for Regular Path Queries
Egor Kostylev, Juan Reutter, D. Vrgoc (2018)
Containment of queries for graphs with dataJ. Comput. Syst. Sci., 92
W. Martens, T. Trautner (2019)
Dichotomies for Evaluating Simple Regular Path QueriesACM Transactions on Database Systems (TODS), 44
S. Kleene (1951)
Representation of Events in Nerve Nets and Finite Automata
C. Câmpeanu, K. Salomaa, Sheng Yu (2003)
A Formal Study Of Practical Regular ExpressionsInt. J. Found. Comput. Sci., 14
M. Romero, P. Barceló, Moshe Vardi (2017)
The homomorphism problem for regular graph patterns2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Juan Reutter, M. Romero, Moshe Vardi (2017)
Regular Queries on Graph DatabasesTheory of Computing Systems, 61
In practice, regular expressions are usually extended by so-called capture groups or capture variables, which allow to capture a subexpression by a variable that can be referenced in the regular expression in order to describe repetitions of subwords. We investigate how this concept could be used for pattern-based graph querying; i.e., we investigate conjunctive regular path queries (CRPQs) that are extended by capture variables.If capture variables are added to CRPQs in a completely unrestricted way, then Boolean evaluation becomes PSPACE-hard in data complexity, even for single-edge graph patterns. On the other hand, if capture variables do not occur under a Kleene star, then the data complexity drops to NL-completeness. Combined complexity is in EXPSPACE but drops to PSPACE-completeness if the depth (i.e., the nesting depth of capture variables) is bounded, and it drops to NP-completeness if the size of the images of capture variables is bounded by a constant (regardless of the depth or of whether capture variables occur under a Kleene star).In the application of regular expressions as string searching tools, references to capture variables only describe exact repetitions of subwords (i.e., they implement the equality relation on strings). Following recent developments in graph database research, we also study CRPQs with capture variables that describe arbitrary regular relations. We show that if the expressions have depth 0, or if the size of the images of capture variables is bounded by a constant, then we can allow arbitrary regular relations while staying in the same complexity bounds. We also investigate the problems of checking whether a given tuple is in the solution set and computing the whole solution set.On the conceptual side, we add capture variables to CRPQs in such a way that they can be defined in an expression on one arc of the graph pattern but also referenced in expressions on other arcs. Hence, they add to CRPQs the possibility to define inter-dependencies between different paths, which is a relevant feature of pattern-based graph querying.
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: May 23, 2022
Keywords: Graph databases
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.