Frequent Patterns are very important in knowledge discovery and data mining process such as mining of association rules, correlations etc. Many existing incremental mining algorithms are Apriori-based, which are not easily adoptable to solve association rule mining. In FP-tree is a compact representation of transaction database that contains frequency information of all relevant Frequent Patterns (FP) in a dataset. Mining association rules among items in a large database has been recognized as one of the most important data mining problems. An earlier approach proposes a model that is capable of mining in transactional database, but that approach is not capable of managing the problem of changing the memory dynamically. In order to solve this problem we have been proposed a hybrid of two algorithms that could be able to handle the dynamic change of memory, dynamic databases and also to solve the problem of association rule mining problems. So memory can be utilized effectively in large scale transaction database.