Welcome to the InfoSci Platform
Reference Hub3
A Query Beehive Algorithm for Data Warehouse Buffer Management and Query Scheduling

A Query Beehive Algorithm for Data Warehouse Buffer Management and Query Scheduling

Amira Kerkad, Ladjel Bellatreche, Pascal Richard, Carlos Ordonez, Dominique Geniet
Copyright: © 2014 |Volume: 10 |Issue: 3 |Pages: 25
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781466653771|DOI: 10.4018/ijdwm.2014070103
Cite Article Cite Article

MLA

Kerkad, Amira, et al. "A Query Beehive Algorithm for Data Warehouse Buffer Management and Query Scheduling." IJDWM vol.10, no.3 2014: pp.34-58. http://doi.org/10.4018/ijdwm.2014070103

APA

Kerkad, A., Bellatreche, L., Richard, P., Ordonez, C., & Geniet, D. (2014). A Query Beehive Algorithm for Data Warehouse Buffer Management and Query Scheduling. International Journal of Data Warehousing and Mining (IJDWM), 10(3), 34-58. http://doi.org/10.4018/ijdwm.2014070103

Chicago

Kerkad, Amira, et al. "A Query Beehive Algorithm for Data Warehouse Buffer Management and Query Scheduling," International Journal of Data Warehousing and Mining (IJDWM) 10, no.3: 34-58. http://doi.org/10.4018/ijdwm.2014070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Analytical queries, like those used in data warehouses and OLAP, are generally interdependent. This is due to the fact that the database is usually modeled with a denormalized star schema or its variants, where most queries pass through a large central fact table. Such interaction has been largely exploited in query optimization techniques such as materialized views. Nevertheless, such approaches usually ignore buffer management and assume queries have a fixed order and are known in advance. We believe such assumptions are too strong and thus they need to be revisited and simplified. In this paper, we study the combination of two problems: buffer management and query scheduling, in both static and dynamic scenarios. We present an NP-hardness study of the joint problem, highlighting its complexity. We then introduce a new and highly efficient algorithm inspired by a beehive. We conduct an extensive experimental evaluation on a real DBMS showing the superiority of our algorithm compared to previous ones as well as its excellent scalability.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.