Mashing Up Search Services

  • Authors:
  • Daniele Braga;Stefano Ceri;Florian Daniel;Davide Martinenghi

  • Affiliations:
  • Politecnico di Milano;Politecnico di Milano;University of Trento, Italy;Politecnico di Milano

  • Venue:
  • IEEE Internet Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mashup languages offer new graphic interfaces for service composition. Normally, composition is limited to simple services, such as RSS or Atom feeds, but users can potentially use visual mashup languages for complex service compositions, with typed parameters and well-defined I/O interfaces. Composing search services introduces new issues, however, such as determining the optimal sequence of search invocations and separately composing ranked entries into a globally ranked result. Enabling end users to mash up services through suitable abstractions and tools is a viable option for improving service-based computations.