The distributed information search component (Disco) and the World Wide Web
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient mid-query re-optimization of sub-optimal query execution plans
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Memory-adaptive scheduling for large query execution
Proceedings of the seventh international conference on Information and knowledge management
Dynamic Query Operator Scheduling for Wide-Area Remote Access
Distributed and Parallel Databases
Obsolescent materialized views in query processing of enterprise information systems
Proceedings of the eighth international conference on Information and knowledge management
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Ginga: a self-adaptive query processing system
Proceedings of the eleventh international conference on Information and knowledge management
Join and multi-join processing in data integration systems
Data & Knowledge Engineering
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Efficient and Adaptive Processing of Multiple Continuous Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
A Closed Approach to Vague Collections in Partly Inaccessible Distributed Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Adaptive Query Processing: A Survey
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Learning response time for WebSources using query feedback and application in query optimization
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed query adaptation and its trade-offs
Proceedings of the 2003 ACM symposium on Applied computing
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An adaptable distributed query processing architecture
Data & Knowledge Engineering
Data integration: the teenage years
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Foundations and Trends in Databases
Distributed and Parallel Databases
Execution of distributed queries in the web environment
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
A strategy to develop adaptive and interactive query brokers
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
An adaptive load balancing algorithm for large data parallel processing with communication delay
ICCS'03 Proceedings of the 2003 international conference on Computational science
Dynamic query optimisation: towards decentralised methods
International Journal of Intelligent Information and Database Systems
Mobile Information Systems
| Hi-index | 0.00 |
Accessing data from numerous widely-distributed sources poses significant new challenges for query optimization and execution. Congestion and failures in the network can introduce highly-variable response times for wide-area data access. This paper is an initial exploration of solutions to this variability. We introduce a class of dynamic, run-time query plan modification techniques that we call query plan scrambling. We present an algorithm that modifies execution plans on-the-fly in response to unexpected delays in obtaining initial requested tuples from remote sources. The algorithm both reschedules operators and introduces new operators into the query plan. We present simulation results that demonstrate how the technique effectively hides delays by performing other useful work while waiting for missing data to arrive.