Federated search techniques: an overview of the trends and state of the art

A Garba, S Wu, S Khalid - Knowledge and Information Systems, 2023 - Springer
Conventional search engines, such as Bing, Baidu, and Google, offer a convenient way for
users to seek information on the web. However, with all the benefits they provide, one major …

Federated search

M Shokouhi, L Si - Foundations and Trends® in Information …, 2011 - nowpublishers.com
Federated search (federated information retrieval or distributed information retrieval) is a
technique for searching multiple text collections simultaneously. Queries are submitted to a …

Selective search: Efficient and effective search of large textual collections

A Kulkarni, J Callan - ACM Transactions on Information Systems (TOIS), 2015 - dl.acm.org
The traditional search solution for large collections divides the collection into subsets
(shards), and processes the query against all shards in parallel (exhaustive search). The …

From queries to cards: Re-ranking proactive card recommendations based on reactive search history

M Shokouhi, Q Guo - Proceedings of the 38th International ACM SIGIR …, 2015 - dl.acm.org
The growing accessibility of mobile devices has substantially reformed the way users access
information. While the reactive search by query remains as common as before, recent years …

Taily: Shard selection using the tail of score distributions

R Aly, D Hiemstra, T Demeester - … of the 36th international ACM SIGIR …, 2013 - dl.acm.org
Search engines can improve their efficiency by selecting only few promising shards for each
query. State-of-the-art shard selection algorithms first query a central index of sampled …

Document allocation policies for selective searching of distributed indexes

A Kulkarni, J Callan - Proceedings of the 19th ACM international …, 2010 - dl.acm.org
Indexes for large collections are often divided into shards that are distributed across multiple
computers and searched in parallel to provide rapid interactive search. Typically, all index …

Identifying web queries with question intent

G Tsur, Y Pinter, I Szpektor, D Carmel - Proceedings of the 25th …, 2016 - dl.acm.org
Vertical selection is the task of predicting relevant verticals for a Web query so as to enrich
the Web search results with complementary vertical results. We investigate a novel variant of …

Aggregated search

J Arguello - Foundations and Trends® in Information …, 2017 - nowpublishers.com
The goal of aggregated search is to provide integrated search across multiple
heterogeneous search services in a unified interface—a single query box and a common …

Target apps selection: Towards a unified search framework for mobile devices

M Aliannejadi, H Zamani, F Crestani… - The 41st international acm …, 2018 - dl.acm.org
With the recent growth of conversational systems and intelligent assistants such as Apple
Siri and Google Assistant, mobile devices are becoming even more pervasive in our lives …

Shard ranking and cutoff estimation for topically partitioned collections

A Kulkarni, AS Tigelaar, D Hiemstra… - Proceedings of the 21st …, 2012 - dl.acm.org
Large document collections can be partitioned into'topical shards' to facilitate distributed
search. In a low-resource search environment only a few of the shards can be searched in …