Towards a general theory of action and time
Artificial Intelligence
Fresh Information Retrieval Using Cooperative Meta Search Engines
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Persistent Cache in Cooperative Search Engine
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Query Based Site Selection for Distributed Search Engines
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Exploiting time-based synonyms in searching document archives
Proceedings of the 10th annual joint conference on Digital libraries
Determining time of queries for re-ranking search results
ECDL'10 Proceedings of the 14th European conference on Research and advanced technology for digital libraries
Temporal ranking of search engine results
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Modeling geographic, temporal, and proximity contexts for improving geotemporal search
Journal of the American Society for Information Science and Technology
Hi-index | 0.00 |
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.