Sign In to Follow Application
View All Documents & Correspondence

System And Method For Optimally Managing Heterogeneous Data In A Distributed Storage Environment

Abstract: The present disclosure relates to systems, methods, and non-transitory computer-readable media for optimally managing heterogeneous data in a distributed environment in real time. The method comprises initializing a first storage pool capable of storing data from one or more sources, the first storage pool being distributed across one or more computing devices. Then data from the one or more sources may be stored in the first storage pool. Subsequently, one or more memory pools may be generated in a second storage pool based on amount of data to be stored in the first storage pool and one or more parameters associated with the data stored in the first storage pool. Finally, metadata is created in a first memory pool of the one or more memory pools for the data stored in the first storage pool, the metadata capable of retrieving the data stored in the first storage pool in real-time FIG. 2

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
24 September 2014
Publication Number
41/2014
Publication Type
INA
Invention Field
COMPUTER SCIENCE
Status
Email
ipr@akshipassociates.com
Parent Application
Patent Number
Legal Status
Grant Date
2023-02-09
Renewal Date

Applicants

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

Inventors

1. ABHISHEK SUMAN
House - Swastika Vihar, Ranchi Road, Opp. Laxmi Petrol Pump, PO: Bihar Sharif, Dist: Nalanda, Bihar – 803101, India.

Specification

CLIAMS:We claim:

1. A method for optimally managing data in a distributed storage environment, the method comprising:
initializing a first storage pool capable of storing data from one or more sources, the first storage pool being distributed across one or more computing devices;
storing data from the one or more sources in the first storage pool;
generating one or more memory pools in a second storage pool based on amount of data to be stored in the first storage pool and one or more parameters associated with the data stored in the first storage pool; and
creating metadata in a first memory pool of the one or more memory pools for the data stored in the first storage pool, the metadata capable of retrieving the data stored in the first storage pool in real-time.

2. The method of claim 1, wherein the metadata comprises at least one of location of the data, access rights associated with the data, number of copies of the data, status of the data, retention period of the data, location of the nearest copy of the data across the one or more computing devices.

3. The method of claim 1, further comprising:
performing one or more operations associated with the data stored in the first storage pool; and
updating the metadata in the second storage pool in response to performing the one or more operations associated with the data stored in the first storage pool.

4. The method of claim 1, further comprising;
receiving a request to retrieve a first data from the first storage pool;
fetching a map indicative of the location of the first data in the first storage pool; and
fetching a nearest copy of the first data using the map.

5. The method of claim 1, wherein initializing the first storage pool further comprises:
initiating one or more services on the one or more computing devices to provide storage capacity of the first storage pool;
sharing the storage capacity by the one or more computing devices among themselves.

6. The method of claim 1, further comprising generating a cache data store in a second memory pool of the one or more memory pools, the cache data store capable of storing at least a portion of the data, the portion of the data being frequently accessed data.

7. The method of claim 1, further comprising:
occurring of a failure in at least one of the one or more computing devices;
circulating the information regarding the failure to the metadata stored in the first storage pool;
creating one or more redundant copies of the data corrupted by the failure; and
updating the metadata in response to creating one or more redundant copies of the data.

8. The method of claim 1, wherein the first storage pool comprises a persistent storage and wherein the second storage pool comprises a volatile random access memory.

9. The method of claim 1, further comprising:
providing concurrent and exclusive access to multiple users of the first storage pool in real-time using semaphores and Mutex index.

10. The method of claim 1, further comprising:
grouping similar type of data together for faster access.

11. A system for optimally managing data in a distributed storage environment, the system comprising:
one or more hardware processors;
a computer-readable medium storing instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
initializing a first storage pool capable of storing data from one or more sources, the first storage pool being distributed across one or more computing devices;
storing data from the one or more sources in the first storage pool;
generating one or more memory pools in a second storage pool based on amount of data to be stored in the first storage pool and one or more parameters associated with the data stored in the first storage pool, the second storage pool being distributed across the one or more computing devices; and
creating metadata in a first memory pool of the one or more memory pools for the data stored in the first storage pool, the metadata capable of retrieving the data stored in the first storage pool in real-time.

