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

1. 发明授权

US5161227A Multilevel locking system and method 失效
标题翻译：多重锁定系统和方法
公开(公告)号：US5161227A
公开(公告)日：1992-11-03
申请号：US434649
申请日：1989-11-13
申请人： Daniel M. Dias , Balakrishna R. Iyer , Philip S. Yu
发明人： Daniel M. Dias , Balakrishna R. Iyer , Philip S. Yu
IPC分类号： G06F15/16 , G06F15/177 , G06F17/30
CPC分类号： G06F17/30362
摘要： A multi-processor computer system in which each processor is under the control of separate system software and access a common database. A two level lock management system is used to prevent data corruption due to unsychronized data access by the multiple processors. By this system, subsets of data in the database are assigned respectively different lock entities. Before a task running on one of the processors access data in the database it first requests permission to access the data in a given mode with reference to the appropriate lock entity. A first level lock manager handles these requests synchronously, using a simplified model of the locking system having shared and exclusive lock modes to either grant or deny the request. All requests are then forwarded to a second level lock manager which grants or denies the request based on a more robust model of the locking system and queues denied requests. The denied requests are granted, in turn, as the tasks which have been granted access finish processing data in the database.

2. 发明授权

US5191652A Method and apparatus for exploiting communications bandwidth as for providing shared memory 失效
标题翻译：用于开发通信带宽的方法和装置，用于提供共享存储器
公开(公告)号：US5191652A
公开(公告)日：1993-03-02
申请号：US434969
申请日：1989-11-13
申请人： Daniel M. Dias , Balakrishna R. Iyer
发明人： Daniel M. Dias , Balakrishna R. Iyer
IPC分类号： G06F15/173 , H04L12/43
CPC分类号： H04L12/43
摘要： A multiprocessor system linked by a fiber optic ring network uses some of the bandwith of the ring network as a shared memory resource. Data slots are defined on the network which can carry message packets from one processor to another or network memory packets which circulate indefinitely on the network. One use of these network memory packets is as a lock management system for controlling concurrent access to a shared database by the multiple processors. The network memory packets are treated as lock entities. A processor indicates that it wants to procure a lock entity by circulating a packet, having a first network memory type, around the network. If no conflicting packets are detected when the circula ted packet returns, the type of the slot is changed to a second network memory type indicating a procured lock entity.

3. 发明授权

US5007053A Method and apparatus for checksum address generation in a fail-safe modular memory 失效
标题翻译：在故障安全模块化存储器中生成校验和地址的方法和装置
公开(公告)号：US5007053A
公开(公告)日：1991-04-09
申请号：US278104
申请日：1988-11-30
申请人： Balakrishna R. Iyer , Daniel M. Dias , Yitzhak Dishon
发明人： Balakrishna R. Iyer , Daniel M. Dias , Yitzhak Dishon
IPC分类号： G06F12/16 , G06F3/06 , G06F11/10 , G11C29/00
CPC分类号： G06F11/1008 , G06F11/1028 , G06F11/1076 , G11C29/70
摘要： A modular fail-safe memory and an address generation mechanism that provides load balancing when the memory is shared by a number of processors. A plurality of memory modules are used for the memory with no specific limit on the number of memory modules, and a checksum block is used to back-up corresponding blocks in the other memory modules. The checksum blocks are distributed across the memory modules, and an address generation mechanism determines the checksum location for a specific memory block. This address generation mechanism ensures that checksum blocks are equally divided between the memory modules so that there is no memory bottleneck, is easy to implement in hardware, and is extended to provide similar properties when a module failure occurs.

4. 发明授权

US09104713B2 Managing a temporal key property in a database management system 有权
标题翻译：管理数据库管理系统中的临时密钥属性
公开(公告)号：US09104713B2
公开(公告)日：2015-08-11
申请号：US13253879
申请日：2011-10-05
申请人： Balakrishna R. Iyer , Robert W. Lyle , Jerry Mukai
发明人： Balakrishna R. Iyer , Robert W. Lyle , Jerry Mukai
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30371 , G06F17/30336 , G06F17/30339 , G06F17/30345 , G06F17/30368 , G06F17/30595
摘要： Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table.
摘要翻译：实施例提供了一种用于有效地搜索时间密钥索引以及在与索引相对应的数据库表中实施密钥特征属性的方法。例如，通过在具有用于时间密钥的排序顺序的索引中寻址时间范围重叠，服务器系统的数据库管理工具可以在强制数据库表中的时间密钥属性的同时有效地处理客户端请求。

5. 发明申请

US20140019422A1 ENCODED DATA PROCESSING 有权
标题翻译：编码数据处理
公开(公告)号：US20140019422A1
公开(公告)日：2014-01-16
申请号：US13617614
申请日：2012-09-14
申请人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
发明人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30286 , G06F17/30076 , G06F17/30339 , H03M7/30
摘要： Techniques are provided for encoded data processing which allows for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.
摘要翻译：为编码数据处理提供技术，其允许作为编码数据变化的连续数据处理。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

6. 发明授权

US07325051B2 Integrated storage appliance 有权
标题翻译：集成存储设备
公开(公告)号：US07325051B2
公开(公告)日：2008-01-29
申请号：US10259034
申请日：2002-09-26
申请人： Sanjoy Das , Balakrishna R. Iyer , John T. Flynn , Vahit H. Hacigumus , Dante A. Aubert , Lu Nguyen
发明人： Sanjoy Das , Balakrishna R. Iyer , John T. Flynn , Vahit H. Hacigumus , Dante A. Aubert , Lu Nguyen
IPC分类号： G06F15/173 , G06F15/16 , H04L12/28
CPC分类号： G06F11/1482 , G06F3/0617 , G06F3/0658 , G06F3/067 , G06F11/2007 , G06F11/2015 , G06F11/2035 , G06F11/2089 , G06F17/30557 , H04L29/06 , H04L67/02 , H04L67/1002 , H04L67/1023 , H04L67/1034 , H04L67/142 , H04L67/2828 , H04L67/2842 , H04L69/329 , H04L2029/06054
摘要： A system and method for providing an integrated storage appliance is disclosed. The storage appliance includes a storage subsystem, a process cluster coupled to the storage subsystem, and a customizable software stack that includes storage-access application so executed by the processor cluster, wherein subsystem, processor cluster and software stack are integrated such that the storage appliance exhibits greater combined reliability, higher availability, and higher serviceability characteristics than would be provided by a sum of the characteristics unintegrated components.
摘要翻译：公开了一种用于提供集成存储设备的系统和方法。存储设备包括存储子系统，耦合到存储子系统的进程集群和可定制的软件堆栈，其包括由处理器集群执行的存储访问应用，其中子系统，处理器集群和软件堆栈被集成，使得存储设备与非整合组件的特征的总和相比，具有更大的组合可靠性，更高的可用性和更高的可服务性特性。

7. 发明授权

US08756208B2 Encoded data processing 失效
标题翻译：编码数据处理
公开(公告)号：US08756208B2
公开(公告)日：2014-06-17
申请号：US13545522
申请日：2012-07-10
申请人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
发明人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30286 , G06F17/30076 , G06F17/30339 , H03M7/30
摘要： Techniques for encoded data processing which allow for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.
摘要翻译：用于编码数据处理的技术，其允许作为编码数据的连续数据处理改变。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

8. 发明授权

US5619199A Order preserving run length encoding with compression codeword extraction for comparisons 失效
标题翻译：订单保留运行长度编码与压缩码字提取进行比较
公开(公告)号：US5619199A
公开(公告)日：1997-04-08
申请号：US434775
申请日：1995-05-04
申请人： Steven J. Watts , Balakrishna R. Iyer
发明人： Steven J. Watts , Balakrishna R. Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937
摘要： The present invention provides a system and method for the dictionary ordering of keys after expansion, compression and concatenation of their key parts. After each key part has been expanded through padding, each substring of identical characters of length greater than or equal to three is compressed through run-length encoding algorithm. The substring is replaced by the sequence character, a compression identifying character and a number identifying the number of characters being replaced. After compression and the subsequent concatenation, the keys are compared character by character. At the first instance of a miscomparison, the comparison scheme performs a normal dictionary ordering if neither of the characters are part of a compression sequence. If a character at the point of miscomparison is part of a compression sequence then an ordering decision is made based on the compression character, the length of the compressed substring and the character following the compressed substring.
摘要翻译：本发明提供了一种在关键部件的扩展，压缩和级联之后对键进行字典排序的系统和方法。在通过填充扩展每个关键部分之后，通过游程编码算法压缩长度大于或等于3的相同字符的每个子字符串。子字符串由序列字符替换，压缩识别字符和标识要替换的字符数的数字。经过压缩和随后的级联，按键逐个比较。在错误比较的第一个实例中，如果两个字符都不是压缩序列的一部分，则比较方案执行正常的字典排序。如果错误点处的字符是压缩序列的一部分，则基于压缩字符，压缩子字符串的长度和压缩子字符串之后的字符进行排序决定。

9. 发明授权

