中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

37 records (took 0.018 seconds)

    Data storage method and system
    31.
    发明授权
    Data storage method and system 有权

    公开(公告)号：US10977223B2

    公开(公告)日：2021-04-13

    申请号：US16249740

    申请日：2019-01-16

    Applicant: Palantir Technologies Inc.

    Inventor： Joseph Ellis ,  Jakub Kozlowski ,  James Baker ,  Mark Elliot

    IPC: G06F16/21 ,  G06F16/28 ,  G06F16/22 ,  G06F16/18

    Abstract: Example embodiments describe a data storage method and system. For example, the method described, performed by one or more processors, may comprise in an application for enforcing one or more policies for reading and writing data to a database receiving, over a data network, instructions for performing a read or write request for data, and sending the read or write request to a transaction manager for providing transactions for a key-value store of the database, the request being in accordance with one or more policies to be enforced by the enforcing application. The method may also comprise receiving, from the transaction manager, a response message based on operations performed by the transaction manager in response to the read or write request.

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

    公开(公告)号：US10027551B1

    公开(公告)日：2018-07-17

    申请号：US15696094

    申请日：2017-09-05

    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

    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.

    Nested discovery and deletion of resources
    33.
    发明授权
    Nested discovery and deletion of resources 有权

    公开(公告)号：US11481399B1

    公开(公告)日：2022-10-25

    申请号：US16870335

    申请日：2020-05-08

    Applicant: Palantir Technologies Inc.

    Inventor： Jakob Juelich ,  James Baker

    IPC: G06F16/2455 ,  G06F16/901 ,  G06F21/62 ,  G06F16/953 ,  G06F16/16

    Abstract: Systems, methods, and non-transitory computer readable media are provided for recursively searching a plurality of workspaces of the system for linked data associated with the seed data, initiating an endpoint process for each the seed data and the linked data, and, upon completion of the search, delete the seed data and the linked data identified based at least in part on the endpoint process. The process may be automatically repeated at a predetermined time interval to identify and remove future data that is stored in the plurality of datasets.

    DATA STRUCTURE BASED ON EVENT COMPACTION AND READ-OFFSETS
    34.
    发明申请
    DATA STRUCTURE BASED ON EVENT COMPACTION AND READ-OFFSETS 有权

    公开(公告)号：US20220197921A1

    公开(公告)日：2022-06-23

    申请号：US17644426

    申请日：2021-12-15

    Applicant: Palantir Technologies Inc.

    Inventor： Robert Fink ,  James Baker ,  Mark Elliot

    IPC: G06F16/25 ,  G06F16/23 ,  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.

    DATA STORAGE SYSTEM AND METHOD
    36.
    发明申请
    DATA STORAGE SYSTEM AND METHOD 审中-公开

    公开(公告)号：US20190354616A1

    公开(公告)日：2019-11-21

    申请号：US16100538

    申请日：2018-08-10

    Applicant: Palantir Technologies Inc.

    Inventor： James Baker ,  Robert Kruszewski ,  Ovidiu-Dan Sanduleac

    IPC: G06F17/30

    Abstract: Data item deltas are generated for each of M updates of a plurality of updates, wherein M is greater than or equal to one, and a first first-level combined delta is generated representing N updates of the plurality of updates, wherein N is greater than M, and the N updates comprise the M updates and O=N−M other updates. A first second-level combined delta is generated representing J updates of the plurality of updates, wherein J is greater than N, and the J updates comprise the N updates and K other updates of the plurality of updates, wherein K=J−N. The deltas, the first first-level combined delta and the first second-level combined delta are stored for enabling subsequent reading of at least part of the data by accessing the data item, the first first-level combined delta and the first second-level combined delta.

Patent Agency Ranking