Bit-Sequence Index Storage for Secure Deduplicated File Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage methods face challenges in efficiently reducing data volume, ensuring data security, and complying with copyright laws, as they struggle with the exponential growth of data and the risk of loss or unauthorized access.
Innovation Solution
The implementation of a bit-sequence-storage system, where files are broken down into bit sequences and represented by symbols, allowing for significant data compression and deduplication, with index tables facilitating secure and efficient storage and retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored in traditional formats with replication and error encoding, then data security and reliability are improved, but data storage volume increases significantly
Solution Approach 1:
The patent segments data into fixed-size bit sequences (e.g., 128 bits) and represents each segment as a symbol in an index table. This segmentation allows for efficient storage where only unique bit sequences are stored once, eliminating redundant storage of duplicate data while maintaining data integrity through the indexing mechanism.
Solution Approach 2:
Instead of storing multiple copies of entire files or large portions of data, the patent creates symbolic representations (copies) of bit sequences in an index table. These symbolic copies allow rapid retrieval and reconstruction of original data without requiring physical duplication of the actual data bits, thus reducing storage volume while preserving data security.
2Quantity of substance
If data compression techniques are applied, then data storage volume is reduced, but data retrieval complexity increases
Solution Approach 1:
The patent performs preliminary organization of data into fixed-size bit sequences and pre-computes symbolic representations before storage. The index table is pre-built with symbols mapping to specific bit sequence positions, so that during retrieval, the system only needs to look up symbols and reconstruct data without performing complex compression or decompression operations in real-time.
Solution Approach 2:
The patent changes the representation parameter of data from continuous binary streams to discrete symbolic representations in an index table. Each bit sequence is transformed into a symbol that can be efficiently stored and retrieved, changing the fundamental parameter of data representation to simplify both storage and retrieval operations.
3Quantity of substance
If data deduplication is implemented, then storage efficiency is improved, but copyright compliance becomes challenging
Solution Approach 1:
The patent applies different handling rules to different portions of data at the bit sequence level. While duplicate bit sequences are consolidated in the index table for storage efficiency, the system maintains the ability to reconstruct complete unique copies of files when needed for copyright compliance. The local quality of each bit sequence representation can be adjusted based on licensing or access requirements.
Data Source
AI summary
A method for execution by a computing entity includes receiving a file retrieval request for a file. The method further includes accessing an index table regarding the file. The method further includes interpreting the index table to identify a plurality of bit sequences. The index table includes a plurality of symbols, where a symbol is representative of a bit sequence. The method further includes sending one or more requests to a network device regarding at least some of the plurality of bit sequences. The method further includes receiving a requested bit sequence in response to the one or more requests. The method further includes reconstructing a portion of the file based on the requested bit sequence and the index table.