US5495601A Method to off-load host-based DBMS predicate evaluation to a disk controller 失效
标题翻译：用于将基于主机的DBMS谓词评估卸载到磁盘控制器的计算机程序产品
公开(公告)号：US5495601A
公开(公告)日：1996-02-27
申请号：US989447
申请日：1992-12-11
申请人： Inderpal S. Narang , Balakrishna R. Iyer , Chandrasekaran Mohan
发明人： Inderpal S. Narang , Balakrishna R. Iyer , Chandrasekaran Mohan
IPC分类号： G06F12/00 , G06F11/14 , G06F17/30
CPC分类号： G06F17/30377 , Y10S707/99938 , Y10S707/99954
摘要： A method is disclosed for a database system for [off-loading] off-loading, to disk [controller] controller, the extraction of committed [data involving the] data. The system first [picking] picks a Commit.sub.-- LSN value and [insuring] insures all the data modified prior to the Commit.sub.-- LSN value is processed following the DBMS policy of reducing some disk I/Os or not for the modified pages cached in the system. If the policy is not to do disk I/Os for such [pages] pages, then the system places the identifiers of those pages in an ignore list. Otherwise, the system writes those pages to disk and empties the ignore list. [After which] Afterwards, the system forwards the ignore list and the Commit.sub.--LSN along with information regarding the data to be processed to the controller. The controller performs the off-load function by reading from disk every page identified by the system except those in the ignore [list] list, and [determining] determining, for each [page] page, if the page's Page.sub.-- LSN value is less than the Commit.sub.-- LSN. If it [is] is, then the controller processes the page and adds any qualifying data from that page to a defined answer set. Otherwise, the controller adds the Page.sub.-- ID for that page to a defined exception list. The controller than passes the answer set and the exception list to the system. The system processes the pages identified in the exception list and those in the ignore list. The system consolidates these answers with the answer set returned by the controller for presentation to the user.
摘要翻译：公开了一种用于[卸载]卸载的数据库系统的方法，到磁盘[控制器]控制器，提取已提交的涉及数据的数据。系统首先[pick]选择一个Commit-LSN值，并且[确保]确保在Commit-LSN值之前修改的所有数据被处理，遵循减少某些磁盘I / O的DBMS策略，而不是缓存在系统。如果策略不为这些[页]页面执行磁盘I / O，则系统将这些页面的标识符放置在忽略列表中。否则，系统将这些页面写入磁盘并清空忽略列表。 [之后]之后，系统将忽略列表和Commit-LSN以及要处理的数据的信息与控制器进行转发。控制器通过从除了[list]列表中的系统之外的系统识别的每个页面读取磁盘来执行卸载功能，以及[确定]对于每个[page]页面，如果页面的Page-LSN值较小比Commit-LSN。如果是，则控制器处理页面，并将该页面中的任何限定数据添加到定义的答案集。否则，控制器将该页面的Page-ID添加到定义的异常列表中。控制器将答案集和异常列表传递给系统。系统处理异常列表中标识的页面和忽略列表中的页面。系统将这些答案与控制器返回的回答集合合并，以呈现给用户。

10. 发明授权

US5412384A Method and system for adaptively building a static Ziv-Lempel dictionary for database compression 失效
标题翻译：用于自适应构建静态Ziv-Lempel字典进行数据库压缩的方法和系统
公开(公告)号：US5412384A
公开(公告)日：1995-05-02
申请号：US288675
申请日：1994-08-10
申请人： Chung-Chia Chang , Gregory L. Davoll , Mohamed H. El-Ruby , Craig A. Friske , Balakrishna R. Iyer , John P. Lazarus , David Wilhite , Kenneth E. Plambeck
发明人： Chung-Chia Chang , Gregory L. Davoll , Mohamed H. El-Ruby , Craig A. Friske , Balakrishna R. Iyer , John P. Lazarus , David Wilhite , Kenneth E. Plambeck
IPC分类号： G06F5/00 , G06T9/00 , H03M7/30 , H03M7/46 , H03M7/38
CPC分类号： H03M7/3088 , G06T9/005
摘要： A system for creating a static data compression dictionary adapted to a hardware-based data compression architecture. A static Ziv-Lempel dictionary is created and stored in memory for use in compressing database records. No data compression occurs during dictionary construction. A fixed-size Ziv-Lempel parse-tree is adapted to database characteristics in one of two alternate ways. First, the parse-tree is overbuilt substantially and then pruned back to a static size by eliminating the least recently used (LRU) nodes having the lowest use count. Alternatively, the parse-tree is built to a static size and thereafter selected nodes are replaced with new nodes upon database sampling. This node recycling procedure chooses the least-useful nodes for replacement according to a use count and LRU strategy while exhausting the database sample. The pruned Ziv-Lempel parse-tree is then transformed to a static dictionary configuration and stored in memory for use in a hardware-based database compression procedure. Completion of the static dictionary before starting data compression eliminates the initial compression inefficiencies well-known for the Ziv-Lempel procedure. The parse-tree construction is enhanced by initializing the tree with NULL and DEFAULT sequences from database definitions before examining any data.
摘要翻译：一种用于创建适用于基于硬件的数据压缩架构的静态数据压缩字典的系统。静态Ziv-Lempel字典被创建并存储在内存中用于压缩数据库记录。字典构造期间不发生数据压缩。固定大小的Ziv-Lempel解析树以两种备选方式之一适用于数据库特征。首先，解析树被大量覆盖，然后通过消除具有最低使用次数的最近最少使用的（LRU）节点将其修剪回静态大小。或者，解析树被构建为静态大小，此后在数据库采样时，所选择的节点被新节点替换。该节点回收过程根据使用次数和LRU策略选择最不利的节点进行替换，同时耗尽数据库样本。修剪后的Ziv-Lempel解析树然后转换为静态字典配置，并存储在内存中，用于基于硬件的数据库压缩过程。开始数据压缩之前完成静态字典消除了Ziv-Lempel过程众所周知的初始压缩效率低下。在检查任何数据之前，通过从数据库定义中初始化具有NULL和DEFAULT序列的树来增强解析树结构。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式