Rewriting of regular expressions and regular path queries
From MaRDI portal
Publication:696951
DOI10.1006/JCSS.2001.1805zbMATH Open1015.68083OpenAlexW4212940894WikidataQ64360103 ScholiaQ64360103MaRDI QIDQ696951FDOQ696951
Authors: Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi 
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
Recommendations
- scientific article; zbMATH DE number 1953135
- Rewriting extended regular expressions
- scientific article; zbMATH DE number 2080479
- Adding regular expressions to graph reachability and pattern queries
- Algebraic rewritings for optimizing regular path queries.
- Regular path expressions in feature logic
- Regular path expressions in feature logic
- Regular path queries with constraints
- Querying the unary negation fragment with regular path expressions
- scientific article; zbMATH DE number 2090027
Cites Work
- Lorel
- Relationships between nondeterministic and deterministic tape complexities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the domino problem
- Recursive query plans for data integration
- Title not available (Why is that?)
- Space-bounded reducibility among combinatorial problems
Cited In (38)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of RDF Databases
- Document spanners: a formal approach to information extraction
- View-based tree-language rewritings for XML
- View-based query answering in description logics: semantics and complexity
- The View Selection Problem for Regular Path Queries
- A note on the expressibility problem for modal logics and star-free regular expressions
- View-based query processing: on the relationship between rewriting, answering and losslessness
- Navigational and rule-based languages for graph databases
- Querying best paths in graph databases
- Algebraic rewritings for optimizing regular path queries.
- Fault-tolerant computation of distributed regular path queries
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- Regular path queries under approximate semantics
- The first-order truth behind undecidability of regular path queries determinacy
- Static analysis of XML security views and query rewriting
- Closure properties and complexity of rational sets of regular languages
- Regular queries on graph databases
- Reasoning and query answering in description logics
- Querying regular graph patterns
- Database Theory - ICDT 2005
- Graph logics with rational relations: the role of word combinatorics
- Title not available (Why is that?)
- Inputs, Outputs, and Composition in the Logic of Information Flows
- Semantic acyclicity on graph databases
- Determinacy and query rewriting for conjunctive queries and views
- Title not available (Why is that?)
- Answering regular path queries in expressive description logics via alternating tree-automata
- Efficiently deciding \(\mu\)-calculus with converse over finite trees
- Title not available (Why is that?)
- Rewriting of visibly pushdown languages for XML data integration
- Regular expressions for data words
- Bounded regular path queries in view-based data integration
- On the data complexity of consistent query answering over graph databases
- Federation and navigation in SPARQL 1.1
- On simplification of schema mappings
Uses Software
This page was built for publication: Rewriting of regular expressions and regular path queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696951)
