Cubrick
Authors:
Open Access
- 1 September 2016
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 9 (13) , 1305-1316
Abstract
This paper describes the architecture and design of Cubrick, a distributed multidimensional in-memory DBMS suited for interactive analytics over highly dynamic datasets. Cubrick has a strictly multidimensional data model composed of cubes, dimensions and metrics, supporting sub-second OLAP operations such as slice and dice, roll-up and drill-down over terabytes of data. All data stored in Cubrick is range partitioned by every dimension and stored within containers called bricks in an unordered and sparse fashion, providing high data ingestion rates and indexed access through any combination of dimensions. In this paper, we describe details about Cubrick's internal data structures, distributed model, query execution engine and a few details about the current implementation. Finally, we present results from a thorough experimental evaluation that leveraged datasets and queries collected from a few internal Cubrick deployments at Facebook.Keywords
This publication has 10 references indexed in Scilit:
- Nanocubes for Real-Time Exploration of Spatiotemporal DatasetsIEEE Transactions on Visualization and Computer Graphics, 2013
- ScubaProceedings of the VLDB Endowment, 2013
- Processing a trillion cells per mouse clickProceedings of the VLDB Endowment, 2012
- Column-stores vs. row-stores2008
- Dwarf2002
- Consistent hashing and random trees1997
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- R-trees1984
- A record and file partitioning modelCommunications of the ACM, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975