利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

22 条记录 (耗时 0.027 秒)

    Prefetch performance of index access by look-ahead prefetch
    3.
    发明申请
    Prefetch performance of index access by look-ahead prefetch 审中-公开
    通过预先预取预取索引访问的性能

    公开(公告)号：US20060212658A1

    公开(公告)日：2006-09-21

    申请号：US11083289

    申请日：2005-03-18

    申请人： Namik Hrle ,  You-Chin Fuh ,  Yoichi Tsuji ,  Li Xia

    发明人： Namik Hrle ,  You-Chin Fuh ,  Yoichi Tsuji ,  Li Xia

    IPC分类号： G06F12/00

    CPC分类号： G06F12/0862

    摘要： Embodiments of the present invention provide a “look-ahead” form prefetch. Look-ahead prefetch may utilize a look-ahead queue to prefetch multiple pages asynchronously. The look-ahead queue may hold a plurality of search keys that are related to a transaction. When accessing a table, an index manager may retrieve the table's index and scan the index based on the search keys from the look-ahead queue to find the RIDs in the table that match the search keys. The index manager may then accumulate these RIDs into a prefetch list. A prefetch manager may read the prefetch list, determine locations for the pages of the table that contain the records identified by the RIDs, and dispatch prefetch tasks to the appropriate storage device for these pages.

    摘要翻译： 本发明的实施例提供了一种“先行”形式预取。 先行预取可以利用预先队列来异步预取多个页面。 先行队列可以保存与事务相关的多个搜索关键字。 当访问表时，索引管理器可以检索表的索引并基于来自先行队列的搜索键来扫描索引，以找到表中与搜索关键字匹配的RID。 索引管理器然后可以将这些RID累加到预取列表中。 预取管理器可以读取预取列表，确定包含由RID标识的记录的表的页面的位置，以及将这些页面的预取任务分派到适当的存储设备。

    Dynamic statement processing in database systems
    4.
    发明申请
    Dynamic statement processing in database systems 审中-公开
    数据库系统中的动态语句处理

    公开(公告)号：US20070219973A1

    公开(公告)日：2007-09-20

    申请号：US11377328

    申请日：2006-03-15

    申请人： Baoqiu Cui ,  You-Chin Fuh ,  Jeff Sullivan ,  Yoichi Tsuji ,  Li Xia

    发明人： Baoqiu Cui ,  You-Chin Fuh ,  Jeff Sullivan ,  Yoichi Tsuji ,  Li Xia

    IPC分类号： G06F17/30

    CPC分类号： G06F16/2435

    摘要： A method, computer program product, and system for processing dynamic statements in a database system are provided. The method, computer program product, and system provide for calculating a first set of characteristics associated with a dynamic statement when the dynamic statement matches one of a plurality of dynamic statements previously processed by the system, comparing the first set of characteristics associated with the dynamic statement to a second set of characteristics associated with one of one or more access paths generated for the one previously processed dynamic statement, and utilizing the one access path to execute the dynamic statement when the comparison of the first set of characteristics to the second set of characteristics satisfies one or more predetermined criteria.

    摘要翻译： 提供了一种用于处理数据库系统中的动态语句的方法，计算机程序产品和系统。 所述方法，计算机程序产品和系统提供用于当动态语句与先前由系统处理的多个动态语句中的一个动态语句匹配时计算与动态语句相关联的第一组特征，比较与动态语句相关联的第一组特征 语句到与针对一个先前处理的动态语句生成的一个或多个访问路径之一相关联的第二组特征，以及当第一组特征与第二组的特征比较时，利用一个访问路径来执行动态语句 特性满足一个或多个预定标准。

    Selection of optimal plans for FIRST-N-ROW queries
    5.
    发明申请
    Selection of optimal plans for FIRST-N-ROW queries 审中-公开
    选择FIRST-N-ROW查询的最优计划

    公开(公告)号：US20060167845A1

    公开(公告)日：2006-07-27

    申请号：US11042525

    申请日：2005-01-25

    申请人： Li Xia ,  You-Chin Fuh ,  Yoichi Tsuji

    发明人： Li Xia ,  You-Chin Fuh ,  Yoichi Tsuji

    IPC分类号： G06F17/30

    CPC分类号： G06F16/24542

    摘要： A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization comprises determining an optimal access plan for a first-N-rows query by evaluating a cost of fetching N rows, relative to a total number of rows R in a final results set. Specifically, for a pipelined access plan, this comprises calculating how many rows need to be fetched from each table in the pipelined plan in order to obtain the first N rows from the final results set.

    摘要翻译： 一种用于优化计算机系统中的查询的方法，装置和制品，其中所述查询由所述计算机系统执行以从存储在所述计算机系统上的数据库中检索数据。 优化包括通过评估获取N行的成本相对于最终结果集中的总行数R来确定用于第一N行查询的最优访问计划。 具体来说，对于流水线访问计划，这包括计算在流水线计划中从每个表中获取多少行，以便从最终结果集中获取前N行。

    Efficient evaluation of index screening predicates
    9.
    发明申请
    Efficient evaluation of index screening predicates 失效
    指标筛选谓词的有效评估

    公开(公告)号：US20070011143A1

    公开(公告)日：2007-01-11

    申请号：US11176601

    申请日：2005-07-06

    申请人： You-Chin Fuh ,  Ping Wang ,  Li Xia ,  Binghua Zhen

    发明人： You-Chin Fuh ,  Ping Wang ,  Li Xia ,  Binghua Zhen

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864 ,  G06F17/30657 ,  Y10S707/99933

    摘要： Techniques are provided for processing a query using an index. It is determined whether a number of consecutive keys that evaluate to a false-positive when applying a screening predicate in the query exceeds a false-positive predefined value. One or more keys in the index are skipped in response to determining that the number of consecutive keys exceeds the false-positive predefined value.

    摘要翻译： 提供了使用索引处理查询的技术。 确定在查询中应用筛选谓词时评估为假阳性的多个连续密钥是否超过假阳性预定义值。 响应于确定连续键的数量超过假阳性预定义值，跳过索引中的一个或多个键。

    System and article of manufacture for efficient evaluation of index screening predicates
    10.
    发明授权
    System and article of manufacture for efficient evaluation of index screening predicates 失效
    系统和制造品，用于有效评估指标筛选谓词

    公开(公告)号：US07979440B2

    公开(公告)日：2011-07-12

    申请号：US12276104

    申请日：2008-11-21

    申请人： You-Chin Fuh ,  Ping Wang ,  Li Xia ,  Binghua Zhen

    发明人： You-Chin Fuh ,  Ping Wang ,  Li Xia ,  Binghua Zhen

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30864 ,  G06F17/30657 ,  Y10S707/99933

    摘要： Techniques are provided for processing a query using an index. It is determined whether a number of consecutive keys that evaluate to a false-positive when applying a screening predicate in the query exceeds a false-positive predefined value. One or more keys in the index are skipped in response to determining that the number of consecutive keys exceeds the false-positive predefined value.

    摘要翻译： 提供了使用索引处理查询的技术。 确定在查询中应用筛选谓词时评估为假阳性的多个连续密钥是否超过假阳性预定义值。 响应于确定连续键的数量超过假阳性预定义值，跳过索引中的一个或多个键。