Dropbox, Inc.

Figma, Inc.

Braden Walker

Aaron Passey

Akos Albert

David Wetterau

Nipunn Koorapati

Sujay Jayakar

James Cowling

Alexander Sosa

David Aeschlimann

Vrushali Kulkarni

Leslie Tu

Preslav Le

Tanay Lathia

Lihao He

Luan Dos Santos

Matthew Rosencrantz

Lin Xu

In examples, a query management system maintains a query schema for a structured data source. The query schema includes a collection of query templates, where each query template specifies at least one condition. When a mutation in an underling data source is detected, the query management system generates an invalidation command for a corresponding set of cached keys. Based on attributes of the mutated data set, the query template can enable the use of wildcard designations to for purpose of identifying cache keys that are to be invalidated as a result of the mutated data set.

Query management system for application service platform

The disclosed technology addresses the need in the art for a content management system that can be highly flexible to the needs of its subjects. The present technology permits any object to be shared by providing a robust and flexible access control list mechanism. The present technology utilizes a data structure that is highly efficient that both minimizes the amount of information that needs to be written into any database, but also allows for fast reads and writes of information from authoritative tables that are a source of truth for the content management system, while allowing for maintenance of indexes containing more refined data that allow for efficient retrieval of certain information that would normally need to be calculated when it is needed.

Aggregates index

A consistency verification system that verifies data consistency in a content item management system. The system processes a write request. The write request includes a set of preconditions, a key, and data to write in a write operation. Processing the write request includes determining that the set of conditions are met, committing the write request at a commit time, and assigning a timestamp indicating the commit time to the write request. The system verifies data consistency associated with the write request. The verifying data consistency includes sending a replay request corresponding to the write request. The system determines whether results of the replay are consistent with results of the write request. Responsive to determining whether results of the replay are consistent with results of the write request, the system outputs information describing data inconsistency.

Verifying data consistency using verifiers in a content management system for a distributed key-value database

Data model and data service for content management system

Evaluating an access control list from permission statements

Determining access changes

Evaluating access based on group membership

A consistency verification system that verifies data consistency in a content item management system. The system maintains a plurality of verifiers for checking data consistency, each verifier comprising instructions for verifying consistency for a type of requests. The system may verify the original request by selecting a verifier from the plurality of verifiers based on a type of the original request. Using the selected verifier, the consistency verification system may send verification requests to the content item management system at a second timestamp that is a period of time after the original timestamp. The system may determine whether the second response is consistent with the first response. If the responses are not consistent, the system may output information describing data inconsistency. If the responses are consistent, the system may output results and perform further verifications to help ensure data accuracy.

Systems and methods are provided for intent tracking asynchronous operations. An example method can include receiving, at a content management system (CMS), a first request to perform an operation on a content item stored at the CMS; adding the request to perform the operation to a queue of operations to be processed by the CMS; and prior to completing the operation: receiving, from a client device associated with a user account registered at the CMS, a second request to access the content item; in response to the second request, determining a predicted state of the content item, the predicted state of the content item reflecting a result of performing the operation on the content item; and providing, to the client device, a response including the predicted state of the content item.

Intent tracking for asynchronous operations

Systems and methods for snapshot isolation in a distributed storage system M are provided. In some examples, a method can include receiving a request for data from a data store comprising a plurality of storage nodes, the request comprising a key associated with the data and a request timestamp, identifying a storage node in the plurality of storage nodes from which to read the data based on the key and a mapping of keys to storage nodes, determining that the request is associated with a transaction comprising operations associated with at least one other storage node in the plurality of storage nodes, determining a status of the entry for the key in the key-value table based on a lookup of a transaction table using the transaction identifier, and providing the data when the status of the entry for the key indicates the data is ready to be read.

Snapshot isolation in a distributed storage system

A system can serialize moves and mounts across namespaces based on lamport clocks. In some examples, the system obtains a request to move a content item from a source namespace to a destination namespace. The system processes an incoming move at the destination and an outgoing move at the source. The system processes for the content item a delete at the source and an add at the destination. The system assigns a first clock to the incoming move and a second clock to the outgoing move, the first clock being lower than the second clock. The system assigns a third clock to the delete and a fourth clock to the add, the third clock being higher than the second clock and lower than the fourth clock. The system serializes the incoming and outgoing moves, the delete and the add based on the first, second, third and fourth clocks.

Atomic moves with lamport clocks in a content management system

Growing community of inventors

San Francisco, CA, United States of America

Braden Walker