专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

61. 发明申请

US20060265414A1 Creating and dissolving affinity relationships in a cluster 有权
公开(公告)号：US20060265414A1
公开(公告)日：2006-11-23
申请号：US11132811
申请日：2005-05-18
申请人： Juan Loaiza , Neil James Macnaughton , Sashikanth Chandrasekaran
发明人： Juan Loaiza , Neil James Macnaughton , Sashikanth Chandrasekaran
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30362
摘要： A lock manager system is provided that includes multiple distinct mechanisms for assigning resources to masters. Specifically, the lock manager system includes (1) one or more assignment mechanisms that do not take into account the affinity between nodes and objects (“affinity-independent assignment mechanisms”), and (3) one or more assignment mechanisms that do take into account the affinity between nodes and objects (“affinity-based assignment mechanisms”). At any given time, the assignment of any given resource to a master is governed by only one of the multiple assignment mechanisms employed by the system. Various techniques are described for determining which assignment mechanism to use with which resources.

62. 发明授权

US07058783B2 Method and mechanism for on-line data compression and in-place updates 有权
标题翻译：在线数据压缩和就地更新的方法和机制
公开(公告)号：US07058783B2
公开(公告)日：2006-06-06
申请号：US10246964
申请日：2002-09-18
申请人： Sashikanth Chandrasekaran , Angelo Pruscino
发明人： Sashikanth Chandrasekaran , Angelo Pruscino
IPC分类号： G06F12/00
CPC分类号： G06F3/064 , G06F3/0608 , G06F3/0676 , G06F17/30067 , Y10S707/99942
摘要： A method and mechanism is disclosed for implementing storage and compression in a computer system. Each granular portion of a file can be individually stored in either a compressed storage unit or an uncompressed storage unit. The storage units can be allocated apriori or on an as-needed basis.
摘要翻译：公开了一种用于在计算机系统中实现存储和压缩的方法和机制。文件的每个粒度部分可以单独存储在压缩存储单元或未压缩存储单元中。存储单元可以根据需要分配或者根据需要。

63. 发明申请

US20050240595A1 Dynamic redistribution of a distributed memory index when individual nodes have different lookup indexes 有权
标题翻译：当各个节点具有不同的查找索引时，分布式内存索引的动态重新分配
公开(公告)号：US20050240595A1
公开(公告)日：2005-10-27
申请号：US11000818
申请日：2004-11-30
申请人： Sashikanth Chandrasekaran
发明人： Sashikanth Chandrasekaran
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30171
摘要： Techniques for performing window-by-window remastering are described, in which the mechanism used by nodes to determine the resource-to-window mapping is separated from the mechanism used by the nodes to access resource information. For example, all nodes of a multiple-node system may use the same hash function to determine which resources are involved in a remastering window. However, the resource indexes employed by the nodes to access resource information need not use that same hash function. For example, in nodes where the resource indexes are hash indexes, different nodes may use different hash functions. Further, some or all of the nodes may use mechanisms other than hash indexes to access the resource information.
摘要翻译：描述了用于执行逐个窗口重新划分的技术，其中节点用于确定资源对窗口映射的机制与节点用于访问资源信息的机制分离。例如，多节点系统的所有节点可以使用相同的散列函数来确定在重新格式化窗口中涉及哪些资源。然而，节点用于访问资源信息的资源索引不需要使用相同的散列函数。例如，在资源索引为散列索引的节点中，不同的节点可能使用不同的散列函数。此外，一些或所有节点可以使用除散列索引以外的机制来访问资源信息。

64. 发明申请

US20050160315A1 Geographically distributed clusters 有权
标题翻译：地理分布式集群
公开(公告)号：US20050160315A1
公开(公告)日：2005-07-21
申请号：US10759894
申请日：2004-01-15
申请人： Sashikanth Chandrasekaran , William Kehoe
发明人： Sashikanth Chandrasekaran , William Kehoe
IPC分类号： G06F9/40 , G06F11/14 , G06F11/20 , G06F15/16
CPC分类号： G06F11/2079 , G06F11/1471 , G06F11/1474 , G06F11/2058 , G06F11/2069 , G06F11/2071 , G06F2201/80
摘要： A method and apparatus for mirroring data between a plurality of sites is provided. At a first site of the plurality of sites, a record is maintained that identifies which changes made to one or more data blocks that are stored at the first site have had associated redo information replicated to the other sites of the plurality of sites. A priority value associated with a transaction that is to be performed at the first site is determined. The transaction specifies a modification to a data block. Thereafter, if the priority value indicates that the transaction should not be lost if the first site becomes inoperable, then the transaction is committed only after the record indicates that all other changes that have updated the data block at the first site have had their respective redo information replicated to the other sites of the plurality of sites.
摘要翻译：提供了一种用于在多个站点之间镜像数据的方法和装置。在多个站点的第一站点处，维护记录，其识别对存储在第一站点处的一个或多个数据块所做的更改具有复制到多个站点中的其他站点的相关联的重做信息。确定与要在第一站点执行的事务相关联的优先级值。事务指定对数据块的修改。此后，如果优先级值指示如果第一站点变得不可操作，则不应丢失该事务，则仅在该记录指示在第一站点上更新了数据块的所有其它更改已经具有各自的重做之后才提交该事务信息复制到多个站点的其他站点。

