Efficient, interactive recommendation of mashup composition knowledge

Soudip Roy Chowdhury, Florian Daniel, Fabio Casati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Citations (Scopus)


In this paper, we approach the problem of interactively querying and recommending composition knowledge in the form of re-usable composition patterns. The goal is that of aiding developers in their composition task. We specifically focus on mashups and browser-based modeling tools, a domain that increasingly targets also people without profound programming experience. The problem is generally complex, in that we may need to match possibly complex patterns on-the-fly and in an approximate fashion. We describe an architecture and a pattern knowledge base that are distributed over client and server and a set of client-side search algorithms for the retrieval of step-by-step recommendations. The performance evaluation of our prototype implementation demonstrates that - if sensibly structured - even complex recommendations can be efficiently computed inside the client browser.

Original languageEnglish
Title of host publicationService-Oriented Computing - 9th International Conference, ICSOC 2011, Proceedings
Number of pages15
Volume7084 LNCS
Publication statusPublished - 2011
Externally publishedYes
Event9th International Conference on Service-Oriented Computing, ICSOC 2011 - Paphos, Cyprus
Duration: 5 Dec 20118 Dec 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7084 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Conference on Service-Oriented Computing, ICSOC 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient, interactive recommendation of mashup composition knowledge'. Together they form a unique fingerprint.

Cite this