Filters








5,082 Hits in 4.0 sec

Performance Measurements of Compressed Bitmap Indices

Theodore Johnson
1999 Very Large Data Bases Conference  
dblp:conf/vldb/Johnson99 fatcat:5cevcjlhlfh43gae3fuhn23v2q

Bitmap indices for fast end-user physics analysis in ROOT

Kurt Stockinger, Kesheng Wu, Rene Brun, Philippe Canal
2006 Nuclear Instruments and Methods in Physics Research Section A : Accelerators, Spectrometers, Detectors and Associated Equipment  
Our performance results show that for multi-dimensional queries, bitmap indices outperform the traditional analysis method up to a factor of 10.  ...  In this paper we describe an integration effort that can significantly reduce this unnecessary reading by using an efficient compressed bitmap index technology.  ...  Size of the Compressed Bitmap Indices We first measure the sizes of the compressed bitmap indices and compare them with the original, uncompressed data set.  ... 
doi:10.1016/j.nima.2005.11.127 fatcat:t4oab4ha7zd4hozuf6mmajihlm

On the Performance of Bitmap Indices for High Cardinality Attributes1 [chapter]

K WU, E OTOO, A SHOSHANI
2004 Proceedings 2004 VLDB Conference  
For an attribute with a high cardinality, the size of the bitmap index can be very large. To overcome this size problem, specialized compression schemes are used.  ...  In addition, our analyses and tests show that the compressed indices are relatively small compared with commonly used indices such as B-trees.  ...  This is the performance of projection index, which we use as the yard stick to measure the performance of other indices.  ... 
doi:10.1016/b978-012088469-8/50006-1 fatcat:o2odtflpdfg33b25kvju6s4q6e

On the Performance of Bitmap Indices for High Cardinality Attributes [chapter]

Kesheng Wu, Ekow Otoo, Arie Shoshani
2004 Proceedings 2004 VLDB Conference  
For an attribute with a high cardinality, the size of the bitmap index can be very large. To overcome this size problem, specialized compression schemes are used.  ...  In addition, our analyses and tests show that the compressed indices are relatively small compared with commonly used indices such as B-trees.  ...  This is the performance of projection index, which we use as the yard stick to measure the performance of other indices.  ... 
doi:10.1016/b978-012088469-8.50006-1 dblp:conf/vldb/WuOS04 fatcat:hg6svruaabfftc7ky3cshf3jv4

Optimizing bitmap indices with efficient compression

Kesheng Wu, Ekow J. Otoo, Arie Shoshani
2006 ACM Transactions on Database Systems  
Our timing measurements on range queries not only confirm the linear relationship between the query response time and the number of hits, but also demonstrate that WAH compressed indices answer queries  ...  faster than the commonly used indices including projection indices, B-tree indices, and other compressed bitmap indices.  ...  Doron Rotem and Kurt Stockinger for their help in reviewing the drafts of this paper. This work was supported by the Office of Science of the U.S. Department of Energy under Contract No.  ... 
doi:10.1145/1132863.1132864 fatcat:dsxpp6zugreovdyou63sykgrtq

Application of bitmap index to information retrieval

Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits.  ...  The hierarchical summary bits provide bitmap indices with efficient bit operations, usage of space for large sparse bitmaps, and partial decompression.  ...  To deal with this performance issue, we apply bitmap indices, which carry out Boolean operations efficiently [2] .  ... 
doi:10.1145/1367497.1367680 dblp:conf/www/FujiokaUO08 fatcat:prs6gkqan5ailppmdu4xq7qt7e

Indexing Incomplete Databases [chapter]

Guadalupe Canahuate, Michael Gibas, Hakan Ferhatosmanoglu
2006 Lecture Notes in Computer Science  
The performance of Bitmap indexes and quantization based indexes is evaluated and compared over a variety of analysis parameters for real and synthetic data sets.  ...  We first show that known indexing techniques for multi-dimensional data search break down in terms of performance when indexed attributes contain missing data.  ...  Bitmap Compression One of the biggest disadvantages of bitmap indices is the amount of space they require.  ... 
doi:10.1007/11687238_52 fatcat:4xbwlt5pwvgnxcch74f73ugvly

Update Conscious Bitmap Indices

Guadalupe Canahuate, Michael Gibas, Hakan Ferhatosmanoglu
2007 International Conference on Scientific and Statistical Database Management  
We compare the update conscious bitmaps to traditional bitmaps in terms of storage space, update performance, and query execution time.  ...  In order to transfer the fast query response times offered by bitmap indices to dynamic database domains, we propose an update conscious bitmap index that provides a mechanism to quickly update bitmaps  ...  Updates of existing data are handled by performing a delete operation followed by an insertion. These changes expand the applicable domain of bitmap indices.  ... 
doi:10.1109/ssdbm.2007.24 dblp:conf/ssdbm/CanahuateGF07 fatcat:djv47b3rbrhljnd6rm5cgw6wmi

Strategies for processing ad hoc queries on large data warehouses

