Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Partially preemptible hash joins
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Ripple joins for online aggregation
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Quality of Service Issues in Internet Web Services
IEEE Transactions on Computers
Data Management for Pervasive Computing
Proceedings of the 27th International Conference on Very Large Data Bases
Memory-Adaptive External Sorting
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Semantic caching of Web queries
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient query processing for data integration
Efficient query processing for data integration
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient delivery of web services
Efficient delivery of web services
QPipe: a simultaneously pipelined relational query engine
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Content-based routing: different plans for different data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Composing, optimizing, and executing plans for bioinformatics web services
The VLDB Journal — The International Journal on Very Large Data Bases
Interactive query formulation over web service-accessed sources
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Analysis of Caching and Replication Strategies for Web Applications
IEEE Internet Computing
Maximizing the output rate of multi-way join queries over streaming information sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Damia: a data mashup fabric for intranet applications
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Framework for Web service query algebra and optimization
ACM Transactions on the Web (TWEB)
Foundations and Trends in Databases
Optimization of multi-domain queries on the web
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
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.