Temporal ranking for fresh information retrieval

  • Authors:
  • Nobuyoshi Sato;Minoru Uehara;Yoshifumi Sakai

  • Affiliations:
  • Toyo University, Kawagoe, Saitama, Japan;Toyo University, Kawagoe, Saitama Japan;Tohoku Univeristy, Sendai Japan

  • Venue:
  • AsianIR '03 Proceedings of the sixth international workshop on Information retrieval with Asian languages - Volume 11
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a centralized architecture, a search engine based on a distributed architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support for temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose an implementation of temporal ranking.