Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
We consider the problem of searching a set of data repositories,each managed by an independent agent which is able to handlequeries from users, as well as queries from peer agents. Given aquery, an agent's task is to find a closest match to the query overall the distributed databases. The agents search the distributeddatabases cooperatively by routing queries with each other.However, it is in efficientto route all queries to all agents. Inthis paper, we present strategies for routing queries efficientlybetween agents.