Rewriting of regular expressions and regular path queries

DOI10.1006/jcss.2001.1805zbMath1015.68083OpenAlexW4212940894WikidataQ64360103 ScholiaQ64360103MaRDI QIDQ696951

Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi, Diego Calvanese

Publication date: 12 September 2002

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

Full work available at URL: https://doi.org/10.1006/jcss.2001.1805

zbMATH Keywords

view-based query rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (32)

On the data complexity of consistent query answering over graph databases ⋮ On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Semantic Acyclicity on Graph Databases ⋮ Querying Regular Graph Patterns ⋮ View-based query processing: on the relationship between rewriting, answering and losslessness ⋮ Regular queries on graph databases ⋮ On simplification of schema mappings ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Inputs, Outputs, and Composition in the Logic of Information Flows ⋮ Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ Algebraic rewritings for optimizing regular path queries. ⋮ View-based query answering in description logics: semantics and complexity ⋮ Determinacy and query rewriting for conjunctive queries and views ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ Static analysis of XML security views and query rewriting ⋮ Reasoning and Query Answering in Description Logics ⋮ Federation and Navigation in SPARQL 1.1 ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ A note on the expressibility problem for modal logics and star-free regular expressions ⋮ Regular path queries under approximate semantics ⋮ Rewriting of visibly pushdown languages for XML data integration ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounded regular path queries in view-based data integration ⋮ Document Spanners ⋮ Fault-tolerant computation of distributed regular path queries ⋮ The View Selection Problem for Regular Path Queries ⋮ Graph Logics with Rational Relations ⋮ Foundations of RDF Databases ⋮ MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES ⋮ Unnamed Item ⋮ Regular expressions for data words

Uses Software

• GraphLog
• Lorel

Cites Work

• Lorel
• Space-bounded reducibility among combinatorial problems
• Relationships between nondeterministic and deterministic tape complexities
• Recursive query plans for data integration
• The undecidability of the domino problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewriting of regular expressions and regular path queries