11 search results - page 1 / 3 » Optimizing candidate check costs for bitmap indices |
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
TKDE
2010
13 years 3 months ago
2010
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correctin...
TPDS
2010
13 years 3 months ago
2010
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...