Print Email Facebook Twitter BlockJoin Title BlockJoin: Efficient Matrix Partitioning Through Joins Author Kunft, Andreas (Technical University of Berlin) Katsifodimos, A (TU Delft Web Information Systems) Schelter, Sebastian (Technical University of Berlin) Rabl, Tilmann (Technical University of Berlin; German Research Centre for Artificial Intelligence (DFKI)) Markl, Volker (Technical University of Berlin; German Research Centre for Artificial Intelligence (DFKI)) Contributor Boncz, Peter (editor) Salem, Ken (editor) Date 2017 Abstract Linear algebra operations are at the core of many Machine Learning (ML) programs. At the same time, a considerable amount of the effort for solving data analytics problems is spent in data preparation. As a result, end-to- end ML pipelines often consist of (i) relational operators used for joining the input data, (ii) user defined functions used for feature extraction and vectorization, and (iii) linear algebra operators used for model training and cross- validation. Often, these pipelines need to scale out to large datasets. In this case, these pipelines are usually implemented on top of dataflow engines like Hadoop, Spark, or Flink. These dataflow engines implement relational operators on row-partitioned datasets. However, efficient linear algebra operators use block-partitioned matrices. As a result, pipelines combining both kinds of operators require rather expensive changes to the physical representation, in particular re partitioning steps. In this paper, we investigate the potential of reducing shuffling costs by fusing relational and linear algebra operations into specialized physical operators. We present BlockJoin, a distributed join algorithm which directly produces block-partitioned results. To minimize shuffling costs, BlockJoin applies database techniques known from columnar processing, such as index-joins and late materialization, in the context of parallel dataflow engines. Our experimental evaluation shows speedups up to 6× and the skew resistance of BlockJoin compared to state- of-the-art pipelines implemented in Spark. To reference this document use: http://resolver.tudelft.nl/uuid:3eafcbe9-a7fe-400d-9c59-918707e10cd2 Publisher VLDB Endowment Source Proceedings of the VLDB Endowment: Proceedings of the 43rd International Conference on Very Large Data Bases Event VLDB 2017, 2017-08-28 → 2017-09-01, Munich, Germany Series Proceedings of the VLDB Endowment, 10 (13) Part of collection Institutional Repository Document type conference paper Rights © 2017 Andreas Kunft, A Katsifodimos, Sebastian Schelter, Tilmann Rabl, Volker Markl Files PDF blockjoin_pvldb17.pdf 1.36 MB Close viewer /islandora/object/uuid:3eafcbe9-a7fe-400d-9c59-918707e10cd2/datastream/OBJ/view