Expressiveness and static analysis of extended conjunctive regular path queries

DOI10.1016/J.JCSS.2013.01.008MaRDI QIDQ389234zbMATH OpenOpenAlexFDO

Authors Dominik D. Freydenberger, Nicole Schweikardt

Publication date 20 January 2014

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2013.01.008

zbMATH Keywords

conjunctive queriesgraph databasesquery containmentregular path queriesregular relations

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Static analysis of navigational XPath over graph databases
• Conjunctive visibly-pushdown path queries
• scientific article; zbMATH DE number 2241907
• Regular queries on graph databases
• Regular queries on graph databases

Cites work

• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Bounded Algol-Like Languages
• Elements of automata theory. Translated from the French by Reuben Thomas
• Elements of finite model theory.
• Expressiveness and static analysis of extended conjunctive regular path queries
• Extended Regular Expressions: Succinctness and Decidability
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• scientific article; zbMATH DE number 2150289 (Why is no real title available?)
• scientific article; zbMATH DE number 2241907 (Why is no real title available?)
• Languages with homomorphic replacements
• On Goedel speed-up and succinctness of language representations
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
• Theory of computation.

Cited in

(17)

• Document spanners: from expressive power to decision problems
• Path querying on acyclic graphs using Boolean grammars
• Context-free path querying by Kronecker product
• Deterministic regular expressions with back-references
• A logic for document spanners
• Static analysis of navigational XPath over graph databases
• Conjunctive visibly-pushdown path queries
• scientific article; zbMATH DE number 5808834 (Why is no real title available?)
• Expressiveness and static analysis of extended conjunctive regular path queries
• Boundedness of conjunctive regular path queries
• On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
• scientific article; zbMATH DE number 2241907 (Why is no real title available?)
• Fine-Grained Complexity of Regular Path Queries
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
• Fine-grained complexity of regular path queries
• The equivalence problem of E-pattern languages with length constraints is undecidable
• The equivalence problem of E-pattern languages with regular constraints is undecidable

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Expressiveness and static analysis of extended conjunctive regular path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389234)