IP Library › Granted Patent US 11,609,882
Granted Patent B2
US 11,609,882 · App. 17/734,052 · Granted Mar 21, 2023

System and method for random-access manipulation of compacted data files

Inventors: Aliasghar Riahi (Orinda, CA); Joshua Cooper (Columbia, SC); Mojgan Haddad (Orinda, CA); Charles Yeomans (Orinda, CA)
Assignee: ATOMBEAM TECHNOLOGIES INC
G06F16/1752G06F3/067G06F3/0608G06F3/0641
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,609,882
App. No.
17/734,052
Filed
Apr 30, 2022
Granted
Mar 21, 2023
Kind
B2
Art Unit
2136
USPC
707/692
Abstract

A system and method for random-access manipulation of compacted data files, utilizing a reference codebook, a random-access engine, a data deconstruction engine, and a data deconstruction engine. The system may receive a data query pertaining to a data read or data write request, wherein the data file to be read from or written to is a compacted data file. A random-access engine may facilitate data manipulation processes by accessing a reference codebook associated with the compacted data file, a frequency table used to construct the reference codebook, and data query details. A data read request is supported by random-access search capabilities that may enable the locating and decoding of the bits corresponding to data query details. A random-access engine facilitates data write processes. The random-access engine may encode the data to be written, insert the encoded data into a compacted data file, and update the codebook as needed.

Claims (32)

1. A system for random-access manipulation of compacted data files, comprising:

a computing device comprising a memory, a processor, and a non-volatile data storage device;

at least one optimized hash-based reference codebook;

a reconstruction engine comprising a first plurality of programming instructions stored in the memory and operable on the processor, wherein the first plurality of programming instructions, when operating on the processor, cause the computing device to:

retrieve a plurality of reference codes from a compacted data file;

decode each of the plurality of retrieved reference codes by, for each retrieved reference code, retrieving the chunklet associated with the respective reference code from the reference codebook; and

provide the retrieved chunklets as a data stream to the requesting process; and

a random access engine comprising a second plurality of programming instructions stored in the memory and operating on the processor, wherein the second plurality of programming instructions, when operating on the processor, cause the computing device to:

receive a data search query;

estimate, using an estimator module, a first starting bit location in the compacted data file;

refine the first starting bit location by:

determining whether a bit sequence starting at the first starting bit location corresponds to a codeword boundary and, if not, traversing the reference codebook until a codeword boundary is located at a new starting bit;

traversing from the new starting bit until a start codeword corresponding to the beginning of the data search query is identified; and

sending the first start codeword and a plurality of immediately following codewords from the compacted data file to the reconstruction engine for decoding.

2. The system of claim 1 , further comprising a deconstruction engine comprising a third plurality of programming instructions stored in the memory and operable on the processor, wherein the third plurality of programming instructions, when operating on the processor, cause the computing device to:

deconstruct a data stream into a plurality of data chunklets;

encode the data stream using the reference codebook by:

retrieving a reference code for each chunklet from the reference codebook; and

where there is no reference code for a first chunklet, generating a hash code as a new reference code and storing the first chunklet and its newly-created reference code in the reference codebook.

3. A method for random-access manipulation of compacted data files, comprising the steps of:

retrieving, at a reconstruction engine comprising a first plurality of programming instructions stored in a memory and operable on a processor, wherein the first plurality of programming instructions, a plurality of reference codes from a compacted data file;

decoding each of the plurality of retrieved reference codes by, for each retrieved reference code, retrieving the chunklet associated with the respective reference code from the reference codebook;

providing the retrieved chunklets as a data stream to the requesting process;

receiving, at a random access engine comprising a second plurality of programming instructions stored in the memory and operating on the processor, a data search query;

estimating, using an estimator module of the random access engine, a first starting bit location in the compacted data file;

refining the first starting bit location by determining whether a bit sequence starting at the first starting bit location corresponds to a codeword boundary and, if not, traversing the reference codebook until a codeword boundary is located at a new starting bit;

traversing from the new starting bit until a start codeword corresponding to the beginning of the data search query is identified; and

sending the first start codeword and a plurality of immediately following codewords from the compacted data file to the reconstruction engine for decoding.

4. The method of claim 3 , further comprising the steps of:

deconstructing, at a deconstruction engine comprising a third plurality of programming instructions stored in the memory and operable on the processor, a data stream into a plurality of data chunklets;

encoding the data stream using the reference codebook by retrieving a reference code for each chunklet from the reference codebook; and

where there is no reference code for a first chunklet, generating a hash code as a new reference code and storing the first chunklet and the its newly-created reference code in the reference codebook.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 29, 2022
From: RIAHI, ALISGHAR; COOPER, JOSHUA; HADDAD, MOJGAN; YEOMANS, CHARLES
To: ATOMBEAM TECHNOLOGIES INC
Reel/Frame 060360/0413 →
Continuity (11)
Continuation 17180439 · Feb 19, 2021
Continuation In Part 16923039 · Jul 7, 2020
Continuation In Part 16716098 · Dec 16, 2019
Continuation 16455655 · Jun 27, 2019
Continuation In Part 16200466 · Nov 26, 2018
Continuation In Part 15975741 · May 9, 2018
Provisional Application 63140111 · Jan 21, 2021
Provisional Application 63027166 · May 19, 2020
Provisional Application 62926723 · Oct 28, 2019
Provisional Application 62578824 · Oct 30, 2017
Related Publication 20220335014A1 · Oct 20, 2022