基於上述兩種情況，本文發展一個全新的挖掘關聯規則作法， 針對挖掘關聯規則時最耗時的步驟加以改進，在掃瞄資料庫一次後，將資料庫的內容儲存於一個樹狀結構中，再利用此樹狀結構產生關聯規則。如此將可大幅減少I/O的時間，讓使用者能更快產生關聯規則，並且不需在掃瞄資料庫前即指定minimum support，所以可以動態給定minimum support而不用重新掃瞄資料庫。

[1]M.S. Chen, J. Han, and P.S. Yu, "Data Mining: An Overview from a Database Perspective'', IEEE Transactions on Knowledge and Data Engineering, 8(6): 866-883, 1996
[1]J. Han, J. Pei and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD''00), Dallas, TX, May 2000, pp. 1-12.
[2]R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. of the 20th Int''l Conference on Very Large Databases, Santiago, Chile, Sep. 1994.
[3]S. Li, H. Shen and L. Cheng, "New Algorithms For Efficient Mining Of Association Rules," Information Sciences, Vol. 118, No. 1-4, Sep. 1999, pp. 251-268.
[4]J-S. Park, M-S. Chen and P. S. Yu, ``Using a Hash-Based Method with Transaction Trimming for Mining Association Rules,'' IEEE Trans. on Knowledge and Data Engineering, Vol. 9, No. 5, Oct. 1997, pp. 813-825.
[5]N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, "Efficient Mining Of Association Rules Using Closed Itemset Lattices," Information Systems, Vol. 24, No. 1, March 1999, pp. 25-46.
[6]A. Savasere, E. Omiecinski and S. Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases," Proc. Int''l Conf. Very Large Data Bases, Zurich, Switzerland, Sep. 1995, pp. 432-444.
[7]H. Toivonen, "Sampling Large Databases For Association Rules," The 22th International Conference on Very Large Databases (VLDB''96), Mumbay, India, Sep. 1996, pp. 134-145.
[8]J. Han and M. Kamber, Data mining: Concepts and Techniques, Academic Press, 2001.
[9]陳彥良、凌俊青、許秉瑜"在包裹式資料庫中挖掘數量關連規則,"資訊管理學報，第七卷，第二期，pp. 215-229。。
[10]陳彥良等,"資料間隱含關係的挖掘與展望," 二十一世紀台灣湧現中的資訊管理議題專家研討會, "大溪,鴻禧山莊。