Queued sessions for communicating correlated messages over a network
    1.
    发明授权
    Queued sessions for communicating correlated messages over a network 有权
    用于通过网络传送相关消息的排队会话

    公开(公告)号:US07421501B2

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

    申请号:US11050990

    申请日:2005-02-04

    IPC分类号: G06F15/16 G06F12/00

    CPC分类号: H04L69/16 H04L67/14

    摘要: Systems and methods in accordance with the present invention allow for messages to be delivered from one application to another over a network in discrete groupings or communication sessions. For example, a sending computer system sends a group of related messages to a queue at a recipient computer system. The recipient computer system identifies that the messages of the group are related, and initiates a session-oriented communication channel. The recipient computer passes the group of messages to an appropriate application, and opens a different, new session-oriented communication channel for a new group of messages that are not necessarily related to the first group of messages. In one implementation, an order identifier in each of the received messages instructs the recipient computer system on what order, if any, the messages in a group are to be processed by the specific application.

    摘要翻译: 根据本发明的系统和方法允许在离散的分组或通信会话中通过网络将消息从一个应用传递到另一应用。 例如,发送计算机系统将一组相关消息发送到接收方计算机系统的队列。 接收者计算机系统识别出该组的消息相关,并发起面向会话的通信信道。 接收者计算机将消息组传递到适当的应用程序,并为不一定与第一组消息相关联的新组消息打开不同的新的面向会话的通信信道。 在一个实现中,每个接收到的消息中的订单标识符指示接收方计算机系统按照特定应用程序处理组中的消息的顺序(如果有的话)。

    Queued sessions for communicating correlated messages over a network
    3.
    发明申请
    Queued sessions for communicating correlated messages over a network 有权
    用于通过网络传送相关消息的排队会话

    公开(公告)号:US20060177069A1

    公开(公告)日:2006-08-10

    申请号:US11050990

    申请日:2005-02-04

    IPC分类号: H04L9/00

    CPC分类号: H04L69/16 H04L67/14

    摘要: Systems and methods in accordance with the present invention allow for messages to be delivered from one application to another over a network in discrete groupings or communication sessions. For example, a sending computer system sends a group of related messages to a queue at a recipient computer system. The recipient computer system identifies that the messages of the group are related, and initiates a session-oriented communication channel. The recipient computer passes the group of messages to an appropriate application, and opens a different, new session-oriented communication channel for a new group of messages that are not necessarily related to the first group of messages. In one implementation, an order identifier in each of the received messages instructs the recipient computer system on what order, if any, the messages in a group are to be processed by the specific application.

    摘要翻译: 根据本发明的系统和方法允许在离散的分组或通信会话中通过网络将消息从一个应用传递到另一应用。 例如,发送计算机系统将一组相关消息发送到接收方计算机系统的队列。 接收者计算机系统识别出该组的消息相关,并发起面向会话的通信信道。 接收者计算机将消息组传递到适当的应用程序,并为不一定与第一组消息相关联的新组消息打开不同的新的面向会话的通信信道。 在一个实现中,每个接收到的消息中的订单标识符指示接收方计算机系统按照特定应用程序处理组中的消息的顺序(如果有的话)。

    Method and apparatus for processing a list structure
    5.
    发明授权
    Method and apparatus for processing a list structure 有权
    用于处理列表结构的方法和装置

    公开(公告)号:US06963882B1

    公开(公告)日:2005-11-08

    申请号:US09677339

    申请日:2000-10-02

    IPC分类号: G06F9/46 G06F17/30 H04L29/08

    摘要: Various enhancements are made to the architecture of a list processor to facilitate its use in implementing a message queue that is shared by queue managers residing across a multisystem complex. A new list structure control—a program list entry identifier indicator, or PLEIDI—is defined to allow the user to specify whether user-defined entry IDs are used when the list is allocated. A new delete list (DL) command is added that sequentially processes list entries in the order in which they exist on the specified list. A new move list entries (MLES) command provides a performance-optimized means to process an input list of entries. New key comparison functions and list monitoring enhancements have also been added. A new type of key called a secondary list entry key (SLEK) allows the user to specify a secondary key value as a means to identify a list entry.

    摘要翻译: 对列表处理器的架构进行了各种改进,以便于其在实现驻留在多系统复合体上的队列管理器共享的消息队列中的使用。 新的列表结构控制 - 程序列表条目标识符指示符或PLEIDI被定义为允许用户指定在分配列表时是否使用用户定义的条目ID。 添加一个新的删除列表(DL)命令,按照它们在指定列表中存在的顺序顺序处理列表条目。 新的移动列表条目(MLES)命令提供了一种性能优化的方法来处理条目的输入列表。 还增加了新的关键比较功能和列表监控增强功能。 称为次列表条目密钥(SLEK)的新类型的密钥允许用户指定辅助密钥值作为识别列表条目的手段。

    Queued method invocations on distributed component applications
    6.
    发明授权
    Queued method invocations on distributed component applications 有权
    分布式组件应用程序的排队方法调用

    公开(公告)号:US06425017B1

    公开(公告)日:2002-07-23

    申请号:US09135378

    申请日:1998-08-17

    IPC分类号: G06F954

    CPC分类号: G06F9/547 G06F9/548

    摘要: An object runtime architecture allows method invocations to be made on either a synchronous, real-time basis or a queued basis using the normal call semantics of an object model. The object runtime architecture provides a proxy of an object with a method invocation recorder for receiving method calls of a client on the object, and marshaling the method calls into a message for sending to a queue associated with the object. The object runtime architecture further provides a listener for dispatching the message from the queue to a player which uses a stub to unmarshal the message in order to issue the method calls to the object. The object runtime architecture thus decouples the client and objects lifetimes and availability, without requiring explicit programming of the client and object to perform message queuing. Accordingly, with no modification of the object's interface structure or code, the same object can be used in either a real-time or queued environment. This allows the decision between real-time or queued method invocations to be made much later than at development of the object, such as at run-time creation of the object.

    摘要翻译: 对象运行时架构允许使用对象模型的正常调用语义在同步,实时或排队的基础上进行方法调用。 对象运行时体系结构使用方法调用记录器来提供对象的代理,用于接收对象上的客户端的方法调用,并将该方法调用组合成消息以发送到与该对象相关联的队列。 对象运行时体系结构进一步提供了一个侦听器,用于将消息从队列发送到使用存根来解组消息的播放器,以发出对该对象的方法调用。 因此,对象运行时架构使客户端和对象的寿命和可用性分离,而不需要客户端和对象的显式编程来执行消息队列。 因此,在对对象的接口结构或代码进行修改的情况下,可以在实时或排队的环境中使用相同的对象。 这允许实时或排队的方法调用之间的决定比开发对象的时间晚得多,例如在对象的运行时创建。

    Fault-tolerant transaction-oriented data processing
    7.
    发明授权
    Fault-tolerant transaction-oriented data processing 失效
    容错的面向事务的数据处理

    公开(公告)号:US5465328A

    公开(公告)日:1995-11-07

    申请号:US181521

    申请日:1994-01-14

    IPC分类号: G06F12/00 G06F11/00 G06F11/14

    摘要: In transaction processing systems, it is known for resource-updating operations within a transaction to be backed out at the request of an application program following detection of error conditions during processing of the transaction. If the error condition is very likely to recur, it may be undesirable for the operations request to be presented to the application exactly as before. A transaction-oriented data processing system and a method of transaction-oriented data processing are provided in which operation requests or data packets may be marked to be excluded from the effects of application-requested backouts.

    摘要翻译: 在事务处理系统中,知道事务中的资源更新操作在事务处理期间在检测到错误状况之后,根据应用程序的请求进行备份。 如果错误条件很可能重现,则操作请求可能与以前一样呈现给应用程序可能是不希望的。 提供面向事务的数据处理系统和面向事务的数据处理的方法,其中可以将操作请求或数据分组标记为从应用请求的回退的效果中排除。

    System and method for storing persistent and non-persistent queued data
