@inproceedings{uoadl:3182924,
    pages = "2101-2105",
    keywords = "Disambiguation; Relational Databases; Expansion; keyword search;
Information Retrieval; Data Extraction",
    BIBTEX_ENTRY = "inproceedings",
    year = "2019",
    author = "Hormozi, Niousha",
    publisher = "IEEE Comput. Soc",
    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.",
    title = "Disambiguation and Result Expansion in Keyword Search over Relational
Databases",
    booktitle = "2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019)",
    doi = "10.1109/ICDE.2019.00248"
}