#include <DBCacheTransactionShrinker.hpp>
Inheritance diagram for DBCacheTransactionShrinker:
Public Types | |
typedef DBCache::params_t | params_t |
Public Member Functions | |
DBCacheTransactionShrinker (const params_t *par) | |
counter_t | nextTransactionBIS_modifyPrevious (BIS &transaction, std::vector< unsigned int > &filter) |
It returns the next transaction and modifies the previously returned transaction according to the filter. | |
void | setCandidateSize (const size_t candidate_size) |
This sets the size of the candidates. | |
template<class BIS> | |
counter_t | nextTransactionBIS (BIS &transaction) |
template<class UAC> | |
bool | nextTransactionUAC (UAC &transaction) |
void | rewind () |
see: TransactionReader::rewind |
In the basic database cacher (see DBCache) it is not possible to modify the transactions that are stored in the cacher. Nevertheless it may significantly increase the efficiency if we could delete some item from certain transactions. For example unnecessary items slow down the support count of Apriori regardless of the data structure that is used to store the candidates.
An efficient transaction skrinking, which can be used in Apriori, was proposed by Park et al. It states that an item can be deleted from transaction t at iteration l, if it is not the element of l different candidates that are contained in t.
Definition at line 32 of file DBCacheTransactionShrinker.hpp.
|
Reimplemented from DBCache< T_R >. Definition at line 35 of file DBCacheTransactionShrinker.hpp. |
|
Definition at line 36 of file DBCacheTransactionShrinker.hpp. |
|
Definition at line 55 of file DBCache.hpp. |
|
It returns the next transaction and modifies the previously returned transaction according to the filter.
|
|
Definition at line 58 of file DBCache.hpp. |
|
see: TransactionReader::rewind
Definition at line 62 of file DBCache.hpp. |
|
This sets the size of the candidates.
|