Search computing

Managing complex search queries

Journal article (2010)

Authors

Stefano Ceri Politecnico di Milano
Adnan Abid 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
Mamoun Abu Helou Politecnico di Milano
Davide Barbieri Politecnico di Milano
A. 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
Affiliation
External organisation
More Info
expand_more

Published Date

01-11-2010

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

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.