We present a novel strategy to partition a document collection onto several servers and to
perform effective collection selection. The method is based on the analysis of query logs. We …

The rank aggregation problem has been studied extensively in recent years with a focus on
how to combine several different rankers to obtain a consensus aggregate ranker. We study …

The goal of distributed information retrieval is to support effective searching over multiple
document collections. For efficiency, queries should be routed to only those collections that …

How to merge and organise query results retrieved from different resources is one of the key
issues in distributed information retrieval. Some previous research and experiments suggest …

The escalation of deep web databases has been phenomenal over the last decade,
spawning a growing interest in automated discovery of interesting relationships among …

As the number and diversity of distributed Web databases on the Internet exponentially
increase, it is difficult for user to know which databases are appropriate to search. Given …

This paper proposes a web search algorithm, which aims to distinguish irrelevant
information and to enhance the amount of the relevant information in respect to a user's …

The Internet contains billions of documents and thousands of systems for searching over
these documents. Searching for a useful document can be as difficult as the proverbial …

This paper proposes an information system, which aims to bridge the semantic gap in web
search. The system uses multiple domain ontological structures expanding the user's query …