Demo Data from EDBT 2026 / reviewers in the wild / expert
Anshul Bhandari
dblp:300/4472
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021
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.
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 33% Information retrieval · 33% Machine learning and data management · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning
data discovery |
0.5 | 1 | 2021 | DICE: Data Discovery by Example · Proc. VLDB Endow. 2021 |
Machine learning and data management
human-in-the-loop |
0.5 | 1 | 2021 | DICE: Data Discovery by Example · Proc. VLDB Endow. 2021 |
Information retrieval › query formulation
query synthesis |
0.5 | 1 | 2021 | DICE: Data Discovery by Example · Proc. VLDB Endow. 2021 |
Methods — techniques the papers use, named apart from their topics
SQL query synthesis · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Examples are All You Need: Iterative Data Discovery by Example in Data Lakes
El Kindi Rezig, Anshul Bhandari, Anna Fariha, Benjamin Price, Allan Vanterpool, Andrew Bowne, Lindsey McEvoy, Vijay Gadepally |
CIDR | 2 |
| 2021 | DICE: Data Discovery by ExampleabstractIn order to conduct analytical tasks, data scientists often need to find relevant data from an avalanche of sources (e.g., data lakes, large organizational databases). This effort is typically made in an ad hoc, non-systematic manner, which makes it a daunting endeavour. Current data discovery systems typically require the users to find relevant tables manually, usually by issuing multiple queries (e.g., using SQL). However, expressing such queries is nontrivial, as it requires knowledge of the underlying structure (schema) of the data organization in advance. This issue is further exacerbated when data resides in data lakes, where there is no predefined schema that data must conform to. On the other hand, data scientists can often come up with a few example records of interest quickly. Motivated by this observation, we developed DICE---a human-in-the-loop system for Data dIsCovery by Example---that takes user-provided example records as input and returns more records that satisfy the user intent. DICE's key idea is to synthesize a SQL query that captures the user intent, specified via examples. To this end, DICE follows a three-step process: (1) DICE first discovers a few candidate queries by finding join paths across tables within the data lake. (2) Then DICE consults with the user for validation by presenting a few records to them, and, thus, eliminating spurious queries. (3) Based on the user feedback, DICE refines the search and repeats the process until the user is satisfied with the results. We will demonstrate how DICE can help in data discovery through an interactive, example-based interaction. El Kindi Rezig, Anshul Bhandari, Anna Fariha, Benjamin Price, Allan Vanterpool, Vijay Gadepally, Michael Stonebraker |
Proc. VLDB Endow. | 2 |