Fuzzy Decision Tree based Effective IMine Indexing

Data base management system is a set of programs that allows storing, modify, and obtain information from a database. With the huge increase in the amount of information, it is very difficult to manage these databases. Hence there is a need for an effective indexing technique. The advantage of using index lies in the fact is that index makes search operation very fast. In this paper proposed the IMine index (a common and compressed structure which presents close integration of item set mining) structure by using Fuzzy Decision Tree (FDT) and I-Tree. Previous approaches have used Prefix Hash Tree (PHT) and FP-Bonsai Tree but it exhibits long delays and unnecessary use of available memory size. FDT uses certain rules to generate the tree structure and hence it is easy to read the index based on the rule. FDT allows selective reading on the I-Tree. The experimental results proves that the use of FDT in the IMine provides low reading cost, very low utilization of available memory, and hence very low computation time.