A hidden Markov model approach to keyword-based search over relational databases

Sonia Bergamaschi*, Francesco Guerra, Silvia Rota, Yannis Velegrakis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We present a novel method for translating keyword queries over relational databases into SQL queries with the same intended semantic meaning. In contrast to the majority of the existing keyword-based techniques, our approach does not require any a-priori knowledge of the data instance. It follows a probabilistic approach based on a Hidden Markov Model for computing the top-K best mappings of the query keywords into the database terms, i.e., tables, attributes and values. The mappings are then used to generate the SQL queries that are executed to produce the answer to the keyword query. The method has been implemented into a system called KEYRY (from KEYword to queRY).

Original languageEnglish
Title of host publicationConceptual Modeling, ER 2011 - 30th International Conference, Proceedings
Pages411-420
Number of pages10
DOIs
Publication statusPublished - 9 Nov 2011
Event30th International Conference on Conceptual Modeling, ER 2011 - Brussels, Belgium
Duration: 31 Oct 20113 Nov 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6998 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference30th International Conference on Conceptual Modeling, ER 2011
Country/TerritoryBelgium
CityBrussels
Period31/10/113/11/11

Fingerprint

Dive into the research topics of 'A hidden Markov model approach to keyword-based search over relational databases'. Together they form a unique fingerprint.

Cite this