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

1. 发明授权

US06219660B1 Access path selection for SQL with variables in a RDBMS 有权
标题翻译：使用RDBMS中的变量进行SQL的访问路径选择
公开(公告)号：US06219660B1
公开(公告)日：2001-04-17
申请号：US09392151
申请日：1999-09-08
申请人： Donald J. Haderle , Jerry Mukai , Randy Mitchell Nakagawa , Hong Sang Tie
发明人： Donald J. Haderle , Jerry Mukai , Randy Mitchell Nakagawa , Hong Sang Tie
IPC分类号： G06F1730
CPC分类号： G06F17/30433 , G06F17/30463 , G06F17/30469 , G06F17/30474 , Y10S707/956 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99945
摘要： A method, apparatus, and article of manufacture for a computer implemented query compiler. A query is executed in a computer, the query being performed by the computer to retrieve data from a database stored on a data storage device connected to the computer. The query is received containing at least one variable. At execution time, a value is determined for each variable in the query. A filter factor is estimated using the determined value for each variable. Then, an access path is determined for the query using the estimated filter factor.
摘要翻译：一种用于计算机实现的查询编译器的方法，装置和制品。在计算机中执行查询，该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。收到的查询至少包含一个变量。在执行时，为查询中的每个变量确定一个值。使用每个变量的确定值来估计滤波器因子。然后，使用估计的过滤因子确定查询的访问路径。

2. 发明授权

US5748952A System and method for avoiding complete index tree traversals in sequential and almost sequential index probes 失效
标题翻译：用于避免在顺序和几乎顺序的索引探针中完整的索引树遍历的系统和方法
公开(公告)号：US5748952A
公开(公告)日：1998-05-05
申请号：US438558
申请日：1995-05-10
申请人： Atul Chadha , Donald J. Haderle , Akira Shibamiya , Robert W. Lyle , Steven J. Watts
发明人： Atul Chadha , Donald J. Haderle , Akira Shibamiya , Robert W. Lyle , Steven J. Watts
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99953
摘要： The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.
摘要翻译：本发明提供一种用于利用顺序或近序列索引探针中的密钥接近以避免完整的索引树遍历的系统和方法。来自三个页面（LAST，PARENT和NEXT）的页面信息存储在索引后备缓冲区中的单独的信息字段中。 LAST信息字段包含在读取键或插入键操作期间在索引探测期间访问的最新叶子页面的信息，PARENT信息字段包含在LAST信息字段中描述的最近访问的叶子页面的父页面上的信息，并且NEXT信息字段包含在获取下一个键或删除键操作期间访问的最新叶子页面的信息。在随后的索引探针中，顺序地分析LAST，NEXT和PARENT信息字段以确定搜索关键字是否包含在由LAST或NEXT信息字段描述的叶子页内，或者如果搜索关键字包含在叶子页之一内由PARENT信息字段描述的父页指向。如果LAST，NEXT或PARENT信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

3. 发明授权

US5940819A User specification of query access paths in a relational database management system 失效
标题翻译：关系数据库管理系统中查询访问路径的用户规范
公开(公告)号：US5940819A
公开(公告)日：1999-08-17
申请号：US920531
申请日：1997-08-29
申请人： Thomas Abel Beavin , Donald J. Haderle , Akira Shibamiya , Hong Sang Tie , Yun Wang
发明人： Thomas Abel Beavin , Donald J. Haderle , Akira Shibamiya , Hong Sang Tie , Yun Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30306 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942
摘要： A relational data base management system includes a query processor that permits consideration of alternative user-specified access paths, which the processor will validate and incorporate into the query execution plan it otherwise generates. The optimizer of the query processor retrieves user-specified data that defines an access path for a query during bind operations. Any access path parameters that are invalid are replaced with processor-selected values.
摘要翻译：关系数据库管理系统包括查询处理器，该查询处理器允许考虑替代的用户指定的访问路径，处理器将验证其并且并入其否则生成的查询执行计划中。查询处理器的优化器检索在绑定操作期间定义查询的访问路径的用户指定的数据。任何无效的访问路径参数都被处理器选择的值替换。

4. 发明授权

