Performing multidimensional search and content-associative retrieval on data that has been losslessly reduced using a prime data sieve
    2.
    发明申请
    Performing multidimensional search and content-associative retrieval on data that has been losslessly reduced using a prime data sieve 有权
    对使用主数据筛无损减少的数据执行多维搜索和内容关联检索

    公开(公告)号:US20160188668A1

    公开(公告)日:2016-06-30

    申请号:US14998330

    申请日:2015-12-23

    Applicant: Ascava, Inc.

    Abstract: This disclosure relates to multidimensional search and retrieval on losslessly reduced data by organizing prime data elements using components of a structure of an input dataset so that searches can be performed on the losslessly reduced data based on the one or more components of the structure. Some embodiments can retrieve, from the data structure that organizes the prime data elements, either references to metadata for prime data elements, or metadata for prime data elements, or prime data elements in a content associative manner, based upon the value of certain fields or dimensions in an input query presented to the data structure (said data structure being called the prime data sieve). For every prime data element, the prime data sieve can retain a reverse reference to the losslessly reduced representation of each chunk that refers to the prime data element.

    Abstract translation: 本公开涉及通过使用输入数据集的结构的组件来组织主要数据元素的无损数据的多维度搜索和检索,使得可以基于结构的一个或多个组件对无损数据的数据执行搜索。 一些实施例可以从组织主要数据元素的数据结构中,基于某些字段的值或者基于某些字段的值,以内容关联方式来引用主要数据元素的元数据或主数据元素的元数据或主数据元素, 提供给数据结构的输入查询中的维度(所述数据结构称为主数据筛)。 对于每个主数据元素,主数据筛可以保留对引用主数据元素的每个块的无损缩减表示的反向引用。

    Performing keyword-based search and retrieval on data that has been losslessly reduced using a prime data sieve
    3.
    发明申请
    Performing keyword-based search and retrieval on data that has been losslessly reduced using a prime data sieve 有权
    对使用主数据筛无损减少的数据执行关键字搜索和检索

    公开(公告)号:US20160188645A1

    公开(公告)日:2016-06-30

    申请号:US14757956

    申请日:2015-12-23

    Applicant: Ascava, Inc.

    Abstract: Some embodiments can factorize input data into a sequence of elements. Next, for at least one element in the sequence of elements, the embodiments can identify one or more prime data elements and determine a reconstitution program based on the element and the one or more prime data elements. The embodiments can then use the one or more prime data elements and the reconstitution program to generate a losslessly reduced representation of the element, and store the losslessly reduced representation of the element at a storage location. Next, in response to determining that a keyword is present in the element, the embodiments can (i) create a link that associates the keyword with the storage location, and (ii) store the link in the keyword index. The link can additionally associate the keyword with an offset where the keyword occurs in the element.

    Abstract translation: 一些实施例可以将输入数据分解为元素序列。 接下来,对于元件序列中的至少一个元件,实施例可以识别一个或多个素数据元素,并且基于元素和一个或多个素数据元素来确定重构程序。 实施例然后可以使用一个或多个主数据元素和重构程序来生成元素的无损缩小的表示,并且将元素的无损缩减表示存储在存储位置。 接下来,响应于确定元素中存在关键字,实施例可以(i)创建将关键字与存储位置相关联的链接,以及(ii)将链接存储在关键字索引中。 该链接还可以将关键字与关键字在元素中出现的偏移量相关联。

    Performing keyword-based search and retrieval on data that has been losslessly reduced using a prime data sieve
    6.
    发明授权
    Performing keyword-based search and retrieval on data that has been losslessly reduced using a prime data sieve 有权
    对使用主数据筛无损减少的数据执行关键字搜索和检索

    公开(公告)号:US09594765B2

    公开(公告)日:2017-03-14

    申请号:US14757956

    申请日:2015-12-23

    Applicant: Ascava, Inc.

    Abstract: Some embodiments can factorize input data into a sequence of elements. Next, for at least one element in the sequence of elements, the embodiments can identify one or more prime data elements and determine a reconstitution program based on the element and the one or more prime data elements. The embodiments can then use the one or more prime data elements and the reconstitution program to generate a losslessly reduced representation of the element, and store the losslessly reduced representation of the element at a storage location. Next, in response to determining that a keyword is present in the element, the embodiments can (i) create a link that associates the keyword with the storage location, and (ii) store the link in the keyword index. The link can additionally associate the keyword with an offset where the keyword occurs in the element.

    Abstract translation: 一些实施例可以将输入数据分解为元素序列。 接下来,对于元件序列中的至少一个元件,实施例可以识别一个或多个素数据元素,并且基于元素和一个或多个素数据元素来确定重构程序。 实施例然后可以使用一个或多个主数据元素和重构程序来生成元素的无损缩小的表示,并且将元素的无损缩减表示存储在存储位置。 接下来,响应于确定元素中存在关键字,实施例可以(i)创建将关键字与存储位置相关联的链接,以及(ii)将链接存储在关键字索引中。 该链接还可以将关键字与关键字在元素中出现的偏移量相关联。

    EFFICIENT RETRIEVAL OF DATA THAT HAS BEEN LOSSLESSLY REDUCED USING A PRIME DATA SIEVE

    公开(公告)号:US20220066994A1

    公开(公告)日:2022-03-03

    申请号:US17413886

    申请日:2019-12-11

    Applicant: Ascava, Inc.

    Abstract: Techniques and systems for reconstituting a sequence of losslessly reduced data chunks are described. Some embodiments can collect metadata while losslessly reducing a sequence of data chunks by using prime data elements to obtain the sequence of losslessly reduced data chunks, wherein the metadata includes an indicator corresponding to each prime data element that indicates whether or not the prime data element is referenced in multiple losslessly reduced data chunks, and optionally includes a memory size of each prime data element. Some embodiments can retrieve the metadata and reconstitute the sequence of losslessly reduced data chunks, wherein during reconstitution, the metadata can be used to retain only those prime data elements in memory that are referenced in multiple losslessly reduced data chunks. Some embodiments can, prior to performing reconstitution, use the metadata to optionally allocate sufficient memory to store the prime data elements that are referenced in multiple losslessly reduced data chunks.

    Using a distributed prime data sieve for efficient lossless reduction, search, and retrieval of data

    公开(公告)号:US10108633B2

    公开(公告)日:2018-10-23

    申请号:US14757929

    申请日:2015-12-23

    Applicant: Ascava, Inc.

    Abstract: Systems and techniques for losslessly reducing input data using a distributed system comprising multiple computers that maintain portions of a data structure that organizes prime data elements based on names of the prime data elements. During operation, a first computer can determine a first name for the element, and send the element to a second computer based on the first name. The second computer can losslessly reduce the element by determining a second name for the element, and using the second name to navigate through a portion of the data structure maintained at the second computer.

Patent Agency Ranking