199 search results - page 3 / 40 » A Performance Comparison of bitmap indexes |
KDD
1998
ACM
15 years 1 months ago
1998
ACM
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
SBBD
2001
14 years 10 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to i...
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...