Please use this identifier to cite or link to this item:
Title: Byteslice : pushing the envelop of main memory data processing with a new storage layout
Authors: Feng, Z
Lo, E 
Kao, B
Xu, W
Issue Date: 2015
Source: SIGMOD'15 : proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, May 31-June 4, 2015, Melbourne, Victoria, Australia, p. 31-46. New York, NY: ACM, 2015
Abstract: Scan and lookup are two core operations in main memory column stores. A scan operation scans a column and returns a result bit vector that indicates which records satisfy a filter. Once a column scan is completed, the result bit vector is converted into a list of record numbers, which is then used to look up values from other columns of interest for a query. Recently there are several inmemory data layout proposals that aim to improve the performance of in-memory data processing. However, these solutions all stand at either end of a trade-off - each is either good in lookup performance or good in scan performance, but not both. In this paper we present ByteSlice, a new main memory storage layout that supports both highly efficient scans and lookups. ByteSlice is a bytelevel columnar layout that fully leverages SIMD data-parallelism. Micro-benchmark experiments show that ByteSlice achieves a data scan speed at less than 0.5 processor cycle per column value - a new limit of main memory data scan, without sacrificing lookup performance. Our experiments on TPC-H data and real data show that ByteSlice offers significant performance improvement over all state-of-the-art approaches.
Keywords: Column store
Main memory
Storage layout
Publisher: ACM
ISBN: 9781450327589
ISSN: 0730-8078
DOI: 10.1145/2723372.2747642
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 7, 2020


Last Week
Last month
Citations as of Sep 20, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 20, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.