Optimization of nested SQL queries revisited
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Database tuning: principles, experiments, and troubleshooting techniques
Database tuning: principles, experiments, and troubleshooting techniques
SilkRoute: A framework for publishing relational data in XML
ACM Transactions on Database Systems (TODS)
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
XPERANTO: Middleware for Publishing Object-Relational Data as XML Documents
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficiently publishing relational data as XML documents
The VLDB Journal — The International Journal on Very Large Data Bases
Optimization of query streams using semantic prefetching
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Incremental evaluation of schema-directed XML publishing
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Optimizing view queries in ROLEX to support navigable result trees
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A uniform system for publishing and maintaining XML data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
| Hi-index | 0.00 |
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution at the server side, and partly of query submission and network exchanges between the program and the server. The natural organization of database programs leads to submit an intensive flow of elementary SQL queries to the server, and exploits only locally its optimization power. In this paper, we develop a global optimization approach. We base this approach on an execution model where queries can be executed asynchronously with respect to the flow of the application program. Our method aims at choosing an efficient query scheduling which limits the penalty of client/server interactions. Our results show that the technique can improve the execution time of database programs by several orders of magnitude.