Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 2013
DOI: 10.1145/2463664.2465220
|View full text |Cite
|
Sign up to set email alerts
|

Learning and verifying quantified boolean queries by example

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-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
42
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 60 publications
(43 citation statements)
references
References 28 publications
1
42
0
Order By: Relevance
“…These works do not focus on predicting user interests or "similar" data tuples. In [20] they require the user to specify in advance the attributes and value assignments used to learn queries, which are assumptions we cannot make in our work. Finally, our vision for automatic, interactive navigation in databases was first introduced in [21].…”
Section: Related Workmentioning
confidence: 99%
“…These works do not focus on predicting user interests or "similar" data tuples. In [20] they require the user to specify in advance the attributes and value assignments used to learn queries, which are assumptions we cannot make in our work. Finally, our vision for automatic, interactive navigation in databases was first introduced in [21].…”
Section: Related Workmentioning
confidence: 99%
“…Query learning: Database community has proposed several systems that help the DBMS learn the user's information need by showing examples to the user and collecting her feedback [2,8,19,41,61]. In these systems, a user explicitly teaches the system by labeling a set of examples potentially in several steps without getting any answer to her information need.…”
Section: Related Workmentioning
confidence: 99%
“…The instantiation of our paradigm for learning relational queries [11,12] follows a very recent line of research [39,34,18] from which we differ in two ways: (i) we assume no knowledge of the database schema, and (ii) we do not have an initial query output to start with and we discover it from user interactions. Another work strongly related to ours is [1,2], which focuses on learning quantified Boolean queries and also uses the framework of learning with membership queries [6]. The goal of their system is somewhat different from our paradigm, in that their goal is to disambiguate a natural language specification of the query, whereas we focus on raw data to guess the "unknown" query that the user has in mind.…”
Section: Related Workmentioning
confidence: 99%