Database Theory - ICDT 2005

DOI10.1007/B104421MaRDI QIDQ5316602zbMATH OpenOpenAlexFDO

Authors Gerome Miklau, Dan Suciu, Nilesh N. Dalvi

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104421

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Query evaluation on a database given by a random graph
• Asymptotic conditional probabilities: The non-unary case
• Efficient Approximations of Conjunctive Queries
• Asymptotic Conditional Probabilities: The Unary Case
• Asymptotic determinacy of path queries using union-of-paths views

Cited in

(8)

• Chance constraint as a basis for probabilistic query model
• Query evaluation on a database given by a random graph
• A method of eliminating information disclosure in view publishing
• Data Privacy for $\mathcal{ALC}$ Knowledge Bases
• Asymptotic conditional probabilities: The non-unary case
• The dichotomy of probabilistic inference for unions of conjunctive queries
• A formal analysis of information disclosure in data exchange
• Magic Sets and their application to data integration

This page was built for publication: Database Theory - ICDT 2005

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