Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICDE.2013.6544836
DC FieldValue
dc.titleAn efficient and compact indexing scheme for large-scale data store
dc.contributor.authorLu, P.
dc.contributor.authorWu, S.
dc.contributor.authorShou, L.
dc.contributor.authorTan, K.-L.
dc.date.accessioned2014-07-04T03:11:20Z
dc.date.available2014-07-04T03:11:20Z
dc.date.issued2013
dc.identifier.citationLu, P.,Wu, S.,Shou, L.,Tan, K.-L. (2013). An efficient and compact indexing scheme for large-scale data store. Proceedings - International Conference on Data Engineering : 326-337. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICDE.2013.6544836" target="_blank">https://doi.org/10.1109/ICDE.2013.6544836</a>
dc.identifier.isbn9781467349086
dc.identifier.issn10844627
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/78007
dc.description.abstractThe amount of data managed in today's Cloud systems has reached an unprecedented scale. In order to speed up query processing, an effective mechanism is to build indexes on attributes that are used in query predicates. However, conventional indexing schemes fail to provide a scalable service: as the size of these indexes are proportional to the data size, it is not space efficient to build many indexes. As such, it becomes more crucial to develop effective index to provide scalable database services in the Cloud. In this paper, we propose a compact bitmap indexing scheme for a large-scale data store. The bitmap indexing scheme combines state-of-the-art bitmap compression techniques, such as WAH encoding and bit-sliced encoding. To further reduce the index cost, a novel and query efficient partial indexing technique is adopted, which dynamically refreshes the index to handle updates and process queries. The intuition of our indexing approach is to maximize the number of indexed attributes, so that a wider range of queries, including range and join queries, can be efficiently supported. Our indexing scheme is light-weight and its creation can be seamlessly grafted onto the MapReduce processing engine without incurring significant running cost. Moreover, the compactness allows us to maintain the bitmap indexes in memory so that performance overhead of index access is minimal. We implement our indexing scheme on top of the underlying Distributed File System (DFS) and evaluate its performance on an in-house cluster. We compare our index-based query processing with HadoopDB to show its superior performance. Our experimental results confirm the effectiveness, efficiency and scalability of the indexing scheme. © 2013 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICDE.2013.6544836
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/ICDE.2013.6544836
dc.description.sourcetitleProceedings - International Conference on Data Engineering
dc.description.page326-337
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

18
checked on Jul 18, 2019

Page view(s)

121
checked on Jul 20, 2019

Google ScholarTM

Check

Altmetric


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