利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

19 条记录 (耗时 0.026 秒)

    Adaptive dataset growth
    1.
    发明申请
    Adaptive dataset growth 有权
    自适应数据集增长

    公开(公告)号：US20050102331A1

    公开(公告)日：2005-05-12

    申请号：US10703998

    申请日：2003-11-06

    申请人： Michael Bracey ,  John Campbell ,  Julie Chen ,  Akira Shibamiya ,  Bryan Smith ,  James Teng

    发明人： Michael Bracey ,  John Campbell ,  Julie Chen ,  Akira Shibamiya ,  Bryan Smith ,  James Teng

    IPC分类号： G06F7/00 ,  G06F12/00 ,  G06F12/02 ,  G06F17/30

    CPC分类号： G06F12/023 ,  Y10S707/99931 ,  Y10S707/99956

    摘要： A method and article of manufacture, implementing the method, allocates space for a dataset. The dataset has an initial area and zero or more additional allocated areas to provide space for storing the dataset. The size of a new additional area is determined. The new additional area is associated with a new area number, and the size of the new additional area is based on the new area number. Additional space for the dataset is allocated based on the size of the new additional area. Alternately, an apparatus stores a dataset. A computer has a data storage device connected thereto. The data storage device has a plurality of areas for storing a dataset. The plurality of areas comprises an initial area having an initial area size and a plurality of additional areas having an additional area size, wherein the additional area size varies. In one embodiment, the additional area size monotonically increases.

    摘要翻译： 一种方法和制造方法，实现该方法，为数据集分配空间。 数据集具有初始区域和零个或多个额外的分配区域，以提供用于存储数据集的空间。 确定新的附加区域的大小。 新的附加区域与新的区域号相关联，新的附加区域的大小基于新的区域号。 基于新附加区域的大小分配数据集的附加空间。 或者，设备存储数据集。 计算机具有连接到其上的数据存储装置。 数据存储装置具有用于存储数据集的多个区域。 多个区域包括具有初始区域尺寸的初始区域和具有附加区域尺寸的多个附加区域，其中附加面积大小变化。 在一个实施例中，附加面积大小单调增加。

    Method, system, and program for optimizing database query execution
    3.
    发明授权
    Method, system, and program for optimizing database query execution 有权
    用于优化数据库查询执行的方法，系统和程序

    公开(公告)号：US07146365B2

    公开(公告)日：2006-12-05

    申请号：US10353138

    申请日：2003-01-27

    申请人： Terry Dennis Allen ,  Paramesh S. Desai ,  Akira Shibamiya ,  Hong Sang Tie ,  Annie S. Tsang

    发明人： Terry Dennis Allen ,  Paramesh S. Desai ,  Akira Shibamiya ,  Hong Sang Tie ,  Annie S. Tsang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30336 ,  Y10S707/99932 ,  Y10S707/99938

    摘要： Disclosed is a method, system, and program for database query execution. A range of data pages is assigned to each of multiple parallel tasks. For each of the multiple parallel tasks, the range of data pages is mapped to one or more physical partitions, and a data partitioned secondary index partition associated with each of the one or more physical partitions is identified. Each of the multiple parallel tasks is executed to process the database query against the assigned range of data pages using the one or more data partitioned secondary index partitions.

    摘要翻译： 公开了一种用于数据库查询执行的方法，系统和程序。 为多个并行任务分配一系列数据页。 对于多个并行任务中的每一个，将数据页面的范围映射到一个或多个物理分区，并且识别与一个或多个物理分区中的每一个相关联的数据分区次级索引分区。 执行多个并行任务中的每一个以使用一个或多个数据分区的次级索引分区来处理针对分配的数据页面范围的数据库查询。

    Insert performance on a multi-system transaction environment
    4.
    发明授权
    Insert performance on a multi-system transaction environment 失效
    在多系统事务环境中插入性能

    公开(公告)号：US06334134B1

    公开(公告)日：2001-12-25

    申请号：US09135834

    申请日：1998-08-18

    申请人： Donald James Haderle ,  Akira Shibamiya ,  James Zu-Chia Tseng ,  Julie Ann Watts

    发明人： Donald James Haderle ,  Akira Shibamiya ,  James Zu-Chia Tseng ,  Julie Ann Watts

    IPC分类号： G06F1200

    CPC分类号： G06F17/30595 ,  Y10S707/99956

    摘要： A method, apparatus, and article of manufacture for a computer implemented insert system. Data is stored in a database stored on a data storage device connected to a plurality of computers. At least one look-aside space map is allocated to each of the computers. At each computer, when data is to be inserted into the database, a look-aside space map allocated to that computer is identified, and a free data page is located using the identified look-aside space map.

    摘要翻译： 一种用于计算机实现的插入系统的方法，装置和制品。 数据存储在存储在连接到多个计算机的数据存储设备上的数据库中。 至少一个空白地图被分配给每个计算机。 在每个计算机上，当数据被插入到数据库中时，识别分配给该计算机的前视空间图，并且使用所识别的旁观空间图来定位空闲数据页。

    Query optimization through the use of multi-column statistics to avoid the problems of column correlation
    6.
    发明授权
    Query optimization through the use of multi-column statistics to avoid the problems of column correlation 失效
    查询优化通过使用多列统计来避免列关联的问题

    公开(公告)号：US5995957A

    公开(公告)日：1999-11-30

    申请号：US808521

    申请日：1997-02-28

    申请人： Thomas Abel Beavin ,  Balakrishna Raghavendra Iyer ,  Akira Shibamiya ,  Hong Sang Tie ,  Min Wang

    发明人： Thomas Abel Beavin ,  Balakrishna Raghavendra Iyer ,  Akira Shibamiya ,  Hong Sang Tie ,  Min Wang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30469 ,  Y10S707/99932

    摘要： The system, method, and program of this invention collects multi-column statistics, by a database management system, to reflect a relationship among multiple columns of a table in a relational database. These statistics are stored in the system catalog, and are used during query optimization to obtain an estimate of the number of qualifying rows when a query has predicates on multiple columns of a table.A multi-column linear quantile statistic is collected by dividing the data of multiple columns into sub-ranges where each sub-range has approximately an even distribution of data, and determining a frequency and cardinality of each sub-range. A multi-column polygonal quantile statistic is collected by dividing the data of multiple columns into sub-spaces where each sub-space contains approximately the same number of tuples, and determining a frequency and cardinality of each sub-space.The system catalog is accessed for the stored multi-column linear quantile statistic for a query having a single range predicate and at least one equal predicate to determine the selectivity value for the predicates of the query. The system catalog is accessed for the stored multi-column polygonal quantile statistic for a query having more than one range predicate. These statistics are used in various ways to determine the selectivity value for the predicates of the query.

    摘要翻译： 本发明的系统，方法和程序通过数据库管理系统收集多列统计，以反映关系数据库中的表的多个列之间的关系。 这些统计信息存储在系统目录中，并且在查询优化期间使用，以便在查询在表的多个列上进行谓词时获取合格行数的估计。 通过将多列的数据划分成子范围，其中每个子范围具有大致均匀的数据分布，并且确定每个子范围的频率和基数，来收集多列线性分位数统计量。 通过将多列的数据划分成子空间，其中每个子空间包含大致相同数量的元组，并且确定每个子空间的频率和基数，来收集多列多边形分位数统计量。 对于具有单一范围谓词和至少一个相等谓词的查询，为存储的多列线性分位数统计量访问系统目录，以确定查询谓词的选择性值。 对于具有多个范围谓词的查询，为存储的多列多边形分位数统计量访问系统目录。 这些统计信息以各种方式用于确定查询谓词的选择性值。

    FAST SELECT FOR FETCH FIRST N ROWS WITH ORDER BY
    9.
    发明申请
    FAST SELECT FOR FETCH FIRST N ROWS WITH ORDER BY 审中-公开
    快速选择用于订购第一个N ROWS WITH ORDER BY

    公开(公告)号：US20080288495A1

    公开(公告)日：2008-11-20

    申请号：US12185102

    申请日：2008-08-03

    申请人： Akiko Hoshikawa ,  Allan B. Lebovitz ,  Akira Shibamiya

    发明人： Akiko Hoshikawa ,  Allan B. Lebovitz ,  Akira Shibamiya

    IPC分类号： G06F7/06 ,  G06F17/30

    CPC分类号： G06F16/24553

    摘要： Fetching an ordered first N rows of a table, includes: reading a row in the table; determining that the read row qualifies as the first N rows of the table for rows read so far, and storing data of the read row; and determining an order of data of qualifying rows and storing the order. Only data in rows that qualify to be among the first N rows are ordered and stored. This provides a significantly more efficient processing. It eliminates tournament tree sorts, corresponding work file read and write I/O's, and associated CPU time. This reduces the time for the running of a query and improves the performance of other applications sharing the use of work files. Further, the improved performance is particular significant when the buffer sizes are within a page of records or rows, although multiple pages may be used.

    摘要翻译： 获取表中排序的前N行包括：读取表中的一行; 确定所读取的行被认为是目前为止读取的行的表的前N行，并且存储读取行的数据; 并确定合格行的数据顺序并存储顺序。 只有有资格成为前N行的行中的数据才会被排序和存储。 这提供了显着更有效的处理。 它消除了比赛树种类，对应的工作文件读写I / O和相关的CPU时间。 这减少了运行查询的时间，并提高了共享使用工作文件的其他应用程序的性能。 此外，尽管可以使用多个页面，但是当缓冲器大小在记录或行的页面内时，改进的性能是特别重要的。

    Fast select for fetch first N rows with order by
    10.
    发明申请
    Fast select for fetch first N rows with order by 有权
    快速选择提取前N行与顺序

    公开(公告)号：US20070061280A1

    公开(公告)日：2007-03-15

    申请号：US11222894

    申请日：2005-09-08

    申请人： Akiko Hoshikawa ,  Allan Lebovitz ,  Akira Shibamiya

    发明人： Akiko Hoshikawa ,  Allan Lebovitz ,  Akira Shibamiya

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30483

    摘要： A method for fetching an ordered first N rows of a table, includes: reading a row in the table; determining that the read row qualifies as the first N rows of the table for rows read so far, and storing data of the read row; and determining an order of data of qualifying rows and storing the order. Only data in rows that qualify to be among the first N rows are ordered and stored. This provides a significantly more efficient processing. It eliminates tournament tree sorts, corresponding work file read and write I/O's, and associated CPU time. This reduces the time for the running of a query and improves the performance of other applications sharing the use of work files. Further, the improved performance is particular significant when the buffer sizes are within a page of records or rows, although multiple pages may be used.

    摘要翻译： 一种用于获取表的有序前N行的方法，包括：读取表中的一行; 确定所读取的行被认为是目前为止读取的行的表的前N行，并且存储读取行的数据; 并确定合格行的数据顺序并存储顺序。 只有有资格成为前N行的行中的数据才会被排序和存储。 这提供了显着更有效的处理。 它消除了比赛树种类，对应的工作文件读写I / O和相关的CPU时间。 这减少了运行查询的时间，并提高了共享使用工作文件的其他应用程序的性能。 此外，尽管可以使用多个页面，但是当缓冲器大小在记录或行的页面内时，改进的性能是特别重要的。