Random redundant storage in disk arrays: complexity of retrieval problems

Random redundant storage in disk arrays: complexity of retrieval problems

Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2003-09, Vol.52 (9), p.1210-1214
Hauptverfasser: Aerts, J., Korst, J., Spieksma, F., Verhaegh, W., Woeginger, G.
Format: Artikel
Sprache:eng
Schlagworte:
Arrays
Complexity
Complexity theory
Data storage
Disks
Multimedia
Redundant
Retrieval
Strategy
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1214
container_issue 9
container_start_page 1210
container_title IEEE transactions on computers
container_volume 52
creator Aerts, J.
Korst, J.
Spieksma, F.
Verhaegh, W.
Woeginger, G.
description Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.
doi_str_mv 10.1109/TC.2003.1228515
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1228515</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1228515</ieee_id><sourcerecordid>2429892731</sourcerecordid><originalsourceid>FETCH-LOGICAL-c390t-1bed24f53b6ceb42a4e9860c061223262f960ef8e74762f2923d2d65e23a046b3</originalsourceid><addsrcrecordid>eNp9kc9LwzAUx4MoOKdnD16KBz11e0maLPEmxV8wEGSeQ9q-SmfbzKQT99-buYHgwdPj8T7f9-tLyDmFCaWgp4t8wgD4hDKmBBUHZESFmKVaC3lIRgBUpZpncExOQlgCgGSgR-TpxfaV6xKP1bqvbD8kYXDevmHS9EnVhPfEem834SYpXbdq8asZNomrIz_4Bj9tm6y8K1rswik5qm0b8Gwfx-T1_m6RP6bz54en_HaellzDkNICK5bVgheyxCJjNkOtJJQg4-KcSVZrCVgrnGWzmDDNeMUqKZBxC5ks-Jhc7_rGwR9rDIPpmlBi29oe3ToYDVQqSTmN5NW_ZPyTio-ACF7-AZdu7ft4hVEq4yKTP9B0B5XeheCxNivfdNZvDAWzdcAscrN1wOwdiIqLnaJBxF96X_0GJdeAGA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884354600</pqid></control><display><type>article</type><title>Random redundant storage in disk arrays: complexity of retrieval problems</title><source>IEEE Electronic Library (IEL)</source><creator>Aerts, J. ; Korst, J. ; Spieksma, F. ; Verhaegh, W. ; Woeginger, G.</creator><creatorcontrib>Aerts, J. ; Korst, J. ; Spieksma, F. ; Verhaegh, W. ; Woeginger, G.</creatorcontrib><description>Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2003.1228515</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Arrays ; Complexity ; Complexity theory ; Data storage ; Disks ; Multimedia ; Redundant ; Retrieval ; Strategy</subject><ispartof>IEEE transactions on computers, 2003-09, Vol.52 (9), p.1210-1214</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c390t-1bed24f53b6ceb42a4e9860c061223262f960ef8e74762f2923d2d65e23a046b3</citedby><cites>FETCH-LOGICAL-c390t-1bed24f53b6ceb42a4e9860c061223262f960ef8e74762f2923d2d65e23a046b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1228515$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1228515$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Aerts, J.</creatorcontrib><creatorcontrib>Korst, J.</creatorcontrib><creatorcontrib>Spieksma, F.</creatorcontrib><creatorcontrib>Verhaegh, W.</creatorcontrib><creatorcontrib>Woeginger, G.</creatorcontrib><title>Random redundant storage in disk arrays: complexity of retrieval problems</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.</description><subject>Arrays</subject><subject>Complexity</subject><subject>Complexity theory</subject><subject>Data storage</subject><subject>Disks</subject><subject>Multimedia</subject><subject>Redundant</subject><subject>Retrieval</subject><subject>Strategy</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kc9LwzAUx4MoOKdnD16KBz11e0maLPEmxV8wEGSeQ9q-SmfbzKQT99-buYHgwdPj8T7f9-tLyDmFCaWgp4t8wgD4hDKmBBUHZESFmKVaC3lIRgBUpZpncExOQlgCgGSgR-TpxfaV6xKP1bqvbD8kYXDevmHS9EnVhPfEem834SYpXbdq8asZNomrIz_4Bj9tm6y8K1rswik5qm0b8Gwfx-T1_m6RP6bz54en_HaellzDkNICK5bVgheyxCJjNkOtJJQg4-KcSVZrCVgrnGWzmDDNeMUqKZBxC5ks-Jhc7_rGwR9rDIPpmlBi29oe3ToYDVQqSTmN5NW_ZPyTio-ACF7-AZdu7ft4hVEq4yKTP9B0B5XeheCxNivfdNZvDAWzdcAscrN1wOwdiIqLnaJBxF96X_0GJdeAGA</recordid><startdate>20030901</startdate><enddate>20030901</enddate><creator>Aerts, J.</creator><creator>Korst, J.</creator><creator>Spieksma, F.</creator><creator>Verhaegh, W.</creator><creator>Woeginger, G.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030901</creationdate><title>Random redundant storage in disk arrays: complexity of retrieval problems</title><author>Aerts, J. ; Korst, J. ; Spieksma, F. ; Verhaegh, W. ; Woeginger, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c390t-1bed24f53b6ceb42a4e9860c061223262f960ef8e74762f2923d2d65e23a046b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Arrays</topic><topic>Complexity</topic><topic>Complexity theory</topic><topic>Data storage</topic><topic>Disks</topic><topic>Multimedia</topic><topic>Redundant</topic><topic>Retrieval</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aerts, J.</creatorcontrib><creatorcontrib>Korst, J.</creatorcontrib><creatorcontrib>Spieksma, F.</creatorcontrib><creatorcontrib>Verhaegh, W.</creatorcontrib><creatorcontrib>Woeginger, G.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications 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><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Aerts, J.</au><au>Korst, J.</au><au>Spieksma, F.</au><au>Verhaegh, W.</au><au>Woeginger, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Random redundant storage in disk arrays: complexity of retrieval problems</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2003-09-01</date><risdate>2003</risdate><volume>52</volume><issue>9</issue><spage>1210</spage><epage>1214</epage><pages>1210-1214</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2003.1228515</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9340
ispartof IEEE transactions on computers, 2003-09, Vol.52 (9), p.1210-1214
issn 0018-9340
1557-9956
language eng
recordid cdi_ieee_primary_1228515
source IEEE Electronic Library (IEL)
subjects Arrays
Complexity
Complexity theory
Data storage
Disks
Multimedia
Redundant
Retrieval
Strategy
title Random redundant storage in disk arrays: complexity of retrieval problems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T23%3A42%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Random%20redundant%20storage%20in%20disk%20arrays:%20complexity%20of%20retrieval%20problems&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Aerts,%20J.&rft.date=2003-09-01&rft.volume=52&rft.issue=9&rft.spage=1210&rft.epage=1214&rft.pages=1210-1214&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2003.1228515&rft_dat=%3Cproquest_RIE%3E2429892731%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884354600&rft_id=info:pmid/&rft_ieee_id=1228515&rfr_iscdi=true