An incremental algorithm for computing ranked full disjunctions

DOI10.1016/j.jcss.2006.10.015zbMath1115.68161OpenAlexW1965761777MaRDI QIDQ882441

Yehoshua Sagiv, Sara A. 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

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

Cites Work

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