4 citations · 4 across the 3 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2008
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
Owen Kaser, Daniel Lemire, Kamel Aouiche
Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-…
cs.DB2007
A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP
Kamel Aouiche, Daniel Lemire
A data warehouse cannot materialize all possible views, hence we must estimate quickly, accurately, and reliably the size of views to determine the best candidates for materializat…
cs.DB2007★ 4 cited
Unasssuming View-Size Estimation Techniques in OLAP
Kamel Aouiche, Daniel Lemire
Even if storage was infinite, a data warehouse could not materialize all possible views due to the running time and update requirements. Therefore, it is necessary to estimate quic…