Computer Science ›› 2015, Vol. 42 ›› Issue (11): 28-31.doi: 10.11896/j.issn.1002-137X.2015.11.004

Previous Articles     Next Articles

Optimized Adaptive Hybrid Indexing for In-memory Column Stores

XUE Zhong-bin, ZHOU Xuan, ZHANG Yan-song, ZHOU Xin and WANG Shan   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Analytical database has been widely deployed in modern corporations which are posing increasing demand for the speed of data analysis.In the era of big data,analytical database is faced with a number of new challenges.Firstly,the complexity of data keeps increasing,therefore,more efforts have to be put into system configuration,such as index creation.Secondly,without prior knowledge about the patterns of workload,system administrators have to build and rebuild indexes repeatedly,in order to meet the time constraints.Apparently,traditional approaches to index construction and maintenance can not work well in the new environment.Database cracking provides an alternative to solve the problem.Using database cracking,a DBA does not need to fine-tune the system configuration.Instead,the database can automatically adjust itself to fit the workload during query execution.In recent years,a series of database cracking algorithms have been proposed,while none of them is optimal in all situations.The paper proposed a cache conscious cost model for database cracking.Based on the model,we created a new adaptive index,which can combine the advantages of several previous cracking approaches.Extensive experiments were conducted to demonstrate the effectiveness of our method.

Key words: Adaptive merging,Database cracking,Adaptive indexing,Hybrid algorithm

[1] Chaudhuri S,Weikum G.Rethinking database system architecture:Towards a self-tuning risc-style database system[C]∥Proceedings of the 26th In VLDB.2000:1-10
[2] Graefe G,Idreos S,Kuno H,et al.Benchmarking adaptive indexing[C]∥TPCTC.2010:169-184
[3] Graefe G,Kuno H.Adaptive indexing for relational keys[C]∥ICDE.2010:69-74
[4] Graefe G,Kuno H.Self-selecting,self-tuning,incrementally optimized indexex[C]∥EDBT.2010:371-381
[5] Idreos S,Kersten M L,Manegold S.Database cracking[C]∥CIDR.2007:68-78
[6] Idreos S,Kersten M L,Manegold S.Updating a cracked data-base[C]∥SIGMOD.2007:413-424
[7] Idreos S,Kersten M L,Manegold S.Self-organizing tuple reconstruction in column stores[C]∥SIGMOD.2009:297-308
[8] Idreos S,Manegold S,Kuno H,et al.Merging what’s cracked,cracking what’s merged:adaptive index in main-memory column-stores[J].PVLDB,2011,4(9):585-597
[9] Halim F,Idreos S,Karras P,et al.Stochastic database cracking:Towards robust adaptive indexing in main-memory Column-stores[J].PVLDB,2012,5(6):502-513
[10] Kersten M,Manegold S.cracking the database store[C]∥CIDR.2005:213-224
[11] Hoare C A R.Algorithm 64:Quicksort[J].Communications of the ACM,1961,4(4):319-320
[12] Schuhknecht F M,Jindal A,Dittrich J.The Uncracked Pieces in Database Cracking[C]∥VLDB.2013
[13] Pirk H,Petraki E,Idreos S,et al.Database Cracking:FancyScan,not Poor Man’s Sort![J/OL].http://oai.cwi.nl/oai/asset/22474/22474D.pdf
[14] Graefe G,Halim F,Idreos S,et al.Transactional support for adaptive indexing[J].The VLDB Journal,2014,23(2):303-328
[15] Alvarez V,Schuhknecht F M,Dittrich J,et al.Main Memory Adaptive Indexing for Multi-core Systems[J/OL].http://arxiv.org/abs/1404.2034

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!