US5133068A Complied objective referential constraints in a relational database having dual chain relationship descriptors linked in data record tables 失效
标题翻译：具有链接在数据记录表中的双链关系描述符的关系数据库中的合并目标参考约束
公开(公告)号：US5133068A
公开(公告)日：1992-07-21
申请号：US754227
申请日：1991-08-28
申请人： Richard A. Crus , Michael J. Dockter , Robert W. Engles , Donald J. Haderle
发明人： Richard A. Crus , Michael J. Dockter , Robert W. Engles , Donald J. Haderle
IPC分类号： G06F12/00 , G06F7/00 , G06F17/30
CPC分类号： G06F17/30371
摘要： An implementation of referential integrity in which descriptions of referential constraints are compiled into meta-data descriptions of the constraint rules and specifications. The meta-data descriptions of the constraints are stored in the form of objects called relationship descriptors. Each relationship descriptor contains a complete description of a referential constraint, either directly or by means of pointers to other objects such as record and index descriptors which contain information comprised in the constraint's specification. The relationship descriptors are linked into two types of chains by symbolic pointers. One type of relationship descriptor chain connects all relationship descriptors which have a common parent table. The other type of relationship descriptor chain connects relationship descriptors with common dependent tables. Both types of chains are anchored in respective fields in the tables' record descriptors. The use of meta-data descriptors facilitates both ready modification of the constraints, and speedy enforcement of the constraints by a single, shared procedure which may be embedded in the data base manager.

5. 发明授权

US5940822A Encoding method of members related by multiple concept or group hierarchies and identification of members in a corpus or a database that are descendants of one or more selected concepts or groups from the encoding 失效
标题翻译：通过多个概念或组层次相关的成员的编码方法以及作为来自编码的一个或多个所选概念或组的后代的语料库或数据库中的成员的标识
公开(公告)号：US5940822A
公开(公告)日：1999-08-17
申请号：US921197
申请日：1997-08-29
申请人： Donald J. Haderle , Balakrishna Raghavendra Iyer
发明人： Donald J. Haderle , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942
摘要： A method, apparatus, and article of manufacture for an encoder for encoding members in a concept hierarchy. A query is executed in a computer. The query is performed by the computer to retrieve data from a database stored on a data storage device connected to the computer. Members in the database that are related by one or more concept hierarchies are encoded. Then, members in one of the concept hierarchies that are descendants of one or more selected concepts are identified based on the encoding.
摘要翻译：用于编码器的方法，装置和制品，用于在概念层级中对构件进行编码。在计算机中执行查询。该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。与一个或多个概念层次相关的数据库中的成员被编码。然后，基于编码来识别作为一个或多个所选概念的后代的概念层次之一的成员。

6. 发明授权

US5845274A Computer program product for avoiding complete index tree traversals in sequential and almost sequential index probes 失效
标题翻译：用于避免在顺序和几乎顺序的索引探针中完整的索引树遍历的计算机程序产品
公开(公告)号：US5845274A
公开(公告)日：1998-12-01
申请号：US471509
申请日：1995-06-06
申请人： Atul Chadha , Donald J. Haderle , Akira Shibamiya , Robert W. Lyle , Steven J. Watts
发明人： Atul Chadha , Donald J. Haderle , Akira Shibamiya , Robert W. Lyle , Steven J. Watts
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99953
摘要： The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.
摘要翻译：本发明提供一种用于利用顺序或近序列索引探针中的密钥接近以避免完整的索引树遍历的系统和方法。来自三个页面（LAST，PARENT和NEXT）的页面信息存储在索引后备缓冲区中的单独的信息字段中。 LAST信息字段包含在读取键或插入键操作期间在索引探测期间访问的最新叶子页面的信息，PARENT信息字段包含在LAST信息字段中描述的最近访问的叶子页面的父页面上的信息，并且NEXT信息字段包含在获取下一个键或删除键操作期间访问的最新叶子页面的信息。在随后的索引探针中，顺序地分析LAST，NEXT和PARENT信息字段以确定搜索关键字是否包含在由LAST或NEXT信息字段描述的叶子页内，或者如果搜索关键字包含在叶子页之一内由PARENT信息字段描述的父页指向。如果LAST，NEXT或PARENT信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

7. 发明授权

US5581750A System and method for improving data recovery performance 失效
标题翻译：提高数据恢复性能的系统和方法
公开(公告)号：US5581750A
公开(公告)日：1996-12-03
申请号：US31791
申请日：1993-03-15
申请人： Donald J. Haderle , James Z. Teng
发明人： Donald J. Haderle , James Z. Teng
IPC分类号： G06F11/14 , G06F17/30
CPC分类号： G06F11/1471 , Y10S707/99953
摘要： A system and method are provided for recovering a computerized database. During transaction processing of a database, at least one log range is tracked comprising update transaction log records. The log range has a begin value and an end value. The begin value corresponds to a log RBA location of a first access of the database by an updating transaction. The end value corresponds to a log RBA location at a commit or abort of a last updating transaction. The end value corresponds to a point when the database is designated as being read only (called pseudo open). During recovery of the database, the update transaction log records in the log range are applied to a version of the database stored in non-volatile memory.
摘要翻译：提供了一种用于恢复计算机化数据库的系统和方法。在数据库的事务处理期间，跟踪包括更新事务日志记录的至少一个日志范围。日志范围具有开始值和结束值。开始值对应于更新事务对数据库的第一次访问的日志RBA位置。结束值对应于上次更新事务的提交或中止时的日志RBA位置。结束值对应于数据库被指定为只读（称为伪打开）的点。在恢复数据库期间，日志范围内的更新事务日志记录应用于存储在非易失性存储器中的数据库版本。

