Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Workload-independent data-driven vertical partitioning. / Bobrov, Nikita; Chernishev, George; Novikov, Boris.
New Trends in Databases and Information Systems - ADBIS 2017 Short Papers and Workshops AMSD, BigNovelTI, DAS, SW4CH, DC, Proceedings. ed. / Jerome Darmont; Marite Kirikova; Kjetil Norvag; Robert Wrembel; George A. Papadopoulos; Johann Gamper; Stefano Rizzi. Springer Nature, 2017. p. 275-284 (Communications in Computer and Information Science; Vol. 767).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Workload-independent data-driven vertical partitioning
AU - Bobrov, Nikita
AU - Chernishev, George
AU - Novikov, Boris
PY - 2017/10/1
Y1 - 2017/10/1
N2 - Vertical partitioning is a well-explored area of automatic physical database design. The classic approach is as follows: Derive an optimal vertical partitioning scheme for a given database and a workload. The workload describes queries, their frequencies, and involved attributes. In this paper we identify a novel class of vertical partitioning algorithms. The algorithms of this class do not rely on knowledge of the workload, but instead use data properties that are contained in the workload itself. We propose such algorithm that uses a logical scheme represented by functional dependencies, which are derived from stored data. In order to discover functional dependencies we use TANE — a popular functional dependency extraction algorithm. We evaluate our algorithm using an industrial DBMS (PostgreSQL) on number of workloads. We compare the performance of an unpartitioned configuration with partitions produced by our algorithm and several state-of-the-art workload-aware algorithms.
AB - Vertical partitioning is a well-explored area of automatic physical database design. The classic approach is as follows: Derive an optimal vertical partitioning scheme for a given database and a workload. The workload describes queries, their frequencies, and involved attributes. In this paper we identify a novel class of vertical partitioning algorithms. The algorithms of this class do not rely on knowledge of the workload, but instead use data properties that are contained in the workload itself. We propose such algorithm that uses a logical scheme represented by functional dependencies, which are derived from stored data. In order to discover functional dependencies we use TANE — a popular functional dependency extraction algorithm. We evaluate our algorithm using an industrial DBMS (PostgreSQL) on number of workloads. We compare the performance of an unpartitioned configuration with partitions produced by our algorithm and several state-of-the-art workload-aware algorithms.
KW - Functional dependency
KW - Physical design
KW - Vertical partitioning
UR - http://www.scopus.com/inward/record.url?scp=85029792724&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-67162-8_27
DO - 10.1007/978-3-319-67162-8_27
M3 - Conference contribution
AN - SCOPUS:85029792724
SN - 9783319671611
T3 - Communications in Computer and Information Science
SP - 275
EP - 284
BT - New Trends in Databases and Information Systems - ADBIS 2017 Short Papers and Workshops AMSD, BigNovelTI, DAS, SW4CH, DC, Proceedings
A2 - Darmont, Jerome
A2 - Kirikova, Marite
A2 - Norvag, Kjetil
A2 - Wrembel, Robert
A2 - Papadopoulos, George A.
A2 - Gamper, Johann
A2 - Rizzi, Stefano
PB - Springer Nature
T2 - 21st European Conference on Advances in Databases and Information Systems, ADBIS 2017 and 1st workshop on Data Driven Approaches for Analyzing and Managing Scholarly Data, AMSD 2017, 1st workshop on Novel Techniques for Integrating Big Data, BigNovelTI 2017, 1st International workshop on Data Science: Methodologies and Use-Cases, DaS 2017, 2nd International workshop on Semantic Web for Cultural Heritage, SW4CH 2017
Y2 - 24 September 2017 through 27 September 2017
ER -
ID: 35273404