Mashups over the deep web

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Combining information from different Web sources often results in a tedious and repetitive process, e.g. even simple information requests might require to iterate over a result list of one Web query and use each single result as input for a subsequent query. One approach for this chained queries are data-centric mashups, which allow to visually model the data flow as a graph, where the nodes represent the data source and the edges the data flow. In this paper we combine the benefits of such an intuitive graphical modeling framework for these chained queries with the large class of Web data sources that are only accessible by filling out forms. These so-called Deep Web sites offer a wealth of structured, high-quality data but pose also several challenges. We identify and address the main challenges and propose an integrated framework for answering chained queries. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hornung, T., Simon, K., & Lausen, G. (2009). Mashups over the deep web. In Lecture Notes in Business Information Processing (Vol. 18 LNBIP, pp. 228–241). Springer Verlag. https://doi.org/10.1007/978-3-642-01344-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free