High throughput heavy hitter aggregation for modern SIMD processors

9th International Workshop on Data Management on New Hardware, DaMoN 2013 - In Conjunction with the ACM SIGMOD/PODS Conference

Volumn , Issue , 2013, Pages

  Polychroniou, Orestis ^a   Ross, Kenneth A ^a  

^a Howard Hughes Medical Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE FUNCTION; CACHE ACCESS; HIGH THROUGHPUT; PERFECT HASHING; SHARED NOTHING; SIMD INSTRUCTIONS; SIMD PROCESSORS; SMALL FOOTPRINTS;

ALGORITHMS; CACHE MEMORY; COMMERCE; HARDWARE; INFORMATION MANAGEMENT;

AGGREGATES;

EID: 84880524345     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2485278.2485284     Document Type: Conference Paper

References (21)

1. P. Boncz, M. Zukowski, and N. Nes. Monetdb/x100: Hyper-pipelining query execution. In CIDR, 2005.
2. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In ICALP, 2002.
3. J. Cieslewicz and K. A. Ross. Adaptive aggregation on chip multiprocessors. In VLDB, 2007.
4. J. Cieslewicz, K. A. Ross, K. Satsumi, and Y. Ye. Automatic contention detection and amelioration for data-intensive operations. In SIGMOD, 2010.
5. G. Cormode et al. An improved data stream summary: the count-min sketch and its applications. J. Algo., 55(1), 2005.
6. G. Cormode and M. Hadjieleftheriou. Finding frequent items in data streams. In VLDB, 2008.
7. M. Dietzfelbinger et al. A reliable randomized algorithm for the closest-pair problem. J. Algorithms, 25(1), 1997.
8. M. Dietzfelbinger and U. Schellbach. Weaknesses of cuckoo hashing with a simple universal hash class: The case of large universes. In SOFSEM, 2009.
9. W. J. Ewens and H. S. Wilf. Computing the distribution of the maximum in balls-and-boxes problems with application to clusters of disease cases. PNAS, 104(27), 2007.
10. R. M. Karp et al. A simple algorithm for finding frequent elements in streams and bags. ACM T. Dat. S., 28(1), 2003.
11. S. Manegold et al. Optimizing database architecture for the new bottleneck: memory access. VLDB J., 9(3), 2000.
12. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB, 2002.
13. A. Metwally D. Agrawal, and A. E. Abbadi. An integrated e• cient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst, 31(3), 2006.
14. J. Misra and D. Gries. Finding repeating elements. Technical report, Cornell University, 1982.
15. T. Neumann. E• ciently compiling e• cient query plans for modern hardware. VLDB, 4(9), 2011.
16. R. Pagh et al. Cuckoo hashing. J. Algorithms, 51(2), 2004.
17. K. A. Ross. E• cient hash probes on modern processors. In ICDE, 2007.
18. P. Roy, J. Teubner, and G. Alonso. E• cient frequent item counting in multi-core hardware. In KDD, 2012.
19. Y. Ye, K. A. Ross, and N. Vesdapunt. Scalable aggregation on multicore processors. In DaMoN, 2011.
20. J. Zhou and K. A. Ross. Implementing database operations using simd instructions. In SIGMOD, 2002.
21. M. Zukowski, S. Heman, and P. Boncz. Architecture-conscious hashing. In DaMoN, 2006.