Holistic Indexing in Main-memory Column-stores

被引:19
|
作者
Petraki, Eleni [1 ]
Idreos, Stratos [2 ]
Manegold, Stefan [1 ]
机构
[1] CWI Amsterdam, Amsterdam, Netherlands
[2] Harvard Univ, Cambridge, MA 02138 USA
关键词
Holistic Indexing; Self-organization; MULTI-CORE; DATABASE;
D O I
10.1145/2723372.2723719
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Great database systems performance relies heavily on index tuning, i.e., creating and utilizing the best indices depending on the workload. However, the complexity of the index tuning process has dramatically increased in recent years due to ad-hoc workloads and shortage of time and system resources to invest in tuning. This paper introduces holistic indexing, a new approach to automated index tuning in dynamic environments. Holistic indexing requires zero set-up and tuning effort, relying on adaptive index creation as a side-effect of query processing. Indices are created incrementally and partially; they are continuously refined as we process more and more queries. Holistic indexing takes the stateof-the-art adaptive indexing ideas a big step further by introducing the notion of a system which never stops refining the index space, taking educated decisions about which index we should incrementally refine next based on continuous knowledge acquisition about the running workload and resource utilization. When the system detects idle CPU cycles, it utilizes those extra cycles by refining the adaptive indices which are most likely to bring a benefit for future queries. Such idle CPU cycles occur when the system cannot exploit all available cores up to 100%, i.e., either because the workload is not enough to saturate the CPUs or because the current tasks performed for query processing are not easy to parallelize to the point where all available CPU power is exploited. In this paper, we present the design of holistic indexing for column-oriented database architectures and we discuss a detailed analysis against parallel versions of state-of-the-art indexing and adaptive indexing approaches. Holistic indexing is implemented in an open-source column-store DBMS. Our detailed experiments on both synthetic and standard benchmarks (TPC-H) and workloads (SkyServer) demonstrate that holistic indexing brings significant performance gains by being able to continuously refine the physical design in parallel to query processing, exploiting any idle CPU resources.
引用
收藏
页码:1153 / 1166
页数:14
相关论文
共 50 条
  • [1] Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores
    Halim, Felix
    Idreos, Stratos
    Karras, Panagiotis
    Yap, Roland H. C.
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (06): : 502 - 513
  • [2] Fast Multi-Column Sorting in Main-Memory Column-Stores
    Xu, Wenjian
    Feng, Ziqiang
    Lo, Eric
    [J]. SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 1263 - 1278
  • [3] Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
    Idreos, Stratos
    Manegold, Stefan
    Kuno, Harumi
    Graefe, Goetz
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (09): : 586 - 597
  • [4] Adaptive NUMA-aware data placement and task scheduling for analytical workloads in main-memory column-stores
    Psaroudakis, Iraklis
    Scheuer, Tobias
    May, Norman
    Sellami, Abdelkader
    Ailamaki, Anastasia
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2016, 10 (02): : 37 - 48
  • [5] Highspeed Graph Processing Exploiting Main-Memory Column Stores
    Hauck, Matthias
    Paradies, Marcus
    Froening, Holger
    Lehner, Wolfgang
    Rauhe, Hannes
    [J]. EURO-PAR 2015: PARALLEL PROCESSING WORKSHOPS, 2015, 9523 : 503 - 514
  • [6] Nimble join: A parallel star join for main memory column-stores
    Sangat, Prajwol
    Taniar, David
    Indrawan-Santiago, Maria
    Messom, Christopher
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (08):
  • [7] Efficient Many-Core Query Execution in Main Memory Column-Stores
    Dees, Jonathan
    Sanders, Peter
    [J]. 2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 350 - 361
  • [8] Vectorized UDFs in Column-Stores
    Raasveldt, Mark
    Muhleisen, Hannes
    [J]. 28TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT (SSDBM) 2016), 2016,
  • [9] Hardware-Oblivious Parallelism for In-Memory Column-Stores
    Heimel, Max
    Saecker, Michael
    Pirk, Holger
    Manegold, Stefan
    Markl, Volker
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (09): : 709 - 720
  • [10] The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases
    Leis, Viktor
    Kemper, Alfons
    Neumann, Thomas
    [J]. 2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 38 - 49