Using hierarchical task network planning techniques to create custom web search services over multiple biomedical databases

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

Abstract

We present a novel method to create complex search services over public online biomedical databases using hierarchical task network planning techniques. In the proposed approach, user queries are regarded as planning tasks (goals), while basic query services provided by the databases correspond to planning operators (POs). Each individual source is then mapped to a set of POs that can be used to process primitive (simple) queries. Advanced search services can be created by defining decomposition methods (DMs). The latter can be regarded as "recipes" that describe how to decompose non-primitive (complex) queries into sets of simpler subqueries following a divide-and-conquer strategy. Query processing proceeds by recursively decomposing non-primitive queries into smaller queries, until primitive queries are reached that can be processed using planning operators. Custom web search services can be created from the generated planners to provide biomedical researchers with valuable tools to process frequent complex queries. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

García-Remesal, M. (2008). Using hierarchical task network planning techniques to create custom web search services over multiple biomedical databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5178 LNAI, pp. 42–49). Springer Verlag. https://doi.org/10.1007/978-3-540-85565-1_6

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