-
dbis
-
Publications
-
2012
-
Efficient Frequent Item Counting in Multi-Core Hardware
KDD 2012 Reviews
points: S1. Clever, highly-tuned data structures S2. Convincing performance results Weak points: W1. Very specialized problem, low potential impact W2. Some experimental comparisons missing W3. Somewhat [...] their approach with the merge-based approach, ideally in settings when there are (1) no queries, (2) infrequent queries, (3) frequent queries. Finally, a comparison to the parallel techniques of [6] is [...] assumes that the data structure is "warmed up" and/or that items arrive in random order . The proposed 2-core approach seems to require some message queue between the two processors. How would such a queue …