Abstract
Databases commonly use multi-column indices for composite keys that concatenate attribute values for fast entity retrieval. For real-world applications, such concatenated composite keys contribute significantly to the overall space consumption, which is particularly expensive for main memory-resident databases. We present an integer-based hash representation of the actual values for the purpose of reducing the overall memory footprint of a system while maintaining the level of performance. We analyzed the performance impact as well as the memory footprint reduction of hash-based indices in SAP HANA in a real-world enterprise database setting. For a live production SAP ERP system, the introduction of hash-based primary key indices alone reduces the entire memory footprint by 10 % with comparable performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Global 2000: http://www.forbes.com/global2000/.
References
Ailamaki, A., et al.: DBMSs on a modern processor: where does time go? In: VLDB 1999, Proceedings of 25th International Conference on Very Large Data Bases, pp. 266–277 (1999)
Anh, V.N., Moffat, A.: Inverted index compression using word-aligned binary codes. Inf. Retr. 8(1), 151–166 (2005)
Athanassoulis, M., Ailamaki, A.: BF-Tree: approximate tree indexing. Proc. VLDB Endowment 7, 1881–1892 (2014)
Fagin, R., Nievergelt, J., Pippenger, N., Raymond Strong, H.: Extendible hashing a fast access method for dynamic files. ACM Trans. Database Syst. (TODS) 4(3), 315–344 (1979)
Färber, F., et al.: SAP HANA database: data management for modern business applications. ACM Sigmod Rec. 40(4), 45–51 (2012)
Faust, M., Schwalb, D., Plattner, H.: Composite group-keys. In: Jagatheesan, A., Levandoski, J., Neumann, T., Pavlo, A. (eds.) IMDM 2013/2014. LNCS, vol. 8921, pp. 139–150. Springer, Heidelberg (2015)
Gopal, V., et al.: Fast CRC computation for iSCSI Polynomial using CRC32 instruction. Technical report, Intel Corporation (2011)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Pearson Education, USA (1998)
Krueger, J., et al.: Fast updates on read-optimized databases using multi-core cpus. Proc. VLDB Endowment 5(1), 61–72 (2011)
Larson, P.-A.: Linear hashing with separators—a dynamic hashing scheme achieving one-access. ACM Trans. Database Syst. (TODS) 13(3), 366–388 (1988)
Lehman, T.J., Carey, M.J.: A study of index structures for main memory database management systems. In: Conference on Very Large Data Bases, vol. 294 (1986)
Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: artful indexing for main-memory databases. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 38–49. IEEE (2013)
Litwin, W.: Linear hashing: a new tool for file and table addressing. In: VLDB, vol. 80, pp. 1–3 (1980)
Manegold, S., Kersten, M.L., Boncz, P.: Database architecture evolution: mammals flourished long before dinosaurs became extinct. Proc. VLDB Endowment 2(2), 1648–1653 (2009)
Plattner, H.: The impact of columnar in-memory databases on enterprise systems. Proc. VLDB Endowment 7(13), 1722–1729 (2014)
Ross, K.A.: Efficient hash probes on modern processors. In: IEEE 23rd International Conference on Data Engineering, ICDE, pp. 1297–1301. IEEE (2007)
Sidirourgos, L., Kersten, M.: Column imprints: a secondary index structure. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 893–904. ACM (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Faust, M. et al. (2016). Footprint Reduction and Uniqueness Enforcement with Hash Indices in SAP HANA. In: Hartmann, S., Ma, H. (eds) Database and Expert Systems Applications. DEXA 2016. Lecture Notes in Computer Science(), vol 9828. Springer, Cham. https://doi.org/10.1007/978-3-319-44406-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-44406-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44405-5
Online ISBN: 978-3-319-44406-2
eBook Packages: Computer ScienceComputer Science (R0)