公开(公告)号：US20230060733A1

公开(公告)日：2023-03-02

申请号：US17458591

申请日：2021-08-27

Applicant: salesforce.com, inc.

Inventor： Vaibhav Arora ,  Terry Chong ,  Thomas Fanghaenel

IPC: G06F16/23 ,  G06F16/2455 ,  G06F16/22 ,  G06F12/0815 ,  G06F12/02

Abstract: Techniques are disclosed relating to truncating a tenant's data from a table. A database node may maintain a multi-tenant table having records for tenants. Maintaining the table may include writing a record for a tenant into an in-memory cache and performing a flush operation to flush the record to a shared storage. The database node may write a truncate record into the in-memory cache that truncates a tenant from the table such that records of the tenant having a timestamp indicating a time before the truncate record cannot be accessed as part of a record query. While the truncate record remains in the in-memory cache, the database node may receive a request to perform a record query for a key of the tenant, make a determination on whether a record was committed for the key after the truncate record was committed, and return a response based on the determination.

公开(公告)号：US11374748B2

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

申请号：US16849401

申请日：2020-04-15

Applicant: salesforce.com, inc.

Inventor： Vadiraj Govardhan Hosur ,  Andrew Tucker ,  Terry Chong ,  Raghavendran Hanumantharau ,  Dhanashree Kashid ,  Scott Daniel Wisniewski ,  Prithviraj Vasanth ,  Pranesh Radhakrishnan

IPC: H04L9/08 ,  G06F21/60 ,  G06F21/62

Abstract: Disclosed techniques relate to caching tenant encryption keys for a multi-tenant database. In some embodiments, a computing system encrypts data for a database in a multi-tenant database system using encryption keys assigned to respective tenants that are using the database. The computing system may store the encryption keys in a cache and, in response to a key rotation request for a first tenant, invalidate an entry in the cache for the first encryption key of the first tenant. The computing system may block writes for the first tenant until a new key is cached (e.g., based on retrieval from a key management system). In various embodiments, disclosed techniques may reduce encryption latency.

公开(公告)号：US20220188317A1

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

申请号：US17653820

申请日：2022-03-07

Applicant: salesforce.com, inc.

Inventor： Thomas Fanghaenel ,  Jameison Bear Martin ,  Nathaniel Wyatt ,  Diego Ongaro ,  Terry Chong

IPC: G06F16/2455 ,  G06F12/0891 ,  G06F16/22 ,  G06F16/84 ,  G06F16/172

Abstract: Techniques are disclosed relating to maintaining a cache usable to locate data stored in a data structure. A computer system, in various embodiments, maintains a data structure having a plurality of levels that store files for a database. The files may include one or more records that each have a key and corresponding data. The computer system may also maintain a cache for the database whose entries store, for a key, an indication of a location of a corresponding record in a file of the data structure. In some embodiments, the computer system receives a request to access a particular record stored in the data structure where the request specifies a key usable to locate the particular record. The computer system may retrieve, from the cache via the key, a particular indication of a location of the particular record and may use the particular indication to access the particular record.

公开(公告)号：US20220067004A1

公开(公告)日：2022-03-03

申请号：US17009605

申请日：2020-09-01

Applicant: salesforce.com, inc.

Inventor： Rohit Agrawal ,  Aditya Shetty ,  Kaushal Mittal ,  Terry Chong ,  Thomas Fanghaenel ,  Vaibhav Arora

IPC: G06F16/21 ,  G06F16/22

Abstract: Techniques are disclosed relating to merge operations for multi-level data structures, such as log-structured merge-trees (LSM trees). A computer system may store, in a database, a plurality of files as part of an LSM tree and a plurality of database key structures. A given one of the plurality of database key structures may indicate, for a corresponding one of the plurality of files, a set of key ranges derived from database records that are included in the corresponding file. The computer system may determine, using ones of the plurality of database key structures, a key range overlap that is indicative of an extent of overlap of key ranges from a set of the plurality of files with respect to a particular key range. Based on the determined key range overlap, the computer system may assign a priority level to a merge operation that involves the set of files.

公开(公告)号：US11238174B2

公开(公告)日：2022-02-01

申请号：US16263751

申请日：2019-01-31

Applicant: salesforce.com, inc.

Inventor： Terry Chong ,  Jameison Bear Martin ,  Thomas Fanghaenel ,  Andrew Tucker ,  Nathaniel Wyatt ,  Raghavendran Hanumantharau ,  Assaf Ben-Gur ,  William Charles Mortimore, Jr.

