Relational database management systems manages the tables with predefined indexes. In RDBM S indexes are created on the basis of attribute values. The Imine indexing scheme is used to index item sets in relational databases. The index creation is performed with out any constraints. IM ine provides a complete representation of the original database. The Imine indexing scheme reduces the input/output cost for item set extraction and management process. The Imine index method supports different item set extraction algorithms. Different rule mining algorithms are supported by Imine index scheme. At present the Imine index scheme is developed under PostgreSQL DBM S. The item set extraction and indexing operations are integrated in the system. The IM ine scheme is improved to handle incremental data. In the incremental data handling mechanism the item sets and indexes are updated with respect transactional database changes. The data add, modify and remove operations are supported by the proposed index method. Reindexing process is optimized. Data structure is updated to handle all data distribution. The proposed item set extraction and indexing scheme is designed for the Oracle relational database. The system development is planned using J2EE environment. General and compact structure - Provide tight integration of item set extraction - Can be efficiently exploited by different item set extraction algorithm - In particular, FP-growth and LCM v.2 - Has been integrated into the PostgreSQL DBM S
[1]
Gao Cong,et al.
Speed-up iterative frequent itemset mining with constraint changes
,
2002,
2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[2]
Ada Wai-Chee Fu,et al.
Mining frequent itemsets without support threshold: with and without item constraints
,
2004,
IEEE Transactions on Knowledge and Data Engineering.
[3]
Osmar R. Zaïane,et al.
Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining
,
2003,
KDD '03.
[4]
Hiroki Arimura,et al.
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
,
2004,
FIMI.
[5]
Laks V. S. Lakshmanan,et al.
Pushing Convertible Constraints in Frequent Itemset Mining
,
2004,
Data Mining and Knowledge Discovery.
[6]
Gösta Grahne,et al.
Efficiently Using Prefix-trees in Mining Frequent Itemsets
,
2003,
FIMI.
[7]
Gösta Grahne,et al.
Mining frequent itemsets from secondary memory
,
2004,
Fourth IEEE International Conference on Data Mining (ICDM'04).
[8]
Ganesh Ramesh,et al.
Indexing and Data Access Methods for Database Mining
,
2002,
DMKD.