Three strategies for concurrent processing of frequent itemset queries using FP-growth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4747 LNCS, Issue , 2007, Pages 240-258

  Wojciechowski, Marek ^a   Galecki, Krzysztof ^a   Gawronek, Krzysztof ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS; OPTIMIZATION;

CONCURRENT PROCESSING; FREQUENT ITEMSET QUERIES; QUERY OPTIMIZATION TECHNIQUES;

QUERY PROCESSING;

EID: 38449111680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75549-4_15     Document Type: Conference Paper

References (25)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proc. of the 1993 ACM SIGMOD Conf. on Management of Data, ACM Press, New York (1993)
2. Agrawal, R., Mehta, M., Shafer, J., Srikant, R., Arning, A., Bollinger, T.: The Quest Data Mining System. In: Proc. of the 2nd Int'l Conference on Knowledge Discovery in Databases and Data Mining (1996)
3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int'l Conf. on Very Large Data Bases (1994)
4. Alsabbagh, J.R., Raghavan, V. V.: Analysis of common subexpression exploitation models in multiple-query processing. In: Proc. of the 10th ICDE Conference (1994)
5. Baralis, E., Psaila, G.: Incremental Refinement of Mining Queries. In: Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol. 1676, pp. 173-182. Springer, Heidelberg (1999)
6. Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. Journal of Artificial Intelligence Research 16 (2002)
7. Cheung, D.W., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proc. of the 12th ICDE (1996)
8. Han, J., Pei, J.: Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. SIGKDD Explorations (December 2000)
9. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of the 2000 ACM SIGMOD Conf. on Management of Data, ACM Press, New York (2000)
10. Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Mining and Knowledge Discovery: An International Journal 8(1) (2004)
11. Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications of the ACM 39(11) (1996)
12. Jarke, M.: Common subexpression isolation in multiple query optimization. In: Kim, W., Reiner, D.S. (eds.) Query Processing in Database Systems, Springer, Heidelberg (1985)
13. Jeudy, B., Boulicaut, J-F.: Using condensed representations for interactive association rule mining. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 225-236. Springer, Heidelberg (2002)
14. Jin, R., Sinha, K., Agrawal, G.: Simultaneous Optimization of Complex Mining Tasks with a Knowledgeable Cache. In: Proc. of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York (2005)
15. Meo, R.: Optimization of a Language for Data Mining. In: Proc. of the ACM Symposium on Applied Computing - Data Mining Track, ACM Press, New York (2003)
16. Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Materialized Data Mining Views. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, Springer, Heidelberg (2000)
17. Nag, B., Deshpande, P.M., DeWitt, D.J.: Using a Knowledge Cache for Interactive Discovery of Association Rules. In: Proc. of the 5th KDD Conference (1999)
18. Pei, J., Han, J.: Can We Push More Constraints into Frequent Pattern Mining? In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York (2000)
19. Roy, P., Seshadri, S., Sundarshan, S., Bhobe, S.: Efficient and Extensible Algorithms for Multi Query Optimization. ACM SIGMOD Intl. Conference on Management of Data (2000)
20. Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. 21th Int'l Conf. Very Large Data Bases (1995)
21. Sellis, T.: Multiple-query optimization. ACM Transactions on Database Systems 13(1) (1988)
22. Wojciechowski, M., Zakrzewicz, M.: Evaluation of Common Counting Method for Concurrent Data Mining Queries. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol. 2798, Springer, Heidelberg (2003)
23. Wojciechowski, M., Zakrzewicz, M.: Data Mining Query Scheduling for Apriori Common Counting. In: Proc. of the Sixth International Baltic Conference on Databases and Information Systems (2004)
24. Wojciechowski, M., Zakrzewicz, M.: Evaluation of the Mine Merge Method for Data Mining Query Processing. In: Benczur, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, Springer, Heidelberg (2004)
25. Wojciechowski, M., Zakrzewicz, M.: On Multiple Query Optimization in Data Mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, Springer, Heidelberg (2005)