A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
Update Conscious Bitmap Indices
2007
International Conference on Scientific and Statistical Database Management
Preserved Fulltext
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 ...
We compare the update conscious bitmaps to traditional bitmaps in terms of storage space, update performance, and query execution time. ...
Section 2 provides some background on bitmap indices and bitmap compression. Section 3 presents the update conscious bitmap approach. ...
doi:10.1109/ssdbm.2007.24
dblp:conf/ssdbm/CanahuateGF07
fatcat:djv47b3rbrhljnd6rm5cgw6wmi
Resource discovery algorithm based on hierarchical model and Conscious search in Grid computing system
2017
Journal of Soft Computing and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The "Bitmap" model is based on the hierarchical and conscious search model that allows for less traffic and low number of messages in relation to other methods in this respect. ...
This proposed method is based on the hierarchical and conscious search model that enhances the "Bitmap" method with the objective to reduce traffic, reduce the load of resource management processing, reduce ...
The "index" record with index "Bitmap[i] =0" indicates that the resource "R" with "i" feature is absent among the child of this node. ...
doi:10.5899/2017/jsca-00086
fatcat:4la5id5rbvc5bddth4uaqrd3hy
Updatable Materialization of Approximate Constraints
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Therefore, we present a sharded bitmap as the underlying data structure which offers efficient update operations, and describe approaches to maintain approximate constraints under updates, avoiding index ...
As real world data warehouse workloads are often not limited to read-only queries, we enhance the PatchIndex structure towards an update-conscious design in this paper. ...
Sharded bitmap design Update Conscious Bitmap Indices [11] faced the problem of degrading read performance under updates [3] . ...
arXiv:2102.06557v1
fatcat:vpibfjo5wrfqdalpby33w2kcui
UpBit
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A major drawback of bitmap indexes, however, is that supporting updates is particularly costly. ...
Bitmap indexes are kept compressed to minimize storage footprint; as a result, updating a bitmap index requires the expensive step of decoding and then encoding a bitvector. ...
Update Conscious Bitmaps [8] (UCB) is the state-of-the-art design for update-optimized bitmap indexes. ...
doi:10.1145/2882903.2915964
dblp:conf/sigmod/AthanassoulisYI16
fatcat:oofnlx4qm5adfhpiumguyyv4ue
Dynamic Data Organization for Bitmap Indices
2008
Proceedings of the Third International ICST Conference on Scalable Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Bitmap indices have been successfully used in scientific databases and data warehouses. ...
In this paper, we present a dynamic data structure and algorithm for organizing bitmap indices for better compression and query processing performance. ...
This technique speeds up the updates on bitmap indices significantly, however tuple reordering is not taken into account. ...
doi:10.4108/icst.infoscale2008.3554
dblp:conf/infoscale/ApaydinFCT08
fatcat:btcrzc6tgrc35m4ak7yviuiope
Secondary indexing in one dimension
2009
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show how to support updates achieving various time-space trade-offs. * The main ideas for this work were conceived during Dagstuhl seminar No. 08081 on Data Structures, 2008. ...
A more space-conscious approach to range queries is binning (see [16] ). ...
Since one bitmap in each materialized level (namely the one corresponding to the last occurrence of that character) will be affected by an update, we need to update O(lg lg n) bitmaps. ...
doi:10.1145/1559795.1559824
dblp:conf/pods/PaghS09
fatcat:prx3tgpcfzdh3cv7c5cdbmfh4a
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We show how to support updates achieving various time-space trade-offs. ...
A more space-conscious approach to range queries is binning (see [16] ). ...
Since one bitmap in each materialized level (namely the one corresponding to the last occurrence of that character) will be affected by an update, we need to update O(lg lg n) bitmaps. ...
arXiv:0811.2904v1
fatcat:zlhkh5phe5cnfj6afv6lahhuxm
KISS-Tree
2012
Proceedings of the Eighth International Workshop on Data Management on New Hardware - DaMoN '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present the KISS-Tree, a latch-free inmemory index that is optimized for a minimum number of memory accesses and a high number of concurrent updates. ...
Current research mainly focused on adapting block-optimized B+-Trees, but these data structures were designed for secondary memory and involve comprehensive structural maintenance for updates. ...
Because there is a maximum of 2 6 = 64 buckets in a node on the last level, the bitmap indicates which buckets are actually in use. ...
doi:10.1145/2236584.2236587
dblp:conf/damon/KissingerSHL12
fatcat:o7qnna2n65ddvapqf6nc6bijf4
Two birds, one stone
2016
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, Hippo achieves up to three orders of magnitude less maintenance overhead and up to an order of magnitude higher throughput (for hybrid query/update workloads) than its counterparts. ...
overhead which results in non-ignorable dollar cost in big data scenarios especially when deployed on modern storage devices. (2) Maintaining an index incurs high latency because the DBMS has to locate and update ...
Bitmap index also does not perform well in update-intensive workloads due to tuplewise index structure. ...
doi:10.14778/3025111.3025120
fatcat:4trraxwt2zcbpof36epr2mkwr4
Compressed bitmap indexes: beyond unions and intersections
2014
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Compressed bitmap indexes are used to speed up simple aggregate queries in databases. ...
Our work shows that bitmap indexes are more broadly applicable than is commonly believed. ...
When the bitmaps are poorly compressible, we can view RBMRG as a memory-conscious version of SCANCOUNT. ...
doi:10.1002/spe.2289
fatcat:3yelnd2vgreyzov3xjde3wqm34
DB2 with BLU acceleration
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Designed and built from the ground up to exploit modern multi-core processors, DB2 BLU's hardware-conscious algorithms are carefully engineered to maximize parallelism by using novel data structures that ...
As predicates in the evaluator chain are applied, they disqualify tuples and update the TSNList bitmap with 0-bits. ...
It accepts a TSNList (a range of TSNs and a bitmap indicating which TSNs from that range need to be loaded), and outputs a Vector holding values or codes for that column, as desired. ...
doi:10.14778/2536222.2536233
fatcat:wcuspdaryzbzxkhwvvz63wt5hm
Column imprints
2013
Proceedings of the 2013 international conference on Management of data - SIGMOD '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce column imprint, a novel and powerful, yet lightweight, cache conscious secondary index. ...
Large scale data warehouses rely heavily on secondary indexes, such as bitmaps and b-trees, to limit access to slow IO devices. ...
Bitmaps, or variations of bitmaps, are more often used for this task [20] . Bitmaps work by mapping individual values to an array of bits. ...
doi:10.1145/2463676.2465306
dblp:conf/sigmod/SidirourgosK13
fatcat:uqeba5k34nfm7l7ax65grksh5i
Optimal Dynamic Sequence Representations
2014
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The time is worst-case for the queries and amortized for the updates. This complexity is better than the best previous ones by a Θ(1 + lg σ/ lg lg n) factor. ...
It consists of cutting the bitmap into chunks of length b = lg(n)/2 and encoding each chunk i as a pair (c i , o i ): c i is the class, which indicates how many 1s are there in the chunk, and o i is the ...
Mäkinen and Navarro [27] obtained O(lg σ lg n) time for all the operations, including updates, by using dynamic bitmaps that handled all the operations in time O(lg n). ...
doi:10.1137/130908245
fatcat:xtpxdic6eve5xfx2ptcwpkb7ca
Optimal Dynamic Sequence Representations
[chapter]
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The time is worst-case for the queries and amortized for the updates. This complexity is better than the best previous ones by a Θ(1 + lg σ/ lg lg n) factor. ...
It consists of cutting the bitmap into chunks of length b = lg(n)/2 and encoding each chunk i as a pair (c i , o i ): c i is the class, which indicates how many 1s are there in the chunk, and o i is the ...
Mäkinen and Navarro [27] obtained O(lg σ lg n) time for all the operations, including updates, by using dynamic bitmaps that handled all the operations in time O(lg n). ...
doi:10.1137/1.9781611973105.62
dblp:conf/soda/NavarroN13
fatcat:5c5vbhctanbmbno5m72xflhl3y
Perceptually-supported image editing of text and graphics
2004
ACM SIGGRAPH 2004 Papers on - SIGGRAPH '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
First, it presents a new, intuitive model for maintaining image objects and groups, along with underlying logic for updating these in the course of an editing session. ...
or other obvious visual indicators. ...
Boxes indicate groups found by Scan-Scribe's automatic structuring processes. ...
doi:10.1145/1186562.1015787
fatcat:yucr6q2hzfduplvaouwsnqbqoe
« Previous
Showing results 1 — 15 out of 410 results