Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bahar Qarabaqi

dblp:145/6046 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—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 first-author

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
2 papers
Information retrieval · 56% Query processing and optimization · 38% Data mining · 5%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › query reformulation
query refinement
0.422016
Merlin: Exploratory Analysis with Imprecise Queries · IEEE Trans. Knowl. Data Eng. 2016
User-driven refinement of imprecise queries · ICDE 2014
Query processing and optimization › uncertain data query processing
imprecise query answering
0.322016
Merlin: Exploratory Analysis with Imprecise Queries · IEEE Trans. Knowl. Data Eng. 2016
User-driven refinement of imprecise queries · ICDE 2014
Query processing and optimization
probabilistic query processing
0.212016
Merlin: Exploratory Analysis with Imprecise Queries · IEEE Trans. Knowl. Data Eng. 2016
Information retrieval › interactive information retrieval
exploratory search
0.212014
User-driven refinement of imprecise queries · ICDE 2014
Information retrieval › query formulation
interactive query refinement
0.212014
User-driven refinement of imprecise queries · ICDE 2014
Data mining
exploratory data analysis
0.112016
Merlin: Exploratory Analysis with Imprecise Queries · IEEE Trans. Knowl. Data Eng. 2016

Methods — techniques the papers use, named apart from their topics

real-time approximation · 0.2probability distribution modeling · 0.2sensitivity analysis · 0.2probabilistic framework · 0.2
YearPublicationVenuePosition
2016 Merlin: Exploratory Analysis with Imprecise Queries
abstract
Merlin supports exploratory search in large databases. The user interacts with it by specifying probability distributions over attributes, which express imprecise conditions about the entities of interest. Merlin helps the user home in on the right query conditions by addressing three key challenges: (1) efficiently computing results for an imprecise query, (2) providing feedback about the sensitivity of the result to changes of individual conditions, and (3) suggesting new conditions. We formally introduce the notion of sensitivity and prove structural properties that enable efficient algorithms for quantifying the effect of uncertainty in user-specified conditions. To support interactive responses, we also develop techniques that can deliver probability estimates within a given realtime limit and are able to adapt automatically as interactive query refinement proceeds.
Bahar Qarabaqi, Mirek Riedewald
IEEE Trans. Knowl. Data Eng.1
2014 User-driven refinement of imprecise queries
abstract
We propose techniques for exploratory search in large databases. The goal is to provide new functionality that aids users in homing in on the right query conditions to find what they are looking for. Query refinement proceeds interactively by repeatedly consulting the user to manage query conditions. This process is characterized by three key challenges: (1) dealing with incomplete and imprecise user input, (2) keeping user effort low, and (3) guaranteeing interactive system response time. We address the first two challenges with a probability-based framework that guides the user to the most important query conditions. To recover from input errors, we introduce the notion of sensitivity and propose efficient algorithms for identifying the most sensitive user input, i.e., those inputs that had the greatest influence on the query results. For the third challenge, we develop techniques that can deliver estimates of the required probabilities within a given hard realtime limit and are able to adapt automatically as the interactive query refinement proceeds.
Bahar Qarabaqi, Mirek Riedewald
ICDE1