会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • FAST SELECT FOR FETCH FIRST N ROWS WITH ORDER BY
    • 快速选择用于订购第一个N ROWS WITH ORDER BY
    • US20080288495A1
    • 2008-11-20
    • US12185102
    • 2008-08-03
    • Akiko HoshikawaAllan B. LebovitzAkira Shibamiya
    • Akiko HoshikawaAllan B. LebovitzAkira Shibamiya
    • G06F7/06G06F17/30
    • 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时间。 这减少了运行查询的时间,并提高了共享使用工作文件的其他应用程序的性能。 此外,尽管可以使用多个页面,但是当缓冲器大小在记录或行的页面内时,改进的性能是特别重要的。
    • 6. 发明授权
    • Fast select for fetch first N rows with order by
    • 快速选择提取前N行与顺序
    • US07792825B2
    • 2010-09-07
    • US11222894
    • 2005-09-08
    • Akiko HoshikawaAllan B. LebovitzAkira Shibamiya
    • Akiko HoshikawaAllan B. LebovitzAkira Shibamiya
    • G06F17/30
    • 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时间。 这减少了运行查询的时间,并提高了共享使用工作文件的其他应用程序的性能。 此外,尽管可以使用多个页面,但是当缓冲器大小在记录或行的页面内时,改进的性能是特别重要的。