A new data layout for set intersection on GPUs

Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

Volumn , Issue , 2011, Pages 698-708

  Amossen, Rasmus Resen ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Data layout; Frequent itemset mining; GPU; Set intersection; Sparse boolean matrix multiplication

Indexed keywords

BOOLEAN MATRIX MULTIPLICATION; DATA LAYOUTS; FREQUENT ITEMSET MINING; GPU; SET INTERSECTION;

DISTRIBUTED PARAMETER NETWORKS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

COMPUTER GRAPHICS EQUIPMENT;

EID: 80053252111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2011.71     Document Type: Conference Paper

References (31)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases (VLDB '94), pages 487-499. Morgan Kaufmann Publishers, 1994.
2. R. R. Amossen and R. Pagh. Faster join-projects and sparse matrix multiplications. In Proceedings of the 12th International Conference on Database Theory (ICDT), pages 121-126. ACM, 2009.
3. P. Bille, A. Pagh, and R. Pagh. Fast evaluation of unionintersection expressions. In Proceedings of International Symposium on Algorithms And Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 739-750. Springer, 2007.
4. P. A. Boncz, M. Zukowski, and N. Nes. MonetDB/X100: Hyper-pipelining query execution. In Proceedings of Conference on Innovative Data Systems Research (CIDR), pages 225-237, 2005.
5. C. Borgelt. Efficient implementations of apriori and eclat. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
6. C. Borgelt. Recursion pruning for the apriori algorithm. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
7. C. Borgelt. An implementation of the fp-growth algorithm. In Proceedings of the 1st international workshop on open source data mining (OSDM), pages 1-5. ACM, 2005.
8. Computer language benchmark game. http://shootout.alioth.debian.org/u32/- benchmark.php?test=all&lang=all.
9. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In Proceedings of Symposium on Discrete Algorithms (SODA), pages 743-752, 2000.
10. M. Dietzfelbinger and F. M. auf der Heide. Simple, efficient shared memory simulations. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 110-119. SIGACT and SIGARCH, June 30-July 2, 1993. Extended abstract.
11. W. Fang, M. Lu, X. Xiao, B. He, and Q. Luo. Frequent itemset mining on graphics processors. In Proceedings of the Fifth International Workshop on Data Management on New Hardware (DaMoN), pages 34-42. ACM, 2009.
12. A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, A. D. Nguyen, Y.-K. Chen, and P. Dubey. Cache-conscious frequent pattern mining on a modern processor. In VLDB, pages 577-588. ACM, 2005.
13. N. K. Govindaraju, J. Gray, R. Kumar, and D. Manocha. GPUTerasort: high performance graphics co-processor sorting for large database management. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 325-336. ACM, 2006.
14. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov, 8(1):53-87, 2004. (Pubitemid 39019971)
15. B. He, K. Yang, R. Fang, M. Lu, N. Govindaraju, Q. Luo, and P. Sander. Relational joins on graphics processors. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 511-524. ACM, 2008.
16. T. Johnson. Performance measurements of compressed bitmap indices. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), pages 278-289. Morgan Kaufmann Publishers Inc., 1999.
17. N. Leischner, V. Osipov, and P. Sanders. GPU sample sort. In 24th International Parallel and Distributed Processing (IPDPS). IEEE, 2010.
18. E. Li and L. Liu. Optimization of frequent itemset mining on multiple-core processor. In VLDB, pages 1275-1285. ACM, 2007.
19. Nvidia opencl best practices guide, 2009.
20. J. D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Krüger, A. E. Lefohn, and T. J. Purcell. A survey of general-purpose computation on graphics hardware. Computer Graphics Forum, 26(1), 2007.
21. R. Pagh and F. F. Rodler. Cuckoo hashing. Journal of Algorithms, 51:122-144, 2004.
22. B. Rácz. nonordfp: An FP-growth variation without rebuilding the FP-tree. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
23. B. Rácz, F. Bodon, and L. Schmidt-Thieme. On benchmarking frequent itemset mining algorithms: from measurement to analysis. In Proceedings of the 1st international workshop on open source data mining (OSDM), pages 36-45. ACM, 2005.
24. L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2):409-422, May 1984. (Pubitemid 15493881)
25. T. Uno, M. Kiyomi, and H. Arimura. LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In Proceedings of the IEEE ICDM Workshop on Frequent Item-set Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
26. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34(1):116-127, Jan. 1987. (Pubitemid 17601594)
27. K. Wu, E. J. Otoo, and A. Shoshani. On the performance of bitmap indices for high cardinality attributes. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), pages 24-35. Morgan Kaufmann, 2004.
28. Y. Ye and C.-C. Chiang. A parallel apriori algorithm for frequent itemsets mining. In SERA, pages 87-94. IEEE Computer Society, 2006.
29. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. 3rd Intl. Conf. on Knowledge Discovery and Data Mining, 20, 1997.
30. M. J. Zaki. Parallel and distributed association mining: A survey. IEEE Concurrency, 7(4):14-25, Oct./Dec. 1999.
31. M. Zukowski, S. Heman, N. Nes, and P. Boncz. Superscalar RAM-CPU cache compression. In Proceedings of the 22nd International Conference on Data Engineering (ICDE), page 59. IEEE Computer Society, 2006.