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

1. 发明授权

US5794242A Temporally and spatially organized database 失效
标题翻译：临时和空间组织的数据库
公开(公告)号：US5794242A
公开(公告)日：1998-08-11
申请号：US835553
申请日：1997-04-08
申请人： Russell J. Green , J. Christopher Davies , Alan J. Paxton , Christopher Whitaker
发明人： Russell J. Green , J. Christopher Davies , Alan J. Paxton , Christopher Whitaker
IPC分类号： G06F17/30
CPC分类号： G06F17/30 , Y10S707/99953
摘要： During operation of a computer system, index records and data records of a data structure are organized in a hierarchical manner, with index records being at a higher level of the hierarchy than the data records referenced by the index records. While the data structure is manipulated, the data records are stored in a random access memory. Modifications made to the data structure are chronologically written to a disk storage in a bottom-first/top-last order of the hierarchy for persistent storage as a database. A back-up copy of the database is made by storing the data and index records of the database in a top-first/bottom-last order on a sequentially readable media. A temporal and spatial view of a portion of the database can be obtained by accessing the index records and the data records of the database or the back-up media in the top-first/bottom last order.
摘要翻译：在计算机系统的操作期间，以层次的方式组织数据结构的索引记录和数据记录，其中索引记录处于比索引记录引用的数据记录更高的层级。当数据结构被操纵时，数据记录被存储在随机存取存储器中。对数据结构进行的修改按时间顺序以层次结构的底部/最后一个顺序写入磁盘存储，作为数据库用于持久存储。数据库的备份副本是通过将数据库的数据和索引记录以顺序可读介质的顶部/最下一个顺序存储来进行的。数据库的一部分的时间和空间视图可以通过以顶部/最下一个顺序访问数据库或备份媒体的索引记录和数据记录来获得。

2. 发明授权

US5440732A Key-range locking with index trees 失效
标题翻译：带索引树的关键范围锁定
公开(公告)号：US5440732A
公开(公告)日：1995-08-08
申请号：US014181
申请日：1993-02-05
申请人： David B. Lomet , Russell J. Green
发明人： David B. Lomet , Russell J. Green
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30362 , G06F17/30949 , Y10S707/99931 , Y10S707/99938
摘要： A database-management system (10) generates bounded-disorder indexes on its database keys. In such an index, the leaf nodes (51, 62) are large and are divided into a number of buckets (52, 54, 56, 58), only one of which ordinarily is accessed in any given single-record database operation. The key values in a leaf node are distributed among the leaf node's buckets in accordance with a hashing function. The lockable ranges locked for scanning functions are defined in accordance with key-valued locking, in which each lockable range is bounded by successive key values that exist in the database. But the multiple-bucket accesses that would otherwise be required, because of the hash-function distribution of key values among a node's several buckets, are avoided because the lockable ranges are defined by the sequence of key values in the bucket rather than in the node. In addition to the existing key values, moreover, the buckets' key-value limits are also employed to bound lockable ranges, even if no database records contain those key-value limits. This prevents end-of-bucket insertions and deletions from needing further I/O operations in order to identify the lockable ranges that those insertions and deletions modify.
摘要翻译：数据库管理系统（10）在其数据库密钥上生成有界无序索引。在这样的索引中，叶节点（51,62）很大并被分成多个桶（52,54,56,58），其中只有一个通常在任何给定的单记录数据库操作中被访问。根据哈希函数，叶节点中的关键值分布在叶节点的桶中。针对扫描功能锁定的可锁定范围根据键值锁定定义，其中每个可锁定范围由数据库中存在的连续键值限定。但是，由于可靠的范围是由桶中的关键值序列而不是在节点中定义的，所以避免了因为节点的几个桶之间的键值的散列函数分布而需要的多桶访问。此外，除了现有的键值之外，即使没有数据库记录包含这些键值限制，也可以使用桶的键值限制来绑定可锁定的范围。这样可以防止最后的插入和删除需要进一步的I / O操作，以便识别这些插入和删除修改的可锁定范围。

3. 发明申请

US20120303413A1 METHODS AND SYSTEMS FOR NETWORK TRAFFIC FORECAST AND ANALYSIS 审中-公开
标题翻译：网络交通预测与分析的方法与系统
公开(公告)号：US20120303413A1
公开(公告)日：2012-11-29
申请号：US13481305
申请日：2012-05-25
申请人： Yufei Wang , Russell J. Green
发明人： Yufei Wang , Russell J. Green
IPC分类号： G06Q30/02
CPC分类号： G06Q10/0631 , G06Q30/0201 , G06Q30/0202 , G06Q50/32
摘要： A computer-implemented method and system are provided for forecasting traffic load on a communications network driven by market factors.
摘要翻译：提供了一种计算机实现的方法和系统，用于预测由市场因素驱动的通信网络上的业务负载。

4. 发明授权

US5485607A Concurrency-control method and apparatus in a database management system utilizing key-valued locking 失效
标题翻译：利用键值锁定的数据库管理系统中的并发控制方法和装置
公开(公告)号：US5485607A
公开(公告)日：1996-01-16
申请号：US14188
申请日：1993-02-05
申请人： David B. Lomet , Russell J. Green
发明人： David B. Lomet , Russell J. Green
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , Y10S707/99938
摘要： The concurrency-control mechanisms in a database-management system achieves high concurrency by using a lock-mode set larger than that conventionally employed for multi-granularity locking. In a system of key-valued locking in which locks on key-value ranges are acquired separately from the locks on the key values with which they are associated, the IX lock mode conventionally acquired on a range by update, insert, and delete operations is replaced with three separate lock modes respectively associated with those operations and invoked by them for range locking. In key-valued-locking systems in which ranges are locked commonly with the key-values associated with them, the mode set is further expanded so that each mode represents a different combination of range and key-value locks.
摘要翻译：数据库管理系统中的并发控制机制通过使用大于常规用于多粒度锁定的锁模式来实现高并发性。在键值锁定系统中，键值范围的锁与其关联的键值分开获取锁定，通常通过更新，插入和删除操作在范围上获取的IX锁定模式是替换为分别与这些操作相关联的三个单独的锁定模式，并由它们用于范围锁定。在键值锁定系统中，范围与其相关联的键值通常被锁定，模式集进一步扩展，使得每个模式表示范围和键值锁定的不同组合。

5. 发明授权

US07788285B2 Finer grain dependency tracking for database objects 有权
标题翻译：数据库对象的更细粒度依赖跟踪
公开(公告)号：US07788285B2
公开(公告)日：2010-08-31
申请号：US10846120
申请日：2004-05-14
申请人： Kumar Rajamani , Susan Kotsovolos , Russell J. Green , Rajagopalan Govindarajan , Jaebock Lee , Ho Chak Hung , Guhan Viswanathan
发明人： Kumar Rajamani , Susan Kotsovolos , Russell J. Green , Rajagopalan Govindarajan , Jaebock Lee , Ho Chak Hung , Guhan Viswanathan
IPC分类号： G06F7/00
CPC分类号： G06F17/30286
摘要： A method and apparatus for updating databases are disclosed. An update vector for an object is created for identifying updated attributes. A dependent object is identified and a dependency vector of the dependent object is compared with update vector to determine whether the dependent object depends on the updated attributes.
摘要翻译：公开了一种用于更新数据库的方法和装置。创建用于标识更新的属性的对象的更新向量。识别依赖对象，并将依赖对象的依赖向量与更新向量进行比较，以确定依赖对象是否依赖于更新的属性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式