File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2723372.2747642
- Scopus: eid_2-s2.0-84957589427
- WOS: WOS:000452535700004
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: ByteSlice: pushing the envelop of main memory data processing with a new storage layout
Title | ByteSlice: pushing the envelop of main memory data processing with a new storage layout |
---|---|
Authors | |
Keywords | Main memory Column store Storage layout SIMD OLAP |
Issue Date | 2015 |
Publisher | The Association for Computing Machinery. |
Citation | The 2015 ACM SIGMOD/PODS Conference (SIGMOD’15), Melbourne, VC., Australia, 31 May-4 June 2015. In Conference Proceedings, 2015, p. 31-46 How to Cite? |
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. |
Description | Accepted Research Papers |
Persistent Identifier | http://hdl.handle.net/10722/214761 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Feng, Z | - |
dc.contributor.author | Lo, E | - |
dc.contributor.author | Kao, B | - |
dc.contributor.author | Xu, W | - |
dc.date.accessioned | 2015-08-21T11:54:28Z | - |
dc.date.available | 2015-08-21T11:54:28Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | The 2015 ACM SIGMOD/PODS Conference (SIGMOD’15), Melbourne, VC., Australia, 31 May-4 June 2015. In Conference Proceedings, 2015, p. 31-46 | - |
dc.identifier.isbn | 978-1-4503-2758-9 | - |
dc.identifier.uri | http://hdl.handle.net/10722/214761 | - |
dc.description | Accepted Research Papers | - |
dc.description.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. | - |
dc.language | eng | - |
dc.publisher | The Association for Computing Machinery. | - |
dc.relation.ispartof | Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD’15) | - |
dc.subject | Main memory | - |
dc.subject | Column store | - |
dc.subject | Storage layout | - |
dc.subject | SIMD | - |
dc.subject | OLAP | - |
dc.title | ByteSlice: pushing the envelop of main memory data processing with a new storage layout | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Kao, B: kao@cs.hku.hk | - |
dc.identifier.authority | Kao, B=rp00123 | - |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1145/2723372.2747642 | - |
dc.identifier.scopus | eid_2-s2.0-84957589427 | - |
dc.identifier.hkuros | 249901 | - |
dc.identifier.spage | 31 | - |
dc.identifier.epage | 46 | - |
dc.identifier.isi | WOS:000452535700004 | - |
dc.publisher.place | United States | - |