Strategies for cooperative search in distributed databases

被引：1

作者：

Chua, JJ ^{[1
]}

Tischer, PE ^{[1
]}

机构：

[1] Monash Univ, Sch Comp Sci & Software Engn, Clayton, Vic 3800, Australia

来源：

IEEE/WIC INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS | 2003年

关键词：

distributed query processing; query routing; peer-to-peer search;

D O I：

10.1109/IAT.2003.1241086

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We consider the problem of searching a set of data repositories, each managed by air 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.

引用

页码：325 / 328

页数：4

共 10 条

[1]

Chua J, 1999, CONCUR SYST ENGN SER, V56, P7

[2]

Chua J. J., 1999, FAST FULL SEARCH EQU

[3]

*FGDC, NAT SPAT DAT CLEAR

[4] BRANCH AND BOUND ALGORITHM FOR COMPUTING K-NEAREST NEIGHBORS [J].

FUKUNAGA, K ;

NARENDRA, PM .

IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (07) :750-753

[5]

HUANG CY, 1992, NAT PROD LETT, V1, P3

[6] Efficient Web access to distributed biological collections using a taxonomy browser [J].

Leow, R ;

Taylor, K .

12TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2000, :25-38

[7]

RIO M, 1997, 1997 IEEE INT C INT, V1, P165

[8] CHOICE OF REFERENCE POINTS IN BEST-MATCH FILE SEARCHING [J].

SHAPIRO, M .

COMMUNICATIONS OF THE ACM, 1977, 20 (05) :339-343

[9] Distributed search in P2P networks [J].

Waterhouse, S ;

Doolin, DM ;

Kan, G ;

Faybishenko, Y .

IEEE INTERNET COMPUTING, 2002, 6 (01) :68-72

[10]

YU B, 2002, 2002 C INF KNOWL MAN, P642

← 1 →