利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.011 秒)

    EFFICIENT QUERY PROCESSING USING HISTOGRAMS IN A COLUMNAR DATABASE
    1.
    发明公开
    EFFICIENT QUERY PROCESSING USING HISTOGRAMS IN A COLUMNAR DATABASE 有权
    在柱状数据库中使用直方图进行有效的查询处理

    公开(公告)号：EP3299972A1

    公开(公告)日：2018-03-28

    申请号：EP17196422.4

    申请日：2014-01-15

    申请人： Amazon Technologies, Inc.

    发明人： Gupta, Anurag Windlass

    IPC分类号： G06F17/30

    CPC分类号： G06F16/254 ,  G06F16/221 ,  G06F16/2237 ,  G06F16/245 ,  G06F16/24554 ,  G06F16/278 ,  G06F16/283

    摘要： A probabilistic data structure is generated for efficient query processing using a histogram for unsorted data in a column of a columnar database. A bucket range size is determined for multiples buckets of a histogram of a column in a columnar database table. In at least some embodiments, the histogram may be a height-balanced histogram. A probabilistic data structure is generated to indicate for which particular buckets in the histogram there is a data value stored in the data block. When an indication of a query directed to the column for select data is received, the probabilistic data structure for each of the data blocks storing data for the column may be examined to determine particular ones of the data blocks which do not need to be read in order to service the query for the select data.

    摘要翻译： 使用列状数据库的列中的未排序数据的直方图来生成概率数据结构以进行有效的查询处理。 对于柱状数据库表中列的直方图的多个桶，确定桶范围大小。 在至少一些实施例中，直方图可以是高度平衡直方图。 生成概率数据结构以指示直方图中的哪些特定桶存在数据块中存储的数据值。 当接收到针对用于选择数据的列的查询的指示时，可以检查存储用于该列的数据的每个数据块的概率数据结构以确定不需要读入的特定数据块 为服务查询选择数据。

    MERGING OF SORTED LISTS USING ARRAY PAIR
    2.
    发明公开
    MERGING OF SORTED LISTS USING ARRAY PAIR 审中-公开
    - 加入家长LISTEN使用阵列偶

    公开(公告)号：EP2997461A1

    公开(公告)日：2016-03-23

    申请号：EP14733766.1

    申请日：2014-05-12

    申请人： Microsoft Technology Licensing, LLC

    发明人： GOLDSTEIN, Jonathan David ,  CHANDRAMOULI, Badrish

    IPC分类号： G06F7/32 ,  G06F7/24

    CPC分类号： G06F16/2237 ,  G06F7/32 ,  G06F16/217 ,  G06F16/22 ,  G06F16/245 ,  G06F2207/224

    摘要： The formulation of a merged sorted list from multiple input sorted lists in multiple phases using an array pair. Initially, the first array is contiguously populated with the input sorted lists. In the first phase, the first and second input sorted lists are merged into a first intermediary merged list within the second array. Each subsequent phase merges a prior intermediary merged list resulting from the prior phase and, a next input sorted list in the first array to generate a next intermediary merged list, or a merged sorted list if there or no further input in the first array. The intermediary merged lists alternate between the first array and the second array from one phase to the next phase.

    DATA STRUCTURE FOR EFFICIENT GRAPH DATABASE STORAGE
    6.
    发明公开
    DATA STRUCTURE FOR EFFICIENT GRAPH DATABASE STORAGE 审中-公开

    公开(公告)号：EP4386574A1

    公开(公告)日：2024-06-19

    申请号：EP22306928.7

    申请日：2022-12-16

    申请人： Dassault Systèmes

    发明人： VALLET GLENISSON, Eric ,  SAHUT D'IZARN Jean-Philippe

    IPC分类号： G06F16/22 ,  H03M7/40

    CPC分类号： G06F16/2237 ,  G06F16/2246 ,  H03M7/3066

    摘要： The disclosure notably relates to a computer-implemented method of storing RDF graph data in a graph database comprising a set of RDF tuples. The method comprises obtaining one or more adjacency matrices wherein each adjacency matrix represents a group of tuples of the graph database comprising a same predicate. The method further comprises storing, for each of the one or more adjacency matrices, a data structure comprising an array. The array comprises one or more indices each pointing to a sub-division of the adjacency matrix, and/or one or more elements each representing a group of tuples of the RDF graph database of a respective sub-division of the adjacency matrix.