textabstractTraditional query optimizers produce a fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time. In this paper, we propose a dynamic query processing scheme and we present the performance results obtained by simulation of a queueing network model of the proposed software architecture
The constructionof high-performancedatabasesystems that combine the best aspects of the relational a...
. Distributed databases operating over wide-area networks such as the Internet, must deal with the u...
The efficiency of processing strategies for queries in a distributed database is critical for system...
The success of distributed database depends on the query optimization techniques used. The users pos...
Traditional query optimizers assume accurate knowledge of run-time parameters such as selectivities ...
Very long-running queries in database systems are not uncommon in non-traditional application domain...
The design, implementation and performance of an optimizer for a nested query language is considered...
Execution plans produced by traditional query optimizers for data integration queries may yield poor...
Database parallelism increases the complexity of query optimization. In particular, the query optimi...
AbstractIn this paper, we model database designs using queueing networks, giving visibility to the d...
Query optimizer is an important component in the architecture of relational data base management sys...
Somewhat surprisingly, the behavior of analytical query engines is crucially affected by the dynamic...
Current database systems employ static heuristics for estimating the access time of a particular que...
Distributed query optimization is an important issue in distributed database management systems, sin...
Improving Query Processing Performance in Database Management Systems has been a research challenge...
The constructionof high-performancedatabasesystems that combine the best aspects of the relational a...
. Distributed databases operating over wide-area networks such as the Internet, must deal with the u...
The efficiency of processing strategies for queries in a distributed database is critical for system...
The success of distributed database depends on the query optimization techniques used. The users pos...
Traditional query optimizers assume accurate knowledge of run-time parameters such as selectivities ...
Very long-running queries in database systems are not uncommon in non-traditional application domain...
The design, implementation and performance of an optimizer for a nested query language is considered...
Execution plans produced by traditional query optimizers for data integration queries may yield poor...
Database parallelism increases the complexity of query optimization. In particular, the query optimi...
AbstractIn this paper, we model database designs using queueing networks, giving visibility to the d...
Query optimizer is an important component in the architecture of relational data base management sys...
Somewhat surprisingly, the behavior of analytical query engines is crucially affected by the dynamic...
Current database systems employ static heuristics for estimating the access time of a particular que...
Distributed query optimization is an important issue in distributed database management systems, sin...
Improving Query Processing Performance in Database Management Systems has been a research challenge...
The constructionof high-performancedatabasesystems that combine the best aspects of the relational a...
. Distributed databases operating over wide-area networks such as the Internet, must deal with the u...
The efficiency of processing strategies for queries in a distributed database is critical for system...