Palantir Technologies Inc.

Ucl Business Plc

Jemella Limited

Solivus Limited

Steve Leigh & Associates Limited

James Baker

Mark Elliot

Nathan Ziebart

Neil Rickards

Savino Sguera

Marco Gelmi

Grgur Petric Maretic

Mark F Smith

Stephen Caddick

Vijay Chudasama

Benjamin Duffield

Derek Cicerone

Brian Schimpf

Javier Campanini

Jakob Juelich

Jacob Meacham

Sandor Van Wassenhove

Jason Zhao

Qinfeng Chen

Daniel Brady

Arseny Bogomolov

Xavier Falco

Timothy David Moore

Amr Al Mallah

Paul Alexander Scott

Thomas Petracca

Gokcan Ozakdag

Lam Tran

Jeremy Kong

Robert Alexander Weatherly

Helen Yu

Yixun Xu

Steve Sayers

Jeremy Peter Clements

Lili Yang

Mark Andrew Gagiano

Radu-Cosmin Balan

Samuel Flavio Barroso Souza

Robert Fink

Robert Kruszewski

Sander Kromwijk

Joseph Ellis

Jakub Kozlowski

Ovidiu-Dan Sanduleac

Paul Edwin Lewis

Jo Parker-Swift

Ben Crundwell

Stuart Naylor

Joanna Parker-swift

Ciaran Cotter

Mark Smith

Amelia Livingstone

Philip Cohen

Steve Leigh

Jez Clements

Aki Laakso

Simon Hubbard

Hans Pflaumer

Finlay Knops-Mckim

A distributed, transactional database uses timestamps, such as logical clock values, for entry versioning and transaction management in the database. To write to the database, a service requests a timestamp to be inserted into the database with a new version of data. During a backup procedure, a cleanup process is paused, issuing new timestamps is paused, and a backup timestamp is generated, which results in an effective backup copy. During a restore of a backup, a snapshot of the database is loaded and any entries older than the backup timestamp are deleted, which ensures that a consistent restore has occurred.

Systems and methods for consistent backup of distributed, transactional databases

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.

Nested discovery and deletion of resources

A system for resolving conflicts between data source updates and user edits to an ontology before applying the resulting changes to the ontology and related methods are disclosed. The system is programmed to receive data source updates from data sources and transform the data source updates to updates to ontology data. The system is also programmed to receive edits to ontology data from user accounts. The system is programmed to review these updates or edits to the ontology and resolve conflicts according to a predetermined strategy, such as prioritizing a user edit over a data source update. The resulting changes are incorporated to one or more databases where representations of the ontology data are stored.

Resolving conflicts between data source updates and user edits to ontology data

A roof panel comprising a rigid sheet () of material for forming a structural roof. The sheet is formed with a plurality of ridges (), and a flexible solar material () attached along at least one of the ridges. The maximum height of at least one ridge () above the lowermost plane of the sheet is greater than 50 cm. A method of forming the roof panel comprises forming through holes () in the metal sheet, adhering a flexible solar material () along at least one of the ridges, and miming electrical connections () to the solar panel through the holes to the underside of the ridges ().

Commercial roof

A system for enabling granular access control over ontology data and related methods are disclosed. The system is programmed to receive data source updates from data sources having respective sets of permissions for access control, transform the data source updates to changes to an ontology, and control access to the ontology based on the sets of permissions. The system is further programmed to receive a specification of one or more rules referencing attributes of user accounts or properties of ontology entities and corresponding one or more lists of permissions. The system is programmed to then enforce a security policy based on the specification to further control access to the ontology.

Fine-grained permission models for ontology data

A computer-implemented method for targeted sweep of a key-value data storage is provided. The method comprises before a write transaction to a database having a key value store commits, and before each of one or more write commands of the write transaction are persisted to the key value store, writing an entry for each of the one or more write commands to an end of a targeted sweep queue, the entry comprising metadata including: data identifying a cell to which the write command relates, a start timestamp of the write transaction, and information identifying a type of the write transaction.

Targeted sweep method for key-value data storage

Disclosed herein are systems and computer-implemented methods that include storing a sequence of events, each event associated with a sequence number indicating a temporal position of an event within the sequence of events; further storing one or more read-offsets that are associated with respective consumers and that indicate the sequence number up to which the respective consumers have read events within the sequence of events; determining a smallest read-offset of all read-offsets; compacting events and/or earlier snapshots with sequence numbers smaller than the smallest read-offset into a new snapshot; and replacing, in the sequence of events, the events and/or earlier snapshots with sequence numbers smaller than the smallest read-offset with the new snapshot.

Data structure based on event compaction and read-offsets

An apparatus and method are disclosed. The method, which may be performed by one or more processors, may comprise receiving timestamp data representing a plurality of database transactions and dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps. Further, for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), the method may comprise allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions.

Data storage method and system

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.

Approaches for managing access control permissions

Systems and methods generate a first security node hash identifier by performing a first hash operation, such as a one-way hash, on a first data resource identifier associated with a first data resource, such as a data set, produced by a data resource platform. The systems and methods generate a dependent second security node hash identifier by performing a second hash operation on a second data resource identifier associated with a dependent second data resource produced by the data resource platform and on the first security node hash identifier, receive an access request for access to the dependent second data resource; and in response to the access request, grant permission to access the dependent second data resource to a user associated with the access request based on the dependent second security node hash identifier.

Systems and methods for providing network-based permissioning using security node hash identifiers

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.

A solar electrical generator comprising an outer wall () arranged to partially surround a cavity. A hub () is provided within the cavity wherein the outer face () of the wall is provided with solar cells (). At least one of the hub () and the inner face () of the wall are provided with solar cells ().

Solar electrical generator

Growing community of inventors

London, United Kingdom

James Baker