Recursive queries and context-free graph grammars

DOI10.1016/0304-3975(51)90009-6MaRDI QIDQ753477zbMATH OpenOpenAlexFDO

Authors Bruno Courcelle

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(51)90009-6

zbMATH Keywords

relational databaserecursive queriescomputation graphs of the querycontext-free graph grammar

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4106286
• Compositional semantics of the recursive queries in languages similar to SQL
• Recursively indefinite databases
• scientific article; zbMATH DE number 1222556
• Publication:4942633

Cites work

• scientific article; zbMATH DE number 4049097 (Why is no real title available?)
• scientific article; zbMATH DE number 4049098 (Why is no real title available?)
• scientific article; zbMATH DE number 4106286 (Why is no real title available?)
• scientific article; zbMATH DE number 44213 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• Algebraic automata and context-free sets
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Fixed point theorems and semantics: A folk tale
• Graph expressions and graph rewritings
• Recursive query processing: The power of logic
• The Semantics of Predicate Logic as a Programming Language
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Translation of logic programs into functional fixpoint equations

Cited in

(15)

• Structural recursion as a query language on lists and ordered trees
• On the equivalence of recursive and nonrecursive Datalog programs
• Expressiveness of structured document query languages based on attribute grammars
• Context-free path querying by Kronecker product
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Path querying on acyclic graphs using Boolean grammars
• A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs
• Compositional semantics of the recursive queries in languages similar to SQL
• Recursively indefinite databases
• Advances in Databases and Information Systems
• Regular queries on graph databases
• Containment of monadic Datalog programs via bounded clique-width
• Navigational and rule-based languages for graph databases
• scientific article; zbMATH DE number 4106286 (Why is no real title available?)
• scientific article; zbMATH DE number 1414296 (Why is no real title available?)

This page was built for publication: Recursive queries and context-free graph grammars

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