65. 发明授权

US06845384B2 One-phase commit in a shared-nothing database system 有权
标题翻译：无共享数据库系统中的一阶段提交
公开(公告)号：US06845384B2
公开(公告)日：2005-01-18
申请号：US10718875
申请日：2003-11-21
申请人： Roger J. Bamford , Sashikanth Chandrasekaran , Angelo Pruscino
发明人： Roger J. Bamford , Sashikanth Chandrasekaran , Angelo Pruscino
IPC分类号： G06F9/50 , G06F17/30
CPC分类号： G06F17/30575 , G06F17/30377 , Y10S707/99956
摘要： Techniques are provided for handling distributed transactions in shared-nothing database systems where one or more of the nodes have access to a shared persistent storage. Rather than coordinate the distributed transaction using a two-phase commit protocol, the coordinator of the distributed transaction uses a one-phase commit protocol with those participants that have access to the transaction status information maintained by the coordinator. The transaction status information may reside, for example, in the redo log of the coordinator. In the case that the coordinator fails, those participants can determine the state of the distributed transaction based on information stored on the shared disk. In addition, the coordinator is able to determine whether it is possible to commit the distributed transaction based on information that is stored on the shared disk by the participants, without those participants entering a formal “prepared” state.
摘要翻译：提供了用于在无共享数据库系统中处理分布式事务的技术，其中一个或多个节点可以访问共享永久存储。分布式事务的协调器不是使用两阶段提交协议来协调分布式事务，而是与那些能够访问协调器维护的事务状态信息的参与者使用一阶段提交协议。事务状态信息可以驻留在例如协调器的重做日志中。在协调器失败的情况下，这些参与者可以基于存储在共享磁盘上的信息来确定分布式事务的状态。此外，协调器能够根据参与者在共享磁盘上存储的信息来确定是否可以提交分布式事务，而不需要参与者进入正式的“准备”状态。

66. 发明授权

US08762395B2 Evaluating event-generated data using append-only tables 有权
标题翻译：使用仅附加表来评估事件生成的数据
公开(公告)号：US08762395B2
公开(公告)日：2014-06-24
申请号：US12913739
申请日：2010-10-27
申请人： Sashikanth Chandrasekaran
发明人： Sashikanth Chandrasekaran
IPC分类号： G06F7/00
CPC分类号： G06F17/30466 , G06F17/30584
摘要： Techniques are provided for evaluating base events, compound events, and logical update events in an event processing system. In one embodiment, the base events, compound events, and logical update events are definitions in a particular syntax language that specify conditions for evaluating input event data. In this embodiment, base event definitions are evaluated over the input event data; logical update event definitions are evaluated by determining whether the effect of any earlier event is changed by the arrival of a new event; and compound event definitions are evaluated over records representing events that have been selected by evaluating the base event definitions over the input event data.
摘要翻译：提供了用于评估事件处理系统中的基本事件，复合事件和逻辑更新事件的技术。在一个实施例中，基本事件，复合事件和逻辑更新事件是指定用于评估输入事件数据的条件的特定语法语言中的定义。在该实施例中，基于输入事件数据来评估基本事件定义; 逻辑更新事件定义通过确定任何较早事件的影响是否随着新事件的到达而改变而被评估; 并且通过对通过输入事件数据评估基本事件定义而选择的事件的记录来评估复合事件定义。

67. 发明授权

US08234517B2 Parallel recovery by non-failed nodes 有权
标题翻译：非故障节点的并行恢复
公开(公告)号：US08234517B2
公开(公告)日：2012-07-31
申请号：US10831413
申请日：2004-04-23
申请人： Roger J. Bamford , Sashikanth Chandrasekaran , Angelo Pruscino
发明人： Roger J. Bamford , Sashikanth Chandrasekaran , Angelo Pruscino
IPC分类号： G06F11/00
CPC分类号： G06F17/30575
摘要： Various techniques are described for improving the performance of a shared-nothing database system in which at least two of the nodes that are running the shared-nothing database system have shared access to a disk. Specifically, techniques are provided for recovering the data owned by a failed node using multiple recovery nodes operating in parallel. The data owned by a failed node is reassigned to recovery nodes that have access to the shared disk on which the data resides. The recovery logs of the failed node are read by the recovery nodes, or by a coordinator process that distributes the recovery tasks to the recovery nodes.
摘要翻译：描述了用于改善无共享数据库系统的性能的各种技术，其中运行无共享数据库系统的至少两个节点具有对盘的共享访问。具体地，提供了用于使用并行操作的多个恢复节点来恢复由故障节点拥有的数据的技术。由故障节点拥有的数据重新分配给可访问数据所在的共享磁盘的恢复节点。故障节点的恢复日志由恢复节点或由将恢复任务分发到恢复节点的协调进程读取。

