公开(公告)号：US07984040B2

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

申请号：US12133899

申请日：2008-06-05

申请人： Shailendra Mishra ,  Anand Srinivasan ,  Namit Jain

发明人： Shailendra Mishra ,  Anand Srinivasan ,  Namit Jain

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.

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

公开(公告)号：US20110022618A1

公开(公告)日：2011-01-27

申请号：US12506891

申请日：2009-07-21

申请人： Mohit Thatte ,  Sandeep Bishnoi ,  Namit Jain ,  Anand Srinivasan ,  Shailendra Mishra

发明人： Mohit Thatte ,  Sandeep Bishnoi ,  Namit Jain ,  Anand Srinivasan ,  Shailendra Mishra

IPC分类号： G06F17/30 ,  G06F9/46 ,  G06F15/16

CPC分类号： G06F17/30516 ,  G06F9/541 ,  H04L29/00

摘要： Techniques for facilitating communication between one or more client applications and an event processing server. In one set of embodiments, a framework is provided that enables a client application to communicate with an event processing server via a standard database connectivity API, such as Java Database Connectivity (JDBC).

摘要翻译： 用于促进一个或多个客户端应用与事件处理服务器之间的通信的技术。 在一组实施例中，提供了一种框架，其使得客户端应用程序能够通过诸如Java数据库连接（JDBC）的标准数据库连接API与事件处理服务器进行通信。

公开(公告)号：US07739265B2

公开(公告)日：2010-06-15

申请号：US11874850

申请日：2007-10-18

申请人： Namit Jain ,  Anand Srinivasan ,  Shailendra Kumar Mishra

发明人： Namit Jain ,  Anand Srinivasan ,  Shailendra Kumar Mishra

IPC分类号： G06F17/30

CPC分类号： G06F17/30516

摘要： A first continuous query is deleted from several continuous queries that are being executed, by performing different actions that depend on how resources are shared therebetween. As an example, a second continuous query is deleted if a view is referenced by the first continuous query, and if the view is built on the second continuous query, and if the view is not referenced by any query other than the first continuous query. Such deletion is followed by compiling the second continuous query, followed by updating the view to refer to a newly-compiled version of the second continuous query. As another example, if an operator in the first continuous query is not used by any other query, this operator is de-scheduled from execution, and any exclusively-owned resources are released. Also, data to be read by the operator and data generated by the operator, if present in shared resources, are deleted therefrom.

摘要翻译： 通过执行取决于资源如何共享的不同动作，从正在执行的几个连续查询中删除第一个连续查询。 作为示例，如果第一连续查询引用了视图，并且视图是建立在第二连续查询上，并且视图没有被第一连续查询之外的任何查询引用，则删除第二连续查询。 这样的删除之后是编译第二连续查询，随后更新视图以引用第二连续查询的新编译版本。 作为另一示例，如果第一连续查询中的运算符不被任何其他查询使用，则该运算符从执行中去调度，并且释放任何专有资源。 此外，由用户读取的数据和由运营商产生的数据（如果存在于共享资源中）将被删除。

公开(公告)号：US20090112803A1

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

申请号：US11927683

申请日：2007-10-30

申请人： Anand Srinivasan ,  Namit Jain ,  Parul Jain ,  Shailendra Mishra

发明人： Anand Srinivasan ,  Namit Jain ,  Parul Jain ,  Shailendra Mishra

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.

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

公开(公告)号：US20090106190A1

公开(公告)日：2009-04-23

申请号：US11874896

申请日：2007-10-18

申请人： Anand Srinivasan ,  Namit Jain ,  Shailendra Kumar Mishra

发明人： Anand Srinivasan ,  Namit Jain ,  Shailendra Kumar Mishra

IPC分类号： G06F17/30

CPC分类号： G06F8/20