8. 发明授权

US4961134A Method for minimizing locking and reading in a segmented storage space 失效
标题翻译：在分段存储空间中最小化锁定和读取的方法
公开(公告)号：US4961134A
公开(公告)日：1990-10-02
申请号：US219514
申请日：1988-07-15
申请人： Richard A. Crus , Donald J. Haderle , James Z. Teng
发明人： Richard A. Crus , Donald J. Haderle , James Z. Teng
IPC分类号： G06F7/22 , G06F12/00 , G06F12/02
CPC分类号： G06F17/30339 , G06F12/0238 , Y10S707/99938 , Y10S707/99953
摘要： A page-accessing method in a segmented tablespace 10 which eliminates unnecessary reading and locking. The tablespace comprises data pages 18 grouped into identically-sized segments 16, each segment storing data for a single table. A status indicator 26 for each data page of a segment is kept in a separate segment control block 20 stored on a space map page 14. Five data page status indicator values are maintained: (1) FULL (26a) - entirely full of current data; (2) PARTIALLY FULL (26b) - partially full of current data; (3) UNFORMATTED (26c) - empty; contains no data; (4) MASS DELETE (26d) - contains only obsolete data because of an unqualified deletion (mass delete) of data; or (5) QUALIFIED DELETE (26e) - contains only obsolete data because of a qualified deletion of data.When scanning over the data in a segment, UNFORMATTED and MASS DELETE pages are skipped. QUALIFIED DELETE pages are locked, and then skipped if they still contain only obsolete data when the lock is obtained. When inserting data into pages, preliminary reads of UNFORMATTED and MASS DELETE pages are avoided. Data integrity is ensured by placing integrity checking bits at the beginning and end of each page. If the bits contain the same value, the page's data integrity is intact. If the bits are different, the page's previous consistent contents are recovered from the log records.

9. 发明授权

US4933848A Method for enforcing referential constraints in a database management system 失效
标题翻译：在数据库管理系统中执行参照约束的方法
公开(公告)号：US4933848A
公开(公告)日：1990-06-12
申请号：US219512
申请日：1988-07-15
申请人： Donald J. Haderle , Julie A. Watts
发明人： Donald J. Haderle , Julie A. Watts
IPC分类号： G06F12/00 , G06F9/00 , G06F17/30
CPC分类号： G06F17/30371 , Y10S707/99952
摘要： A method is disclosed for deferring enforcement of referential constraints in large-scale data base operations such as the population or loading of relational tables 10, 12. First, the new rows are loaded in a Data Load phase 24 into the tables, and information on the new rows and their constraints is extracted and sorted 26 into a sorted key data set 68. Any primary indexes 22 required for constraint checking are then updated 28 using the sorted key data set. The new rows are then checked 70 for constraint violations, such violations are rectified 72 to restore the table's referential integrity, and a deletion data set 80 is produced. The deletion data set is merged and sorted 86 with row information 53 stored during loading, and the result is used to copy 88 the new rows violating referential constraints to a separate discard data set 48 where they can be corrected and reloaded into the table. Finally, an error summary report 36 is generated for use in correcting the discard data set.

10. 发明授权

US06289355B1 Fast log apply 失效
标题翻译：快速登录申请
公开(公告)号：US06289355B1
公开(公告)日：2001-09-11
申请号：US09153998
申请日：1998-09-16
申请人： Donald J. Haderle , Thomas Majithia
发明人： Donald J. Haderle , Thomas Majithia
IPC分类号： H02H305
CPC分类号： G06F11/1471 , G06F2201/80 , Y10S707/99931 , Y10S707/99937
摘要： The present invention discloses a technique for restoring a database in a computer. In accordance with the present invention, the database contains objects and is stored on a data storage device connected to the computer. After a system failure, a log file is read. The log file contains one or more modifications to the database objects. Each modification has an associated data page and time stamp or sequence number. The modifications are sorted by at least one predefined sorting key value. The sorted modifications are then grouped by database object. The sorted modifications are applied to each database object in parallel.
摘要翻译：本发明公开了一种在计算机中恢复数据库的技术。根据本发明，数据库包含对象并存储在连接到计算机的数据存储设备上。系统故障后，会读取一个日志文件。日志文件包含对数据库对象的一个或多个修改。每个修改都有相关的数据页和时间戳或序列号。修改通过至少一个预定义的排序键值进行排序。然后按数据库对象对排序的修改进行分组。排序的修改并行应用于每个数据库对象。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式