KEYRY: A keyword-based search engine over relational databases based on a Hidden Markov model

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose the demonstration of KEYRY, a tool for translating keyword queries over structured data sources into queries in the native language of the data source. KEYRY does not assume any prior knowledge of the source contents. This allows it to be used in situations where traditional keyword search techniques over structured data that require such a knowledge cannot be applied, i.e., sources on the hidden web or those behind wrappers in integration systems. In KEYRY the search process is modeled as a Hidden Markov Model and the List Viterbi algorithm is applied to computing the top-k queries that better represent the intended meaning of a user keyword query. We demonstrate the tool's capabilities, and we show how the tool is able to improve its behavior over time by exploiting implicit user feedback provided through the selection among the top-k solutions generated. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Bergamaschi, S., Guerra, F., Rota, S., & Velegrakis, Y. (2011). KEYRY: A keyword-based search engine over relational databases based on a Hidden Markov model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6999 LNCS, pp. 328–331). https://doi.org/10.1007/978-3-642-24574-9_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free