IPC: G06F21/62 ,  G06F16/2455 ,  G06F21/60 ,  H04L9/08

Abstract: System and methods of the disclosed subject matter provide segregating, at a memory storage coupled to a multitenant database system, first tenant data of a first tenant from at least second tenant data of a second tenant, based on a first tenant identifier. A first encryption key associated with the first tenant may be retrieved from a key cache memory based on the first tenant identifier, to encrypt one or more fragments of the first tenant data. The fragments of the first tenant data may be encrypted based on the retrieved encryption key. Non-encrypted header information may be generated for each of the encrypted fragments of the first tenant data, where the header information may have metadata including the first tenant identifier. The encrypted fragments of the first tenant data and the corresponding non-encrypted header information may be stored in the immutable storage.

公开(公告)号：US11061889B2

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

申请号：US16139166

申请日：2018-09-24

Applicant: salesforce.com, inc.

Inventor： Terry Chong ,  Jameison Bear Martin ,  Thomas Fanghaenel

IPC: G06F16/23 ,  G06F3/06 ,  G06F16/245

Abstract: Systems and methods are provided for receiving, at a database system having a memory and at least one persistent storage device to store records, a query for a least one record, where the query uses a first version of a manifest, and where each version of the records that are stored in the at least one persistent storage device are represented by metadata that is part of the first version of the manifest. A first operation may be performed based on a scan operation. The database system may determine whether a purge of the memory has occurred after the first operation. When it is determined that the memory purge has occurred, the scan operation may be restarted from a last position of the scan operation prior to the memory purge using a second version of the manifest.

公开(公告)号：US20200320081A1

公开(公告)日：2020-10-08

申请号：US16908006

申请日：2020-06-22

Applicant: salesforce.com, inc.

Inventor： Thomas Fanghaenel ,  Jameison Bear Martin ,  Nathaniel Wyatt ,  Diego Ongaro ,  Terry Chong

IPC: G06F16/2455 ,  G06F12/0891 ,  G06F16/22 ,  G06F16/84 ,  G06F16/172

Abstract: Techniques are disclosed relating to maintaining a cache usable to locate data stored in a data structure. A computer system, in various embodiments, maintains a data structure having a plurality of levels that store files for a database. The files may include one or more records that each have a key and corresponding data. The computer system may also maintain a cache for the database whose entries store, for a key, an indication of a location of a corresponding record in a file of the data structure. In some embodiments, the computer system receives a request to access a particular record stored in the data structure where the request specifies a key usable to locate the particular record. The computer system may retrieve, from the cache via the key, a particular indication of a location of the particular record and may use the particular indication to access the particular record.

公开(公告)号：US20200097205A1

公开(公告)日：2020-03-26

申请号：US16139717

申请日：2018-09-24

Applicant: salesforce.com, inc.

Inventor： Thomas Fanghaenel ,  Terry Chong ,  Jameison Bear Martin

IPC: G06F3/06 ,  G06F17/30

Abstract: A method of deleting tombstones early includes setting an initial-flag in a first record in the storage system, setting a delete-flag in a second record in the storage system, selecting a set of one or more records in the storage system to be written to an extent of the storage system in a merge operation, each of the one or more records being associated with the first key, and performing the merge operation, wherein the second record is not written to the extent during the merge operation based at least in part on a determination that the first record having the initial-flag set is the oldest record in the set and the second record having the delete-flag set is the newest record in the set.

公开(公告)号：US20190163613A1

公开(公告)日：2019-05-30

申请号：US16263067

申请日：2019-01-31

Applicant: salesforce.com, inc.

Inventor： Jameison Bear Martin ,  Subho Sanjay Chatterjee ,  Patrick James Helland ,  Nathaniel Wyatt ,  Thomas Fanghaenel ,  Terry Chong

IPC: G06F11/36 ,  G06F16/21 ,  G06F16/245

Abstract: Systems and methods are provided for creating a sandbox for an original tenant at a point in time, the original tenant having original tenant data stored in an immutable storage associated with an original tenant identifier, the original tenant data as of the sandbox creation point in time being a virtual snapshot of the original tenant data accessible by a sandbox tenant, where the sandbox tenant data can be changed without changing the original tenant data, and the original tenant data can be changed without changing the sandbox tenant data. A sandbox tenant is created by associating a sandbox tenant identifier with the virtual snapshot of the original tenant data and with sandbox tenant data created by the sandbox tenant subsequent to the sandbox creation point in time. Original tenant data is subsequently created and associated with the original tenant identifier, and is not accessible to the sandbox tenant.