Browse > Article

Improvement of DHP Association Rules Algorithm for Perfect Hashing  

이형봉 (강릉대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.31, no.2, 2004 , pp. 91-98 More about this Journal
Abstract
DHP mining association rules algorithm maintains previously independent direct hash table to reduce the sire of hash tree containing the frequency number of each candidate large itemset. It performs pruning by using the direct hash table when the hash tree is constructed. The mort large the size of direct hash table increases, the higher the effort of pruning becomes. Especially, the effect of pruning in phase 2 which generate 2-large itemsets is so high that it dominates the overall performance of DHP algorithm. So, following the speedy trends of producing VLM(Very Large Memory) systems, extreme increment of direct hash table size is being tried and one of those trials is perfect hash table in phase 2. In case of using perfect hash table in phase 2, we found that some rearrangement of DHP algorithm got about 20% performance improvement compared to simply ｜H$_2$｜ reconfigured DHP algorithm. In this paper, we examine the feasibility of perfect hash table in phase 2 and propose PHP algorithm, a rearranged DHP algorithm, which uses the characteristics of perfect hash table sufficiently, then make an analysis on the results in experimental environment.
Keywords
DHP; PHP; DHP; VLM; hash tree; direct hash table; perfect hash table; PHP;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 R. Agrawal and et al., 'Synthetic Data Generation Code for Associations and Sequential Patterns,' http://www.almaden.ibm.com/cs/quest., 1999
2 U.Vahalia, UNIX Internals, The New Frontier, Prentice Hall, p.400, 1996
3 M. Houtsma, and A. Swami, 'Set-oriented mining of association rules,' Proceedings of the International Conference on Data Engineering, pp.26-33, 1995
4 Digital SPD, 'Very Large Memory Applications,' http://wint.decsy.ru/du/dec_unix/64bit/vlm.htm.
5 D. Irwin, 'Oracle Very Large Memory(VLM) for Digital Alpha NT,' Oracle white paper, 1997
6 이재문, '대용량 주기억장치 시스템에서 효율적인 연관 규칙 탐사 알고리즘,' 정보처리학회 논문지D 제9-D권, 제4호, pp.579-586, 2002   과학기술학회마을   DOI
7 A. Savasere, E. Omiecinski and S. Navathe, 'An Efficient Algorithm for Mining Association Rules in Large Databases,' Proceedings of the 21th VLDB Conference, pp.432-444, 1995
8 R. Agrawal and R. Srikant, 'Fast Algorithms for Mining Association Rules,' Proceedings of the 20th International Conference on Very Large Databases, pp. 487-499, 1994
9 J.S. Park, M.S. Chen and P.S. Yu, 'An Effective Hash-Based Algorithm for Mining Association Rules,' Proceedings of ACM SIGMOD, pp. 175-186, 1995   DOI
10 R. Agrawal, T. Imielinski and A. Swami, 'Mining Association Rules between Sets of Items in Large Databases,' Proceedings of ACM SIGMOD on Management of Data, pp. 207-216, 1993   DOI   ScienceOn
11 이재문, 박종수, '복합 해쉬 트리를 이용한 효율적인 연관 규칙 탐사 알고리즘,' 정보과학회 논문지(B) 제 26권, 제 3호, pp. 343-352, 1999