Skip to main content

Composite Group-Keys

Space-Efficient Indexing of Multiple Columns for Compressed In-Memory Column Stores

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8921))

Abstract

Real world applications make heavy use of composite keys to reference entities. Indices over multiple columns are therefore mandatory to achieve response time goals of applications. We describe and evaluate the Composite Group-Key Index for fast tuple retrieval via composite keys from the compressed partition of in-memory column-stores with a main/delta architecture. Composite Group-Keys work directly on the dictionary-encoded columns. Multiple values are encoded in a native integer and extended by an inverted index. The proposed index offers similar lookup performance as alternative approaches, but reduces the storage requirements significantly. For our analyzed dataset of an enterprise application the index can reduce the storage footprint compared to B+Trees by 70 percent. We give a detailed study of the lookup performance for a variable number of attributes and show that the index can be created efficiently by working directly on the dictionary-compressed data.

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   34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.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

Notes

  1. 1.

    Rockwood et al.: Best practices: Optimizing analytic workloads using DB2 10.5 with BLU Acceleration May 2014 on IBM.com.

  2. 2.

    http://panthema.net/2007/stx-btree/.

References

  1. Böhm, M., Schlegel, B., Volk, P.B., Fischer, U., Habich, D., Lehner, W.: Efficient in-memory indexing with generalized prefix trees. In: Härder, T., Lehner, W., Mitschang, B., Schöning, H., Schwarz, H. (eds.) BTW. LNI, vol. 180, pp. 227–246. GI, Kaiserslautern (2011)

    Google Scholar 

  2. Färber, F., Cha, S.K., Primsch, J., Bornhövd, C., Sigg, S., Lehner, W.: SAP HANA database: data management for modern business applications. SIGMOD Rec. 40(4), 45–51 (2011)

    Article  Google Scholar 

  3. Faust, M., Schwalb, D., Krueger, J., Plattner, H.: Fast lookups for in-memory column stores: group-key indices, lookup and maintenance. In: ADMS 2012

    Google Scholar 

  4. Grund, M., Krueger, J., Plattner, H., Zeier, A., Cudre-Mauroux, P., Madden, S.: HYRISE—a main memory hybrid storage engine. In: VLDB 2010 (2010)

    Google Scholar 

  5. Krüger, J., Kim, C., Grund, M., Satish, N., Schwalb, D., Chhugani, J., Plattner, H., Dubey, P., Zeier, A.: Fast updates on read-optimized databases using multi-core CPUs. PVLDB 5(1), 61–72 (2011)

    Google Scholar 

  6. Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: artful indexing for main-memory databases. In: Jensen, C.S., Jermaine, C.M., Zhou, X. (eds.) ICDE, pp. 38–49. IEEE Computer Society (2013)

    Google Scholar 

  7. Müller, I., Ratsch, C., Faerber, F.: Adaptive string dictionary compression in in-memory column-store database systems. In: EDBT (2014)

    Google Scholar 

  8. Raman, V., Attaluri, G., Barber, R., Chainani, N., Kalmuk, D., KulandaiSamy, V., Leenstra, J., Lightstone, S., Liu, S., Lohman, G.M., Malkemus, T., Mueller, R., Pandis, I., Schiefer, B., Sharpe, D., Sidle, R., Storm, A., Zhang, L.: DB2 with BLU acceleration: so much more than just a column store. In: Proceedings of the VLDB Endowment, pp. 1080–1091. VLDB Endowment, Aug 2013

    Google Scholar 

  9. Raman, V., Swart, G., Qiao, L., Reiss, F., Dialani, V., Kossmann, D., Narang, I., Sidle, R.: Constant-time query processing. In: ICDE 2008: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. IEEE Computer Society, Apr 2008

    Google Scholar 

  10. Rao, J., Ross, K.: Cache conscious indexing for decision-support in main memory. In: Proceedings of the International Conference on Very Large Data Bases (VLDB) (1999)

    Google Scholar 

  11. Rao, J., Ross, K.A.: Making B+-Trees Cache Conscious in Main Memory, vol. 29. ACM, New York (2000)

    Google Scholar 

  12. Sikka, V., Färber, F., Lehner, W., Cha, S.K., Peh, T., Bornhövd, C.: Efficient transaction processing in SAP HANA database: the end of a column store myth. In: Candan, K.S., Chen, Y., Snodgrass, R.T., Gravano, L., Fuxman, A. (eds.) SIGMOD Conference, pp. 731–742. ACM, New York (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Faust .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Faust, M., Schwalb, D., Plattner, H. (2015). Composite Group-Keys. In: Jagatheesan, A., Levandoski, J., Neumann, T., Pavlo, A. (eds) In Memory Data Management and Analysis. IMDM IMDM 2013 2014. Lecture Notes in Computer Science(), vol 8921. Springer, Cham. https://doi.org/10.1007/978-3-319-13960-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13960-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13959-3

  • Online ISBN: 978-3-319-13960-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics