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

1. 发明申请

US20100082551A1 DATA PLACEMENT TRANSPARENCY FOR HIGH AVAILABILITY AND LOAD BALANCING 审中-公开
标题翻译：数据放置高可用性和负载平衡的透明度
公开(公告)号：US20100082551A1
公开(公告)日：2010-04-01
申请号：US12238852
申请日：2008-09-26
申请人： Vishal Kathuria , Robert H. Gerber , Mahesh K. Sreenivas , Yixue Zhu , John Ludeman , Ashwin Shrinivas , Ming Chuan Wu
发明人： Vishal Kathuria , Robert H. Gerber , Mahesh K. Sreenivas , Yixue Zhu , John Ludeman , Ashwin Shrinivas , Ming Chuan Wu
IPC分类号： G06F17/30
CPC分类号： G06F16/24524 , G06F16/27
摘要： A method of updating a clone data map associated with a plurality of nodes of a computer system is disclosed. The clone data map includes node identification data and clone location data. A node failure event of a failed node of the computer system that supports a primary clone is detected. The clone data map is updated such that a secondary clone stored at a node other than the failed node is marked as a new primary clone. In addition, clone data maps may be used to perform node load balancing by placing a substantially similar number of primary clones on each node of a node cluster or may be used to increase or decrease a number of nodes of the node cluster. Further, data fragments that have a heavy usage or a large fragment size may be reduced in size by performing one or more data fragment split operations.
摘要翻译：公开了一种更新与计算机系统的多个节点相关联的克隆数据映射的方法。克隆数据图包括节点标识数据和克隆位置数据。检测到支持主克隆的计算机系统的故障节点的节点故障事件。更新克隆数据图，使得存储在除故障节点之外的节点的次级克隆被标记为新的主克隆。此外，克隆数据映射可以用于通过将基本上相似数量的主克隆放置在节点簇的每个节点上来执行节点负载平衡，或者可以用于增加或减少节点簇的多个节点。此外，可以通过执行一个或多个数据片段拆分操作来减小具有较大使用量或大片段大小的数据片段的大小。

2. 发明申请

US20100082546A1 Storage Tiers for Database Server System 审中-公开
标题翻译：数据库服务器系统的存储层
公开(公告)号：US20100082546A1
公开(公告)日：2010-04-01
申请号：US12241912
申请日：2008-09-30
申请人： Mahesh K. Sreenivas , Robert H. Gerber , Vishal Kathuria , John F. Ludeman , Ashwin Shrinivas , Michael A. Uhlar
发明人： Mahesh K. Sreenivas , Robert H. Gerber , Vishal Kathuria , John F. Ludeman , Ashwin Shrinivas , Michael A. Uhlar
IPC分类号： G06F17/30
CPC分类号： G06F16/221
摘要： A technique is described for storing data from a database across a plurality of data storage devices, wherein each data storage device is capable of being accessed only by a corresponding computer system in a group of interconnected computer systems. In accordance with the technique, an identifier of the database is received. An identifier of a storage tier instance is also received, wherein the storage tier instance comprises a logical representation of one or more storage locations within each of the data storage devices. Responsive to the receipt of the identifier of the database and the identifier of the storage tier instance, data from the database is stored in two or more of the storage locations logically represented by the storage tier instance, wherein each of the two or more storage locations in which data is stored is within a corresponding one of the data storage devices.
摘要翻译：描述了一种用于在多个数据存储设备中存储来自数据库的数据的技术，其中每个数据存储设备仅能够由一组互连的计算机系统中的对应的计算机系统访问。根据该技术，接收数据库的标识符。还接收存储层实例的标识符，其中存储层实例包括每个数据存储设备内的一个或多个存储位置的逻辑表示。响应于接收到数据库的标识符和存储层实例的标识符，来自数据库的数据被存储在由存储层实例逻辑表示的两个或多个存储位置中，其中两个或多个存储位置其中存储数据在相应的一个数据存储设备内。

3. 发明授权

US08131700B2 Transitioning clone data maps and synchronizing with a data query 有权
标题翻译：转换克隆数据映射并与数据查询同步
公开(公告)号：US08131700B2
公开(公告)日：2012-03-06
申请号：US12237895
申请日：2008-09-25
申请人： Yixue Zhu , Robert H. Gerber , Vishal Kathuria , Samuel Hyrum Smith
发明人： Yixue Zhu , Robert H. Gerber , Vishal Kathuria , Samuel Hyrum Smith
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , G06F17/30362
摘要： Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained.
摘要翻译：公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

4. 发明申请

US20100088289A1 TRANSITIONING CLONE DATA MAPS AND SYNCHRONIZING WITH A DATA QUERY 有权
标题翻译：转换克隆数据并与数据查询同步
公开(公告)号：US20100088289A1
公开(公告)日：2010-04-08
申请号：US12237895
申请日：2008-09-25
申请人： Yixue Zhu , Robert H. Gerber , Vishal Kathuria , Samuel Hyrum Smith
发明人： Yixue Zhu , Robert H. Gerber , Vishal Kathuria , Samuel Hyrum Smith
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , G06F17/30362
摘要： Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained.
摘要翻译：公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

5. 发明授权

US07523288B2 Dynamic fragment mapping 有权
标题翻译：动态片段映射
公开(公告)号：US07523288B2
公开(公告)日：2009-04-21
申请号：US11470586
申请日：2006-09-06
申请人： Robert H. Gerber , Vishal Kathuria
发明人： Robert H. Gerber , Vishal Kathuria
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G06F9/26 , G06F9/34 , G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30339 , G06F17/30584 , Y10S707/99937 , Y10S707/99942 , Y10S707/99953
摘要： A dataset is divided into pieces and stored at multiple locations and the system dynamically increases or decreases the number of storage locations where the pieces of the data set may be stored. A data structure comprises a first data field including a first index and a first element, and one or more data fields each with an index and an element. The elements of the one or more data fields include a token representing a location associated with the index of the first data field. A data row of a data set is mapped to the index of a data field using a second index. The second index is derived from a data row of the data set using a hash function. The second index is then mapped to the index of a data field included in the one or more data fields using a modulus function.
摘要翻译：数据集被分成多个位置存储，系统动态地增加或减少存储数据集的存储位置的数量。数据结构包括包括第一索引和第一元素的第一数据字段以及每个具有索引和元素的一个或多个数据字段。一个或多个数据字段的元素包括表示与第一数据字段的索引相关联的位置的令牌。使用第二索引将数据集的数据行映射到数据字段的索引。第二个索引是使用散列函数从数据集的数据行导出的。然后使用模函数将第二索引映射到包含在一个或多个数据字段中的数据字段的索引。

6. 发明申请

US20080059749A1 Dynamic Fragment Mapping 有权
标题翻译：动态片段映射
公开(公告)号：US20080059749A1
公开(公告)日：2008-03-06
申请号：US11470586
申请日：2006-09-06
申请人： Vishal Kathuria , Robert H. Gerber
发明人： Vishal Kathuria , Robert H. Gerber
IPC分类号： G06F12/00
CPC分类号： G06F17/30339 , G06F17/30584 , Y10S707/99937 , Y10S707/99942 , Y10S707/99953
摘要： A data structure and methods for dynamic fragment mapping are disclosed. A dataset may be divided into pieces and stored at multiple locations and the system may dynamically increase or decrease the number of storage locations where the pieces of the data set may be stored. The addition or removal of storage locations may cause only the data stored on those locations to be moved but the rest of the data may not be moved.The data structure comprises a first data field including a first index and a first element, and one or more data fields, each with an index and an element. The elements of the one or more data fields include a token representing a location associated with the index of the first data field. A data row of a data set may be mapped to the index of a data field using a second index. The second index may be derived from a data row of the data set using a hash function. The second index may then be mapped to the index of a data field included in the one or more data fields using a modulus function.
摘要翻译：公开了用于动态片段映射的数据结构和方法。数据集可以被划分成多个位置并且存储在多个位置，并且系统可以动态地增加或减少可以存储数据集的存储位置的数量。添加或删除存储位置可能仅导致存储在这些位置上的数据被移动，但其余的数据可能不会被移动。数据结构包括包括第一索引和第一元素的第一数据字段以及每个具有索引和元素的一个或多个数据字段。一个或多个数据字段的元素包括表示与第一数据字段的索引相关联的位置的令牌。可以使用第二索引将数据集的数据行映射到数据字段的索引。可以使用散列函数从数据集的数据行导出第二索引。然后可以使用模函数将第二索引映射到包含在一个或多个数据字段中的数据字段的索引。

7. 发明申请

US20080282244A1 Distributed transactional deadlock detection 审中-公开
标题翻译：分布式事务死锁检测
公开(公告)号：US20080282244A1
公开(公告)日：2008-11-13
申请号：US11800675
申请日：2007-05-07
申请人： Ming-Chuan Wu , Yuxi Bai , Robert H. Gerber , Alexandre Verbitski
发明人： Ming-Chuan Wu , Yuxi Bai , Robert H. Gerber , Alexandre Verbitski
IPC分类号： G06F9/46
CPC分类号： G06F9/524
摘要： Aspects of the subject matter described herein relate to deadlock detection in distributed environments. In aspects, nodes that are part of the environment each independently create a local wait-for graph. Each node transforms its local wait-for graph to remove non-global transactions that do not need resources from multiple nodes. Each node then sends its transformed local wait-for graph to a global deadlock monitor. The global deadlock monitor combines the local wait-for graphs into a global wait-for graph. Phantom deadlocks are detected and removed from the global wait-for graph. The global deadlock monitor may then detect and resolve deadlocks that involve global transactions.
摘要翻译：本文所述主题的方面涉及分布式环境中的死锁检测。在方面，作为环境一部分的节点各自独立地创建本地等待图。每个节点转换其本地等待图，以去除不需要多个节点资源的非全局事务。然后，每个节点将其转换的本地等待图发送到全局死锁监视器。全局死锁监视器将本地等待图形合并到全局等待图中。从全局等待图中检测并删除幻像死锁。然后，全局死锁监视器可以检测并解决涉及全局事务的死锁。

