Expressiveness and static analysis of extended conjunctive regular path queries

DOI10.1016/j.jcss.2013.01.008zbMath1409.68082OpenAlexW2128315929MaRDI QIDQ389234

Nicole Schweikardt, Dominik D. Freydenberger

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)

Related Items

Document spanners: from expressive power to decision problems, Expressiveness and static analysis of extended conjunctive regular path queries, Conjunctive Visibly-Pushdown Path Queries, Fine-Grained Complexity of Regular Path Queries, Foundations of graph path query languages. Course notes for the reasoning web summer school 2021, Deterministic regular expressions with back-references, A logic for document spanners

Uses Software

• ALGOL 60

Cites Work

• Expressiveness and static analysis of extended conjunctive regular path queries
• On Goedel speed-up and succinctness of language representations
• Elements of finite model theory.
• Languages with homomorphic replacements
• Theory of computation.
• Extended Regular Expressions: Succinctness and Decidability
• Bounded Algol-Like Languages
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item