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

Niousha Hormozi

dblp:208/4094 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
keyword search
0.412019
Disambiguation and Result Expansion in Keyword Search Over Relational Databases · ICDE 2019
Information retrieval › keyword search
keyword search over relational databases
0.412019
Disambiguation and Result Expansion in Keyword Search Over Relational Databases · ICDE 2019
Information retrieval › query understanding
query disambiguation
0.412019
Disambiguation and Result Expansion in Keyword Search Over Relational Databases · ICDE 2019

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

disambiguation · 0.4
YearPublicationVenuePosition
2019 Disambiguation and Result Expansion in Keyword Search Over Relational Databases
abstract
Recently, there has been a significant growth in keyword search due to its wide range of use-cases in people's everyday life. While keyword search has been applied to different kinds of data, ambiguity always exists no matter what data the query is being asked from. Generally, when users submit a query they need an exact answer that perfectly meets their needs, rather than wondering about different possible answers that are retrieved by the system. To achieve this, search systems need a Disambiguation functionality that can efficiently filter out and rank all possible answers to a query, before showing them to user. In this paper, we are going to describe how we are improving state of the art in various stages of a keyword-search pipeline in order to retrieve the answers that best match the user's intent.
Niousha Hormozi
ICDE1