Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1989323.1989424
Title: | Llama: Leveraging columnar storage for scalable join processing in the MapReduce framework | Authors: | Lin, Y. Agrawal, D. Chen, C. Ooi, B.C. Wu, S. |
Keywords: | column store join MapReduce |
Issue Date: | 2011 | Citation: | Lin, Y.,Agrawal, D.,Chen, C.,Ooi, B.C.,Wu, S. (2011). Llama: Leveraging columnar storage for scalable join processing in the MapReduce framework. Proceedings of the ACM SIGMOD International Conference on Management of Data : 961-972. ScholarBank@NUS Repository. https://doi.org/10.1145/1989323.1989424 | Abstract: | To achieve high reliability and scalability, most large-scale data warehouse systems have adopted the cluster-based architecture. In this paper, we propose the design of a new cluster-based data warehouse system, LLama, a hybrid data management system which combines the features of row-wise and column-wise database systems. In Llama, columns are formed into correlation groups to provide the basis for the vertical partitioning of tables. Llama employs a distributed file system (DFS) to disseminate data among cluster nodes. Above the DFS, a MapReduce-based query engine is supported. We design a new join algorithm to facilitate fast join processing. We present a performance study on TPC-H dataset and compare Llama with Hive, a data warehouse infrastructure built on top of Hadoop. The experiment is conducted on EC2. The results show that Llama has an excellent load performance and its query performance is significantly better than the traditional MapReduce framework based on row-wise storage. © 2011 ACM. | Source Title: | Proceedings of the ACM SIGMOD International Conference on Management of Data | URI: | http://scholarbank.nus.edu.sg/handle/10635/40553 | ISBN: | 9781450306614 | ISSN: | 07308078 | DOI: | 10.1145/1989323.1989424 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.