Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2501.04347 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915094580953088 |
|---|---|
| author | Calì, Andrea Martinenghi, Davide Torlone, Riccardo |
| author_facet | Calì, Andrea Martinenghi, Davide Torlone, Riccardo |
| contents | The Deep Web is constituted by data that are accessible through Web pages, but not readily indexable by search engines as they are returned in dynamic pages. In this paper we propose a conceptual framework for answering keyword queries on Deep Web sources represented as relational tables with so-called access limitations. We formalize the notion of optimal answer, characterize queries for which an answer can be found, and present a method for query processing based on the construction of a query plan that minimizes the accesses to the data sources. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04347 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Keyword Search in the Deep Web Calì, Andrea Martinenghi, Davide Torlone, Riccardo Databases The Deep Web is constituted by data that are accessible through Web pages, but not readily indexable by search engines as they are returned in dynamic pages. In this paper we propose a conceptual framework for answering keyword queries on Deep Web sources represented as relational tables with so-called access limitations. We formalize the notion of optimal answer, characterize queries for which an answer can be found, and present a method for query processing based on the construction of a query plan that minimizes the accesses to the data sources. |
| title | Keyword Search in the Deep Web |
| topic | Databases |
| url | https://arxiv.org/abs/2501.04347 |