Top-down query processing in indefinite stratified databases

DOI10.1016/S0169-023X(97)00026-8MaRDI QIDQ3840928zbMATH OpenFDO

Authors

Publication date 13 August 1998

Published in Data & Knowledge Engineering (Search for Journal in Brave)

zbMATH Keywords

deductive databasesperfect modelstop-down query processingcyclic treesdeduction treesindefinite stratified databases

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1696727
• Top-down query processing in first-order deductive databases under the DWFS
• scientific article; zbMATH DE number 2140433
• scientific article; zbMATH DE number 1735824
• Publication:4943320

Cited in

(6)

• Top-down query processing in first-order deductive databases under the DWFS
• scientific article; zbMATH DE number 1735824 (Why is no real title available?)
• scientific article; zbMATH DE number 2140433 (Why is no real title available?)
• Efficient bottom-up computation of queries on stratified databases
• Computing only minimal answers in disjunctive deductive databases
• scientific article; zbMATH DE number 1696727 (Why is no real title available?)

This page was built for publication: Top-down query processing in indefinite stratified databases

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