{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T01:42:02Z","timestamp":1778204522545,"version":"3.51.4"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,8,28]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/2536274.2536281","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1222-1225","source":"Crossref","is-referenced-by-count":27,"title":["QUEST"],"prefix":"10.14778","volume":"6","author":[{"given":"Sonia","family":"Bergamaschi","sequence":"first","affiliation":[{"name":"University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Guerra","sequence":"additional","affiliation":[{"name":"University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Interlandi","sequence":"additional","affiliation":[{"name":"University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raquel","family":"Trillo-Lado","sequence":"additional","affiliation":[{"name":"University of Zaragoza, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Velegrakis","sequence":"additional","affiliation":[{"name":"University of Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"565","volume-title":"SIGMOD","author":"Bergamaschi S.","year":"2011"},{"key":"e_1_2_1_2_1","first-page":"411","volume-title":"ER, LNCS 6998","author":"Bergamaschi S.","year":"2011"},{"key":"e_1_2_1_3_1","first-page":"836","volume-title":"ICDE","author":"Ding B.","year":"2007"},{"key":"e_1_2_1_4_1","first-page":"1601","volume-title":"CIKM","author":"Rota S.","year":"2011"},{"issue":"234","key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TCOMM.1994.577040","article-title":"List Viterbi decoding algorithms with applications. Communications","volume":"42","author":"Seshadri N.","year":"1994","journal-title":"IEEE Transactions on"},{"key":"e_1_2_1_6_1","unstructured":"G. Shafer. A Mathematical Theory of Evidence. Princeton University Press Princeton New Jersey 1976.  G. Shafer. A Mathematical Theory of Evidence . Princeton University Press Princeton New Jersey 1976."},{"issue":"11","key":"e_1_2_1_7_1","first-page":"899","article-title":"Summary graphs for relational database schemas","volume":"4","author":"Yang X.","year":"2011","journal-title":"PVLDB"},{"key":"e_1_2_1_8_1","volume-title":"Synthesis Lectures on Data Management. Morgan & Claypool Pub.","author":"Yu J. X.","year":"2010"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536274.2536281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:53:24Z","timestamp":1672224804000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536274.2536281"}},"subtitle":["a keyword search system for relational data based on semantic and machine learning techniques"],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,8,28]]}},"alternative-id":["10.14778\/2536274.2536281"],"URL":"https:\/\/doi.org\/10.14778\/2536274.2536281","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}