METHOD AND APPARATUS FOR PERFORMING A DEPTH-FIRST JOIN IN A DATABASE
    1.
    发明申请
    METHOD AND APPARATUS FOR PERFORMING A DEPTH-FIRST JOIN IN A DATABASE 有权
    用于在数据库中执行深度访问的方法和设备

    公开(公告)号:US20080027906A1

    公开(公告)日:2008-01-31

    申请号:US11828221

    申请日:2007-07-25

    申请人: Harry Kao

    发明人: Harry Kao

    IPC分类号: G06F7/06 G06F17/30

    CPC分类号: G06F17/30498

    摘要: In a database, inner joins are performed in a depth-first manner. Depth-first joins differ from breadth-first joins in that rows are examined a page at a time during execution from every table that is participating in the query. Thus, the depth-first join is a constant-space operation with respect to the size of the data set, with the storage required approximately equal to the sum of the sizes of a page from each table.

    摘要翻译: 在数据库中,以深度优先的方式执行内连接。 深度优先连接与宽度优先联接不同,因为在执行期间,每个表中的行都会在参与查询的每个表中检查一个页面。 因此,深度优先连接是相对于数据集的大小的恒定空间操作,其中所需的存储大约等于每个表的页面大小之和。

    Data store with lock-free stateless paging capability
    2.
    发明授权
    Data store with lock-free stateless paging capability 有权
    数据存储,无锁无状态寻呼功能

    公开(公告)号:US08996486B2

    公开(公告)日:2015-03-31

    申请号:US11301985

    申请日:2005-12-12

    IPC分类号: G06F7/00 G06F17/30

    摘要: Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.

    摘要翻译: 公开了一种用于限制响应于查询的数据存储返回的结果的数量的方法和装置。 在接收到初始查询之后,数据存储返回包含符合查询条件的数据存储库内数据项子集的结果页。 数据存储还提供指示数据项集的范围的标记。 如果接收到请求满足相同查询条件并且包括标记的附加结果的后续查询,则数据存储返回包括与初始子集不相交的数据项的子集的结果页面,并提供更新的标记 这表明初始和后续子集的联合程度。 如果从数据存储还需要进一步的结果,则可以提交包含更新的标记的附加查询。

    DATA STORAGE WITH LOCK-FREE STATELESS PAGING CAPABILITY
    3.
    发明申请
    DATA STORAGE WITH LOCK-FREE STATELESS PAGING CAPABILITY 审中-公开
    数据存储具有无锁定无缝封装能力

    公开(公告)号:US20150178399A1

    公开(公告)日:2015-06-25

    申请号:US14639009

    申请日:2015-03-04

    IPC分类号: G06F17/30

    摘要: Disclosed are a method and apparatus for limiting the number of results returned by a store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.

    摘要翻译: 公开了一种用于限制响应于查询的商店返回的结果的数量的方法和装置。 在接收到初始查询之后,数据存储返回包含符合查询条件的数据存储库内数据项子集的结果页。 数据存储还提供指示数据项集的范围的标记。 如果接收到请求满足相同查询条件并且包括标记的附加结果的后续查询,则数据存储返回包括与初始子集不相交的数据项的子集的结果页面,并提供更新的标记 这表明初始和后续子集的联合程度。 如果从数据存储还需要进一步的结果,则可以提交包含更新的标记的附加查询。

    Method and apparatus for performing a depth-first join in a database
    4.
    发明授权
    Method and apparatus for performing a depth-first join in a database 有权
    用于在数据库中执行深度优先连接的方法和装置

    公开(公告)号:US07962476B2

    公开(公告)日:2011-06-14

    申请号:US11828221

    申请日:2007-07-25

    申请人: Harry Kao

    发明人: Harry Kao

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30498

    摘要: In a database, inner joins are performed in a depth-first manner. Depth-first joins differ from breadth-first joins in that rows are examined a page at a time during execution from every table that is participating in the query. Thus, the depth-first join is a constant-space operation with respect to the size of the data set, with the storage required approximately equal to the sum of the sizes of a page from each table.

    摘要翻译: 在数据库中,以深度优先的方式执行内连接。 深度优先连接与宽度优先联接不同,因为在执行期间,每个表中的行都会在参与查询的每个表中检查一个页面。 因此,深度优先连接是相对于数据集的大小的恒定空间操作,其中所需的存储大约等于每个表的页面大小之和。

    Data store with lock-free stateless paging capability

    公开(公告)号:US20060129540A1

    公开(公告)日:2006-06-15

    申请号:US11301985

    申请日:2005-12-12

    IPC分类号: G06F17/30

    摘要: Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.