• DocumentCode
    3149153
  • Title

    Optimizing DaaS Web Service Based Data Mashups

  • Author

    Barhamgi, Mahmoud ; Ghedira, Chirine ; Benslimane, Djamal ; Tbahriti, Salah-Eddine ; Mrissa, Michael

  • Author_Institution
    Claude Bernard Lyonl Univ., Villeurbanne, France
  • fYear
    2011
  • fDate
    4-9 July 2011
  • Firstpage
    464
  • Lastpage
    471
  • Abstract
    Data Mashup is a special class of mashup application that combines information on the fly from multiple data sources to respond to transient business needs. In this paper, we propose two optimization algorithms to optimize Data Mashups. The first allows for selecting the minimum number of services required in the data mashup. The second exploits the services´ constraints on inputs and outputs to filter out superfluous calls to component services in the data mashup. These two algorithms are evaluated and tested in the healthcare application domain, and the reported results are very promising.
  • Keywords
    Web services; optimisation; DaaS Web service optimisation; Data-as-a-Service; data mashups; healthcare application domain; Algorithm design and analysis; Clustering algorithms; Concrete; Mashups; Ontologies; Resource description framework; Data Services; Optimization; Query rewriting; Services composition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Services Computing (SCC), 2011 IEEE International Conference on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    978-1-4577-0863-3
  • Electronic_ISBN
    978-0-7695-4462-5
  • Type

    conf

  • DOI
    10.1109/SCC.2011.72
  • Filename
    6009295