Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance impact of proxies in data intensive client-server applications
ICS '99 Proceedings of the 13th international conference on Supercomputing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Efficient execution of multiple query workloads in data analysis applications
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Batch Scheduling in Parallel Database Systems
Proceedings of the Ninth International Conference on Data Engineering
Query Scheduling in Multi Query Optimization
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Memory aware query scheduling in a database cluster
Memory aware query scheduling in a database cluster
(R) Prefetching and Caching for Query Scheduling in a Special Class of Distributed Applications
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
Improving Performance of Multiple Sequence Alignment Analysis in Multi-Client Environments
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Active Proxy-G: optimizing the query execution process in the grid
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Optimizing the Execution of Multiple Data Analysis Queries on Parallel and Distributed Environments
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A data locality aware online scheduling approach for I/O-intensive jobs with file sharing
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
| Hi-index | 0.00 |
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets aswell as intermediate results are maintained in memory to speed up query evaluation. In this work, we present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a sharedmemory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images.