Skip to main content
Log in

Service-oriented execution model supporting data sharing and adaptive query processing

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

To deal with the environment’s heterogeneity, information providers usually offer access to their data by publishing Web services in the domain of pervasive computing. Therefore, to support applications that need to combine data from a diverse range of sources, pervasive computing requires a middleware to query multiple Web services. There exist works that have been investigating on generating optimal query plans. We however in this paper propose a query execution model, called PQModel, to optimize the process of query execution over Web Services. In other words, we attempt to improve query efficiency from the aspect of optimizing the execution processing of query plans.

PQModel is a data-flow execution model. Along with an adaptive query framework it used, PQModel aims to improve query efficiency and resource utilization by exploiting data and computation sharing opportunities across queries. A set of experiments, based on a prototype tool we developed, were carefully designed to evaluate PQModel by comparing it with a model whose query engine evaluates queries independently. Results show that our model can improve query efficiency in terms of both response time and network overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Apache axis. http://ws.apache.org/axis/

  2. Apache Tomcat. http://tomcat.apache.org/

  3. Abadi, D., Carney, D., Cetintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., Zdonik, S.: Aurora: a new model and architecture for data stream management. Int. J. VLDB 12(2), 120–139 (2003)

    Article  Google Scholar 

  4. Acharya, S.: Application and infrastructure challenges in pervasive computing. In: NSF Workshop on Context-Aware Mobile Database Management (CAMM), January, 2002

  5. Altinel, M., Brown, P., Cline, S., Kartha, R., Louie, E., Markl, V., Mau, L., Ng, Y.H., Simmen, D., Singh, A.: Damia—A data mashup fabric for intranet applications. In: Proc. of the 33rd Int. Conf. on Very Large Data Bases (VLDB) (2007)

  6. Avnur, R., Hellerstein, J.: Eddies: Continuously adaptive query processing. In: Proc. of the 19th ACM SIGMOD Int. Conf. Management of Data (2000)

  7. Babu, S., Bizarro, P.: Adaptive query processing in the looking glass. In: Conf. on Innovative Data Systems Research (CIDR) (2005)

  8. Bizarro, P., Babu, S., DeWitt, D., Widom, J.: Content-based routing: Different plans for different data. In: Proc. of the 31st Int. Conf. on Very Large Data Bases (VLDB) (2005)

  9. Braga, D., Ceri, S., Daniel, F., Martinenghi, D.: Optimization of multi-domain queries on the Web. In: Proc. of the 34th Int. Conf. on Very Large Data Bases (VLDB) (2008)

  10. Chappell, D.A., Jewell, T.: Java Web Services. O’Reilly, 2002

  11. Cherniack, M., Franklin, M.J., Zdonik, S.B.: Data management for pervasive computing. In: Proc. of the 27th Int. Conf. on Very Large Data Bases (VLDB) (2001)

  12. Chidlovskii, B., Borghoff, U.M.: Semantic caching of Web queries. Int. J. VLDB 9(1), 2–17 (2000)

    Article  Google Scholar 

  13. Conti, M., Kumar, M., Das, S.K., Shirazi, B.A.: Quality of service issues in Internet Web services. IEEE Trans. Comput. 51(6), 593–594 (2002)

    Article  Google Scholar 

  14. Deshpande, A., Ives, Z.G., Raman, V.: Adaptive query processing. Found. Trends Databases 1(1), 1–140 (2007)

    Article  Google Scholar 

  15. Florescu, D., Levy, A., Manolescu, I., Suciu, D.: Query optimization in the presence of limited access patterns. In: Proc. of the 18th ACM SIGMOD Int. Conf. Management of Data (1999)

  16. Gounaris, A.: Resource aware query processing on the grid. PhD thesis, School of Computer Science of the University of Manchester (2005)

  17. Haas, P.J., Hellerstein, J.M.: Ripple joins for online aggregation. In: Proc. of the 18th ACM SIGMOD Int. Conf. Management of Data (1999)

  18. Harizopoulos, S., Shkapenyuk, V., Ailamaki, A.: : Qpipe: a simultaneously pipelined relational query engine. In: Proc. of the 24th ACM SIGMOD Int. Conf. Management of Data (2005)

  19. Ives, Z.: Efficient query processing for data integration. PhD thesis, University of Washington (2002)

  20. Madden, S.R., Shah, M.A., Hellerstein, J.M., Raman, V.: Continuously adaptive continuous queries over streams. In: Proc. of the 21st ACM SIGMOD Int. Conf. Management of Data (2002)

  21. Markl, V., Raman, V., Simmen, D., Lohman, G., Pirahesh, H.: Robust query processing through progressive optimization. In: Proc. of the 23rd ACM SIGMOD Int. Conf. Management of Data (2004)

  22. Pang, H., Carey, M.J., Livny, M.: Partially preemptive hash joins. In: Proc. of the 12th ACM SIGMOD Int. Conf. Management of Data (1993)

  23. Pang, H., Carey, M.J., Livny, M.: Memory-adaptive external sorting. In: Proc. of the 19th Int. Conf. on Very Large Data Bases (VLDB) (1993)

  24. Petropoulos, M., Deutsch, A., Papakonstantinou, Y.: Interactive query formulation over Web service-accessed sources. In: Proc. of the 25th ACM SIGMOD Int. Conf. Management of Data (2006)

  25. Quzzani, M.: Efficient delivery of Web services. PhD thesis, Virginia Polytechnic (2004)

  26. Rubao, L., Minghong, Z., Huaming, L.: Request Window: An approach to improve throughput of RDBMS-based data integration system by utilizing data sharing across concurrent distributed queries. In: Proc. of the 33rd Int. Conf. on Very Large Data Bases (VLDB) (2007)

  27. Sacco, G.M., Schkolnick, M.: Buffer management in relational database systems. ACM TODS 11(4), 473–498 (1986)

    Article  Google Scholar 

  28. Sellis, T.K.: Multiple query optimization. ACM Trans. Database Syst. 13(1), 23–52 (1988)

    Article  Google Scholar 

  29. Sivasubramanian, S., Pierre, G., Steen, M.V., Alonso, G.: Analysis of caching and replication strategies for Web applications. IEEE Internet Comput. 11(1), 60–66 (2007)

    Article  Google Scholar 

  30. Srivastava, U., Munagala, K., Widom, J., Motwani, R.: Query optimization over Web services. In: Proc. of the 32nd Int. Conf. on Very Large Data Bases (VLDB) (2006)

  31. Thakkar, S., Ambite, J.L., Knoblock, C.A.: Composing, optimizing, and executing plans for bioinformatics web services. Int. J. VLDB 14(3), 330–353 (2005)

    Article  Google Scholar 

  32. Viglas, S., Naughton, J.F., Burger, J.: Maximizing the output rate of multi-join queries over streaming information sources. In: Proc. of the 29th Int. Conf. on Very Large Data Bases (VLDB) (2003)

  33. Weiser, M.: The computer for the twenty-first century. Sci. Am. 265(3), 94–104 (1991)

    Article  Google Scholar 

  34. Yu, Q., Bouguettaya, A.: Framework for Web service query algebra and optimization. ACM Trans. Web (TWEB) 2(1), 1–35 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongwei Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Y., Liu, J., Chen, G. et al. Service-oriented execution model supporting data sharing and adaptive query processing. Cluster Comput 13, 127–140 (2010). https://doi.org/10.1007/s10586-009-0109-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-009-0109-8

Keywords

Navigation