Sciweavers

EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 3 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
ICDE
2005
IEEE
98views Database» more  ICDE 2005»
14 years 5 months ago
An Implementation Scheme of Relational Tables
AbstractAbstractAbstract In this paper, an implementation scheme for relational tables is proposed. Our scheme employs extendible chunked arrays. We are proposing an implementation...
Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan, ...