• M
    AggregateFunctions: implemented topK(n) · 5f1e65b2
    Marek Vavruša 提交于
    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.
    5f1e65b2
AggregateFunctionTopK.h 8.0 KB