An incremental algorithm for computing ranked full disjunctions

DOI10.1016/J.JCSS.2006.10.015MaRDI QIDQ882441zbMATH OpenOpenAlexFDO

Authors Yehoshua Sagiv, Sara Cohen

Publication date 23 May 2007

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

Full work available at URL https://doi.org/10.1016/j.jcss.2006.10.015

zbMATH Keywords

rankingincomplete informationquery processingapproximatenull valuesfull disjunctionouter-join

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Database theory (68P15)

Recommendations

• An algorithm for disjunctive programs
• On the rank of disjunctive cuts
• Algorithmic aspects of disjunctive domination in graphs
• Algorithmic aspects of disjunctive total domination in graphs
• scientific article; zbMATH DE number 1213132
• On the complexity of selecting disjunctions in integer programming
• Theory and algorithms for disjunctive deductive databases
• scientific article; zbMATH DE number 512869

Cites work

• Database Theory - ICDT 2005
• On generating all maximal independent sets
• On the Complexity of Testing Implications of Functional and Join Dependencies

This page was built for publication: An incremental algorithm for computing ranked full disjunctions

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