Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1112.68363OpenAlexW4232873349MaRDI QIDQ5316602FDOQ5316602

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

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

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (8)

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

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)