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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yu, J., Benatallah, B., Casati, F., Daniel, F.: Understanding Mashup Development. IEEE Internet Computing 12(5), 44–52 (2008)
Yahoo! Pipes: Rewire the web (2011), http://pipes.yahoo.com/
Altinel, M., Brown, P., Cline, S., et al.: Damia-A Data Mashup Fabric For Intranet Applications. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 1370–1373 (2007)
Wong, J., Hong, J.I.: Making Mashups with Marmite:Towards End-User Programming for the Web. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1435–1444 (2007)
Kongdenfha, W., Benatallah, B., Saint-Paul, R., Casati, F.: SpreadMash: A Spreadsheet-Based Interactive Browsing and Analysis Tool for Data Services. In: Bellahsène, Z., Léonard, M. (eds.) CAiSE 2008. LNCS, vol. 5074, pp. 343–358. Springer, Heidelberg (2008)
Wang, G., Yang, S., Han, Y.: Mashroom: End-User Mashup Programming Using Nested Tables. In: Proceedings of the 18th International Conference on World Wide Web, pp. 861–870 (2009)
Silberschatz, A., Korth, H.F., Sudarshan, S.: Database System Concepts, 5th edn. (Simplified Chinese Translation Edition), pp. 378–400. The McGraw-Hill Education (Asia) Co. China Machine Press (2006)
EditGrid (2011), http://www.editgrid.com/
Ennals, R.J., Garofalakis, M.N.: MashMaker: Mashups for the Masses. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 1116–1118 (2007)
Hartmann, B., Wu, L., Collins, K., et al.: Programming by a Sample: Rapidly Creating Web Applications with d.mix. In: Proceedings of the 20th Annual ACM Symposium on User Interface Software and Technology, pp. 241–250 (2007)
Di, L.G., Hacid, H., Paik, H., et al.: Data Integration in Mashups. ACM SIGMOD Record 38(1), 59–66 (2009)
Hassan, O.A., Ramaswarny, L., Miller, J.A.: MACE: A Dynamic Caching Framework for Mashups. In: Proceedings of the IEEE International Conference on Web Services, pp. 75–82 (2009)
Hassan, O.A., Ramaswarny, L., Miller, J.A.: Enhancing Scalability and Performance of Mashups Through Merging and Operator Reordering. In: Proceedings of the IEEE International Conference on Web Services, pp. 171–178 (2010)
Schek, H.J., Scholl, M.H.: The relational model with relation-valued attributes. Information Systems 11(2), 137–147 (1986)
Babcock, B., Babu, S., Datar, M., et al.: Operator scheduling in data stream systems. The International Journal on Very Large Data Bases 13(4), 333–353 (2004)
Abadi, D.J., Carney, D., Cetintemel, U., et al.: Aurora: a new model and architecture for data stream management. The VLDB Journal 12(2), 120–139 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, H., Zhang, C., Zhang, P. (2012). An Optimization Strategy for Mashups Performance Based on Relational Algebra. In: Sheng, Q.Z., Wang, G., Jensen, C.S., Xu, G. (eds) Web Technologies and Applications. APWeb 2012. Lecture Notes in Computer Science, vol 7235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29253-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-29253-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29252-1
Online ISBN: 978-3-642-29253-8
eBook Packages: Computer ScienceComputer Science (R0)