Probe, count, and classify: categorizing hidden web databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
PERSIVAL demo: categorizing hidden-web resources
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
Single-agent and Multi-agent Approaches to WWW Information Integration
PRIMA '98 Selected papers from the First Pacific Rim International Workshop on Multi-Agents, Multiagent Platforms
SE-LEGO: creating metasearch engines on demand
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Deploying information agents on the web
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Hi-index | 0.00 |
This paper proposes the architecture of the functional composition of Web databases (WebDBs). Unlike a general search engine which receives keywords and returns a list of URLs, a WebDB receives a complex query and returns a list of records. The complex query specifies the condition of each field of the records. The process of composing WebDBs is described as a script, where a user chooses the target WebDBs and describes how to connect the output from one WebDB to the input of another WebDB and how to generate outputs. The novelty of the proposal is that both the WebDBs and output formats are considered as components of the same level and that the reuse of new keywords is represented as a connection (CGI links). Once the process is described as a script, the user can use the script for a new WebDB of his own.