Proxy server caching of database content
US-2021173888-A1 · Jun 10, 2021 · US
US11709882B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11709882-B2 |
| Application number | US-202117451788-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 21, 2021 |
| Priority date | Oct 21, 2021 |
| Publication date | Jul 25, 2023 |
| Grant date | Jul 25, 2023 |
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.
Managing an image storage space is provided. A number of processor units identifies a benchmark image in a similar images group. A number of other images not identified in the similar images group as the benchmark image is a set of similar images. The number of processor units creates an image mapping tree. The image mapping tree has a root block for the benchmark image and blocks arranged in a set of layers below the root block based on the set of similar images; the blocks represent portions of the benchmark image; and a plurality of lower blocks in the blocks in a lower layer correspond to subdivisions in an upper block in the blocks in an upper layer. The number of processor units stores a set of selected blocks in the set of similar images that have differences from a set of corresponding blocks in image mapping tree for the benchmark image. The number of processor units store metadata for the set of selected blocks that describes set of paths in the image mapping tree from the set of corresponding blocks in the image mapping tree to the root block.
Opening claim text (preview).
What is claimed is: 1. A computer implemented method for managing an image storage space, the computer implemented method comprising: identifying, by a number of processor units, a benchmark image in a similar images group, wherein a number of other images are not identified in the similar images group as the benchmark image in a set of similar images; creating, by the number of processor units, an image mapping tree, wherein the image mapping tree has a root block for the benchmark image and blocks arranged in a set of layers below the root block based on the set of similar images, the blocks represent portions of the benchmark image, and a plurality of lower blocks in the blocks in a lower layer correspond to subdivisions in an upper block in the blocks in an upper layer; and storing, by the number of processor units, a set of selected blocks in the set of similar images that have differences from a set of corresponding blocks in image mapping tree for the benchmark image; and storing, by the number of processor units, metadata for the set of selected blocks that describes a set of paths in the image mapping tree from the set of corresponding blocks in the image mapping tree to the root block. 2. The computer implemented method of claim 1 further comprising: storing, by the number of processor units, a set of new blocks for a new image that is different from a set of new corresponding blocks in the benchmark image in the image mapping tree; and storing, by the number of processor units, new meta data for the set of new blocks that describe a set of new paths from the set of new corresponding blocks in the image mapping tree to the root block for the benchmark image in the image mapping tree. 3. The computer implemented method of claim 1 further comprising: storing, by the number of processor units, a set of new images using the image mapping tree if the set of new images is within a maximum threshold of images for the image mapping tree. 4. The computer implemented method of claim 3 further comprising: recreating, by the number of processor units, the image mapping tree using the new set of images and images in the similar images group if the new set of images is equal to or greater than a new image threshold. 5. The computer implemented method of claim 1 , wherein creating, by the number of processor units, the image mapping tree for the similar images group comprises: splitting, by the number of processor units, the benchmark image to form subdivisions in the benchmark image; and creating an upper layer of upper blocks in a layer under the root block in which each upper block in the upper blocks corresponds to a subdivision in the subdivisions in the benchmark image. 6. The computer implemented method of claim 5 , wherein creating, by the number of processor units, the image mapping tree for the similar images group further comprises: determining, by the number of processor units, a number of similar images in the set of similar images that have a similar block that is different from a corresponding upper block in the upper blocks to form a set of corresponding upper blocks; splitting, by the number of processor units, each corresponding upper block in set of corresponding upper blocks into the subdivisions; and creating, by the number of processor units, a lower layer of lower blocks in which each lower block in the lower blocks corresponds to the subdivision in the subdivisions in the set of corresponding upper blocks. 7. The computer implemented method of claim 6 , wherein the lower blocks become the upper blocks for splitting when creating a subsequent lower layer and further comprising: repeating, by the number of processor units, the determining, splitting, and creating steps to form the subsequent lower layer. 8. The computer implemented method of claim 6 further comprising: repeating, by the number of processor units, the determining, splitting, and creating steps to form another lower layer based on storage reduced and processing resources used. 9. The computer implemented method of claim 6 , wherein a number of the lower blocks formed from splitting an upper block is based on the number of similar images having the similar block for the upper block being split. 10. The computer implemented method of claim 1 , wherein the metadata comprises a set of image identifies for the set of selected blocks, a reference to the benchmark image, and the set of paths in the image mapping tree from the set of corresponding blocks in the image mapping tree to the root block. 11. The computer implemented method of claim 1 , wherein identifying, by the number of processor units, the benchmark image in the similar images group comprises: identifying, by the number of processor units, the benchmark image from a plurality of similar images based on a minimum overall difference between the plurality of similar images. 12. The computer implemented method of claim 11 , wherein the minimum overall difference determined using at least one of a RGB color histogram method, a keypoint matching method, an image hash method, or a compute the bits method. 13. A computer implemented method for managing an image storage space, the computer implemented method comprising: receiving, by a number of processor units, a new image for storage using an image mapping tree having a root block for a benchmark image and blocks arranged in a set of layers below the root block based on a set of similar images, wherein the blocks represent portions of the benchmark image and a plurality of lower blocks in the blocks in a lower layer correspond to subdivisions in an upper block in the blocks in an upper layer; storing, by the number of processor units, a set of new blocks for the new image that is different from a set of corresponding blocks in the image mapping tree; and storing, by the number of processor units, new meta data for the set of new blocks that describes a set of new paths from the set of corresponding blocks in the image mapping tree to the root block for the benchmark image in the image mapping tree. 14. A computer system comprising: comprising a number of processor units, wherein the number of processor units executes program instructions to: identifying, the number of processor units, a benchmark image in a similar images group, wherein a number of other images are not identified in the similar images group as the benchmark image is a set of similar images; creating, by the number of processor units, an image mapping tree, wherein the image mapping tree has a root block for the benchmark image and blocks arranged in a set of layers below the root block based on the set of similar images, the blocks represent portions of the benchmark image, and a plurality of lower blocks in the blocks in a lower layer correspond to subdivisions in an upper block in the blocks in an upper layer; and storing, by the number of processor units, a set of selected blocks in the set of similar images that have differences from a set of corresponding blocks in image mapping tree for the benchmark image; and storing, by the number of processor units, metadata for the set of selected blocks that describes set of paths in the image mapping tree from the set of corresponding blocks in the image mapping tree to the root block. 15. The computer system of claim 14 further comprising: storing, by the number of processor units, a set of new blocks for a new image that is different from a set of new corresponding blocks in the benchmark image in the image mapping tree; and storing, by the number of processor units, new meta data for t
using metadata automatically derived from the content · CPC title
Indexing; Data structures therefor; Storage structures · CPC title
Browsing; Visualisation therefor · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.