发明申请
US20080275891A1 METHOD TO CREATE A PARTITION-BY TIME/TUPLE-BASED WINDOW IN AN EVENT PROCESSING SERVICE
有权
在事件处理服务中创建基于时间/基于TUPLE的窗口的方法
- 专利标题: METHOD TO CREATE A PARTITION-BY TIME/TUPLE-BASED WINDOW IN AN EVENT PROCESSING SERVICE
- 专利标题(中): 在事件处理服务中创建基于时间/基于TUPLE的窗口的方法
-
申请号: US11867471申请日: 2007-10-04
-
公开(公告)号: US20080275891A1公开(公告)日: 2008-11-06
- 发明人: Hoyong Park , Namit Jain , Anand Srinivasan , Shailendra Mishra
- 申请人: Hoyong Park , Namit Jain , Anand Srinivasan , Shailendra Mishra
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
A method to create a partition by time/tuple based window in an event processing service is provided. When continuous data streams are received, tuples are stored in a data structure with partitions based upon partition keys. Only a specified amount of tuples may be stored in each partition. When a partition exceeds the specified number of tuples, the oldest tuples are removed from the data structure. Tuples stored beyond a specified time period are also removed from the data structure. Two data structures may also be used to implement a time/tuple based window. Tuples are stored in both a data structure with a partition by window and a data structure with a range window. Tuples are removed in the partition by window when tuples exceed the amount in the partition. Tuples are removed in the range window when tuples exceed a specified time period. The two data structures are synchronized.
公开/授权文献
信息查询