An Effective Technique for IMine Indexing using FP-Bonsai Tree

Abstract

A set of programs that allows to store, modify, and obtain information from a database. There are numerous types of data base management systems, which might be a very little system that run on personal computers to enormous systems that run on mainframes. With the huge increase in the amount of information, it is very difficult to manage these data. 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 perform very fast. In this paper proposed the IMine index (a common and compressed structure which presents close integration of item set mining) by using FP-Bonsai Tree and I-Tree. Previous approach have used Prefix Hash Tree (PHT), but it exhibit reduced locality of reference, i.e., the data to be accessed is distributed apparently at random in memory. Also PHT cause access patterns to jump around, hence this causes long delays and there is a wasteful on memory, since many of array positions possibly will contain empty linked lists. These drawbacks are solved with the use of FP-Bonsai Tree.