This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Rakesh Agrawal, Tomasz Imieliński, Arun Swami. Mining association rules between sets of items in large databases[J]. ACM SIGMOD Record, 1993, 22(2).AgrawalRakeshImielińskiTomaszSwamiArun. Mining association rules between sets of items in large databases[J]. ACM SIGMOD Record, 1993, 22(2).10.1145/170035.170072Search in Google Scholar
David W. Cheung, Jiawei Han. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc of the Twelfth International Conference on Data Engineering, 1996. USA: IEEE, 1996(3):106–114.CheungDavid W.HanJiawei. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc of the Twelfth International Conference on Data Engineering, 1996. USA: IEEE, 1996(3):106–114.Search in Google Scholar
Zhu Yuquan, Sun Zhizhu, Zhao Chuan Shen. Quickly update frequent itemsets[J]. Computer Research and Development, 2003(01):94–99.ZhuYuquanSunZhizhuZhaoChuan Shen. Quickly update frequent itemsets[J]. Computer Research and Development, 2003(01):94–99.Search in Google Scholar
David W L, Cheung S, Lee D, et al. A general incremental technique for maintaining discovered association rules[C]. In Proceedings of the Fifth International Conference On Database Systems For Advanced Applications, Melbourne, Australia, 1997(3):185–194.DavidW LCheungSLeeD, A general incremental technique for maintaining discovered association rules[C]. In Proceedings of the Fifth International Conference On Database Systems For Advanced Applications, Melbourne, Australia, 1997(3):185–194.10.1142/9789812819536_0020Search in Google Scholar
Feng Yucai, Feng Jianlin. Incremental Updating Algorithm for Association Rules[J]. Journal of Software, 1998, 9 (4): 301.FengYucaiFengJianlin. Incremental Updating Algorithm for Association Rules[J]. Journal of Software, 1998, 9 (4): 301.Search in Google Scholar
William Cheung, Osmar R. Zaiane. Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In Proc of the Seventh International Conference on Database Engineering and Applications Symposium, 2003. USA:IEEE, 2003(7):111–116.CheungWilliamZaianeOsmar R.. Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In Proc of the Seventh International Conference on Database Engineering and Applications Symposium, 2003. USA:IEEE, 2003(7):111–116.10.1109/IDEAS.2003.1214917Search in Google Scholar
Gao Feng, Xie Jianying. Discover the incremental update algorithm of association rules[J]. Computer Engineering, 2000(12):49–50+112.GaoFengXieJianying. Discover the incremental update algorithm of association rules[J]. Computer Engineering, 2000(12):49–50+112.Search in Google Scholar
Li Wen, Hong Qin, Teng Zhongjian, Shi Zhaoying. An inverted index based on B+ tree [J]. Computer Knowledge and Technology, 2011, 3 (8): 1720.LiWenHongQinTengZhongjianShiZhaoying. An inverted index based on B+ tree [J]. Computer Knowledge and Technology, 2011, 3 (8): 1720.Search in Google Scholar
Hu Yanbo, Zhong Jun. Based on clustering B + tree database index optimization algorithm [J]. Computer Applications, 2013, 33 (9): 2474.HuYanboZhongJun. Based on clustering B + tree database index optimization algorithm [J]. Computer Applications, 2013, 33 (9): 2474.10.3724/SP.J.1087.2013.02474Search in Google Scholar
Roh Hongchan, Kim Woo-Cheol, Kim Seungwoo, et, al. A B-Tree index extension to enhance response time and the life cycle of flash memory[J]. Information Sciences, 2009, 179:3136.RohHongchanKimWoo-CheolKimSeungwoo, A B-Tree index extension to enhance response time and the life cycle of flash memory[J]. Information Sciences, 2009, 179:3136.10.1016/j.ins.2009.05.007Search in Google Scholar
Wang Yingqiang, Shi Yongsheng. Application of B+ Tree in Database Index[J]. Journal of Yangtze University, 2008, 3 (5): 233.WangYingqiangShiYongsheng. Application of B+ Tree in Database Index[J]. Journal of Yangtze University, 2008, 3 (5): 233.Search in Google Scholar