Kurt Stockinger, Kesheng Wu, Arie Shoshani
2002 Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP - DOLAP '02  
We evaluate the performance of two different compression schemes for bitmap indexes stored is various ways.  ...  Using the compression scheme called Word-Aligned Hybrid Code (WAH) to store the bitmaps in plain files shows the best overall performance for bitmap indexes.  ...  The authors wish to express our sincere gratitude to Theodore Johnson of AT&T Research for permitting us to use his BBC implementation in our bitmap indexing program.  ... 
doi:10.1145/583890.583901 dblp:conf/dolap/StockingerWS02 fatcat:v6s6vyj4lrcojfi2myyiwba7pe

FastBit: an efficient indexing technology for accelerating data-intensive science

Kesheng Wu
2005 Journal of Physics, Conference Series  
It organizes user data in a column-oriented structure which is efficient for on-line analytical processing (OLAP), and utilizes compressed bitmap indices to further speed up query processing.  ...  Analyses have proven the compressed bitmap index used in FastBit to be theoretically optimal for onedimensional queries.  ...  One of the key technology is the Word-Aligned Hybrid (WAH) code for compressing bitmap indices.  ... 
doi:10.1088/1742-6596/16/1/077 fatcat:sdkkr2ay2vgfdhxw2744xqrqmu

CONCISE: Compressed 'n' Composable Integer Set [article]

Alessandro Colantonio, Roberto Di Pietro
2010 arXiv   pre-print
In this paper we present CONCISE (Compressed 'n' Composable Integer Set), a new scheme that enjoys significatively better performances than those of WAH.  ...  The Word Aligned Hybrid (WAH) bitmap compression trades some space to allow for bitwise operations without first decompressing bitmaps.  ...  It has been first proposed to compress bitmap indices of DBMS, but subsequent applications include visual analytics [3] and data mining [4] , to cite a few.  ... 
arXiv:1004.0403v1 fatcat:hv6kgzkxx5c3lomtfl2gzfrnzy

FastBit: interactively searching massive data

K Wu, S Ahern, E W Bethel, J Chen, H Childs, E Cormier-Michel, C Geddes, J Gu, H Hagen, B Hamann, W Koegler, J Lauret (+12 others)
2009 Journal of Physics, Conference Series  
In this article, we present a summary of the key underlying technologies, namely bitmap compression, encoding, and binning.  ...  In each case, FastBit significantly reduces the response time and enables interactive exploration on terabytes of data.  ...  We are also studying ways to perform text searches using compressed bitmap indexes.  ... 
doi:10.1088/1742-6596/180/1/012053 fatcat:ezzqcd2uwbcyxbwdhca2zmcuve

Early Design Phase Cross-Platform Throughput Prediction for Industrial Stream-Processing Applications

Tjerk Bijlsma, Alexander Lint, Jacques Verriet, Marc Herbstritt
2018 Euromicro Conference on Real-Time Systems  
The throughput of a stream-processing application executed on different embedded platforms can be predicted by modeling them using static or measurement based analysis.  ...  A three step regression-based approach is presented, which uses an expression based on Amdahl's law for the discrete scaling of workload over cores and a large database with CPU performance scores to perform  ...  Acknowledgements The research is carried out as part of the Octo+ program under the responsibility of Embedded Systems Innovation by TNO (ESI) with Océ Technologies B.V. as the carrying industrial partner  ... 
doi:10.4230/lipics.ecrts.2018.18 dblp:conf/ecrts/BijlsmaLV18 fatcat:ksju6p235nhqnlwxgzzh4kj4si

Concise: Compressed 'n' Composable Integer Set

Alessandro Colantonio, Roberto Di Pietro
2010 Information Processing Letters  
In this paper we present Concise (Compressed 'n' Composable Integer Set), a new scheme that enjoys significantly better performances than WAH.  ...  The Word Aligned Hybrid (WAH) bitmap compression trades some space to allow for bitwise operations without first decompressing bitmaps.  ...  Time and memory measurements. "Compression" means the ratio between the number of 32-bit words required to represent the compressed bitmap and the cardinality of the integer set.  ... 
doi:10.1016/j.ipl.2010.05.018 fatcat:x5c2ucovizeqlhbhhl7v6rx3mu

Optimizing Druid with Roaring bitmaps

Samy Chambi, Daniel Lemire, Robert Godin, Kamel Boukhalfa, Charles R. Allen, Fangjin Yang
2016 Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16  
Previously, we introduced a new compressed bitmap index scheme called Roaring bitmap that has shown interesting results when compared to the bitmap compression scheme adopted by Druid : Concise.  ...  In this work, we produce an extensive series of experiments in order to compare Roaring bitmap and Concise time-space performances when used to accelerate Druid 's OLAP queries and other kinds of operations  ...  Benchmarking performances for retrieving set bits from bitmaps Another performance aspect indicating the efficiency of a compression bitmap library is the speed at which it allows to iterate over a bitmap  ... 
doi:10.1145/2938503.2938515 dblp:conf/ideas/ChambiLGBAY16 fatcat:m2uqf3o2zjcf3hlenacovmm7qe
« Previous Showing results 1 — 15 out of 5,082 results