Temporal Ranking for Fresh Information Retrieval

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.

[1]  Minoru Uehara,et al.  Reliable distributed search engine based on multiple meta servers , 2002, First International Symposium on Cyber Worlds, 2002. Proceedings..

[2]  Minoru Uehara,et al.  Persistent cache in Cooperative Search Engine , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[3]  Peter B. Danzig,et al.  The Harvest Information Discovery and Access System , 1995, Comput. Networks ISDN Syst..

[4]  Minoru Uehara,et al.  Fresh Information Retrieval Using Cooperative Meta Search Engines , 2002, ICOIN.

[5]  Fabio Grandi,et al.  The Valid Web: An XML/XSL Infrastructure for Temporal Management of Web Documents , 2000, ADVIS.

[6]  Jim Fullton,et al.  Architecture of the Whois++ Index Service , 1996, RFC.

[7]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[8]  Minoru Uehara,et al.  Query based site selection for distributed search engines , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..