Demo Data from EDBT 2026 / reviewers in the wild / expert
Devang Vira
dblp:78/7992
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
2 papers |
Software testing · 88% Program verification · 12% | |
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 54% Data models and query languages · 46% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software testing
test input generation |
0.2 | 2 | 2011 | Generating test data for killing SQL mutants: A constraint-based approach · ICDE 2011 X-data: Generating test data for killing SQL mutants · ICDE 2010 |
Data models and query languages › SQL
SQL query |
0.1 | 1 | 2010 | X-data: Generating test data for killing SQL mutants · ICDE 2010 |
Software testing
mutation testing |
0.0 | 1 | 2010 | X-data: Generating test data for killing SQL mutants · ICDE 2010 |
Methods — techniques the papers use, named apart from their topics
constraint-based approach · 0.2test suite generation · 0.2constraint solving · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Generating test data for killing SQL mutants: A constraint-based approachabstractComplex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specification with an implementation is not applicable, since SQL queries are essentially a specification without any implementation. Queries are usually checked by running them on sample datasets and checking that the correct result is returned; there is no guarantee that all possible errors are detected. In this paper, we address the problem of test data generation for checking correctness of SQL queries, based on the query mutation approach for modeling errors. Our presentation focuses in particular on a class of join/outer-join mutations, comparison operator mutations, and aggregation operation mutations, which are a common cause of error. To minimize human effort in testing, our techniques generate a test suite containing small and intuitive test datasets. The number of datasets generated, is linear in the size of the query, although the number of mutations in the class we consider is exponential. Under certain assumptions on constraints and query constructs, the test suite we generate is complete for a subclass of mutations that we define, i.e., it kills all non-equivalent mutations in this subclass. Shetal Shah, S. Sudarshan 0001, Suhas Kajbaje, Sandeep Patidar, Bhanu Pratap Gupta, Devang Vira |
ICDE | 6 |
| 2010 | X-data: Generating test data for killing SQL mutantsabstractChecking if an SQL query has been written correctly is not an easy task. Formal verification is not applicable, since it is based on comparing a specification with an implementation, whereas SQL queries are essentially a specification without any implementation. Thus, the standard approach for testing queries is to manually check query results on test datasets. Intuitively, a mutant is a query variant that could have been the correct query if the query was in error; a mutant is killed by a dataset if the original query and the mutant return different results on the dataset. In this paper, we address the problem of generation of test data for an SQL query, to kill mutants. Our work focuses in particular on a class of join/outer-join mutants, which are a common cause of error. To minimize human effort in testing, our techniques generate a test suite containing small and intuitive test datasets, combining them into a single dataset where possible. In the absence of foreign-key constraints, and under certain assumptions, the test suite is complete, i.e. it kills all nonequivalent mutations, in the class of join-type mutations that we consider. We also consider some common types of where-clause predicate mutants. Our techniques have been implemented in a prototype data generation tool. Bhanu Pratap Gupta, Devang Vira, S. Sudarshan 0001 |
ICDE | 2 |