中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

151 records (took 0.029 seconds)

    Computer-implemented systems and methods for comparing and associating objects
    81.
    发明授权
    Computer-implemented systems and methods for comparing and associating objects 有权
    用于比较和关联对象的计算机实现的系统和方法

    公开(公告)号：US09286373B2

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

    申请号：US14552336

    申请日：2014-11-24

    Applicant: PALANTIR TECHNOLOGIES INC.

    Inventor： Mark Elliot ,  Allen Chang

    IPC: G06F7/00 ,  G06F17/30

    CPC classification number: G06F17/30598 ,  G06F17/30292 ,  G06F17/30595 ,  G06F17/30687 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/3071 ,  G06Q50/26

    Abstract: Computer-implemented systems and methods are disclosed for comparing and associating objects. In some embodiments, a method is provided for associating a first object with one or more objects within a plurality of objects, each object comprising a first plurality of properties, each property comprising data reflecting a characteristic of an entity represented by the object, the associated objects comprising matching data in corresponding properties for a second plurality of properties. The method may include executing, for each object within the plurality of objects and for the first object, the following: creating a slug for the object, the slug comprising the second plurality of properties from the object; and inputting the slug for the object into a Bloom filter. Further, the method may include creating for a bin within the Bloom filter corresponding to the slug for the first object, an association between objects whose slugs correspond to the bin if the slugs for those objects match.

    Abstract translation: 公开了用于比较和关联对象的计算机实现的系统和方法。 在一些实施例中，提供了一种用于将第一对象与多个对象中的一个或多个对象相关联的方法，每个对象包括第一多个属性，每个属性包括反映由对象表示的实体的特征的数据， 对象包括用于第二多个属性的相应属性中的匹配数据。 该方法可以包括对于多个对象中的每个对象和对于第一对象执行以下操作：为对象创建一个块，该块从该对象中包括第二多个属性; 并将对象的块塞输入到布隆过滤器中。 此外，该方法可以包括针对与第一对象的块状物相对应的布隆过滤器内的仓，创建如果对于这些物体的段塞匹配的，桩的对应物体之间的关联。

    Project-based permission system
    82.
    发明授权
    Project-based permission system 有权

    公开(公告)号：US12299106B2

    公开(公告)日：2025-05-13

    申请号：US18109134

    申请日：2023-02-13

    Applicant: Palantir Technologies Inc.

    Inventor： Hannah Korus ,  Brian Schimpf ,  Lam Tran ,  Mark Elliot ,  Robert Kruszewski

    IPC: G06F21/33 ,  G06F9/48 ,  G06F21/60 ,  G06F21/62

    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media for data security protection are provided. One of the methods includes: receiving a job associated with a project, wherein the project is associated with one or more data sources; identifying a plurality of inputs and a plurality of outputs associated with the job; determining a plurality of required permissions associated with the job, wherein each of the required permissions comprises an operation on a required data source, the operation corresponding to at least one of the inputs or the outputs; verifying that the one or more data sources associated with the project comprise the required data source associated with each of the required permissions; and generating a token associated with the job, the token encoding the required permissions associated with the job, wherein the token is required for execution of the job.

    DATA STRUCTURE BASED ON EVENT COMPACTION AND READ-OFFSETS
    87.
    发明公开
    DATA STRUCTURE BASED ON EVENT COMPACTION AND READ-OFFSETS 审中-公开

    公开(公告)号：US20240012830A1

    公开(公告)日：2024-01-11

    申请号：US18473562

    申请日：2023-09-25

    Applicant: Palantir Technologies Inc.

    Inventor： Robert Fink ,  James Baker ,  Mark Elliot

    IPC: G06F16/11 ,  G06F16/17

    CPC classification number: G06F16/128 ,  G06F16/1734 ,  G06F16/1737

    Abstract: Disclosed herein is a data structure which includes a sequence of events, each event associated with a sequence number indicating a temporal position of an event within the sequence of events; one or more read-offsets, each read-offset associated with a consumer, wherein each read-offset indicates a sequence number up to which a consumer has read events within the sequence of events; and at least one snapshot which represents events with sequence numbers smaller than the smallest read-offset in a compacted form. Disclosed herein is also a computer-implemented method of maintaining the data structure. Disclosed herein is a computer-implemented method, wherein the method is performed on a sequence of events accessible by a plurality of consumers, each event associated with a sequence number indicating a temporal position of an event within the sequence of events, each consumer associated with a read-offset indicating the sequence number up to which the consumer has read events within the sequence of events, the method includes determining a smallest read-offset of all read-offsets; compacting events with sequence numbers smaller than the smallest read-offset into a snapshot; and replacing the events with sequence numbers smaller than the smallest read-offset with the snapshot. Disclosed herein are corresponding computer-readable media and computing systems.

    PROJECTIONS FOR BIG DATABASE SYSTEMS
    88.
    发明公开
    PROJECTIONS FOR BIG DATABASE SYSTEMS 审中-公开

    公开(公告)号：US20230281191A1

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

    申请号：US18178294

    申请日：2023-03-03

    Applicant: Palantir Technologies Inc.

    Inventor： Benjamin Duffield ,  Joshua Casale ,  Mark Elliot ,  Matthew Sills ,  Robert Kruszewski ,  Rahij Ramsharan

    IPC: G06F16/23 ,  G06F16/27 ,  G06F16/2455 ,  G06F16/248

    CPC classification number: G06F16/2379 ,  G06F16/273 ,  G06F16/2455 ,  G06F16/248

    Abstract: A database system comprised of a decoupled compute layer and storage layer is implemented to store, build, and maintain a canonical dataset, a temporary buffer, and projection datasets. The canonical dataset is a set of batch updated data. The data is appended in chunks to the canonical dataset such that the canonical dataset becomes a historical dataset over time. The buffer is a write ahead log that contains the most recent chunks of data and provides atomicity and durability for the database system. The projection datasets are indexes of the canonical dataset and/or the buffer that may have single or multiple column sort-orders and/or particular data formats. The writes to the canonical dataset, projection datasets, and buffer may be asynchronous and therefore the database system is advantageously less resource constrained.

    LOW-LATENCY DATABASE SYSTEM
    89.
    发明申请
    LOW-LATENCY DATABASE SYSTEM 有权

    公开(公告)号：US20230121493A1

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

    申请号：US18083157

    申请日：2022-12-16

    Applicant: Palantir Technologies Inc.

    Inventor： Mark Elliot ,  Joseph Ellis ,  Rahij Ramsharan ,  Matthew Sills ,  Lawrence Manning

    IPC: G06F16/2453 ,  G06F16/248

    Abstract: A database system comprised of a decoupled compute layer and storage layer is implemented to store, build, and maintain a canonical dataset, a temporary buffer, and an edits dataset. The canonical dataset is a set of batch updated data. The data is appended in chunks to the canonical dataset such that the canonical dataset becomes a historical dataset over time. The buffer is a write ahead log that contains the most recent chunks of data and provides atomicity and durability for the database system. The edits dataset is the set of data that contains edits such as cell mutations, row appends and/or row deletions. The database system enables users to make cell or row-level edits to tables and observe those edits in analytical systems or downstream builds with minimal latency.

Patent Agency Ranking