中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

37 records (took 0.019 seconds)

    Data structure based on event compaction and read-offsets
    3.
    发明授权
    Data structure based on event compaction and read-offsets 有权

    公开(公告)号：US11803566B2

    公开(公告)日：2023-10-31

    申请号：US17644426

    申请日：2021-12-15

    Applicant: Palantir Technologies Inc.

    Inventor： Robert Fink ,  James Baker ,  Mark Elliot

    IPC: G06F16/25 ,  G06F16/23 ,  G06F16/2457

    CPC classification number: G06F16/254 ,  G06F16/2358 ,  G06F16/2457

    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.

    Access controls through node-based effective policy identifiers
    5.
    发明授权
    Access controls through node-based effective policy identifiers 有权

    公开(公告)号：US10432469B2

    公开(公告)日：2019-10-01

    申请号：US16009120

    申请日：2018-06-14

    Applicant: Palantir Technologies Inc.

    Inventor： Neil Rickards ,  James Baker ,  Marco Gelmi ,  Radu-Cosmin Balan ,  Savino Sguera

    IPC: G06F15/16 ,  H04L12/24 ,  H04L29/08 ,  H04L29/06 ,  G06F21/00 ,  G06F21/60 ,  G06F21/62

    Abstract: Techniques for implementing a node-based access control system are described herein. In an embodiment, a server computer stores a node based policy system wherein each node identifies a resource and a policy for the resource. The server computer identifies a policy for a first node and an identifier of a second node wherein the second node is a parent node to the first node. The server computer maps an effective policy identifier to the policy for the first node and the identifier of the second node. The server computer stores data associating the effective policy identifier with the first node. The server computer identifies a policy for a third node and an identifier of the second node, wherein the second node is a parent node to the third node and wherein the policy for the third node is equivalent to the policy for the first node. The server computer then stores data associating the effective policy identifier with the third node.

    Approaches for managing access control permissions
    8.
    发明授权
    Approaches for managing access control permissions 有权

    公开(公告)号：US11914623B2

    公开(公告)日：2024-02-27

    申请号：US17077792

    申请日：2020-10-22

    Applicant: Palantir Technologies Inc.

    Inventor： James Baker ,  Sander Kromwijk

    IPC: G06F16/28 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/248 ,  G06F21/62

    CPC classification number: G06F16/285 ,  G06F16/221 ,  G06F16/248 ,  G06F16/24553 ,  G06F21/6227

    Abstract: Systems and methods are provided for determining a query involving at least one dataset comprising a plurality of records, the query being submitted by a first user operating a computing device. An archetype policy that governs access to records of the at least one dataset can be determined, wherein the archetype policy includes at least one logical formula to be evaluated when determining whether a requesting user is permitted to access a given record, and wherein the at least one logical formula is satisfied based at least in part on a state associated with the requesting user and at least one first variable evaluated by the at least one logical formula. At least one record that the first user is permitted to access can be determined based at least in part on satisfaction of the at least one logical formula associated with the archetype policy.

    DATA STRUCTURE BASED ON EVENT COMPACTION AND READ-OFFSETS
    10.
    发明公开
    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.

Patent Agency Ranking