PREDICATE BASED DATA DELETION

• US 20180260407A1
• Filed: 03/07/2017
• Published: 09/13/2018
• Est. Priority Date: 03/07/2017
• Status: Active Grant

• Current Assignee: Salesforce.com, Inc.
• Original Assignee: Salesforce.com, Inc.
• Inventors: Hofhansl, Lars
• Granted Patent: US 10,733,148 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/162 Delete operations erasing in storage systems G06F3/0652
• CPC Class Codes: G06F 16/1744 using compression, e.g. sparse files
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases

Abstract

A database may delete rows of data based on one or more predicate parameters. A method of data storage includes receiving a delete request for a database, where the delete request includes one or more predicate parameters and adding the predicate parameters to a set of deletion predicate parameters in metadata of the database. The method may further include performing a compaction of the database, where the compaction includes rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters.

Claims

1. A method for data storage, comprising:

receiving a delete request for a database, wherein the delete request comprises one or more predicate parameters;

adding the one or more predicate parameters to a set of deletion predicate parameters in metadata of the database; and

performing a compaction of the database, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters.

2. The method of claim 1, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters, unless the data element is marked with a delete marker, or unless a threshold time indicated by a time-to-live (TTL) value has passed since a timestamp of the data element.

3. The method of claim 1, further comprising:

receiving a subsequent delete request for the database, wherein the subsequent delete request comprises an identifier for a data element; and

writing a delete marker in line with the data element associated with the identifier.

4. The method of claim 3, further comprising:

refraining from writing a delete marker for the delete request based at least in part on the delete request comprising the one or more predicate parameters.

5. The method of claim 1, further comprising:

receiving a subsequent delete request for the database, wherein the subsequent delete request comprises a TTL value.

6. The method of claim 1, wherein the one or more predicate parameters corresponds to a data element in the database at the time the data element is initially written to the database.

7. The method of claim 1, wherein each of the one or more predicate parameters is associated with a plurality of data elements of the database.

8. The method of claim 1, wherein the one or more predicate parameters consist of an organization identifier, a data size identifier, a data owner identifier, a version identifier, or a combination thereof.

9. The method of claim 1, wherein the database is structured in a log-structured merge-tree format.

10. The method of claim 1, wherein the database comprises a write-ahead logging (WAL) database.

11. An apparatus for data storage, in a system comprising:

a processor;

memory in electronic communication with the processor; and

instructions stored in the memory and operable, when executed by the processor, to cause the apparatus to;

receive a delete request for a database, wherein the delete request comprises one or more predicate parameters;

add the one or more predicate parameters to a set of deletion predicate parameters in metadata of the database; and

perform a compaction of the database, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters.

12. The apparatus of claim 11, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters, unless the data element is marked with a delete marker, or unless a threshold time indicated by a time-to-live (TTL) value has passed since a timestamp of the data element.

13. The apparatus of claim 11, wherein the instructions are further executable by the processor to:

receive a subsequent delete request for the database, wherein the subsequent delete request comprises an identifier for a data element; and

write a delete marker in line with the data element associated with the identifier.

14. The apparatus of claim 13, wherein the instructions are further executable by the processor to:

refrain from writing a delete marker for the delete request based at least in part on the delete request comprising the one or more predicate parameters.

15. The apparatus of claim 11, wherein the instructions are further executable by the processor to:

receive a subsequent delete request for the database, wherein the subsequent delete request comprises a TTL value.

16. A non-transitory computer readable medium storing code for data storage, the code comprising instructions executable by a processor to:

receive a delete request for a database, wherein the delete request comprises one or more predicate parameters;

add the one or more predicate parameters to a set of deletion predicate parameters in metadata of the database; and

perform a compaction of the database, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters.

17. The non-transitory computer-readable medium of claim 16, wherein the compaction comprises rewriting each data element of the database unless a key of the data element corresponds to at least one of the set of deletion predicate parameters, unless the data element is marked with a delete marker, or unless a threshold time indicated by a time-to-live (TTL) value has passed since a timestamp of the data element.

18. The non-transitory computer-readable medium of claim 16, wherein the instructions are further executable by the processor to:

receive a subsequent delete request for the database, wherein the subsequent delete request comprises an identifier for a data element; and

write a delete marker in line with the data element associated with the identifier.

19. The non-transitory computer-readable medium of claim 18, wherein the instructions are further executable by the processor to:

refrain from writing a delete marker for the delete request based at least in part on the delete request comprising the one or more predicate parameters.

20. The non-transitory computer-readable medium of claim 16, wherein the instructions are further executable by the processor to:

receive a subsequent delete request for the database, wherein the subsequent delete request comprises a TTL value.