Sciweavers

Share
5 search results - page 1 / 1
» Optimizing I O Costs of Multi-dimensional Queries Using Bitm...
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
10 years 7 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
CIKM
2005
Springer
10 years 7 months ago
Optimizing candidate check costs for bitmap indices
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 ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
10 years 8 months ago
Online Sorted Range Reporting
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 ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
PODS
2008
ACM
221views Database» more  PODS 2008»
11 years 1 months ago
A generic flow algorithm for shared filter ordering problems
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...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CGF
2010
143views more  CGF 2010»
10 years 1 months ago
Coherent Culling and Shading for Large Molecular Dynamics Visualization
Molecular dynamics simulations are a principal tool for studying molecular systems. Such simulations are used to investigate molecular structure, dynamics, and thermodynamical pro...
Sebastian Grottel, Guido Reina, Carsten Dachsbache...
books