Pushing constraint selections

DOI10.1016/0743-1066(93)90048-LMaRDI QIDQ5289313zbMATH OpenWikidataFDO

Authors Divesh Srivastava, Raghu Ramakrishnan

Publication date 23 August 1993

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

Full work available at URL https://doi.org/10.1016/0743-1066(93)90048-L

zbMATH Keywords

constraint informationconstraint propagationconstraint query languagemagic templates transformation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Database theory (68P15)

Recommendations

• Optimizing bottom-up evaluation of constraint queries
• Magic templates: a spellbinding approach to logic programs
• Memoing evaluation for constraint extensions of datalog
• Implementation alternatives for bottom-up evaluation

Cited in

(10)

• Speeding up inferences using relevance reasoning: a formalism and algorithms
• Foundations of aggregation constraints
• Subsumtion and indexing in constraint query languages with linear arithmetic constraints.
• Memoing evaluation for constraint extensions of datalog
• scientific article; zbMATH DE number 1696812 (Why is no real title available?)
• Optimizing bottom-up evaluation of constraint queries
• scientific article; zbMATH DE number 1980928 (Why is no real title available?)
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Optimization of bound disjunctive queries with constraints
• Preference queries in deductive databases

This page was built for publication: Pushing constraint selections

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