Efficient evaluation for a subset of recursive queries

DOI10.1016/0743-1066(91)90039-RMaRDI QIDQ3210148zbMATHFDO

Authors Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen

Publication date 1991

Published in The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

evaluationDatalog programrecursive querieslogic databasesbinary- chain program

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1406216
• Grammars and automata to optimize chain logic queries
• Chase of recursive queries
• On the bottom-up evaluation of recursive queries
• Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets

Cited in

(15)

• Chase of recursive queries
• The pushdown method to optimize chain logic programs
• Characterization and processing of simple prefixed-chain recursion
• Grammars and automata to optimize chain logic queries
• Implementation of logical query languages for databases
• On the graph traversal method for evaluating linear binary-chain programs
• On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases
• scientific article; zbMATH DE number 4035216 (Why is no real title available?)
• On the expected size of recursive datalog queries
• Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets
• A generalization of the differential approach to recursive query evaluation
• A graph-based decomposition approach for recursive query processing
• scientific article; zbMATH DE number 1950277 (Why is no real title available?)
• Minimizing function-free recursive inference rules
• Logic Programming

This page was built for publication: Efficient evaluation for a subset of recursive queries

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