Brighthouse is a column-oriented data warehouse that supports the compressed databases as well as analytic querying. For the faster query processing, Brighthouse creates packages from the data rows. While the query is resolving, it decompresses only those packages that partially satisfy the condition of the query to avoid accessing all the database. However, Brighthouse used a constant parameter to create packages, this may create incompact packages and lead to large number of packages that are processed in each query. In this paper, at first, we define the task of partitioning data table into blocks as an optimization problem, then discuss the time complexity of the problem and propose an efficient algorithm, which creates dynamically data packages for efficient queries in databases. The experimental results shown the advantage of the proposed approach in package range reduction.
CITATION STYLE
Nguyen, L. T. T., Nguyen, H. S., & Nguyen, S. H. (2018). A dynamic packed approach for analytic data warehouse in Ad-Hoc queries. In Advances in Intelligent Systems and Computing (Vol. 655, pp. 205–213). Springer Verlag. https://doi.org/10.1007/978-3-319-67220-5_19
Mendeley helps you to discover research relevant for your work.