Sign In to Follow Application
View All Documents & Correspondence

Method And System For Data Compression And Data Storage Optimization

Abstract: This disclosure relates to method and system for data compression and data storage optimization. The method of writing optimized data on a storage device may include assigning a unique virtual address to each data block, converting each data block into a matrix, reducing each data block by processing the corresponding matrix to form a minimum state matrix based on a set of sequential rules, deriving a granular metadata for each data block based on the corresponding minimum state matrix and the corresponding set of sequential rules, and storing the granular metadata for each data block on the storage device at a physical address mapped to the unique virtual address of that data block. Further, the method of reading data optimally stored on the storage device may include generating each data block by back-propagating the granular metadata, stored at the physical address, for each corresponding data block.

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
29 September 2018
Publication Number
14/2020
Publication Type
INA
Invention Field
COMPUTER SCIENCE
Status
Email
bangalore@knspartners.com
Parent Application
Patent Number
Legal Status
Grant Date
2023-09-22
Renewal Date

Applicants

WIPRO LIMITED
Doddakannelli, Sarjapur Road, Bangalore 560035, Karnataka, India.

Inventors

1. RISHAV DAS
33/1 Nandi Bagan Bye Lane, P.O.: Salkia, P.S: Golabari (Howrah City Police), Howrah - 711106, West Bengal

Specification

1. A method of writing optimized data on a storage device, the method comprising:
assigning, by a read/write device, a unique virtual address to each of a plurality of data
blocks of a pre-defined data block size;
converting, by the read/write device, each of the plurality of data blocks into a matrix of a pre-defined matrix size;
reducing, by the read/write device, each of the plurality of data blocks by processing the corresponding matrix to form a minimum state matrix based on a set of sequential rules;
deriving, by the read/write device, a granular metadata for each of the plurality of data blocks based on the corresponding minimum state matrix and the corresponding set of sequential rules; and
storing, by the read/write device, the granular metadata for each of the plurality of data blocks on the storage device at a physical address, which is mapped to the corresponding unique virtual address for each of the plurality of data blocks.
2. The method of claim 1, further comprising at least one of:
slicing an original data block into the plurality of data blocks; or
deduplicating the plurality of data blocks data by removing one or more redundant data blocks or by removing one or more redundant data chunks within each of the plurality of data blocks.
3. The method of claim 1, wherein the pre-defined block size is dependent on at least one of a computing platform or a data storage platform implementing the read/write device.
4. The method of claim 1, wherein the pre-defined matrix size comprises a fixed number of columns and N number of rows, and wherein N is determined based on the pre-defined data block size.
5. The method of claim 1, wherein processing the corresponding matrix to form the minimum state matrix comprises reorganizing matrix so as to form an identity matrix or a near identity matrix.

6. The method of claim 1, wherein storing the granular metadata further comprises:
generating a key hash table by compressing the granular metadata; and
storing the key hash table for each of the plurality of data blocks at the physical address.
7. A method of reading data optimally stored on a storage device, the method comprising:
receiving, by a read/write device, a unique virtual address of each of a plurality of data
blocks of a pre-defined data block size;
accessing, by a read/write device, a granular metadata for each of the plurality of data blocks from a physical address of the storage device, wherein the physical address is mapped to the corresponding unique virtual address for each of the plurality of data blocks;
deriving, by the read/write device, a minimum state matrix and a set of sequential rules for each of the plurality of data blocks based on the corresponding granular metadata;
expanding, by the read/write device, each of the plurality of data blocks by processing the corresponding minimum state matrix to form a matrix, of a pre-defined matrix size, based on the corresponding set of sequential rules; and
building, by the read/write device, each of the plurality of data blocks from the corresponding matrix.
8. The method of claim 7, wherein accessing the granular metadata further comprises:
accessing a key hash table for each of the plurality of data blocks from the physical
address, wherein the key hash table is formed by compressing the granular metadata; and reconstructing the granular metadata from the key hash table.
9. The method of claim 7, wherein deriving the minimum state matrix comprises parsing the granular metadata and assigning respective value to each of a plurality of elements of the minimum state matrix.
10. The method of claim 7, wherein processing the corresponding minimum state matrix to form the matrix comprises computing value of each of a plurality of elements of the matrix based on the minimum state matrix by back-propagating the set of sequential rules.
11. The method of claim 7, further comprising concatenating the plurality of data blocks into an original data block based on the corresponding unique virtual addresses.

12. A system for writing optimized data on a storage device, the system comprising:
a read/write device comprising at least one processor and a memory for storing instructions that, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
assigning a unique virtual address to each of a plurality of data blocks of a pre-defined data block size;
converting each of the plurality of data blocks into a matrix of a pre-defined matrix size;
reducing each of the plurality of data blocks by processing the corresponding matrix to form a minimum state matrix based on a set of sequential rules;
deriving a granular metadata for each of the plurality of data blocks based on the corresponding minimum state matrix and the corresponding set of sequential rules; and
storing the granular metadata for each of the plurality of data blocks on the storage device at a physical address, which is mapped to the corresponding unique virtual address for each of the plurality of data blocks.
13. The system of claim 12, wherein the operations further comprise at least one of:
slicing an original data block into the plurality of data blocks; or
deduplicating the plurality of data blocks data by removing one or more redundant data blocks or by removing one or more redundant data chunks within each of the plurality of data blocks.
14. The system of claim 12, wherein processing the corresponding matrix to form the
minimum state matrix comprises reorganizing matrix so as to form an identity matrix or a near
identity matrix.
15. The system of claim 12, wherein storing the granular metadata further comprises:
generating a key hash table by compressing the granular metadata; and
storing the key hash table for each of the plurality of data blocks at the physical address.

16. A system for reading data optimally stored on a storage device, the system comprising:
a read/write device comprising at least one processor and a memory for storing instructions that, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
receiving a unique virtual address of each of a plurality of data blocks of a pre-defined data block size;
accessing a granular metadata for each of the plurality of data blocks from a physical address of the storage device, wherein the physical address is mapped to the corresponding unique virtual address for each of the plurality of data blocks;
deriving a minimum state matrix and a set of sequential rules for each of the plurality of data blocks based on the corresponding granular metadata;
expanding each of the plurality of data blocks by processing the corresponding minimum state matrix to form a matrix, of a pre-defined matrix size, based on the corresponding set of sequential rules; and
building each of the plurality of data blocks from the corresponding matrix.
17. The system of claim 16, wherein accessing the granular metadata further comprises:
accessing a key hash table for each of the plurality of data blocks from the physical
address, wherein the key hash table is formed by compressing the granular metadata; and reconstructing the granular metadata from the key hash table.
18. The system of claim 16, wherein deriving the minimum state matrix comprises parsing the granular metadata and assigning respective value to each of a plurality of elements of the minimum state matrix.
19. The system of claim 16, wherein processing the corresponding minimum state matrix to form the matrix comprises computing value of each of a plurality of elements of the matrix based on the minimum state matrix by back-propagating the set of sequential rules.

20. The system of claim 16, wherein the operations further comprise concatenating the plurality of data blocks into an original data block based on the corresponding unique virtual addresses.

Documents

Application Documents

# Name Date
1 201841036895-PROOF OF ALTERATION [20-12-2023(online)].pdf 2023-12-20
1 201841036895-STATEMENT OF UNDERTAKING (FORM 3) [29-09-2018(online)].pdf 2018-09-29
2 201841036895-REQUEST FOR EXAMINATION (FORM-18) [29-09-2018(online)].pdf 2018-09-29
3 201841036895-POWER OF AUTHORITY [29-09-2018(online)].pdf 2018-09-29
4 201841036895-FORM 18 [29-09-2018(online)].pdf 2018-09-29
5 201841036895-FORM 1 [29-09-2018(online)].pdf 2018-09-29
6 201841036895-DRAWINGS [29-09-2018(online)].pdf 2018-09-29
7 201841036895-DECLARATION OF INVENTORSHIP (FORM 5) [29-09-2018(online)].pdf 2018-09-29
8 201841036895-COMPLETE SPECIFICATION [29-09-2018(online)].pdf 2018-09-29
9 abstract 201841036895.jpg 2018-10-01
10 201841036895-Request Letter-Correspondence [09-10-2018(online)].pdf 2018-10-09
11 201841036895-Power of Attorney [09-10-2018(online)].pdf 2018-10-09
12 201841036895-Form 1 (Submitted on date of filing) [09-10-2018(online)].pdf 2018-10-09
13 201841036895-Proof of Right (MANDATORY) [01-05-2019(online)].pdf 2019-05-01
14 Correspondence by Agent _Form-1 _06-05-2019.pdf 2019-05-06
15 201841036895-OTHERS [14-07-2021(online)].pdf 2021-07-14
16 201841036895-FER_SER_REPLY [14-07-2021(online)].pdf 2021-07-14
17 201841036895-DRAWING [14-07-2021(online)].pdf 2021-07-14
18 201841036895-COMPLETE SPECIFICATION [14-07-2021(online)].pdf 2021-07-14
19 201841036895-CLAIMS [14-07-2021(online)].pdf 2021-07-14
20 201841036895-FER.pdf 2021-10-17
21 201841036895-PatentCertificate22-09-2023.pdf 2023-09-22
22 201841036895-IntimationOfGrant22-09-2023.pdf 2023-09-22
23 201841036895-PROOF OF ALTERATION [20-12-2023(online)].pdf 2023-12-20

Search Strategy

1 2021-01-1516-11-36E_15-01-2021.pdf

ERegister / Renewals

3rd: 19 Dec 2023

From 29/09/2020 - To 29/09/2021

4th: 20 Dec 2023

From 29/09/2021 - To 29/09/2022

5th: 20 Dec 2023

From 29/09/2022 - To 29/09/2023

6th: 20 Dec 2023

From 29/09/2023 - To 29/09/2024

7th: 26 Sep 2024

From 29/09/2024 - To 29/09/2025

8th: 25 Sep 2025

From 29/09/2025 - To 29/09/2026