Skip to main content

A Dynamic Packed Approach for Analytic Data Warehouse in Ad-Hoc Queries

  • Conference paper
  • First Online:
  • 1276 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 655))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ailamaki, A., DeWitt, D.J., Hill, M.D.: Data page layouts for relational databases on deep memory hierarchies. VLDB J. 11(3), 198–215 (2002)

    Article  MATH  Google Scholar 

  2. Apaydin, T., Canahuate, G., Ferhatosmanoglu, H., Tosun, A.S.: Approximate encoding for direct access and query processing over compressed bitmaps. In: VLDB, pp. 846–857 (2006)

    Google Scholar 

  3. Beyer, K.S., Haas, P.J., Reinwald, B., Sismanis, Y., Gemulla, R.: On synopses for distinct-value estimation under multiset operations. In: SIGMOD, pp. 199–210 (2007)

    Google Scholar 

  4. Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: a multidimensional workload aware histogram. In: SIGMOD, pp. 211–222 (2001)

    Google Scholar 

  5. Chakkappen, S., Cruanes, T., Dageville, B., Jiang, L., Shaft, U., Su, H., Zait, M.: Efficient and scalable statistics gathering for large databases in Oracle 11g. In: SIGMOD, pp. 1053–1063 (2008)

    Google Scholar 

  6. Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: PODS, pp. 181–190 (2008)

    Google Scholar 

  7. Holloway, A.L., Raman, V., Swart, G., DeWitt, D.J.: How to barter bits for chronons: compression and bandwidth tradeoffs for database scans. In: SIGMOD, pp. 389–400 (2007)

    Google Scholar 

  8. Slezak, D., Wroblewski, J., Eastwood, V., Synak, P.: Brighthouse: an analytic data warehouse for ad-hoc queries. PVLDB 1(2), 1337–1345 (2008)

    Google Scholar 

  9. Vo, B., Manku, G.S.: RadixZip: linear-time compression of token streams. VLDB 2007, 1162–1172 (2007)

    Google Scholar 

  10. Zukowski, M., Heman, S., Nes, N., Boncz, P.A.: Super-scalar RAM-CPU cache compression. In: ICDE, p. 59 (2006)

    Google Scholar 

Download references

Acknowledgments

This research is partially supported by the project “Parking space in rest and service areas (RSA)” financed by NCBiR/GDKKiA as a part of common undertaking “RID”, under the contract DZP/RID-I-44/8/NCBR/2016.

This work was carried out during the tenure of an ERCIM ‘Alain Bensoussan’ Fellowship Programme.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hung Son Nguyen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Nguyen, L.T.T., Nguyen, H.S., Nguyen, S.H. (2018). A Dynamic Packed Approach for Analytic Data Warehouse in Ad-Hoc Queries. In: Borzemski, L., Świątek, J., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017. ISAT 2017. Advances in Intelligent Systems and Computing, vol 655. Springer, Cham. https://doi.org/10.1007/978-3-319-67220-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67220-5_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67219-9

  • Online ISBN: 978-3-319-67220-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics