View in EDS PDF Full Text

Performance evaluation of word-aligned compression methods for bitmap indices.

Saved in:
Bibliographic Details
Title: Performance evaluation of word-aligned compression methods for bitmap indices.
Authors: Guzun, Gheorghi1 gheorghi-guzun@uiowa.edu, Canahuate, Guadalupe1 guadalupe-canahuate@uiowa.edu
Source: Knowledge & Information Systems. Aug2016, Vol. 48 Issue 2, p277-304. 28p.
Subjects: Bit-mapped graphics, Institutional repositories, Information retrieval, Science databases, Search algorithms
Abstract: Bitmap indices are a widely used scheme for large read-only repositories in data warehouses and scientific databases. This binary representation allows the use of bit-wise operations for fast query processing and is typically compressed using run-length encoding techniques. Most bitmap compression techniques are aligned using a fixed encoding length (32 or 64 bits) to avoid explicit decompression during query time. They have been proposed to extend or enhance word-aligned hybrid (WAH) compression. This paper presents a comparative study of four bitmap compression techniques: WAH, PLWAH, CONCISE, and EWAH. Experiments are targeted to identify the conditions under which each method should be applied and quantify the overhead incurred during query processing. Performance in terms of compression ratio and query time is evaluated over synthetic-generated bitmap indices, and results are validated over bitmap indices generated from real data sets. Different query optimizations are explored, query time estimation formulas are defined, and the conditions under which one method should be preferred over another are formalized. [ABSTRACT FROM AUTHOR]
Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 116748501
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Performance evaluation of word-aligned compression methods for bitmap indices.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Guzun%2C+Gheorghi%22">Guzun, Gheorghi</searchLink><relatesTo>1</relatesTo><i> gheorghi-guzun@uiowa.edu</i><br /><searchLink fieldCode="AR" term="%22Canahuate%2C+Guadalupe%22">Canahuate, Guadalupe</searchLink><relatesTo>1</relatesTo><i> guadalupe-canahuate@uiowa.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Knowledge+%26+Information+Systems%22">Knowledge & Information Systems</searchLink>. Aug2016, Vol. 48 Issue 2, p277-304. 28p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Bit-mapped+graphics%22">Bit-mapped graphics</searchLink><br /><searchLink fieldCode="DE" term="%22Institutional+repositories%22">Institutional repositories</searchLink><br /><searchLink fieldCode="DE" term="%22Information+retrieval%22">Information retrieval</searchLink><br /><searchLink fieldCode="DE" term="%22Science+databases%22">Science databases</searchLink><br /><searchLink fieldCode="DE" term="%22Search+algorithms%22">Search algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Bitmap indices are a widely used scheme for large read-only repositories in data warehouses and scientific databases. This binary representation allows the use of bit-wise operations for fast query processing and is typically compressed using run-length encoding techniques. Most bitmap compression techniques are aligned using a fixed encoding length (32 or 64 bits) to avoid explicit decompression during query time. They have been proposed to extend or enhance word-aligned hybrid (WAH) compression. This paper presents a comparative study of four bitmap compression techniques: WAH, PLWAH, CONCISE, and EWAH. Experiments are targeted to identify the conditions under which each method should be applied and quantify the overhead incurred during query processing. Performance in terms of compression ratio and query time is evaluated over synthetic-generated bitmap indices, and results are validated over bitmap indices generated from real data sets. Different query optimizations are explored, query time estimation formulas are defined, and the conditions under which one method should be preferred over another are formalized. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=116748501
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10115-015-0877-9
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 28
        StartPage: 277
    Subjects:
      – SubjectFull: Bit-mapped graphics
        Type: general
      – SubjectFull: Institutional repositories
        Type: general
      – SubjectFull: Information retrieval
        Type: general
      – SubjectFull: Science databases
        Type: general
      – SubjectFull: Search algorithms
        Type: general
    Titles:
      – TitleFull: Performance evaluation of word-aligned compression methods for bitmap indices.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Guzun, Gheorghi
      – PersonEntity:
          Name:
            NameFull: Canahuate, Guadalupe
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 02191377
          Numbering:
            – Type: volume
              Value: 48
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Knowledge & Information Systems
              Type: main
ResultId 1