Rewriting of regular expressions and regular path queries
type: Item
instance of: scholarly article
title: Rewriting of regular expressions and regular path queries
zbMATH Open document ID: 1015.68083
author: Diego Calvanese
author: Giuseppe De Giacomo
author: Maurizio Lenzerini
author: Moshe Y. Vardi
published in: Journal of Computer and System Sciences
publication date: 2002-09-12T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1800304
zbMATH Keywords: view-based query rewriting
Wikidata QID: Q64360103
cites work: Lorel
cites work: The undecidability of the domino problem
cites work: Q5639639
cites work: Recursive query plans for data integration
cites work: Q5592246
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q5541339
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Q4348133
describes a project that uses: Lorel
describes a project that uses: GraphLog
MaRDI profile type: Publication
full work available at URL: jcss.2001.1805
OpenAlex ID: W4212940894
DOI: 10.1006/JCSS.2001.1805
Recommended article: Q4414538
Recommended article: Rewriting extended regular expressions
Recommended article: Q4473277
Recommended article: Adding regular expressions to graph reachability and pattern queries
Recommended article: Algebraic rewritings for optimizing regular path queries.
Recommended article: Regular path expressions in feature logic
Recommended article: Regular path queries with constraints
Recommended article: Querying the Unary Negation Fragment with Regular Path Expressions.
Recommended article: Q4808694
description: scientific article; zbMATH DE number 1800304