Fetching Query Results Through Cloud Object Stores
US-2024394271-A1 · Nov 28, 2024 · US
US10120575B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10120575-B2 |
| Application number | US-201514672889-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 30, 2015 |
| Priority date | Mar 31, 2014 |
| Publication date | Nov 6, 2018 |
| Grant date | Nov 6, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments of the present disclosure provide a method and apparatus for dynamic storage tiering by calculating a density of data according to a temperature of the data, and making the density of data with a higher temperature smaller; obtaining density threshold of each of the tiers, wherein the density threshold of an upper tier is smaller than that of a lower tier; comparing the density of the data with the density threshold of each of the tiers to determine which tier the data should be moved to; and moving the data to the determined tier. Embodiments of the present invention may be used to provide a dynamic storage tiering scheme with higher flexibility and scalability.
Opening claim text (preview).
What is claimed is: 1. A method for dynamic storage tiering comprising: computing a density of data according to a temperature associated with data, wherein a higher temperature of data indicates a smaller density of data; obtaining a density threshold of each of a plurality or tiers, wherein the density threshold of an upper tier is assigned to be smaller than the density threshold of a lower tier; comparing the density of data with the density threshold of each of the plurality of tiers to determine which tier amongst the plurality of tiers the data should be moved to; moving the data to the determined tier; wherein the density threshold of each of the plurality of tiers is enabled to be modified; performing detection as to whether the determined tier has a sufficient storage capacity for movement of the data to the determined tier: updating the density threshold of each of the plurality of tiers according to the remaining storage capacity of the determined tier if the determined tier does not have a sufficient storage capacity; comparing the density of data with an updated density threshold of each of the tiers to re-determine which tier the data should be moved to, wherein the density of data is calculated according to the equation ρ(data)=β(1/T), wherein ρ data is the density of data, T is the temperature of the data, and β is an adjustment factor; and moving the data to the re-determined tier. 2. The method according to claim 1 , wherein the temperature of the data is calculated according to the following equation T = T ′ · e - α · Δ t + Δ H · ( 1 - e - α · Δ t ) α · Δ t , wherein T represents the currently-calculated data temperature; Δt is a duration between a previous sampling time and a current sampling time; T′ is a previously-calculated data temperature before the Δt duration; α is an decay factor derived from a temperature exponential half-life decay period; ΔH is data I/O activity between a previous sampling time and a current sampling time; e is a base of the natural logarithm. 3. A method for dynamic storage tiering comprising: a. computing a density of data according to a temperature associated with data, wherein a higher temperature of data indicates a smaller density of data wherein the density of each of the plurality of tiers is calculated according to the following equation: ρ i =(β′T yi +α′C i )·ΔC′ i , wherein ρ i is the density of the i th tier; T yi , represents the physical storage type of the i th tier, the value being dependent on the application environments; β′ is a storage type adjustment factor; C i is the storage capacity of the i th tier; α′ is a capacity adjustment factor; and ΔC′ i is the left capacity factor of the i th tier which changes along with the remaining capacity of the i th tier; b. obtaining a density threshold of each of a plurality of tiers, wherein: i. the density threshold of an upper tier is assigned to be smaller than the density threshold of a lower tier; ii. the density threshold of each of the plurality of tiers is read from a memory; iii. the density of each of the plurality of tiers is computed according to the type of physical storage device of each of the tiers, the storage capacity and the remaining storage capacity of each of the plurality of tiers; and iv. the density threshold of each of the plurality of tiers is computed according to the calculated density of each of the plurality of tiers, and the density threshold of each of the plurality of tiers is stored in the memory; c. comparing the density of data with the density threshold of each of the plurality of tiers to determine which tier amongst the plurality of tiers the data should be moved to; d. moving the data to the determined tier, wherein the density threshold of each of the plurality of tiers is enabled to be modified; e. performing detection as to whether the determined tier has a sufficient storage capacity for movement of the data to the determined tier; f. updating the density threshold of each of the plurality of tiers according to the remaining storage capacity of the determined tier if the determined tier does not have a sufficient storage capacity; g. comparing the density of data with an updated density threshold of each of the tiers to re-determine which tier the data should be moved to; and h. moving the data to the re-detemined tier. 4. The method according to claim 3 , wherein ΔC′ i is determined in the following manner: when ΔC i ≥θ, αC′ i =1; when Δ C i < θ , Δ C i ′ = Δ C i
Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays · CPC title
at area level, e.g. provisioning of virtual or logical volumes · CPC title
Disk arrays, e.g. RAID, JBOD · CPC title
Physics · mapped topic
Migration mechanisms · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.