METHODS AND SYSTEMS FOR QUERYING EVENT STREAMS USING MULTIPLE EVENT PROCESSORS
    11.
    发明申请
    METHODS AND SYSTEMS FOR QUERYING EVENT STREAMS USING MULTIPLE EVENT PROCESSORS 有权
    使用多个事件处理器查询事件流的方法和系统

    公开(公告)号:US20110246445A1

    公开(公告)日:2011-10-06

    申请号:US13162882

    申请日:2011-06-17

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30516 G06F17/30545

    摘要: In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data.

    摘要翻译: 在一个实施例中,用于分布式事件处理的系统包括第一事件处理器和第二事件处理器。 第一事件处理器接收与事件流相关联的事件数据。 第二事件处理器接收与事件流相关联的查询。 基于对与事件流相关联的事件数据的第一部分的查询,由第二事件处理器生成对第一事件处理器的请求。 第二事件处理器从第一事件处理器接收事件数据的第一部分。 然后,第二事件处理器基于事件数据的第一部分生成事件。

    METHOD AND SYSTEM FOR SPILLING FROM A QUEUE TO A PERSISTENT STORE
    12.
    发明申请
    METHOD AND SYSTEM FOR SPILLING FROM A QUEUE TO A PERSISTENT STORE 有权
    从一个队列到一个存储商店的方法和系统

    公开(公告)号:US20100223437A1

    公开(公告)日:2010-09-02

    申请号:US12396008

    申请日:2009-03-02

    IPC分类号: G06F12/02

    CPC分类号: G06F12/12

    摘要: Techniques for managing memory usage of a processing system by spilling data from a memory to a persistent store based upon an evict policy are provided. A triggering event is detected. In response to the triggering event and based on the evict policy, it is determined whether data from the memory of the processing system is to be spilled to the persistent storage. The determination is made by comparing a level of free memory of the processing system with a threshold specified by the evict policy. The data is evicted from the memory.

    摘要翻译: 提供了用于通过基于逐出策略从存储器将数据溢出到持久存储器来管理处理系统的存储器使用的技术。 检测到触发事件。 响应于触发事件并且基于逐出策略,确定来自处理系统的存储器的数据是否将被溢出到持久存储器。 通过将处理系统的空闲内存的级别与逐出策略规定的阈值进行比较来确定。 数据从内存中逐出。

    Facilitating Flexible Windows In Data Stream Management Systems
    13.
    发明申请
    Facilitating Flexible Windows In Data Stream Management Systems 有权
    在数据流管理系统中促进灵活的Windows

    公开(公告)号:US20090112802A1

    公开(公告)日:2009-04-30

    申请号:US11927681

    申请日:2007-10-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30964

    摘要: Facilitating flexible windows in querying continuous data streams. In one embodiment, a software code is associated with a window, wherein execution of the software code determines the values to be included in the window. On receiving a query indicating the window, the result of the query is generated based on the values in the window determined by execution of the software code. The software code may be identified by an identifier and thus used for different queries on the same or different continuous data streams.

    摘要翻译: 方便灵活的窗口查询连续的数据流。 在一个实施例中,软件代码与窗口相关联,其中软件代码的执行确定要包括在窗口中的值。 在接收到指示窗口的查询时,基于通过执行软件代码确定的窗口中的值来生成查询结果。 软件代码可以由标识符标识,并且因此用于相同或不同连续数据流上的不同查询。

    Methods and systems for querying event streams using multiple event processors
    14.
    发明授权
    Methods and systems for querying event streams using multiple event processors 有权
    使用多个事件处理器来查询事件流的方法和系统

    公开(公告)号:US08326822B2

    公开(公告)日:2012-12-04

    申请号:US13162882

    申请日:2011-06-17

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30516 G06F17/30545

    摘要: In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data.

    摘要翻译: 在一个实施例中,用于分布式事件处理的系统包括第一事件处理器和第二事件处理器。 第一事件处理器接收与事件流相关联的事件数据。 第二事件处理器接收与事件流相关联的查询。 基于对与事件流相关联的事件数据的第一部分的查询,由第二事件处理器生成对第一事件处理器的请求。 第二事件处理器从第一事件处理器接收事件数据的第一部分。 然后,第二事件处理器基于事件数据的第一部分生成事件。

    Methods and systems for querying event streams using multiple event processors
    15.
    发明授权
    Methods and systems for querying event streams using multiple event processors 有权
    使用多个事件处理器来查询事件流的方法和系统

    公开(公告)号:US07984040B2

    公开(公告)日:2011-07-19

    申请号:US12133899

    申请日:2008-06-05

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30516 G06F17/30545

    摘要: In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data.

    摘要翻译: 在一个实施例中,用于分布式事件处理的系统包括第一事件处理器和第二事件处理器。 第一事件处理器接收与事件流相关联的事件数据。 第二事件处理器接收与事件流相关联的查询。 基于对与事件流相关联的事件数据的第一部分的查询,由第二事件处理器生成对第一事件处理器的请求。 第二事件处理器从第一事件处理器接收事件数据的第一部分。 然后,第二事件处理器基于事件数据的第一部分生成事件。

    Specifying A Family Of Logics Defining Windows In Data Stream Management Systems
    17.
    发明申请
    Specifying A Family Of Logics Defining Windows In Data Stream Management Systems 有权
    指定一系列逻辑在数据流管理系统中定义Windows

    公开(公告)号:US20090112803A1

    公开(公告)日:2009-04-30

    申请号:US11927683

    申请日:2007-10-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30964

    摘要: Simplifying a user's task in specifying a family of logics, with each logic designed to potentially select different subsets of values from the same continuous data stream at the same time instant. In one embodiment, all the logics are together specified by a common user specified software code design to accept a set of parameters, with different logics resulting from execution of the software code with different parametric values. Thus, when closely related family of logics are to be developed, the common software code may be formulated, with the code being designed to accept parameters and providing different logics for different sets of parametric values corresponding to the parameters.

    摘要翻译: 简化用户指定一系列逻辑的任务,每个逻辑设计用于在同一时刻从相同的连续数据流潜在地选择不同的值子集。 在一个实施例中,所有逻辑一起由公共用户指定的软件代码设计指定,以接受一组参数,具有由执行具有不同参数值的软件代码产生的不同逻辑。 因此,当要开发密切相关的逻辑系列时,可以制定公共软件代码,其中代码被设计为接受参数并且为对应于参数的不同参数值集合提供不同的逻辑。

    DISTRIBUTED EVENT PROCESSING
    18.
    发明申请
    DISTRIBUTED EVENT PROCESSING 有权
    分布式事件处理

    公开(公告)号:US20090037370A1

    公开(公告)日:2009-02-05

    申请号:US12133899

    申请日:2008-06-05

    IPC分类号: G06F7/06 G06F17/30

    CPC分类号: G06F17/30516 G06F17/30545

    摘要: Methods and systems for distributed event processing are disclosed. In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data.

    摘要翻译: 公开了分布式事件处理的方法和系统。 在一个实施例中,用于分布式事件处理的系统包括第一事件处理器和第二事件处理器。 第一事件处理器接收与事件流相关联的事件数据。 第二事件处理器接收与事件流相关联的查询。 基于对与事件流相关联的事件数据的第一部分的查询,由第二事件处理器生成对第一事件处理器的请求。 第二事件处理器从第一事件处理器接收事件数据的第一部分。 然后,第二事件处理器基于事件数据的第一部分生成事件。

    METHOD TO CREATE A PARTITION-BY TIME/TUPLE-BASED WINDOW IN AN EVENT PROCESSING SERVICE
    19.
    发明申请
    METHOD TO CREATE A PARTITION-BY TIME/TUPLE-BASED WINDOW IN AN EVENT PROCESSING SERVICE 有权
    在事件处理服务中创建基于时间/基于TUPLE的窗口的方法

    公开(公告)号:US20080275891A1

    公开(公告)日:2008-11-06

    申请号:US11867471

    申请日:2007-10-04

    IPC分类号: G06F17/30

    CPC分类号: 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.

    摘要翻译: 提供了一种在事件处理服务中通过基于时间/元组的窗口创建分区的方法。 当连续数据流被接收时,元组被存储在具有基于分区键的分区的数据结构中。 每个分区中只能存储一定量的元组。 当分区超过指定数量的元组时,最旧的元组将从数据结构中删除。 存储超过指定时间段的元组也从数据结构中删除。 也可以使用两个数据结构来实现基于时间/元组的窗口。 元组被存储在具有分区的数据结构的窗口和具有范围窗口的数据结构中。 当元组超过分区中的数量时,元组在窗口中被删除。 当元组超过指定的时间段时,元组在范围窗口中被移除。 两个数据结构是同步的。

    Buffered message queue architecture for database management systems with memory optimizations and “zero copy” buffered message queue
    20.
    发明授权
    Buffered message queue architecture for database management systems with memory optimizations and “zero copy” buffered message queue 有权
    具有内存优化和“零复制”缓冲消息队列的数据库管理系统的缓冲消息队列架构

    公开(公告)号:US07203706B2

    公开(公告)日:2007-04-10

    申请号:US10443207

    申请日:2003-05-21

    IPC分类号: G06F17/30

    摘要: A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

    摘要翻译: 公开了一种用于管理数据库管理系统中的消息的缓冲消息队列架构。 “缓冲消息队列”是指在诸如RAM的易失性存储器中实现的消息队列。 易失性存储器可以是可由多个进程访问的共享易失性存储器。 缓冲消息队列架构支持发布和订阅通信机制,消息生成器和消息消费者可以彼此分离并且彼此独立。 缓冲消息队列体系结构提供了持久性发布 - 订阅者消息系统的所有功能,而无需将消息存储在持久存储中。 缓冲消息队列架构提供更好的性能和可扩展性,因为不需要持续的操作,并且不需要维护UNDO / REDO日志。 只要应用程序是“可重复的”,发布到缓冲消息队列的消息至少发送一次,即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制,并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列,并提供基于事务的消息队列。