We showcase QUEST (QUEry generator for STructured sources), a search engine for relational databases that combines semantic and machine learning techniques for transforming keyword queries into meaningful SQL queries. The search engine relies on two approaches: the forward, providing mappings of keywords into database terms (names of tables and attributes, and domains of attributes), and the backward, computing the paths joining the data structures identified in the forward step. The results provided by the two approaches are combined within a probabilistic framework based on the Dempster-Shafer Theory. We demonstrate QUEST capabilities, and we show how, thanks to the flexibility obtained by the probabilistic combination of different techniques, QUEST is able to compute high quality results even with few training data and/or with hidden data sources such as those found in the Deep Web.
QUEST: A Keyword Search System for Relational Data based on Semantic and Machine Learning Techniques / Bergamaschi, Sonia; Guerra, Francesco; Interlandi, Matteo; Trillo Lado, R.; Velegrakis, Y.. - In: PROCEEDINGS OF THE VLDB ENDOWMENT. - ISSN 2150-8097. - ELETTRONICO. - 6:12(2013), pp. 1222-1225. [10.14778/2536274.2536281]
QUEST: A Keyword Search System for Relational Data based on Semantic and Machine Learning Techniques
BERGAMASCHI, Sonia;GUERRA, Francesco;INTERLANDI, Matteo;
2013
Abstract
We showcase QUEST (QUEry generator for STructured sources), a search engine for relational databases that combines semantic and machine learning techniques for transforming keyword queries into meaningful SQL queries. The search engine relies on two approaches: the forward, providing mappings of keywords into database terms (names of tables and attributes, and domains of attributes), and the backward, computing the paths joining the data structures identified in the forward step. The results provided by the two approaches are combined within a probabilistic framework based on the Dempster-Shafer Theory. We demonstrate QUEST capabilities, and we show how, thanks to the flexibility obtained by the probabilistic combination of different techniques, QUEST is able to compute high quality results even with few training data and/or with hidden data sources such as those found in the Deep Web.File | Dimensione | Formato | |
---|---|---|---|
p1222-guerra.pdf
Open access
Descrizione: Articolo demo
Tipologia:
Versione pubblicata dall'editore
Dimensione
708.82 kB
Formato
Adobe PDF
|
708.82 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris