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

Vahid Ghadakchi

dblp:119/2506 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 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
3 papers
Query processing and optimization · 26% Recommender systems · 17% Information retrieval · 17%

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

TopicWeightPapersLastEvidence papers
Recommender systems › user modeling
intent learning
0.412020
A Game-theoretic Approach to Data Interaction · ACM Trans. Database Syst. 2020
Information retrieval
query formulation
0.412020
A Game-theoretic Approach to Data Interaction · ACM Trans. Database Syst. 2020
Indexing and storage engines
caching
0.312018
There Is No Dichotomy between Effectiveness and Efficiency in Keyword Search over Databases · ICDE 2018
Query processing and optimization › interactive query processing
interactive query answering
0.312018
The Data Interaction Game · SIGMOD Conference 2018
Query processing and optimization › keyword query processing
keyword search over databases
0.312018
There Is No Dichotomy between Effectiveness and Efficiency in Keyword Search over Databases · ICDE 2018
Database theory
query answering
0.312018
The Data Interaction Game · SIGMOD Conference 2018
Data models and query languages
query interface
0.312018
The Data Interaction Game · SIGMOD Conference 2018

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

reinforcement learning · 0.8game theory · 0.8q-learning · 0.4subset caching · 0.3
YearPublicationVenuePosition
2020 A Game-theoretic Approach to Data Interaction
abstract
As most users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs. The database management system (DBMS) may interact with users and use their feedback on the returned results to learn the information needs behind their queries. Current query interfaces assume that users do not learn and modify the way they express their information needs in the form of queries during their interaction with the DBMS. Using a real-world interaction workload, we show that users learn and modify how to express their information needs during their interactions with the DBMS and their learning is accurately modeled by a well-known reinforcement learning mechanism. As current data interaction systems assume that users do not modify their strategies, they cannot discover the information needs behind users’ queries effectively. We model the interaction between the user and the DBMS as a game with identical interest between two rational agents whose goal is to establish a common language for representing information needs in the form of queries. We propose a reinforcement learning method that learns and answers the information needs behind queries and adapts to the changes in users’ strategies and proves that it improves the effectiveness of answering queries, stochastically speaking. We propose two efficient implementations of this method over large relational databases. Our extensive empirical studies over real-world query workloads indicate that our algorithms are efficient and effective.
Ben McCamish, Vahid Ghadakchi, Arash Termehchy, Behrouz Touri, Eduardo Cotilla Sanchez, Liang Huang 0001, Soravit Changpinyo
ACM Trans. Database Syst.2
2019 Less Data Delivers Higher Search Effectiveness for Keyword Queries
abstract
As many users, such as scientists, do not know the schema and/or content of their databases, they cannot precisely formulate their information needs using formal query languages, such as SQL. To help these users, researchers have proposed keyword query interfaces over which users can submit their information need using a set of keywords without the precise knowledge about the schema or content of the database. Despite their usability, keyword query interfaces suffer from low effectiveness in answering queries. Therefore, they may return many non-relevant answers or do not return many answers related to the input queries. It is well established that the effectiveness of answering queries decreases as the size of the dataset grows, given all other conditions are the same. In this paper, we propose an approach that uses only a relatively small subset of the database to answer most queries effectively. Since this subset may not contain the relevant answers to many queries, we also propose a method that predicts whether a query can be answered more effectively using this subset or the entire database. Our comprehensive empirical studies using multiple real-world databases and query workloads indicate that our approach significantly improves both the effectiveness and efficiency of answering queries.
Vahid Ghadakchi, Abtin Khodadadi, Arash Termehchy
SSDBM1
2018 There Is No Dichotomy between Effectiveness and Efficiency in Keyword Search over Databases
abstract
The article shows that it is possible to achieve this goal of redesigning the main components of a database system by presenting our effort on finding and caching an optimal subsets of a database to improve both effectiveness and efficiency of answering keyword queries.
Vahid Ghadakchi, Arash Termehchy
ICDE1
2018 The Data Interaction Game
abstract
As many users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs. The database management systems (DBMS) may interact with users and leverage their feedback on the returned results to learn the information needs behind users' queries. Current query interfaces assume that users follow a fixed strategy of expressing their information needs, that is, the likelihood by which a user submits a query to express an information need remains unchanged during her interaction with the DBMS. Using a real-world interaction workload, we show that users learn and modify how to express their information needs during their interactions with the DBMS. We also show that users' learning is accurately modeled by a well-known reinforcement learning mechanism. As current data interaction systems assume that users do not modify their strategies, they cannot discover the information needs behind users' queries effectively. We model the interaction between users and DBMS as a game with identical interest between two rational agents whose goal is to establish a common language for representing information needs in form of queries. We propose a reinforcement learning method that learns and answers the information needs behind queries and adapts to the changes in users' strategies and prove that it improves the effectiveness of answering queries stochastically speaking. We analyze the challenges of efficient implementation of this method over large-scale relational databases and propose two efficient adaptations of this algorithm over large-scale relational databases. Our extensive empirical studies over real-world query workloads and large-scale relational databases indicate that our algorithms are efficient. Our empirical results also show that our proposed learning mechanism is more effective than the state-of-the-art query answering method.
Ben McCamish, Vahid Ghadakchi, Arash Termehchy, Behrouz Touri, Liang Huang 0001
SIGMOD Conference2