会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Method to create a partition-by time/tuple-based window in an event processing service
    • 在事件处理服务中创建基于时间/元组的分区的方法
    • US07945540B2
    • 2011-05-17
    • US11867471
    • 2007-10-04
    • Hoyong ParkNamit JainAnand SrinivasanShailendra Mishra
    • Hoyong ParkNamit JainAnand SrinivasanShailendra Mishra
    • G06F17/30
    • G06F17/30533
    • 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.
    • 提供了一种在事件处理服务中通过基于时间/元组的窗口创建分区的方法。 当连续数据流被接收时,元组被存储在具有基于分区键的分区的数据结构中。 每个分区中只能存储一定量的元组。 当分区超过指定数量的元组时,最旧的元组将从数据结构中删除。 存储超过指定时间段的元组也从数据结构中删除。 也可以使用两个数据结构来实现基于时间/元组的窗口。 元组被存储在具有分区的数据结构的窗口和具有范围窗口的数据结构中。 当元组超过分区中的数量时,元组在窗口中被删除。 当元组超过指定的时间段时,元组在范围窗口中被移除。 两个数据结构是同步的。
    • 70. 发明申请
    • Support for incrementally processing user defined aggregations in a data stream management system
    • 支持在数据流管理系统中逐步处理用户定义的聚合
    • US20090106440A1
    • 2009-04-23
    • US11977437
    • 2007-10-20
    • Anand SrinivasanNamit JainShailendra Kumar Mishra
    • Anand SrinivasanNamit JainShailendra Kumar Mishra
    • G06F15/16
    • G06F17/30412G06F17/30516
    • A computer is programmed to accept a command for creation of a new aggregation defined by a user to process data incrementally, one tuple at a time. One or more incremental function(s) in a set of instructions written by the user to implement the new aggregation maintain(s) locally any information that is to be passed between successive invocations, to support computing the aggregation for a given set of tuples as a whole. The user writes a set of instructions to perform the aggregation incrementally, including a plus function which is repeatedly invoked, only once, for each addition to a window of a message. The user also writes a minus function to be invoked with the message, to return the value of incremental aggregation over the window after removal of the message. In such embodiments, the computer does not maintain copies of messages in the window for use by aggregation function(s).
    • 计算机被编程为接受用于创建由用户定义的新聚合的命令以逐步处理数据,一次一个元组。 由用户写入的用于实现新聚合的一组指令中的一个或多个递增函数在本地维护将在连续调用之间传递的任何信息,以支持计算给定的一组元组的聚合, 整个。 用户写入一组指令以递增地执行聚合,包括对于每个添加到消息窗口的一次,重复调用一次的加号功能。 用户还可以使用该消息写入要调用的减号函数,以便在删除消息后返回窗口上的增量聚合值。 在这样的实施例中,计算机不维护窗口中的消息副本以供聚合功能使用。