Pushing constraint selections

DOI10.1016/0743-1066(93)90048-LzbMATH Open0805.68035WikidataQ126989221 ScholiaQ126989221MaRDI QIDQ5289313FDOQ5289313

Authors: Divesh Srivastava, Raghu Ramakrishnan 

Publication date: 23 August 1993

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

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

zbMATH Keywords

constraint propagationmagic templates transformationconstraint informationconstraint query language

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Preference queries in deductive databases
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• Optimization of bound disjunctive queries with constraints
• Title not available (Why is that?)
• Subsumtion and indexing in constraint query languages with linear arithmetic constraints.
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Foundations of aggregation constraints

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)