12. The system of claim 11, wherein the metadata comprises at least one of a location of the data, access rights associated with the data, number of copies of the data, status of the data, retention period of the data, location of the nearest copy of the data across the one or more computing devices.

13. The system of claim 11, wherein the computer –readable medium stores further instructions, that when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
performing one or more operations associated with the data stored in the first storage pool; and
updating the metadata in the second storage pool in response to performing the one or more operations associated with the data stored in the first storage pool.

14. The system of claim 11, wherein the computer –readable medium stores further instructions, that when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
receiving a request to retrieve a first data from the first storage pool;
fetching a map indicative of the location of the first data in the first storage pool; and
fetching a nearest copy of the first data using the map.

15. The system of claim 11, wherein the operation of initializing the first storage pool comprises:
initiating one or more services on the one or more computing devices to provide storage capacity of the first storage pool;
sharing the storage capacity by the one or more computing devices among themselves;

16. The system of claim 11, wherein the computer –readable medium stores further instructions, that when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
generating a cache data store in a second memory pool of the one or more memory pools, the cache data store capable of storing at least a portion of the data, the portion of the data being frequently accessed data.

17. The system of claim 11, wherein the computer –readable medium stores further instructions, that when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
occurring of a failure in at least one of the one or more computing devices;
circulating the information regarding the failure to the metadata stored in the first storage pool;
creating one or more redundant copies of the data corrupted by the failure; and
updating the metadata in response to creating one or more redundant copies of the data.

18. The system of claim 11, wherein the first storage pool comprises a volatile random access memory and wherein the second storage pool comprises a persistent storage.

19. A non-transitory computer-readable medium storing instructions for optimally managing data in a distributed storage environment that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
initializing a first storage pool capable of storing data from one or more sources, the first storage pool being distributed across one or more computing devices;
storing data from one or more sources in the first storage pool;
generating one or more memory pools in a second storage pool based on amount of data to be stored in the first storage pool and one or more parameters associated with the data stored in the first storage pool, the second storage pool being distributed across the one or more computing devices; and
creating metadata in a first memory pool of the one or more memory pools for the data stored in the first storage pool, the metadata capable of retrieving the data stored in the first storage pool in real-time.
Dated this 24th day of September, 2014
Swetha S.N
Of K&S Partners
Agent for the Applicant
,TagSPECI:TECHNICAL FIELD
The present disclosure relates generally to managing data, and more particularly but not limited to optimally managing heterogeneous data in a distributed storage environment in real time.

Documents

Application Documents

