Efficient evaluation for a subset of recursive queries

DOI10.1016/0743-1066(91)90039-RzbMATH Open0722.68020MaRDI QIDQ3210148FDOQ3210148

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

Publication date: 1991

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

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

zbMATH Keywords

evaluationDatalog programrecursive querieslogic databasesbinary- chain program

Mathematics Subject Classification ID

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

Cited In (15)

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

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)