利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

94 条记录 (耗时 0.032 秒)

    Information processing system and information processing method
    4.
    发明授权
    Information processing system and information processing method 有权

    公开(公告)号：US11841907B2

    公开(公告)日：2023-12-12

    申请号：US17348017

    申请日：2021-06-15

    申请人： TOYOTA JIDOSHA KABUSHIKI KAISHA

    发明人： Masao Yano ,  Tetsuya Shoji

    IPC分类号： G06F16/9038 ,  G06F16/904 ,  G06F16/903

    CPC分类号： G06F16/9038 ,  G06F16/904 ,  G06F16/90348

    摘要： The present disclosure provides an information processing system and an information processing method that, in a material analyzing service that is provided via a network, can appropriately manage data of a high degree of confidentiality. The system and method involve a user terminal that provides a data ID to a combination of first data that relates to a material, and second data that is data obtained by measuring the material and is data whose degree of confidentiality is lower than the first data. The user terminal stores the first data and data ID and transmits the second data and data ID to an information processing device. The information processing device carries out material analysis corresponding to the second data and transmits analysis results data to the user terminal. Accordingly, data having a high degree of confidentiality can be managed appropriately in a material analyzing service over a network.

    Cursor seek operations using deleted record spans
    7.
    发明授权
    Cursor seek operations using deleted record spans 有权

    公开(公告)号：US11762913B2

    公开(公告)日：2023-09-19

    申请号：US16913432

    申请日：2020-06-26

    申请人： Micron Technology, Inc.

    发明人： Neelima Premsankar ,  Gaurav Sanjay Ramdasi ,  David Boles

    IPC分类号： G06F16/903 ,  G06F16/901

    CPC分类号： G06F16/90348 ,  G06F16/9024

    摘要： An example method of cursor seek operations using deleted record spans in memory sub-systems comprises: receiving, by a processing device, a request to search for a first data element of a key-value data store, the request specifying a first key associated with the first data element; determining that the first key is within a range of deleted data elements comprising a plurality of deleted data elements of the key-value data store; identifying a tail key associated with a tail element of the range of deleted data elements; identifying a second data element in the key-value data store, wherein the second data element is associated with a second key that follows the tail key in a specified order of keys; and providing the second data element in response to the request.

    LAYERED GRAPH DATA STRUCTURE
    10.
    发明申请
    LAYERED GRAPH DATA STRUCTURE 审中-公开

    公开(公告)号：US20190205480A1

    公开(公告)日：2019-07-04

    申请号：US15872514

    申请日：2018-01-16

    申请人： Electronic Arts, Inc.

    发明人： Xinfeng Zhang ,  Jian Li ,  Frank Yang ,  Guowen Feng ,  Wen Ren ,  Anand Nair ,  Jian Zhou

    IPC分类号： G06F17/30

    CPC分类号： G06F16/9024 ,  G06F16/90348

    摘要： A layered graph data structure can be stored using a vertex table and an edge table. The vertex table includes a vertex identifier column and a first graph identifier column. The edge table includes a second graph identifier column, a node identifier column, and an edge type column. Queries of the layered graph data structure include a target entity and a graph level, and iterative searching of the vertex table and the edge table is performed based on the graph level and data stored in edge type column.