Abstract
The efficient management of temporal data is crucial for many traditional and emerging database applications. A major performance bottleneck for database systems is the memory hierarchy. The performance of the memory hierarchy is directly related to how the content of disk pages maps to the L2 cache lines, i.e. to the organization of data within a page or the page layout. The prevalent page layout in database systems is the N-ary Storage Model (NSM). As demonstrated in this paper, using NSM for temporal data deteriorates memory hierarchy performance for query-intensive workloads. This paper proposes, new cache-conscious, read-optimized, page layouts specifically tailored for temporal data. The proposed page layouts optimize accesses to all levels of the memory hierarchy by avoiding fetching the same data several times (as opposed to NSM). Experiments show that the proposed page layouts are substantially faster than NSM.
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
Preview
Unable to display preview. Download preview PDF.
References
Stonebraker, M., Bear, C., Çetintemel, U., Cherniack, M.: Al.: One Size Fits All? Part 2: Benchmarking Studies. In: CIDR, pp. 173–184 (2007)
Stonebraker, M., Madden, S., Abadi, D., Harizopoulos, S.: Al.: The End of an Architectural Era (it’s Time for a Complete Rewrite). In: VLDB, pp. 1150–1160 (2007)
Stonebraker, M., Çetintemel, U.: “One Size Fits All”: An Idea Whose Time Has Come and Gone. In: ICDE 2005, pp. 2–11. IEEE Computer Society, Los Alamitos (2005)
Stonebraker, M., Abadi, D.J., Batkin, A., Chen, X.: Al.: C-store: A Column-Oriented DBMS. In: VLDB, pp. 553–564 (2005)
Baykan, E.: Recent Research on Database System Performance. Technical report, LBD-Ecole Polytechnique Fédérale de Lausanne (2005)
Ailamaki, A., DeWitt, D., Hill, M., Wood, D.: DBMSs on a Modern Processor: Where Does Time Go? In: VLDB, pp. 266–277. Morgan Kaufmann, San Francisco (1999)
Ailamaki, A., DeWitt, D., Hill, M., Skounakis, M.: Weaving Relations for Cache Performance. In: VLDB, pp. 169–180 (2001)
He, Z., Marquez, A.: Path and Cache Conscious Prefetching (PCCP). The VLDB Journal 16(2), 235–249 (2007)
Shao, M., Schindler, J., Schlosser, S.W., Ailamaki, A.: Al.: Clotho: Decoupling Memory Page Layout from Storage Organization. In: VLDB, pp. 696–707 (2004)
Ailamaki, A., Govindaraju, N.K., Manocha, D.: Query Co-Processing on Commodity Hardware. In: ICDE, p. 107 (2006)
SybaseIq, http://www.sybase.com/
SenSage, http://www.sensage.com/
VectorNova, http://www.vectornova.com/
Boncz, P.A., Zukowski, M., Nes, N.: MonetDB/X100: Hyper-Pipelining Query Execution. In: CIDR, pp. 225–237 (2005)
Chang, F., Dean, J., Ghemawat, S., Hsieh, W.: Al.: Bigtable: a Distributed Storage System for Structured Data. In: OSDI 2006, Berkeley, CA, USA, pp. 205–218. USENIX Association (2006)
Vertica, http://www.vertica.com/v-zone/product_documentation
Copeland, G.P., Khoshafian, S.: A Decomposition Storage Model. In: Navathe, S.B. (ed.) ACM SIGMOD 1985, pp. 268–279. ACM Press, New York (1985)
Ramakrishnan, R., Gehrke, J.: 3 Data Storage and Indexing. In: Database Management Systems. McGraw-Hill, New York (2000)
Ramamurthy, R., DeWitt, D.J., Su, Q.: A Case for Fractured Mirrors. The VLDB Journal 12(2), 89–101 (2003)
Harizopoulos, S., Liang, V., Abadi, D., Madden, S.: Performance Tradeoffs in Read-Optimized DataBases. In: VLDB, pp. 487–498 (2006)
Abadi, D.: Column Stores for Wide and Sparse Data. In: CIDR, pp. 292–297 (2007)
Abadi, D.J., Madden, S., Hachem, N.: Column-Stores vs. Row-Stores: How Different Are They Really? In: SIGMOD, Vancouver, Canada (to appear, 2008)
Ailamaki, A., DeWitt, D., Hill, M.: Data Page Layouts for Relational Databases on Deep Memory Hierarchies. The VLDB Journal 11(3), 198–215 (2002)
Abadi, D., Madden, S., Ferreira, M.: Integrating Compression and Execution in Column-Oriented Database Systems. In: ACM SIGMOD 2006, pp. 671–682 (2006)
Donghui, Z., Tsotras, V., Seeger, B.: Efficient Temporal Join Processing Using Indices. In: ICDE 2002, p. 103. IEEE Computer Society, Los Alamitos (2002)
Roth, M., Horn, S.V.: Database Compression. SIGMOD Rec. 22(3), 31–39 (1993)
Raman, V., Swart, G.: How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations. In: VLDB, pp. 858–869 (2006)
Hankins, R.A., Patel, J.M.: Data Morphing: An Adaptive, Cache-Conscious Storage Technique. In: VLDB, pp. 417–428 (2003)
Tao, Y., Papadias, D., Zhang, J.: Cost Models for Overlapping and Multiversion structures. ACM Trans. Database Syst. 27(3), 299–342 (2002)
Jouini, K., Jomier, G.: Indexing Multiversion Databases. In: ACM Sixteenth Conference on Information and Knowledge Management CIKM 2007 (November 2007)
Lomet, D.B., Salzberg, B.: The Performance of a Multiversion Access Method. In: ACM SIGMOD 1990, May 1990, pp. 353–363. ACM Press, New York (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jouini, K., Jomier, G., Kabore, P. (2008). Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2008. Lecture Notes in Computer Science, vol 5181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85654-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-85654-2_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85653-5
Online ISBN: 978-3-540-85654-2
eBook Packages: Computer ScienceComputer Science (R0)