Learning and Verifying Quantified Boolean Queries by Example
Databases
2013-04-17 v1
Abstract
To help a user specify and verify quantified queries --- a class of database queries known to be very challenging for all but the most expert users --- one can question the user on whether certain data objects are answers or non-answers to her intended query. In this paper, we analyze the number of questions needed to learn or verify qhorn queries, a special class of Boolean quantified queries whose underlying form is conjunctions of quantified Horn expressions. We provide optimal polynomial-question and polynomial-time learning and verification algorithms for two subclasses of the class qhorn with upper constant limits on a query's causal density.
Cite
@article{arxiv.1304.4303,
title = {Learning and Verifying Quantified Boolean Queries by Example},
author = {Azza Abouzied and Dana Angluin and Christos Papadimitriou and Joseph M. Hellerstein and Avi Silberschatz},
journal= {arXiv preprint arXiv:1304.4303},
year = {2013}
}
Comments
Extended Version of PODS 2013 paper