On updating in very short time by distributed search engines

N. Sato, M. Uehara, Y. Sakai, H. Mori

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Conventional search engines employ a centralized architecture. However, such engines are not suitable for fresh information retrieval because they take a long time to collect Web pages using a Web robot (or crawler). There are also distributed search engines such as Harvest etc., but they cannot update in a very short time, e.g. a few minutes. In this paper, we propose a distributed information retrieval system, called a cooperative search engine (CSE), in which multiple distributed local search engines communicate with each other in order to realize a whole global search engine. A local search engine has own index database and can update quickly. In addition, they cooperate with each other in order to reduce their workload. In this paper, we describe the structure and behavior of CSE, and its efficiency.

Original languageEnglish
Title of host publicationProceedings - 2002 Symposium on Applications and the Internet, SAINT 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages176-183
Number of pages8
ISBN (Electronic)0769514472, 9780769514475
DOIs
Publication statusPublished - 2002
EventSymposium on Applications and the Internet, SAINT 2002 - Nara City, Japan
Duration: 2002 Jan 282002 Feb 1

Publication series

NameProceedings - 2002 Symposium on Applications and the Internet, SAINT 2002

Conference

ConferenceSymposium on Applications and the Internet, SAINT 2002
Country/TerritoryJapan
CityNara City
Period02/1/2802/2/1

Keywords

  • Databases
  • Distributed computing
  • Information retrieval
  • Internet
  • Magnetooptic recording
  • Robots
  • Search engines
  • Web pages
  • Web server
  • World Wide Web

Fingerprint

Dive into the research topics of 'On updating in very short time by distributed search engines'. Together they form a unique fingerprint.

Cite this