An optimization strategy for mashups performance based on relational algebra

  • Authors:

  • Hailun Lin;Cheng Zhang;Peng Zhang

  • Affiliations:

  • Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Graduate University of Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Graduate University of Chinese Academy of Sciences, Beijing, China

  • Venue:
  • APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, mashups as a new type of application have gained tremendous popularity, which provide opportunities of creating personalized Web applications using Internet-based resources to end-users. Meanwhile, the performance of mashups can not be neglected while the end-users participate in mashups construction. Nowadays, there is a lot of research work with a focus on developing tools or platforms to support mashups construction. However, there are few studies concerned about the performance of mashups. In order to improve mashups performance, this paper draws on experience of relational algebra query optimization to establish mashup query-tree model and mashup operator performance model, and defines mashup operators' equivalent transformation rules and query-tree heuristic rules. On this basis, this paper proposes an optimization algorithm for mashups performance. Experiments show that our strategy can effectively improve the run-time performance of mashups.