Search computing
Managing complex search queries
Stefano Ceri (Politecnico di Milano)
Adnan Abid (Politecnico di Milano)
Mamoun Abu Helou (Politecnico di Milano)
Davide Barbieri (Politecnico di Milano)
Alessandro Bozzon (Politecnico di Milano)
Daniele Braga (Politecnico di Milano)
Marco Brambilla (Politecnico di Milano)
Alessandro Campi (Politecnico di Milano)
Francesco Corcoglioniti (Politecnico di Milano)
Emanuele Della Valle (Politecnico di Milano)
Davide Eynard (Politecnico di Milano)
Piero Fraternali (Politecnico di Milano)
Michael Grossniklaus (Politecnico di Milano)
Davide Martinenghi (Politecnico di Milano)
Stefania Ronchi (Politecnico di Milano)
Marco Tagliasacchi (Politecnico di Milano)
Salvatore Vadacca (Politecnico di Milano)
More Info
expand_more
Abstract
Search computing focuses on building answers to complex search queries (for example, "Where can I attend an interesting conference in my field near a sunny beach?") by interacting with a constellation of cooperating search services, and using result ranking and joining as the dominant factors for service composition. The service computing paradigm has so far been neutral to the specific features of search applications and services. To address this weakness, search computing advocates a new approach in which search, join, and ranking are the central aspects for service composition.