知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.01 seconds)

    SPARSE MAPPING OF HIERARCHICAL SUBSET
    2.
    发明申请
    SPARSE MAPPING OF HIERARCHICAL SUBSET 有权

    公开(公告)号：US20230132648A1

    公开(公告)日：2023-05-04

    申请号：US17518968

    申请日：2021-11-04

    Applicant: Google LLC

    Inventor： Arthur E. Blume ,  Ye-Jeong Kim

    IPC: G06F16/22 ,  G06F16/28 ,  G06F16/23

    Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a sparse mapping of a data hierarchy. In one aspect, a method includes accessing a data hierarchy of elements, receiving a list of identifiers that each identify an element in the data hierarchy; determining, from the data hierarchy and the list of identifiers, a minimum tree that includes each of the identified elements identified by the list of identifiers additional elements that are not identified by the list of identifiers, where the identified elements and the additional elements define a set of a minimum number of elements necessary to form a path in the data hierarchy that connects all of the identified elements identified by the list of identifiers, and where the elements that belong to the minimum tree are a proper subset of elements of the data hierarchy.

    Sparse mapping of hierarchical subset
    4.
    发明授权
    Sparse mapping of hierarchical subset 有权

    公开(公告)号：US11734243B2

    公开(公告)日：2023-08-22

    申请号：US17518968

    申请日：2021-11-04

    Applicant: Google LLC

    Inventor： Arthur E. Blume ,  Ye-Jeong Kim

    IPC: G06F16/22 ,  G06F16/23 ,  G06F16/28

    CPC classification number: G06F16/2246 ,  G06F16/2365 ,  G06F16/282

    Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a sparse mapping of a data hierarchy. In one aspect, a method includes accessing a data hierarchy of elements, receiving a list of identifiers that each identify an element in the data hierarchy; determining, from the data hierarchy and the list of identifiers, a minimum tree that includes each of the identified elements identified by the list of identifiers additional elements that are not identified by the list of identifiers, where the identified elements and the additional elements define a set of a minimum number of elements necessary to form a path in the data hierarchy that connects all of the identified elements identified by the list of identifiers, and where the elements that belong to the minimum tree are a proper subset of elements of the data hierarchy.

Patent Agency Ranking