System and method for providing randomly-accessible compacted data

US12468662B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12468662-B2
Application numberUS-202318491798-A
CountryUS
Kind codeB2
Filing dateOct 22, 2023
Priority dateOct 30, 2017
Publication dateNov 11, 2025
Grant dateNov 11, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

What is claimed is: 1 . A system for random-access manipulation of compacted data files, comprising: a computing system comprising a memory, a processor, and a non-volatile data storage device; a deconstruction subsystem 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 system to: deconstruct a data stream into a plurality of sourceblocks; encode the data stream using a reference codebook by: retrieving a codeword for each sourceblock from the reference codebook; where there is no codeword for a first sourceblock, generating a hash code as a new codeword and storing the first sourceblock and its newly-created codeword in the reference codebook; and storing the codewords corresponding to the data stream in a compacted data file; a reconstruction subsystem 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 system to: retrieve a plurality of codewords from the compacted data file received from a requesting process; decode each of the plurality of retrieved codewords by, for each retrieved codeword, retrieving the sourceblock associated with the respective codeword from the reference codebook; and provide the retrieved sourceblocks as a data stream to the requesting process; and a random-access subsystem 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 subsystem 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 . A method for random-access manipulation of compacted data files, comprising the steps of: deconstructing, at a deconstruction subsystem comprising a first plurality of programming instructions stored in a memory and operable on a processor of a computing system, a data stream into a plurality of sourceblocks; encoding the data stream using the reference codebook by retrieving a codeword for each sourceblock from the reference codebook; and where there is no codeword for a first sourceblock, generating a hash code as a new codeword and storing the first sourceblock and its newly-created codeword in the reference codebook; retrieving, at a reconstruction subsystem comprising a second plurality of programming instructions stored in the memory and operable on the processor, a plurality of codewords from a compacted data file; decoding each of the plurality of retrieved codewords by, for each retrieved codeword, retrieving the sourceblock associated with the respective codeword from the reference codebook; providing the retrieved sourceblocks as a data stream to the requesting process; receiving, at a random-access subsystem comprising a third 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 subsystem for decoding.

Assignees

Inventors

Classifications

  • Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

  • De-duplication techniques · CPC title

  • Saving storage space on storage systems · CPC title

  • Secure firmware programming, e.g. of basic input output system [BIOS] · CPC title

  • based on file chunks · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12468662B2 cover?
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 …
Who is the assignee on this patent?
Atombeam Technologies Inc
What technology area does this patent fall under?
Primary CPC classification G06F16/1752. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 11 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).