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

1. 发明授权

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.
摘要翻译：关系数据库管理系统包括查询处理器，该查询处理器允许考虑替代的用户指定的访问路径，处理器将验证其并且并入其否则生成的查询执行计划中。查询处理器的优化器检索在绑定操作期间定义查询的访问路径的用户指定的数据。任何无效的访问路径参数都被处理器选择的值替换。

2. 发明授权

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.
摘要翻译：一种用于计算机实现的查询编译器的方法，装置和制品。在计算机中执行查询，该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。收到的查询至少包含一个变量。在执行时，为查询中的每个变量确定一个值。使用每个变量的确定值来估计滤波器因子。然后，使用估计的过滤因子确定查询的访问路径。

3. 发明授权

US6006220A Determining the optimal access path for a query at execution time using an actual value for each variable in a query for estimating a filter factor 失效
标题翻译：使用查询中每个变量的实际值来确定执行时查询的最优访问路径，以估计过滤因子
公开(公告)号：US6006220A
公开(公告)日：1999-12-21
申请号：US940245
申请日：1997-09-30
申请人： Donald J. Haderle , Jerry Mukai , Randy Mitchell Nakagawa , Hong Sang Tie
发明人： Donald J. Haderle , Jerry Mukai , Randy Mitchell Nakagawa , Hong Sang Tie
IPC分类号： G06F17/30
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.
摘要翻译：一种用于计算机实现的查询编译器的方法，装置和制品。在计算机中执行查询，该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。收到的查询至少包含一个变量。在执行时，为查询中的每个变量确定一个值。使用每个变量的确定值来估计滤波器因子。然后，使用估计的过滤因子确定查询的访问路径。

4. 发明授权

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信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

5. 发明授权

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信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

6. 发明授权

US5367675A Computer automated system and method for optimizing the processing of a query in a relational database system by merging subqueries with the query 失效
标题翻译：计算机自动化系统和方法，用于通过将查询与查询合并来优化关系数据库系统中查询的处理
公开(公告)号：US5367675A
公开(公告)日：1994-11-22
申请号：US807281
申请日：1991-12-13
申请人： Josephine M.-K. Cheng , Sheldon J. Finkelstein , Donald J. Haderle , Mir H. Pirahesh , Yun Wang
发明人： Josephine M.-K. Cheng , Sheldon J. Finkelstein , Donald J. Haderle , Mir H. Pirahesh , Yun Wang
IPC分类号： G06F17/30 , G06F15/403
CPC分类号： G06F17/30451 , G06F17/30466 , Y10S707/99932
摘要： An automated method is provided for optimizing a query for retrieving data from a relational database in a computer relational database management system. The method uses rules for identifying queries for which duplicates are a factor in retrieving the proper data from the database. The method then merges queries with table expressions, views and subqueries when possible without causing duplicates to be unnecessarily retrieved.
摘要翻译：提供了一种自动化方法，用于优化从计算机关系数据库管理系统中的关系数据库检索数据的查询。该方法使用用于识别查询的规则，重复项是从数据库检索正确数据的因素。然后，该方法可能会将查询与表表达式，视图和子查询合并，而不会导致不必要地检索重复。

7. 发明授权

US5241648A Hybrid technique for joining tables 失效
标题翻译：加工表混合技术
公开(公告)号：US5241648A
公开(公告)日：1993-08-31
申请号：US479523
申请日：1990-02-13
申请人： Josephine M. Cheng , Donald J. Haderle , Richard W. Hedges , Balakrishna R. Iyer , Chandrasekaran Mohan , Yun Wang
发明人： Josephine M. Cheng , Donald J. Haderle , Richard W. Hedges , Balakrishna R. Iyer , Chandrasekaran Mohan , Yun Wang
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99937
摘要： Results of a relational data base management system are joined in a process requiring, first, existence of an index on the join columns of the inner table, and, second, ordering on the join column of the first table. First, the index on the inner table's join column is scanned for rows of the inner table having join column values matching such values of rows in the outer table. This is done in a single pass through the outer table. Next, a temporary work table containing the identifiers of inner table rows having join column values matching those of the outer table is produced by concatenating the row identifiers to their matching outer table rows. Following this, the temporary work table is ordered by the identifiers. Last, the identifier list of inner table rows is used to retrieve the corresponding rows of the inner table. All predicates local to the inner table are applied to the retrieved rows, and those satisfying these local predicates are combined with their matching outer table rows and returned to the user.

8. 发明授权

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.

9. 发明授权

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.
摘要翻译：用于编码器的方法，装置和制品，用于在概念层级中对构件进行编码。在计算机中执行查询。该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。与一个或多个概念层次相关的数据库中的成员被编码。然后，基于编码来识别作为一个或多个所选概念的后代的概念层次之一的成员。

10. 发明授权

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位置。结束值对应于数据库被指定为只读（称为伪打开）的点。在恢复数据库期间，日志范围内的更新事务日志记录应用于存储在非易失性存储器中的数据库版本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式