and for recovering the persistent data responsive to a system restart
    8.
    发明授权
    System and method for storing persistent and non-persistent queued data and for recovering the persistent data responsive to a system restart 失效
    用于存储持久和非持久排队数据的系统和方法,以及响应于系统重启来恢复持久数据

    公开(公告)号:US5452430A

    公开(公告)日:1995-09-19

    申请号:US216897

    申请日:1994-03-23

    摘要: A data processing system for the storage of persistent and non-persistent data in a queue, and a method for the storage of data which is required to survive a system failure (persistent data) and data which is not required to survive a system failure (non-persistent data) on a single queue, are disclosed. The method involves receiving persistent and non-persistent data to be stored in a queue, then marking the data in time sequence order, before storing the persistent data in a first set of data pages and the non-persistent data in a second set of data pages. Upon receiving a request for removal of data from the queue, both the first and second sets of pages are checked and the data is removed in time sequence order. A log is preferably created to enable recovery in the event of failure and restart of the queue. When receiving and removing persistent data to be stored in and to be removed from the queue, log entries are made of changes to the persistent data only. Before the receiving of the data, a table in space map pages is created indicating which pages available in storage are free, which are allocated for persistent data, and which are allocated for non-persistent data. After receiving data and removing data, the table is updated. In the event of a failure and restart of the queue, space map page table is scanned and updated to indicate that all pages containing non-persistent data are free.

    摘要翻译: 用于在队列中存储持久数据和非持久数据的数据处理系统,以及用于存储系统故障所需的数据(持久数据)和不需要在系统故障中存活的数据的方法( 非持久性数据)被公开。 该方法包括在将持久数据存储在第一组数据页中,并将非持久数据存储在第二组数据中之后,接收要存储在队列中的持久和非持久性数据,然后以时间顺序对数据进行标记 页面。 在接收到从队列中移除数据的请求时,检查第一组和第二组页面,并按时间顺序排列数据。 优选地创建日志以在队列的故障和重新启动的情况下恢复。 当接收和删除要存储在队列中并将其从队列中删除的持久性数据时,日志条目仅对持久性数据进行更改。 在接收到数据之前,会创建一个空间映射页面,指示存储器中可用的页面是空闲的,哪些页面被分配给持久数据,哪些页面被分配给非持久性数据。 在收到数据和删除数据后,表格将被更新。 在发生故障并重新启动队列的情况下,扫描并更新空间映射页表,以指示包含非持久性数据的所有页面都是空闲的。

    Queued component interface passing for results outflow from queued method invocations
    9.
    发明授权
    Queued component interface passing for results outflow from queued method invocations 有权
    排队的组件接口传递结果从排队方法调用中流出

    公开(公告)号:US07634777B2

    公开(公告)日:2009-12-15

    申请号:US11034517

    申请日:2005-01-06

    IPC分类号: G06F9/44

    摘要: Queued component interface passing provides a way for a queued component to convey results of processing a client program's method invocations made asynchronously via a queue. A queued component recorder for a “processing” queued component operates to marshal-by-value a method invocation parameter that is reference to another queued component recorder for another “results” queued component into a data stream of recorded method invocations, which is then submitted as a message to a queue associated with the processing queued component. On receipt of the message from the queue, a queued component player for the processing queued component unmarshals the reference to the other queued component recorder and passes this reference to the processing queued component. The processing queued component uses the passed reference to invoke methods of the results queued component through its message queue, which conveys the processing queued component's results.

    摘要翻译: 排队的组件接口传递提供了一种排队组件传达处理客户端程序通过队列异步进行的方法调用的结果的方法。 用于“处理”排队组件的排队组件记录器操作以逐个值得一个方法调用参数,该方法调用参数被引用到另一个排队的组件记录器,用于另一个“结果”排队组件成记录方法调用的数据流,然后提交 作为与处理排队组件相关联的队列的消息。 在从队列接收到消息时,用于处理排队的组件的排队组件播放器将对另一个排队的组件记录器的引用进行合并,并将该引用传递给处理排队的组件。 处理队列组件使用传递的引用来通过其消息队列调用结果排队组件的方法,从而传达处理队列组件的结果。

    PROGRAMMING MODEL FOR SUBSCRIPTION SERVICES
    10.
    发明申请
    PROGRAMMING MODEL FOR SUBSCRIPTION SERVICES 审中-公开
    订阅服务的编程模式

    公开(公告)号:US20070156656A1

    公开(公告)日:2007-07-05

    申请号:US11565369

    申请日:2006-11-30

    IPC分类号: G06F7/00

    摘要: The present invention relates to a subscription modeling system and methodology. A query processor receives subscription query and subscriber information and transforms the query and subscriber information into data. An index component propagates at least one database with the transformed data; and a matching component that associates the transformed data with event data to generate a database of notification data that can be delivered to subscribers. The invention provides for abstracting subscription and subscriber information (as well as event information if desired) to high-level classes (e.g., data fields)—thus the invention provides for modeling such notification related information as data. Subscription applications can thus be developed at high levels wherein complex subscription queries and subscriber information can be defined as data fields for example. Databases in accordance with the data fields can be propagated with subscription/subscriber specific information. The present invention takes advantages of the processing power associated with database engines (e.g., SQL server) to generate notifications via performing a join operation on the databases (e.g., subscription database(s), subscriber database(s) and event database(s)). Accordingly, notifications are generated en masse as compared to per subscription per subscriber. Thus the present invention provides for a highly scalable and efficient notification system.

    摘要翻译: 本发明涉及订阅建模系统和方法。 查询处理器接收订阅查询和订户信息,并将查询和用户信息转换为数据。 索引组件使用转换的数据传播至少一个数据库; 以及匹配组件,其将经变换的数据与事件数据相关联,以生成可以递送给订户的通知数据的数据库。 本发明提供了将订阅和订户信息(以及如果需要的事件信息)提取给高级类(例如,数据字段) - 本发明提供了对与数据相关的通知相关信息进行建模。 因此,订阅应用程序可以以高级别开发,其中复合订阅查询和订户信息可以被定义为例如数据字段。 根据数据字段的数据库可以使用订阅/订户特定信息进行传播。 本发明利用与数据库引擎(例如,SQL服务器)相关联的处理能力来通过对数据库(例如订阅数据库,订户数据库和事件数据库)执行加入操作来生成通知, )。 因此,与每个用户的每个订阅相比,大量生成通知。 因此,本发明提供了高度可扩展和高效的通知系统。