Email this article 
Open Access
Subscription or Fee Access
Memory Management by Using Association Rules Mining and Mine Frequent Pattern in Large Data Base
Abstract
Association rules mining Rely on special data structures for the database in the primary memory. These data structure resides in the main memory, but these to handle the storage problem when they go out of the primary memory.VMM stores the overload data into the secondary memory based on some pre assumed memory handling method. So, it will arise the thrashing. This problem is solved by using ARM model capable of mining a transactional data base regardless of its size. The proposed data structure is constructed in the available allocated primary memory first. If it is grows out of the allocated memory quato them it forced to the secondary memory. The secondary memory version of the structure is accessed in a block-by-block basis so that both the spatial and temporal localities of the I/O access are optimized. the proposed framework takes control of the virtual memory access and hence manages the required virtual memory in an optimal way to the best benefit of the mining process to be served. Several clever data structures are used to facilitate these optimizations. Main purpose of this paper is to allocate memory and control this memory managing with the algorithm support.
Keywords
References
R. Agrawal and R. Srikant, “Fast algorithms for mining association rules in large databases,” in Proc. Int. Conf. Very Large Data Bases, 1994, pp. 487–499.
G. Grahne and J. Zhu, “Mining frequent item sets from secondary memory,” in Proc. IEEE Int. Conf. Data Mining, 2004, pp. 91–98.
G. Liu, H. Lu, J. X. Yu, W. Wang, and X. Xiao, “AFOPT: An efficient implementation of pattern growth approach,” in Proc. FIMI, 2003.
J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang, “H-mine: Hyper structure mining of frequent patterns in large databases,” in Proc. IEEE Int. Conf. Data Mining, 2001, pp. 441–448.
J. Liu, Y. Pan, K. Wang, and J. Han, “Mining frequent item sets by opportunistic Projection,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 229–238.
V. Pudi and J. R. Haritsa, “Armor: Association rule mining based on oracle,” in Proc. FIMI, 2003.
C.-F. Cheung, J. X. Yu, and H. Lu, “Constructing suffix tree for gigabyte sequences with megabyte memory,” IEEE Trans. Knowl. Data Eng., vol. 17, no. 1, pp. 90–105, Jan. 2005.
C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi, “Scalable mining of large disc-based graph databases,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2004, pp. 316–325.
X. Yan and J. Han, “gSpan: Graph-based substructure pattern mining,” in Proc. IEEE ICDM, 2002, pp. 721–724.
S.-S. Wong,W.-K. Sung, and L. Wong, “CPS-tree: A compact partitioned suffix tree for disc-based indexing on large genome sequences,” in Proc. IEEE Int. Conf. Data Eng., 2007, pp. 1350–1354.
R. Elmasri and S. B. Navathe, Fundamentals of Database Systems. Reading, MA: Addison-Wesley, 2005.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.