PRESIDIO: A Framework for Efficient Archival Data Storage
The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However, managed disk storage is still expensive...
Gespeichert in:
Veröffentlicht in: | ACM transactions on storage 2011-07, Vol.7 (2), p.1-60 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 60 |
---|---|
container_issue | 2 |
container_start_page | 1 |
container_title | ACM transactions on storage |
container_volume | 7 |
creator | You, Lawrence L. Pollack, Kristal T. Long, Darrell D. E. Gopinath, K. |
description | The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However,
managed
disk storage is still expensive. To further lower the cost, redundancy can be eliminated with the use of interfile and intrafile data compression. However, it is not clear what the optimal strategy for compressing data is, given the diverse collections of data.
To create a scalable archival storage system that efficiently stores diverse data, we present PRESIDIO, a framework that selects from different space-reduction efficent storage methods (ESMs) to detect similarity and reduce or eliminate redundancy when storing objects. In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication or delta compression. Storing and retrieving objects are polymorphic operations independent of their content-based address. A new technique, harmonic super-fingerprinting, is also used for obtaining successively more accurate (but also more costly) measures of similarity to identify the existing objects in a very large data set that are most similar to an incoming new object.
The PRESIDIO design, when reported earlier, had comprehensively introduced for the first time the notion of deduplication, which is now being offered as a service in storage systems by major vendors. As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data. |
doi_str_mv | 10.1145/1970348.1970351 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_914628510</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>914628510</sourcerecordid><originalsourceid>FETCH-LOGICAL-c227t-f0da2a65682ca7b8ec1c65d0ced902b1edb3b982fc4e2e4ab4d7a2f6eb6d9e8a3</originalsourceid><addsrcrecordid>eNo9j81KAzEYRYMotFbXPoKrafPlP0upVQcKFVvXIT9foDJ1atIufHu1HVyduzhcOITcAZ0CCDkDqykXZnqihAsyBil5w6nll_9b6xG5rvWDUq6YkGMyen1brNvHdnVDrrLvKt4OnJD3p8Vm_tIsV8_t_GHZRMb0ock0eeaVVIZFr4PBCFHJRCMmS1kATIEHa1iOAhkKH0TSnmWFQSWLxvMJuT__7kv_dcR6cLttjdh1_hP7Y3UWhGJGAv01Z2czlr7Wgtnty3bny7cD6v6S3ZDshmT-A87aRrg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>914628510</pqid></control><display><type>article</type><title>PRESIDIO: A Framework for Efficient Archival Data Storage</title><source>Access via ACM Digital Library</source><creator>You, Lawrence L. ; Pollack, Kristal T. ; Long, Darrell D. E. ; Gopinath, K.</creator><creatorcontrib>You, Lawrence L. ; Pollack, Kristal T. ; Long, Darrell D. E. ; Gopinath, K.</creatorcontrib><description>The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However,
managed
disk storage is still expensive. To further lower the cost, redundancy can be eliminated with the use of interfile and intrafile data compression. However, it is not clear what the optimal strategy for compressing data is, given the diverse collections of data.
To create a scalable archival storage system that efficiently stores diverse data, we present PRESIDIO, a framework that selects from different space-reduction efficent storage methods (ESMs) to detect similarity and reduce or eliminate redundancy when storing objects. In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication or delta compression. Storing and retrieving objects are polymorphic operations independent of their content-based address. A new technique, harmonic super-fingerprinting, is also used for obtaining successively more accurate (but also more costly) measures of similarity to identify the existing objects in a very large data set that are most similar to an incoming new object.
The PRESIDIO design, when reported earlier, had comprehensively introduced for the first time the notion of deduplication, which is now being offered as a service in storage systems by major vendors. As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data.</description><identifier>ISSN: 1553-3077</identifier><identifier>EISSN: 1553-3093</identifier><identifier>DOI: 10.1145/1970348.1970351</identifier><language>eng</language><subject>Compressing ; Costs ; Data compression ; Data storage ; Design engineering ; Disks ; Optimization ; Strategy</subject><ispartof>ACM transactions on storage, 2011-07, Vol.7 (2), p.1-60</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c227t-f0da2a65682ca7b8ec1c65d0ced902b1edb3b982fc4e2e4ab4d7a2f6eb6d9e8a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>You, Lawrence L.</creatorcontrib><creatorcontrib>Pollack, Kristal T.</creatorcontrib><creatorcontrib>Long, Darrell D. E.</creatorcontrib><creatorcontrib>Gopinath, K.</creatorcontrib><title>PRESIDIO: A Framework for Efficient Archival Data Storage</title><title>ACM transactions on storage</title><description>The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However,
managed
disk storage is still expensive. To further lower the cost, redundancy can be eliminated with the use of interfile and intrafile data compression. However, it is not clear what the optimal strategy for compressing data is, given the diverse collections of data.
To create a scalable archival storage system that efficiently stores diverse data, we present PRESIDIO, a framework that selects from different space-reduction efficent storage methods (ESMs) to detect similarity and reduce or eliminate redundancy when storing objects. In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication or delta compression. Storing and retrieving objects are polymorphic operations independent of their content-based address. A new technique, harmonic super-fingerprinting, is also used for obtaining successively more accurate (but also more costly) measures of similarity to identify the existing objects in a very large data set that are most similar to an incoming new object.
The PRESIDIO design, when reported earlier, had comprehensively introduced for the first time the notion of deduplication, which is now being offered as a service in storage systems by major vendors. As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data.</description><subject>Compressing</subject><subject>Costs</subject><subject>Data compression</subject><subject>Data storage</subject><subject>Design engineering</subject><subject>Disks</subject><subject>Optimization</subject><subject>Strategy</subject><issn>1553-3077</issn><issn>1553-3093</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNo9j81KAzEYRYMotFbXPoKrafPlP0upVQcKFVvXIT9foDJ1atIufHu1HVyduzhcOITcAZ0CCDkDqykXZnqihAsyBil5w6nll_9b6xG5rvWDUq6YkGMyen1brNvHdnVDrrLvKt4OnJD3p8Vm_tIsV8_t_GHZRMb0ock0eeaVVIZFr4PBCFHJRCMmS1kATIEHa1iOAhkKH0TSnmWFQSWLxvMJuT__7kv_dcR6cLttjdh1_hP7Y3UWhGJGAv01Z2czlr7Wgtnty3bny7cD6v6S3ZDshmT-A87aRrg</recordid><startdate>20110701</startdate><enddate>20110701</enddate><creator>You, Lawrence L.</creator><creator>Pollack, Kristal T.</creator><creator>Long, Darrell D. E.</creator><creator>Gopinath, K.</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110701</creationdate><title>PRESIDIO</title><author>You, Lawrence L. ; Pollack, Kristal T. ; Long, Darrell D. E. ; Gopinath, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c227t-f0da2a65682ca7b8ec1c65d0ced902b1edb3b982fc4e2e4ab4d7a2f6eb6d9e8a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Compressing</topic><topic>Costs</topic><topic>Data compression</topic><topic>Data storage</topic><topic>Design engineering</topic><topic>Disks</topic><topic>Optimization</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>You, Lawrence L.</creatorcontrib><creatorcontrib>Pollack, Kristal T.</creatorcontrib><creatorcontrib>Long, Darrell D. E.</creatorcontrib><creatorcontrib>Gopinath, K.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on storage</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>You, Lawrence L.</au><au>Pollack, Kristal T.</au><au>Long, Darrell D. E.</au><au>Gopinath, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>PRESIDIO: A Framework for Efficient Archival Data Storage</atitle><jtitle>ACM transactions on storage</jtitle><date>2011-07-01</date><risdate>2011</risdate><volume>7</volume><issue>2</issue><spage>1</spage><epage>60</epage><pages>1-60</pages><issn>1553-3077</issn><eissn>1553-3093</eissn><abstract>The ever-increasing volume of archival data that needs to be reliably retained for long periods of time and the decreasing costs of disk storage, memory, and processing have motivated the design of low-cost, high-efficiency disk-based storage systems. However,
managed
disk storage is still expensive. To further lower the cost, redundancy can be eliminated with the use of interfile and intrafile data compression. However, it is not clear what the optimal strategy for compressing data is, given the diverse collections of data.
To create a scalable archival storage system that efficiently stores diverse data, we present PRESIDIO, a framework that selects from different space-reduction efficent storage methods (ESMs) to detect similarity and reduce or eliminate redundancy when storing objects. In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication or delta compression. Storing and retrieving objects are polymorphic operations independent of their content-based address. A new technique, harmonic super-fingerprinting, is also used for obtaining successively more accurate (but also more costly) measures of similarity to identify the existing objects in a very large data set that are most similar to an incoming new object.
The PRESIDIO design, when reported earlier, had comprehensively introduced for the first time the notion of deduplication, which is now being offered as a service in storage systems by major vendors. As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data.</abstract><doi>10.1145/1970348.1970351</doi><tpages>60</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1553-3077 |
ispartof | ACM transactions on storage, 2011-07, Vol.7 (2), p.1-60 |
issn | 1553-3077 1553-3093 |
language | eng |
recordid | cdi_proquest_miscellaneous_914628510 |
source | Access via ACM Digital Library |
subjects | Compressing Costs Data compression Data storage Design engineering Disks Optimization Strategy |
title | PRESIDIO: A Framework for Efficient Archival Data Storage |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T03%3A39%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=PRESIDIO:%20A%20Framework%20for%20Efficient%20Archival%20Data%20Storage&rft.jtitle=ACM%20transactions%20on%20storage&rft.au=You,%20Lawrence%20L.&rft.date=2011-07-01&rft.volume=7&rft.issue=2&rft.spage=1&rft.epage=60&rft.pages=1-60&rft.issn=1553-3077&rft.eissn=1553-3093&rft_id=info:doi/10.1145/1970348.1970351&rft_dat=%3Cproquest_cross%3E914628510%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=914628510&rft_id=info:pmid/&rfr_iscdi=true |