Abstract
Main memory database management systems have become essential for response-time-bounded applications, such as those in telecommunications systems or Internet, where users frequently access a table in order to get information or check whether an element exists, and require the response to be as fast as possible. Continuous data growth is making it unaffordable to keep entire relations in memory and some commercial applications provide two different engines to handle data in-memory and on-disk separately. However, these systems assign each table to one of these engines, forcing large relations to be kept on secondary storage.
In this paper we present TwinS — a hybrid database management system that allows managing hybrid tables, i.e. tables partially managed by both engines. We show that we can reduce response time when accessing a large table in the database. All our experiments have been run on a dual-engine DBMS: IBM®SolidDB®.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Garcia-Molina, H., Salem, K.: Main memory database systems: An overview. IEEE Transactions on knowledge and data engineering 4(6), 509–516 (1992)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 426 (1970)
Aguilar-Saborit, J., Trancoso, P., Muntés-Mulero, V., Larriba-Pey, J.-L.: Dynamic adaptive data structures for monitoring data streams. Data Knowl. Eng. 66(1), 92–115 (2008)
DeWitt, D., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., Wood, D.: Implementation techniques for main memory database systems. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 1–8. ACM, New York (1984)
Liedes, A., Wolski, A.: SIREN: a memory-conserving, snapshot-consistent checkpoint algorithm for in-memory databases. In: ICDE’06. Proceedings of the 22nd International Conference on Data Engineering, p. 99 (2006)
Stonebraker, M., Madden, S., Abadi, D., Harizopoulos, S., Hachem, N., Helland, P.: The end of an architectural era it’s time for a complete rewrite). In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB Endowment, pp. 1150–1160 (2007)
Boncz, P., Kersten, M., Manegold, S.: Breaking the memory wall in MonetDB
Jung, K., Lee, K., Bae, H.: Implementation of storage manager in main memory database system altibase TM. In: Chen, J., Hong, S. (eds.) RTCSA 2003. LNCS, vol. 2968, pp. 499–512. Springer, Heidelberg (2004)
Team, C.: In-memory data management for consumer transactions the timesten approach. ACM SIGMOD Record 28(2), 528–529 (1999)
Wang, S., Hao, X., Xu, H., Hu, Y.: Finding frequent items in data streams using ESBF. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M.M. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4819, pp. 244–255. Springer, Heidelberg (2007)
Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics 1(4), 485–509 (2004)
Ledlie, J., Serban, L., Toncheva, D.: Scaling filename queries in a large-scale distributed file system. Tech. rep., Citeseer (2002)
Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB Endowment, p. 357 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guisado-Gámez, J., Wolski, A., Zuzarte, C., Larriba-Pey, JL., Muntés-Mulero, V. (2010). Hybrid In-Memory and On-Disk Tables for Speeding-Up Table Accesses. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15364-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-15364-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15363-1
Online ISBN: 978-3-642-15364-8
eBook Packages: Computer ScienceComputer Science (R0)