DATA QUERY METHOD AND APPARATUS
    32.
    发明申请

    公开(公告)号:US20180011915A1

    公开(公告)日:2018-01-11

    申请号:US15677952

    申请日:2017-08-15

    Inventor: Qiang Tong Jian Li

    CPC classification number: G06F16/278 G06F16/24554 G06F16/24557

    Abstract: Embodiments of the present disclosure provide a data query method and apparatus, which implement a technical effect that data meeting a precision requirement is queried according to a user's requirement of for data precision. The method includes: receiving a query instruction that includes a query condition and query precision; determining a data partition that meets the query condition; determining a data sub-partition corresponding to the query precision from the data partition; and querying data in the data sub-partition to obtain a query result.

    SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR A LOCALITY-SENSITIVE NON-UNIQUE SECONDARY INDEX
    33.
    发明申请
    SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR A LOCALITY-SENSITIVE NON-UNIQUE SECONDARY INDEX 审中-公开
    系统,方法和计算机可读介质,用于本地敏感的非唯一二级索引

    公开(公告)号:US20100138456A1

    公开(公告)日:2010-06-03

    申请号:US12326363

    申请日:2008-12-02

    Applicant: Alireza Aghili

    Inventor: Alireza Aghili

    CPC classification number: G06F16/24557 G06F16/2255

    Abstract: A system, method, and computer-readable medium for allocation of a Locality-sensitive Non-Unique Secondary Index are provided. The Locality-sensitive Non-Unique Secondary Index preserves the similarity of incorporated fields as well as improves the average secondary index sub-table look-up performance and is advantageously resilient to the type of predicates and workloads applied thereto. Rows of the secondary index having values of the columns that are hashed to determine a secondary index sub-table row location have a higher probability of being closely located within the secondary index than rows with more dissimilar column values that are hashed to determine the secondary index row location.

    Abstract translation: 提供了用于分配局部敏感非唯一次要索引的系统,方法和计算机可读介质。 局部敏感的非唯一二级索引保留了合并字段的相似性,并且提高了平均辅助索引子表查找性能,并且有利地适用于应用于其的谓词类型和工作负载。 具有散列以确定次级索引子表行位置的列的值的次级索引的行具有与辅助索引更紧密地位于次要索引内的更高概率,该列具有较多不相似的列值,以便确定辅助索引 行位置。

    Data search system and method
    34.
    发明申请
    Data search system and method 审中-公开
    数据搜索系统和方法

    公开(公告)号:US20060184499A1

    公开(公告)日:2006-08-17

    申请号:US11055516

    申请日:2005-02-11

    Applicant: David Potter

    Inventor: David Potter

    CPC classification number: G06F16/24557 G06F16/24547 G06F16/284

    Abstract: According to some embodiments of the invention, a method of data management is provided. The method includes generating a plurality of sub-tables in a table of a relational database. Each sub-table has a predicate that indicates at least a partial description of information to be stored in the sub-table. The method also includes storing in the plurality of sub-tables one or more records having data. Each record is stored in the sub-table having the predicate that matches at least a portion of the data of the record.

    Abstract translation: 根据本发明的一些实施例,提供了一种数据管理方法。 该方法包括在关系数据库的表格中生成多个子表。 每个子表具有指示要存储在子表中的信息的至少部分描述的谓词。 该方法还包括在多个子表中存储具有数据的一个或多个记录。 每个记录存储在具有与记录的数据的至少一部分匹配的谓词的子表中。

    Two pass calculation to optimize formula calculations for a spreadsheet
    35.
    发明申请
    Two pass calculation to optimize formula calculations for a spreadsheet 审中-公开
    两次计算,以优化电子表格的公式计算

    公开(公告)号:US20060085386A1

    公开(公告)日:2006-04-20

    申请号:US10969381

    申请日:2004-10-19

    CPC classification number: G06F17/246 G06F16/24556 G06F16/24557

    Abstract: Current cell values are provided to a client using two-passes. When a first request to provide values is received during a first pass, default values are provided to the client. Upon receiving each value request, the formula parameters are collected that are associated with the cell. The formula parameters are parsed to determine data that is to be retrieved from a database. Once the locations for all of the data to be retrieved has been determined, the data is retrieved from a database in as few as hits as possible. After obtaining the current values from the database, the client is informed to request the values a second time. When the second request to provide values is received, the client is provided with the calculated values during the second pass.

    Abstract translation: 当前单元格值使用双程提供给客户端。 当在第一次通过期间收到提供值的第一个请求时,将向客户端提供默认值。 收到每个值请求后,收集与该单元格关联的公式参数。 解析公式参数以确定要从数据库检索的数据。 一旦确定要检索的所有数据的位置,就尽可能少地从数据库中检索数据。 在从数据库获取当前值之后,通知客户端再次请求值。 当接收到提供值的第二请求时,在第二次通过期间向客户端提供计算的值。

    Efficient processing of multi-column and function-based in-list predicates
    36.
    发明申请
    Efficient processing of multi-column and function-based in-list predicates 审中-公开
    高效处理多列和基于功能的列表谓词

    公开(公告)号:US20040249845A1

    公开(公告)日:2004-12-09

    申请号:US10880633

    申请日:2004-06-29

    Inventor: Dinesh Das

    Abstract: Described herein are approaches for generating execution plans for database commands that include an in-list predicate. The approaches can be used to generate execution plans that exploit the power of in-list iterators in ways and under circumstances not previously supported by conventional DBMSs. An in-list iterator may be used with execution subplans for processing multi-column in-list queries. An in-list iterator is used with execution subplans that scan function-based indexes. The execution plans for a multi-column in-list query limit table scans to only table partitions that contain data that satisfy the query.

    Abstract translation: 这里描述的是用于生成包括列表内谓词的数据库命令的执行计划的方法。 这些方法可以用于生成执行计划,这些执行计划以常规DBMS以前不支持的方式和情况利用列表中迭代器的功能。 列表中的迭代器可以与用于处理多列列表查询的执行子计划一起使用。 使用列表内的迭代器与执行子计划一起扫描基于函数的索引。 多列列表查询限制表的执行计划仅扫描包含满足查询的数据的表分区。

    DATA STRUCTURE FOR EFFICIENT GRAPH DATABASE STORAGE

    公开(公告)号:US20240202179A1

    公开(公告)日:2024-06-20

    申请号:US18544098

    申请日:2023-12-18

    CPC classification number: G06F16/2246 G06F16/2453 G06F16/24557

    Abstract: A computer-Implemented method of storing RDF graph data in a graph database including a set of RDF tuples. The method includes 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 includes storing, for each of the one or more adjacency matrices, a data structure includes an array. The array includes 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.

    Processing queries using an index generated based on data segments

    公开(公告)号:US11704320B2

    公开(公告)日:2023-07-18

    申请号:US17936759

    申请日:2022-09-29

    Applicant: Snowflake Inc.

    Abstract: A table organized into a set of batch units is accessed. A set of N-grams are generated for a data value in the source table. The set of N-grams include a first N-gram of a first length and a second N-gram of a second length where the first N-gram corresponds to a prefix of the second N-gram. A set of fingerprints are generated for the data value based on the set of N-grams. The set of fingerprints include a first fingerprint generated based on the first N-gram and a second fingerprint generated based on the second N-gram and the first fingerprint. A pruning index that indexes distinct values in each column of the source table is generated based on the set of fingerprints and stored in a database with an association with the source table.

    DATA SEARCH METHOD AND APPARATUS, ELECTRONIC DEVICE AND STORAGE MEDIUM

    公开(公告)号:US20230214394A1

    公开(公告)日:2023-07-06

    申请号:US17966117

    申请日:2022-10-14

    Inventor: Wensong HE

    CPC classification number: G06F16/24561 G06F16/24557

    Abstract: Provided are a data search method and apparatus, an electronic device and a storage medium. The method includes acquiring search data and a search condition and determining a target data set corresponding to the search data; determining each data distance between the search data and a respective query datum included in the target data set; performing data filtering on the each data distance based on the search condition and writing each filtered data distance as a target data distance into a memory; and reading the target data distance stored in the memory, using a query datum corresponding to the target data distance as a target response datum of the search data and displaying the target response datum.

Patent Agency Ranking