5 search results - page 1 / 1 » Optimizing I O Costs of Multi-dimensional Queries Using Bitm... |
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...
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 ...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
PODS
2008
ACM
14 years 4 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
CGF
2010
13 years 4 months ago
2010
Molecular dynamics simulations are a principal tool for studying molecular systems. Such simulations are used to investigate molecular structure, dynamics, and thermodynamical pro...