Patent ID: 9183242
Filing Date: 2015-11-10
Classification: G06F

Abstract:
1. A method for determining frequently occurring data items, comprising: counting, at a node in a merge tree, the occurrence of data items using an ordered set of counters, wherein each of the counters is associated with one of a plurality of distinct categories and represents a quantity of the data items in the associated one of the distinct categories, wherein the counting includes decrementing a subset of the counters in the ordered set and incrementing a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full; storing the ordered set of counters in a priority queue, wherein the priority queue comprises a linked list; storing an index to the ordered set of counters in the priority queue, wherein the index comprises a hashed index; and passing a count of one of the distinct categories of the ordered set of counters and a count of the global decrement counter to a higher level node in the merge tree.