loading
Documents

Research.Publish.Connect.

Paper

Authors: Minlue Wang ; Valeriia Haberland ; Andrew Martin ; John Howroyd and John Mark Bishop

Affiliation: The Centre for Intelligent Data Analytics (TCIDA), Goldsmiths and University of London, United Kingdom

ISBN: 978-989-758-271-4

Keyword(s): Entity Search, Relational Databases, Query Annotation, Semantic Search.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Business Intelligence Applications ; Computational Intelligence ; Evolutionary Computing ; Foundations of Knowledge Discovery in Databases ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Machine Learning ; Mining Text and Semi-Structured Data ; Soft Computing ; Symbolic Systems

Abstract: We study an entity search/match problem that requires retrieved tuples match to the same entity as 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 a free-text entity query into a multi-valued structured query, and two retrieval methods are proposed in order to generate a set of candidate tuples from the database. The retrieval methods essentially formul ate SQL queries against the database given the multi-valued structured query. The results of the 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. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.81.220.239

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Wang, M.; Haberland, V.; Martin, A.; Howroyd, J. and Bishop, J. (2017). Entity Search/Match in Relational Databases.In Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, ISBN 978-989-758-271-4, pages 198-205. DOI: 10.5220/0006498701980205

@conference{kdir17,
author={Minlue Wang. and Valeriia Haberland. and Andrew Martin. and John Howroyd. and John Mark Bishop.},
title={Entity Search/Match in Relational Databases},
booktitle={Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR,},
year={2017},
pages={198-205},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006498701980205},
isbn={978-989-758-271-4},
}

TY - CONF

JO - Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR,
TI - Entity Search/Match in Relational Databases
SN - 978-989-758-271-4
AU - Wang, M.
AU - Haberland, V.
AU - Martin, A.
AU - Howroyd, J.
AU - Bishop, J.
PY - 2017
SP - 198
EP - 205
DO - 10.5220/0006498701980205

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.