Entity Search/Match in Relational Databases

Tools

Wang, Minlue; Haberland, Valeriia; Martin, Andrew; Howroyd, John and Bishop, Mark (J. M.). 2017. 'Entity Search/Match in Relational Databases'. In: 9th International Conference on Knowledge Discovery and Information Retrieval. Funchal, Portugal 1-3 November, 2017. [Conference or Workshop Item]

Preview

Text
Wang et al.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (169kB) | Preview

Abstract or Description

We study an entity search/match problem that requires retrieved tuples match to an input entity query. We assume the input queries are of the same type as the tuples in a materialised relational table. Existing keyword search over relational databases focuses on assembling tuples from a variety of relational tables in order to respond to a keyword query. The entity queries in this work differ from the keyword queries in two ways: (i) an entity query roughly refers to an entity that contains a number of attribute values, i.e. a product entity or an address entity; (ii) there might be redundant or incorrect information in the entity queries that could lead to misinterpretations of the queries. In this paper, we propose a transformation that first converts an unstructured entity query into a multi-valued structured query, and two retrieval methods are proposed to generate a set of candidate tuples from the database. The retrieval methods essentially formulate SQL queries against the database given the multi-valued structured query. The results of a comprehensive evaluation of a large-scale database (more than 29 millions tuples) and two real-world datasets showed that our methods have a good trade-off between generating correct candidates and the retrieval time compared to baseline approaches.

Item Type:

Conference or Workshop Item (Paper)