Principles of database buffer management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Integration of buffer management and query optimization in relational database environment
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Workload scheduling for multiple query processing
Information Processing Letters
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Query Scheduling in Multi Query Optimization
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Dynamic Query Scheduling in Parallel Data Warehouses
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An evaluation of buffer management strategies for relational database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Real-Time Query Scheduling for Wireless Sensor Networks
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Modeling and exploiting query interactions in database systems
Proceedings of the 17th ACM conference on Information and knowledge management
Dynamic Materialization of Query Views for Data Warehouse Workloads
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
CFDC: a flash-aware buffer management algorithm for database systems
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Caching intermediate result of SPARQL queries
Proceedings of the 20th international conference companion on World wide web
Interaction-aware scheduling of report-generation workloads
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable Multi-query Optimization for SPARQL
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Simultaneous Resolution of Buffer Allocation and Query Scheduling Problems
CISIS '12 Proceedings of the 2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)
How to exploit the device diversity and database interaction to propose a generic cost model?
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
In the relational data warehouses, each OLAP query shall involve the fact table. This situation increases the interaction between queries that can have a significant impact on the warehouse performance. This interaction has been largely exploited in solving isolated problems like (i) the multiple-query optimization, (ii) the materialized view selection, (iii) the buffer management, (iv) the query scheduling, etc. Recently, some research efforts studied the impact of the query interaction on optimization problems combining interdependent sub-problems such as buffer management problem (BMP) and the query scheduling problem (QSP). Note that combining two complex problems usually increases the complexity of the integrated problem. In this paper, we study the effect of considering the query interaction on an integrated problem including BMP and QSP (namely, BMQSP). We first present a formalization of the BMQSP and show its hardness study. Due to high complexity of the BMQSP, we propose an algorithm called queen-bee inspired from the natural life of bees. Finally, theoretical and effective (on Oracle 11G) experiments are done using the star schema benchmark data set.