×

Deleting records in a multi-level storage architecture without record locks

  • US 10,162,766 B2
  • Filed: 03/15/2013
  • Issued: 12/25/2018
  • Est. Priority Date: 04/30/2012
  • Status: Active Grant
First Claim
Patent Images

1. In a unified table architecture of an in-memory computing system having a multi-level storage architecture, the multi-level storage architecture having a first level storage structure to store incoming data requests in a logical row format as data records, a second level storage structure to encode and store the data records in a logical column format, and a main memory to compress and store the encoded data records for long-term storage, the main memory being partitioned into a passive main part and an active main part, a method comprising:

  • determining, by one or more processors, whether a record of the data records located in the first level storage structure has an uncommitted write operation;

    if the record has the uncommitted write operation, keeping, by the one or more processors, the record in the first level storage structure;

    if the record does not have the uncommitted write operation;

    executing, by the one or more processors, data change operations on the record;

    moving, by the one or more processors, the record from the first level storage to the second level storage;

    adding, by the one or more processors, record-moved version information to the record to designate that the record has been moved from the first level storage structure to the second level storage structure; and

    merging, by the one or more processors, the record in the second level storage structure into the active main part, the merging into the active main part being based on an encoding scheme specific to a dictionary of the active main part, the dictionary of the active main part being separate from and dependent on a dictionary of the passive main part.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×