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

1. 发明申请

US20080288495A1 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时间。这减少了运行查询的时间，并提高了共享使用工作文件的其他应用程序的性能。此外，尽管可以使用多个页面，但是当缓冲器大小在记录或行的页面内时，改进的性能是特别重要的。

2. 发明授权

US07792825B2 Fast select for fetch first N rows with order by 有权
标题翻译：快速选择提取前N行与顺序
公开(公告)号：US07792825B2
公开(公告)日：2010-09-07
申请号：US11222894
申请日：2005-09-08
申请人： Akiko Hoshikawa , Allan B. Lebovitz , Akira Shibamiya
发明人： Akiko Hoshikawa , Allan B. 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时间。这减少了运行查询的时间，并提高了共享使用工作文件的其他应用程序的性能。此外，尽管可以使用多个页面，但是当缓冲器大小在记录或行的页面内时，改进的性能是特别重要的。

3. 发明申请

US20070061280A1 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时间。这减少了运行查询的时间，并提高了共享使用工作文件的其他应用程序的性能。此外，尽管可以使用多个页面，但是当缓冲器大小在记录或行的页面内时，改进的性能是特别重要的。

4. 发明授权

US10089379B2 Method for sorting data 有权
公开(公告)号：US10089379B2
公开(公告)日：2018-10-02
申请号：US12193084
申请日：2008-08-18
申请人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
发明人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
IPC分类号： G06F17/30 , G06F7/36
摘要： A sequence of one or more input objects are sorted by identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects.

5. 发明申请

US20100042624A1 METHOD FOR SORTING DATA 审中-公开
标题翻译：分类数据的方法
公开(公告)号：US20100042624A1
公开(公告)日：2010-02-18
申请号：US12193084
申请日：2008-08-18
申请人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
发明人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30598 , G06F7/36 , G06F17/30607
摘要： Techniques for sorting a sequence of one or more input objects are provided. The techniques include identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects.
摘要翻译：提供了用于排序一个或多个输入对象的序列的技术。这些技术包括识别由一个或多个输入对象的序列呈现的属性，确定来自一个或多个输入对象的序列的每个输入对象是否呈现属性，将一个或多个输入对象中的每一个存储到缓冲器中，其中如果输入对象呈现所述属性并将输入对象存储在第二缓冲器中，如果不显示所述属性，则将输入对象存储在第一缓冲器中，对每个缓冲器中的所述一个或多个输入对象中的每一个进行排序，或更多的输入对象在一个或多个输入对象的序列中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式