AggregateFunctions: implemented topK(n)
This implements a new function for approximate computation of the most frequent entries using Filtered Space Saving with a merge step adapted from Parallel Space Saving paper. It works better for cases where GROUP BY x is impractical due to high cardinality of x, such as top IP addresses or top search queries.
Showing
dbms/src/Common/SpaceSaving.h
0 → 100644
想要评论请 注册 或 登录