A generalization of the differential approach to recursive query evaluation

DOI10.1016/0743-1066(87)90004-5MaRDI QIDQ3776676zbMATH OpenOpenAlexWikidataFDO

Authors Isaac Balbin, Kotagiri Ramamohanarao

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0743-1066(87)90004-5

zbMATH Keywords

bottom-up evaluationHorn clausesnonhierarchical databasesquery evaluationrecursively defined predicates

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 4049156
• scientific article; zbMATH DE number 4106311
• Efficient evaluation for a subset of recursive queries
• Implementation of logical query languages for databases
• On the power of magic

Cited in

(10)

• Well-founded semantics and stratification for ordered logic programs
• Subsumtion and indexing in constraint query languages with linear arithmetic constraints.
• CoLab: A hybrid knowledge representation and compilation laboratory
• HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
• On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases
• A generalized QSQR evaluation method for Horn knowledge bases
• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• scientific article; zbMATH DE number 4106311 (Why is no real title available?)
• Bottom-up evaluation and query optimization of well-founded models
• Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets

This page was built for publication: A generalization of the differential approach to recursive query evaluation

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