Learning and Verifying Quantified Boolean Queries by Example

Provided by: Association for Computing Machinery
Topic: Big Data
Format: PDF
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 their intended query. In this paper, the authors 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.

Find By Topic