摘要： A data stream management system (DSMS) is designed to support a new user-defined function, by creating and using at least two structures as follows. A first structure (“metadata entry”) is created in response to a command for creation of the new function, and maps a single instance of a class to the function's name. A second structure is created with creation of an operator on receipt of each new continuous query that uses the new function. The second structure (“operator specific data structure”) contains a path to the newly-created instance, which path is obtained by looking up the first structure. Additional second structures are created on receipt of additional continuous queries which use the new function, but all second structures contain the same path. All continuous queries use the same instance. Repeated use of a single instance to compile and execute multiple queries eliminates repeated instantiation of the same function.

摘要翻译： 数据流管理系统（DSMS）旨在通过如下创建和使用至少两个结构来支持新的用户定义的功能。 响应于用于创建新功能的命令创建第一个结构（“元数据条目”），并将类的单个实例映射到函数的名称。 在接收到使用新功能的每个新的连续查询时，创建第二个结构。 第二个结构（“运算符特定数据结构”）包含新创建的实例的路径，通过查找第一个结构获取哪个路径。 附加的第二个结构是在接收到使用新功能的附加连续查询时创建的，但所有第二个结构都包含相同的路径。 所有连续查询使用相同的实例。 重复使用单个实例来编译和执行多个查询消除了相同功能的重复实例化。

公开(公告)号：US20090037370A1

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

申请号：US12133899

申请日：2008-06-05

申请人： Shailendra Mishra ,  Anand Srinivasan ,  Namit Jain

发明人： Shailendra Mishra ,  Anand Srinivasan ,  Namit Jain

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.

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

公开(公告)号：US20080275891A1

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

申请号：US11867471

申请日：2007-10-04

申请人： Hoyong Park ,  Namit Jain ,  Anand Srinivasan ,  Shailendra Mishra

发明人： Hoyong Park ,  Namit Jain ,  Anand Srinivasan ,  Shailendra Mishra

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.

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

公开(公告)号：US07213150B1

公开(公告)日：2007-05-01

申请号：US10044008

申请日：2002-01-11

申请人： Namit Jain ,  Shailendra K. Mishra ,  Bhagat V. Nainani ,  Wei Wang ,  Debashish Chatterjee

发明人： Namit Jain ,  Shailendra K. Mishra ,  Bhagat V. Nainani ,  Wei Wang ,  Debashish Chatterjee

IPC分类号： H04L9/00 ,  H04K1/00 ,  G06F11/30 ,  G06F12/14 ,  H04L9/32

CPC分类号： H04L9/3239 ,  H04L9/3247

摘要： One embodiment of the present invention provides a system that facilitates secure messaging. The system starts by creating a message at an origin. Next, the system computes a digest of the message. This digest is signed using an origin private encryption key. The message and the signed digest are forwarded to a queue for delivery to a recipient. Upon receiving the message and the signed digest at the queue, the system verifies that the digest was signed at the origin by using an origin public encryption key. If the signature is valid, the origin cannot deny creating the message. Valid messages and digests are placed on the queue and the recipient is notified that the message is available.

摘要翻译： 本发明的一个实施例提供一种便于安全消息传递的系统。 系统从原点创建消息开始。 接下来，系统计算消息的摘要。 此摘要使用原始私人加密密钥进行签名。 消息和签名摘要将转发到队列以传递给收件人。 在队列中接收到消息和签名的摘要后，系统将通过使用原始公共加密密钥来验证摘要是否已经在原点上签名。 如果签名有效，则不能拒绝创建该消息。 有效的消息和摘要被放置在队列上，并且通知收件人该消息是可用的。

公开(公告)号：US07203706B2

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

申请号：US10443207

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

IPC分类号： G06F17/30

CPC分类号： G06F9/544 ,  G06F17/30371 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945 ,  Y10S707/99948

摘要： 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日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。

公开(公告)号：US07185034B2

公开(公告)日：2007-02-27

申请号：US10443323

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra ,  Bhagat Nainani

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra ,  Bhagat Nainani

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  Y10S707/99957

摘要： 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日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。