Deductive database development with optimization

MaRDI QIDQ2763601zbMATH OpenFDO

Authors Dragana Djurić, Gordana Pavlović-Lažetić

Publication date 20 January 2002

zbMATH Keywords

prolog-likequerySQL

Mathematics Subject Classification ID

Database theory (68P15)

Review text

In order to find an answer to a query of the form \(W(x_1,\dots,x_n)\) the authors propose two steps: \(1^0\) using Naive or Semi-Naive or Henschen-Naqvi method construct the set \(S\) of derived relations; \(2^0\) translate \(S\) into \(SQL\) and by \(SQL\)-processor find the proper answer. However, is it practical to performe both such steps, in the case when \(S\) has a large number of elements?NEWLINENEWLINEFor the entire collection see [Zbl 0977.00022].

Recommendations

• Fixpoint strategies for deductive databases
• scientific article; zbMATH DE number 4049158
• scientific article; zbMATH DE number 4106311
• An approach on semantic query optimization for deductive databases
• Partial evaluation of queries in deductive databases

Cited in

(3)

• scientific article; zbMATH DE number 4049158 (Why is no real title available?)
• scientific article; zbMATH DE number 1416103 (Why is no real title available?)
• An approach on semantic query optimization for deductive databases

This page was built for publication: Deductive database development with optimization

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