The Deep Web is constituted by data accessible through Web pages, but not readily indexable by search engines, as they are returned in dynamic pages. In this paper we propose a framework for accessing Deep Web sources, represented as relational tables with so-called access limitations, with keyword-based queries. We formalize the notion of optimal answer and investigate methods for query processing. To our knowledge, this problem has never been studied in a systematic way.
Keyword search in the deep web / Cali', Andrea; Martinenghi, Davide; Torlone, Riccardo. - 1378:(2015), pp. 205-208. (Intervento presentato al convegno 9th Alberto Mendelzon International Workshop on Foundations of Data Management, AMW 2015 tenutosi a per nel 2015).
Keyword search in the deep web
CALI', ANDREA;
2015
Abstract
The Deep Web is constituted by data accessible through Web pages, but not readily indexable by search engines, as they are returned in dynamic pages. In this paper we propose a framework for accessing Deep Web sources, represented as relational tables with so-called access limitations, with keyword-based queries. We formalize the notion of optimal answer and investigate methods for query processing. To our knowledge, this problem has never been studied in a systematic way.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
