On the expected size of recursive datalog queries

DOI10.1006/JCSS.1995.1057zbMATH Open0831.68055OpenAlexW3150450481MaRDI QIDQ1900920FDOQ1900920

Authors: Yanyan Li 

Publication date: 25 October 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/59468

Recommendations

• Datalog and recursive query processing
• An analysis of magic sets and related optimization strategies for logic queries
• Translation of logic programs into functional fixpoint equations
• Fixpoint strategies for deductive databases
• Efficient evaluation for a subset of recursive queries

zbMATH Keywords

magic setsdatalogfactoring rewriting algorithms

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Grammars and rewriting systems (68Q42)

Cited In (4)

• Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA)
• Maintenance of datalog materialisations revisited
• Mathematical Foundations of Computer Science 2005
• Title not available (Why is that?)

Uses Software

• Datalog

This page was built for publication: On the expected size of recursive datalog queries

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