Skip navigation

An effective suggestion method for keyword search of databases

An effective suggestion method for keyword search of databases

Huang, Hai ORCID: 0000-0003-1412-0567, Chen, Zonghai, Liu, Chengfei, Huang, He and Zhang, Xiangliang (2016) An effective suggestion method for keyword search of databases. World Wide Web, 20 (4). pp. 729-747. ISSN 1386-145X (Print), 1573-1413 (Online) (doi:https://doi.org/10.1007/s11280-016-0413-1)

Full text not available from this repository. (Request a copy)

Abstract

This paper solves the problem of providing high-quality suggestions for userkeyword queries over databases. With the assumption that the returned suggestions areindependent, existing query suggestion methods over databases score candidate suggestions individually and return the top-k best of them. However, the top-k suggestions have high redundancy with respect to the topics. To provide informative suggestions, the returned k suggestions are expected to be diverse, i.e., maximizing the relevance to the user query and the diversity with respect to topics that the user might be interested in simultaneously. In this paper, an objective function considering both factors is defined for evaluating a suggestion set. We show that maximizing the objective function is a submodular function maximization problem subject to n matroid constraints, which is an NP-hard problem.

Item Type: Article
Uncontrolled Keywords: query suggestion, query reformulation and keyword recommendation
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Department / Research Group: Faculty of Liberal Arts & Sciences
Faculty of Liberal Arts & Sciences > School of Computing & Mathematical Sciences (CAM)
Last Modified: 13 Jan 2021 18:58
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
Selected for REF2021: None
URI: http://gala.gre.ac.uk/id/eprint/30840

Actions (login required)

View Item View Item