loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT'03)
Strategies for Cooperative Search in Distributed Databases
Halifax, Canada
October 13-October 17
ISBN: 0-7695-1931-8
Josel?to J. Chua, Monash University, Clayton, Australia
Peter E. Tischer, Monash University, Clayton, Australia
We consider the problem of searching a set of data repositories, each managed by an independent agent which is able to handle queries from users, as well as queries from peer agents. Given a query, an agent?s task is to find a closest match to the query over all the distributed databases. The agents search the distributed databases cooperatively by routing queries with each other. However, it is inefficient to route all queries to all agents. In this paper, we present strategies for routing queries efficiently between agents.
Index Terms:
Distributed query processing, query routing, peer-to-peer search
Citation:
Josel?to J. Chua, Peter E. Tischer, "Strategies for Cooperative Search in Distributed Databases," iat, pp.325, 2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.