Compressing Bitmap Indexes for Faster Search Operations - CiteSeerX
Recommend Documents
the byte-aligned bitmap code (BBC), are usually faster in performing ... even more competitive in the future as the disk tech- nology improves. ...... www.info-zip.org/pub/infozip/zlib. [18] V. Markl and R. ... Orlando, Florida, USA, pages 220â230.
for read/write access at the same time. In data warehouse environments the data is used for decision support and large sets of data are read and usually not ...
Bitmap indexing has been successfully applied to scien- ... as in the case of scientific databases, indexing technolo- gies are well-known ...... Technical Report, Oracle Corp., 1994. U.S. ... Proceedings of the Int. Conf. on Very Large Data. Bases .
lossy compression we can use a larger hyper-rectangle and represent it in a smaller space. Multidimensional bulk loading algorithm. We can exploit a sort order ...
Nov 6, 2009 - database systems, we first propose several bitmap indexes for supporting ... tems, the proposed bitmap indexes and twig query process-.
GPU-WAH: Applying GPUs to Compressing. Bitmap Indexes with Word Aligned Hybrid. *. Witold Andrzejewski and Robert Wrembel. Poznan University of ...
Jul 30, 2011 - the case of an identified data breach at a financial institu- tion: the system administrator would like to quickly pinpoint the accessed nodes from ...
Mar 26, 2009 - database is converted into a 0-1 bitmap table, where rows corre- spond to .... Columns can be considered to be periodic, i.e. the pattern repeats.
Page 1 ... 1. Executive Summary. In the age of the customer, companies must ... accomplishing any of a number of top mar
mercial Database Management Systems, e.g., Oracle [1, 2], ... many other applications such as visualization of scientific data [10 ... In Oracle, âthe bitmap index is.
We consider an LP with biorthogonal decimation and interpolation filters, and show that the detail signals lie in lower-dimensional subspaces. This allows.
Bitmap-based graphic editing systems are special collaborative editing systems, .... gle-user applications are widely used, such as CorelDraw, Adobe Photoshop, etc. .... tention, this paper designs a new Undo/Redo approach, which takes full ...
gle-user applications are widely used, such as CorelDraw, Adobe Photoshop, etc. ... The previous works on Undo in bitmap-based graphic editing systems include [1], ... tention, this paper designs a new Undo/Redo approach, which takes full ...
lead to successful designs in this domain, giving examples of deployed ... with replicated search trees have shown that they lead to high availability, over-.
of updating such suffix-array based compressed indexes, there are two pieces of ..... We implement the count(c, i) function with a dynamic data structure COUNT,.
Keywords: Lattice Reduction, Quantum Computers, NTRU. 1 Introduction ... hardness of SVP in a special class of lattices. Classical Lattice ..... of NTRU against lattice reduction attacks has been studied in [HPS98,. §4.2 and Appendix].
maintaining n pairs of balanced parentheses in O(log n/ log log n) time per ..... parenthesis and the position of the nearest pair of enclosing parentheses, respec-.
Oct 7, 2016 - beacons (ARTVA) guides the rescuer during the search phase reducing the ... Even though a complete regulatory framework is not available yet in many ...... Available from: https://www.usbid.com/datasheets/dsid/183792.pdf.
existing and validated data mining in-memory software, Sipina [20]. Moreover, ... Induction trees are among the most popular supervised data mining methods.
compressed bitmap indices are efficient for multidimensional range queries ... retains a nonexclusive, royalty-free right to publish or reproduce this article, or to ...
We present MCTA, a model checking tool for real-time specifications ... element, but a subset of its domain. ... applications, hence the name of this abstraction.
Abstract. Cube Pruning is a fast method to explore the search space of a beam decoder. In this paper we present two modifi- cations of the algorithm that aim to ...
Bitmap indices are efficient for answering queries on low-cardinality attributes. ... retains a nonexclusive, royalty-free right to publish or reproduce this article, ...
Compressing Bitmap Indexes for Faster Search Operations - CiteSeerX
sion schemes, like the byte-aligned bitmap code (BBC), are usu- ally faster in ..... A computer CPU with MMX tech- ...... code available at http://www.info-zip.org/pub/infozip-. /zlib. ... February 23-27, 1998, Orlando, Florida, USA, pages 220â230.
LBNL-49627
Compressing Bitmap Indexes for Faster Search Operations Kesheng Wu, Ekow J. Otoo and Arie Shoshani Lawrence Berkeley National Laboratory Berkeley, CA 94720, USA Email: kwu, ejotoo, ashoshani@lbl.gov
Abstract— In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, NOT, etc. Using the general purpose compression schemes, such as gzip, the logical operations on the compressed bitmaps are much slower than on the uncompressed bitmaps. Specialized compression schemes, like the byte-aligned bitmap code (BBC), are usually faster in performing logical operations than the general purpose schemes, but in many cases they are still orders of magnitude slower than the uncompressed scheme. To make the compressed bitmap indexes operate more efficiently, we designed a CPU-friendly scheme which we refer to as the word-aligned hybrid code (WAH). Tests on both synthetic and real application data show that the new scheme significantly outperforms well-known compression schemes at a modest increase in storage space. Compared to BBC, a scheme well-known for its operational efficiency, WAH performs logical operations about 12 times faster and uses only 60% more space. Compared to the uncompressed scheme, in most test cases WAH is faster while still using less space. We further verified with additional tests that the improvement in logical operation speed translates to similar improvement in query processing speed.
I. I NTRODUCTION This research was originally motivated by the need to manage the volume of data produce by a high-energy experiment called STAR1 [25], [26]. In this experiment, information about each potentially interesting collision event is recorded and multi-terabyte ( ) of data is generated each year. One important way of accessing the data is to have the data management system retrieve the events satisfying some condition such as “Energy > 15 GeV and 7 15 GeV and 7 15 GeV and 7 15 GeV and 7 15 GeV and 7