8. 发明授权

US5978793A Processing records from a database 失效
标题翻译：从数据库处理记录
公开(公告)号：US5978793A
公开(公告)日：1999-11-02
申请号：US248538
申请日：1999-02-11
申请人： Anurag Kashyap , Robert H. Gerber , Diane L. Davison , Sanket Atal , Hannes A. Spintzik , Mark T. Nelson
发明人： Anurag Kashyap , Robert H. Gerber , Diane L. Davison , Sanket Atal , Hannes A. Spintzik , Mark T. Nelson
IPC分类号： G06F12/00 , G06F17/30 , G06F17/40 , G06F19/00
CPC分类号： G06F17/30498 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99936 , Y10S707/99937 , Y10S707/99938
摘要： A computer-based method and system of processing records read respectively from first and second related tables of a database includes determining whether data contained in the records read from the first or second tables is unevenly distributed. Records corresponding to evenly distributed data are searched for matches using a first set of instances of the hash-join operator, and records corresponding to data which is unevenly distributed are searched for matches using a second set of instances of a hash-join operator.
摘要翻译：分别从数据库的第一和第二相关表读取处理记录的基于计算机的方法和系统包括确定包含在从第一或第二表读取的记录中的数据是否不均匀分布。使用散列连接运算符的第一组实例来搜索与均匀分布的数据相对应的记录，并且使用散列连接运算符的第二组实例搜索与不均匀分布的数据相对应的记录。

9. 发明授权

US07137099B2 System and method for extending application preferences classes 有权
标题翻译：用于扩展应用程序偏好类的系统和方法
公开(公告)号：US07137099B2
公开(公告)日：2006-11-14
申请号：US10693717
申请日：2003-10-24
申请人： Holly Knight , Robert H. Gerber , Charles Tete Mensa-Annan , Shyamalan Pather , Vincent H. Curley
发明人： Holly Knight , Robert H. Gerber , Charles Tete Mensa-Annan , Shyamalan Pather , Vincent H. Curley
IPC分类号： G06F9/44 , G06F3/00
CPC分类号： G06F9/4488 , G06F9/44505
摘要： The present systems and methods disclose a system for personalizing computer functionality. End-users are provided with tools to easily write rich and complex preferences, for example, by using a plurality simple IF-THEN propositional logic. The preferences are then transformed into queries and executed efficiently on structured data. Preferences that are satisfied then execute actions such as providing notification or storing data in a particular folder. Furthermore, according to an aspect of the invention, data, logic, events, inter alia, are all schematized, thereby enabling sharing of data between application components and across applications.
摘要翻译：本系统和方法公开了一种用于个性化计算机功能的系统。为最终用户提供了工具，可以轻松地编写丰富和复杂的首选项，例如，通过使用多个简单的IF-THEN命题逻辑。然后将首选项转换为查询并高效地执行结构化数据。首选项被满足，然后执行诸如提供通知或将数据存储在特定文件夹中的操作。此外，根据本发明的一个方面，数据，逻辑，事件等都被示意化，从而使应用程序组件之间和跨应用程序共享数据。

10. 发明授权

US5873074A Applying distinct hash-join distributions of operators to both even and uneven database records 失效
标题翻译：将运算符的不同哈希连接分布应用于均匀和不均匀的数据库记录
公开(公告)号：US5873074A
公开(公告)日：1999-02-16
申请号：US844259
申请日：1997-04-18
申请人： Anurag Kashyap , Robert H. Gerber , Diane L. Davison , Sanket Atal , Hannes A. Spintzik , Mark T. Nelson
发明人： Anurag Kashyap , Robert H. Gerber , Diane L. Davison , Sanket Atal , Hannes A. Spintzik , Mark T. Nelson
IPC分类号： G06F12/00 , G06F17/30 , G06F17/40 , G06F19/00
CPC分类号： G06F17/30498 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99936 , Y10S707/99937 , Y10S707/99938
摘要： A computer-based method and system of processing records read respectively from first and second related tables of a database includes determining whether data contained in the records read from the first or second tables is unevenly distributed. Records corresponding to evenly distributed data are searched for matches using a first set of instances of the hash-join operator, and records corresponding to data which is unevenly distributed are searched for matches using a second set of instances of a hash-join operator.
摘要翻译：分别从数据库的第一和第二相关表读取处理记录的基于计算机的方法和系统包括确定包含在从第一或第二表读取的记录中的数据是否不均匀分布。使用散列连接运算符的第一组实例来搜索与均匀分布的数据相对应的记录，并且使用散列连接运算符的第二组实例搜索与不均匀分布的数据相对应的记录。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式