Abstract
Modern applications and databases using dynamic storage environment are characterized by two challenging features: (a) little idle system time to devote in physical design; (b) little priori knowledge about the query and data workload. Traditional approaches to index building and maintenance do not work well in such dynamic environment; while adaptive indexing can be a remedy. An adaptive index is a partially created index. Refinement of the index is conducted during query execution. Database cracking and adaptive merging are two techniques for adaptive indexing. The former is advantageous at initialization, while the latter can converge to its optimal structure with a much faster speed. In this paper, we propose a hybrid approach by combining cracking and adaptive merging. We designed a cost model to measure the cost of data partition operations. Based on the model, we provide an algorithm to refine adaptive index. Experiments show that our hybrid approach can achieve appropriate performance tradeoff between database cracking and adaptive merging.
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
Chaudhuri, S., Weikum, G.: Rethinking database system architecture: Towards a self-tuning risc-style database system. In: Proceedings of the 26th Int. VLDB, pp. 1–10 (2000)
Graefe, G., Idreos, S., Kuno, H., Manegold, S.: Benchmarking adaptive indexing. In: Nambiar, R., Poess, M. (eds.) TPCTC 2010. LNCS, vol. 6417, pp. 169–184. Springer, Heidelberg (2011)
Graefe, G., Kuno, H.: Adaptive indexing for relational keys. In: ICDE, pp. 69–74 (2010)
Graefe, G., Kuno, H.: Self-selecting, self-tuning, incrementally optimized indexex. In: EDBT, pp. 371–381 (2010)
Idreos, S., Kersten, M.L., Manegold, S.: Database cracking. In: CIDR, pp. 68–78 (2007)
Idreos, S., Kersten, M.L., Manegold, S.: Updating a cracked database. In: SIGMOD, pp. 413–424 (2007)
Idreos, S., Kersten, M.L., Manegold, S.: Self-organizing tuple reconstruction in column stores. In: SIGMOD, pp. 297–308 (2009)
Idreos, S., Manegold, S., Kuno, H., Graefe, G.: Merging what’s cracked, cracking what’s merged: adaptive index in main-memory column-stores. PVLDB 4(9), 585–597 (2011)
Halim, F., Idreos, S., Karras, P., Yap, R.H.C.: Stochastic database cracking:Towards robust adaptive indexing in main-memory Column-stores. PVLDB 5(6), 502–513 (2012)
Kersten, M., Manegold, S.: Cracking the database store. In: CIDR, pp. 213–224 (2005)
Bruno, N., Chaudhuri, S.: Physical design refinement: the‘merge-reduce’ approach. ACM TODS 32(4), 28:1–28:41 (2007)
Chaudhuri, S., Narasayya, V.R.: Self-tuning database systems: Adecade of progress. In: VLDB, pp. 3–14 (2007)
Finkelstein, S.J., Schkolnick, M., Tiberio, P.: Physical database design for relational databases. ACM TODS 13(1), 91–128 (1988)
Härder, T.: Selecting an optimal set of secondary indices. In: Samelson, K. (ed.) ECI 1976. LNCS, vol. 44, pp. 146–160. Springer, Heidelberg (1976)
Seshadri, A.: Generalized partial indexes. In: ICDE, pp. 420–427 (1995)
Stonebraker, M.: The case for partial indexes. SIGMOD Record 18(4), 4–11 (1989)
Hoare, C.: Algorithm 64: Quicksort. Comm. ACM 4(7), 321.0 4534 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, Z., Qin, X., Zhou, X., Wang, S., Yu, A. (2013). Optimized Adaptive Hybrid Indexing for In-memory Column Stores. In: Hong, B., Meng, X., Chen, L., Winiwarter, W., Song, W. (eds) Database Systems for Advanced Applications. DASFAA 2013. Lecture Notes in Computer Science, vol 7827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40270-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-40270-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40269-2
Online ISBN: 978-3-642-40270-8
eBook Packages: Computer ScienceComputer Science (R0)