IP Library Granted Patent US 11,809,728
Granted Patent B2
US 11,809,728 · App. 16/250,859 · Granted Nov 7, 2023

Data storage method for massive datasets

Inventors: Julian Coccia (Malmö, SE); Daniel Akerud (Staffanstorp, SE)
Assignee: Snyk Sweden AB
G06F3/0647G06F3/0604G06F3/0619G06F3/0661G06F3/0673G06F7/14G06F11/1004G06F16/2365G06F16/258G06F21/602
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,809,728
App. No.
16/250,859
Granted
Nov 7, 2023
Kind
B2
Abstract

Systems and methods for storing data in an intermediate format for storing, converting the intermediate data format into a production data format of two data volumes, and merging the two data volumes into one data volume.

Claims (12)

1. A data processing method comprising:

storing data in an intermediate format, the intermediate format comprising at least two data volumes, and

merging and converting by a converter unit the data in an intermediate format into a production format by using cryptographic algorithm processing, the production format including an index file and a data file.

2. The data processing method of claim 1 where the index file contains a data index being expressed in a binary form and includes fixed-length data pointers to data records in its associated data file.

3. The data processing method of claim 1 where the data file comprises a plurality of data records, each data record contains a header describing at least one of a data record length and an integrity checksum.

4. The data processing method of claim 1 where the at least two data volumes are retrieved by performing a search on the index file, obtaining a data location from a pointer, and obtaining a data length by subtracting a value associated with the pointer from a selected one of the data volume length and a value associated with a pointer for a next sequential data record.

5. A data system comprising:

a storage unit that stores data in an intermediate format, comprising at least two data volumes, and

a converter unit that merges and converts the data in an intermediate format into a production format by using cryptographic algorithm processing, the production format including an index file and a data file.

6. The data system of claim 5 where the index file contains a data index being expressed in a binary form and includes fixed-length data pointers to data records in its associated data file.

7. The data system of claim 5 where the data file comprises a plurality of data records, each data record contains a header describing the data record length and an optional integrity checksum.

8. The data system of claim 5 where the at least two data volumes are retrieved by performing a search on the index file, obtaining a data location from a pointer, and obtaining a data length by subtracting a value associated with the pointer from a selected one of the data volume length and a value associated with a pointer for a next sequential data record.

Assignments (2)
CHANGE OF NAME Recorded Feb 16, 2023
From: FOSSID AB
To: SNYK SWEDEN AB
Reel/Frame 062776/0982 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 21, 2020
From: COCCIA, JULIAN; AKERUD, DANIEL
To: FOSSID AB
Reel/Frame 054173/0963 →
Continuity (1)
Related Publication 20200233599A1 · Jul 23, 2020