# Name Date
1 4676-CHE-2014 FORM-9 24-09-2014.pdf 2014-09-24
1 4676-CHE-2014-IntimationOfGrant09-02-2023.pdf 2023-02-09
2 4676-CHE-2014 FORM-18 24-09-2014.pdf 2014-09-24
2 4676-CHE-2014-PatentCertificate09-02-2023.pdf 2023-02-09
3 IP28499-spec.pdf 2014-09-26
3 4676-CHE-2014-FORM 3 [25-01-2023(online)].pdf 2023-01-25
4 IP28499-fig.pdf 2014-09-26
4 4676-CHE-2014-PETITION UNDER RULE 137 [25-01-2023(online)].pdf 2023-01-25
5 FORM 5-IP28499.pdf 2014-09-26
5 4676-CHE-2014-Written submissions and relevant documents [25-01-2023(online)].pdf 2023-01-25
6 FORM 3-IP28499.pdf 2014-09-26
6 4676-CHE-2014-AMENDED DOCUMENTS [06-01-2023(online)].pdf 2023-01-06
7 abstract4658-CHE-2014.jpg 2014-09-26
7 4676-CHE-2014-Correspondence to notify the Controller [06-01-2023(online)].pdf 2023-01-06
8 4676CHE2014_CertifiedCopyRequest.pdf 2014-09-29
8 4676-CHE-2014-FORM 13 [06-01-2023(online)].pdf 2023-01-06
9 4676-CHE-2014-POA [06-01-2023(online)].pdf 2023-01-06
9 4676-CHE-2014-Request For Certified Copy-Online(29-09-2014).pdf 2014-09-29
10 4676-CHE-2014 POWER OF ATTORNEY 16-12-2014.pdf 2014-12-16
10 4676-CHE-2014-US(14)-HearingNotice-(HearingDate-10-01-2023).pdf 2022-12-29
11 4676-CHE-2014 FORM-1 16-12-2014.pdf 2014-12-16
11 4676-CHE-2014-FER_SER_REPLY [07-05-2020(online)].pdf 2020-05-07
12 4676-CHE-2014 CORRESPONDENCE OTHERS 16-12-2014.pdf 2014-12-16
12 4676-CHE-2014-FORM 3 [06-05-2020(online)].pdf 2020-05-06
13 4676-CHE-2014-Information under section 8(2) [06-05-2020(online)].pdf 2020-05-06
13 4676CHE2014_Prioritydocumentrequest.pdf 2015-07-08
14 4676-CHE-2014-FER.pdf 2019-11-07
15 4676-CHE-2014-Information under section 8(2) [06-05-2020(online)].pdf 2020-05-06
15 4676CHE2014_Prioritydocumentrequest.pdf 2015-07-08
16 4676-CHE-2014 CORRESPONDENCE OTHERS 16-12-2014.pdf 2014-12-16
16 4676-CHE-2014-FORM 3 [06-05-2020(online)].pdf 2020-05-06
17 4676-CHE-2014-FER_SER_REPLY [07-05-2020(online)].pdf 2020-05-07
17 4676-CHE-2014 FORM-1 16-12-2014.pdf 2014-12-16
18 4676-CHE-2014-US(14)-HearingNotice-(HearingDate-10-01-2023).pdf 2022-12-29
18 4676-CHE-2014 POWER OF ATTORNEY 16-12-2014.pdf 2014-12-16
19 4676-CHE-2014-POA [06-01-2023(online)].pdf 2023-01-06
19 4676-CHE-2014-Request For Certified Copy-Online(29-09-2014).pdf 2014-09-29
20 4676-CHE-2014-FORM 13 [06-01-2023(online)].pdf 2023-01-06
20 4676CHE2014_CertifiedCopyRequest.pdf 2014-09-29
21 4676-CHE-2014-Correspondence to notify the Controller [06-01-2023(online)].pdf 2023-01-06
21 abstract4658-CHE-2014.jpg 2014-09-26
22 4676-CHE-2014-AMENDED DOCUMENTS [06-01-2023(online)].pdf 2023-01-06
22 FORM 3-IP28499.pdf 2014-09-26
23 4676-CHE-2014-Written submissions and relevant documents [25-01-2023(online)].pdf 2023-01-25
23 FORM 5-IP28499.pdf 2014-09-26
24 4676-CHE-2014-PETITION UNDER RULE 137 [25-01-2023(online)].pdf 2023-01-25
24 IP28499-fig.pdf 2014-09-26
25 IP28499-spec.pdf 2014-09-26
25 4676-CHE-2014-FORM 3 [25-01-2023(online)].pdf 2023-01-25
26 4676-CHE-2014-PatentCertificate09-02-2023.pdf 2023-02-09
26 4676-CHE-2014 FORM-18 24-09-2014.pdf 2014-09-24
27 4676-CHE-2014-IntimationOfGrant09-02-2023.pdf 2023-02-09
27 4676-CHE-2014 FORM-9 24-09-2014.pdf 2014-09-24

Search Strategy

1 4676CHE2014_31-10-2019.pdf

ERegister / Renewals

3rd: 08 May 2023

From 24/09/2016 - To 24/09/2017

4th: 08 May 2023

From 24/09/2017 - To 24/09/2018

5th: 08 May 2023

From 24/09/2018 - To 24/09/2019

6th: 08 May 2023

From 24/09/2019 - To 24/09/2020

7th: 08 May 2023

From 24/09/2020 - To 24/09/2021

8th: 08 May 2023

From 24/09/2021 - To 24/09/2022

9th: 08 May 2023

From 24/09/2022 - To 24/09/2023

10th: 06 Feb 2024

From 24/09/2023 - To 24/09/2024

11th: 12 Sep 2024

From 24/09/2024 - To 24/09/2025

12th: 22 Sep 2025

From 24/09/2025 - To 24/09/2026