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. We also outline the main ideas of our implementation of a prototype system for Deep Web keyword search.
|Titolo:||Processing keyword queries under access limitations|
|Data di pubblicazione:||2015|
|Citazione:||Calì, A., Lynch, T.W., Martinenghi, D., & Torlone, R. (2015). Processing keyword queries under access limitations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.30-35). Springer Verlag.|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|