Following is the claim for this invention: -

1. In this invention we have a tree whose parent node is a timestamp when at most k-1 events have occurred and the parent node correspondingly has k- 1 children nodes consisting of description and other attributes of the event or events that occurred at that timestamp and one more special child node which is empty. In the above case the empty child node is for next insert of set of events for the timestamp at which those events have occurred, where the empty child node is that timestamp. Again like in the previous case new timestamp node will at most have k-1 children nodes consisting of description and other attributes of the event or events that occurred at that timestamp and one special empty node for the insertion of next set of events for a subsequent timestamp. We assume that for a given timestamp there can be at most k-1 events occurring at that timestamp. The Event Aggregator periodically collects all the events from the tree ordered by the timestamp and each set of events is preceded by their respective timestamp, and the Event Aggregator returns this information to the user in addition to deleting the tree. The above novel technique of providing event aggregation mechanism for timer events is the claim for this invention.