68. 发明申请

US20120109985A1 EVALUATING EVENT-GENERATED DATA USING APPEND-ONLY TABLES 有权
标题翻译：使用附录表评估事件生成的数据
公开(公告)号：US20120109985A1
公开(公告)日：2012-05-03
申请号：US12913739
申请日：2010-10-27
申请人： Sashikanth Chandrasekaran
发明人： Sashikanth Chandrasekaran
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30584
摘要： Techniques are provided for evaluating base events, compound events, and logical update events in an event processing system. In one embodiment, the base events, compound events, and logical update events are definitions in a particular syntax language that specify conditions for evaluating input event data. In this embodiment, base event definitions are evaluated over the input event data; logical update event definitions are evaluated by determining whether the effect of any earlier event is changed by the arrival of a new event; and compound event definitions are evaluated over records representing events that have been selected by evaluating the base event definitions over the input event data.
摘要翻译：提供了用于评估事件处理系统中的基本事件，复合事件和逻辑更新事件的技术。在一个实施例中，基本事件，复合事件和逻辑更新事件是指定用于评估输入事件数据的条件的特定语法语言中的定义。在该实施例中，基于输入事件数据来评估基本事件定义; 逻辑更新事件定义通过确定任何较早事件的影响是否随着新事件的到达而改变而被评估; 并且通过对通过输入事件数据评估基本事件定义而选择的事件的记录来评估复合事件定义。

69. 发明授权

US08010494B2 Methods to defend against tampering of audit records 有权
标题翻译：防止篡改审计记录的方法
公开(公告)号：US08010494B2
公开(公告)日：2011-08-30
申请号：US12024257
申请日：2008-02-01
申请人： Sashikanth Chandrasekaran , Viresh Garg
发明人： Sashikanth Chandrasekaran , Viresh Garg
IPC分类号： G06F17/30
CPC分类号： G06F17/30286 , G06F17/30289 , G06F17/30368
摘要： Embodiments of the invention provide systems and methods for maintaining audit records for a database or other resource. According to one embodiment, a method for maintaining audit records for a database can comprise detecting an operation involving at least one record of the database. An audit record can be generated for the operation and the audit record can be stored in an audit table in the database. Insert operations and select operations for the audit table can be supported but other operations for the audit table can be prohibited. Additionally or alternatively, creation of more than one audit table having a same name and schema can be prevented.
摘要翻译：本发明的实施例提供了用于维护数据库或其他资源的审计记录的系统和方法。根据一个实施例，用于维护数据库的审计记录的方法可以包括检测涉及数据库的至少一个记录的操作。可以为操作生成审核记录，并将审核记录存储在数据库中的审核表中。可以支持插入操作和选择审核表的操作，但可以禁止审核表的其他操作。另外或替代地，可以防止创建具有相同名称和模式的多个审计表。

70. 发明授权

US07937364B1 Method and system for reliable access of messages by multiple consumers 有权
标题翻译：用于多个消费者可靠访问消息的方法和系统
公开(公告)号：US07937364B1
公开(公告)日：2011-05-03
申请号：US09265489
申请日：1999-03-09
申请人： Sashikanth Chandrasekaran , Ashok R. Saxena
发明人： Sashikanth Chandrasekaran , Ashok R. Saxena
IPC分类号： G06F17/30
CPC分类号： G06F9/546 , G06F2209/548 , Y10S707/918
摘要： Systems and methods for managing the processing of the same pieces of information, e.g., messages, by multiple consumers, in a prescribed order, without causing the degradation of any consumer's performance because of other consumers' access to the same information. A single information queue contains pieces of information to be accessed by multiple consumers. Each piece of information is stored in the information queue along with an information identifier that uniquely identifies the piece of information. A separate table is used to keep track of and identify the pieces of information in the information queue that have been accessed by respective consumers. This separate table is decoupled from the information queue, and, thus, each consumer's access of a piece of queued information does not impact any other consumer's access of the same piece of information. A deletion process may also be executed, in the background if desired, which uses a working list table that identifies the pieces of information that have been accessed. With the working list table and the separate table, the deletion process identifies the pieces of information that have been accessed by all the respective consumers, and deletes them from the information queue.
摘要翻译：用于以规定的顺序管理由多个消费者处理相同信息（例如，消息）的系统和方法，而不会由于其他消费者访问相同信息而导致任何消费者的性能下降。单个信息队列包含多个消费者要访问的信息。每条信息与唯一标识该信息的信息标识符一起存储在信息队列中。使用单独的表来跟踪和识别已经被各个消费者访问的信息队列中的信息片段。这个单独的表与信息队列分离，因此每个消费者对一条排队信息的访问不会影响任何其他消费者对同一信息的访问。如果需要，还可以在后台执行删除处理，其使用标识已经被访问的信息的工作列表表。使用工作列表表和单独的表，删除进程识别所有相应消费者已经访问的信息，并从信息队列中删除它们。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式