Proceedings of the 2019 International Conference on Management of Data 2019
DOI: 10.1145/3299869.3319866
|View full text |Cite
|
Sign up to set email alerts
|

Explaining Wrong Queries Using Small Examples

Abstract: For testing the correctness of SQL queries, e.g., evaluating student submissions in a database course, a standard practice is to execute the query in question on some test database instance and compare its result with that of the correct query. Given two queries Q1 and Q2, we say that a database instance D is a counterexample (for Q1 and Q2) if Q1(D) differs from Q2(D); such a counterexample can serve as an explanation of why Q1 and Q2 are not equivalent. While the test database instance may serve as a counter… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
17
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 39 publications
1
17
0
1
Order By: Relevance
“…A recurring theme in the primary studies, regardless of the research topic, was argumentation for [5,8,101,121] and against [75,88,101] natural learning environments. A natural learning environment better reflects industry, i.e., students' future work environments.…”
Section: Natural and Unnatural Learning Environmentsmentioning
confidence: 99%
“…A recurring theme in the primary studies, regardless of the research topic, was argumentation for [5,8,101,121] and against [75,88,101] natural learning environments. A natural learning environment better reflects industry, i.e., students' future work environments.…”
Section: Natural and Unnatural Learning Environmentsmentioning
confidence: 99%
“…and D ; we then pick the smallest witness overall. If Q 1 and Q 2 are monotone, this approach always yields the smallest counterexample [7]. In [7], we also obtained complexity results for SCP for different classes of queries.…”
Section: Background and Problemmentioning
confidence: 99%
“…If Q 1 and Q 2 are monotone, this approach always yields the smallest counterexample [7]. In [7], we also obtained complexity results for SCP for different classes of queries. For queries involving projection, join, and difference, it is noteworthy that finding the smallest witness for a result tuple is already NP-hard in data complexity, even when the queries are of bounded sizes.…”
Section: Background and Problemmentioning
confidence: 99%
See 2 more Smart Citations