DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE

A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LEWIS BLAKE, PERIYAGARAM SUBRAMANIAM, YADAV SANDEEP, PRAKASH ASHISH, SUBRAMANIAN ANANTHAN, FAITH RICKARD E, KESAVAN RAM
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator LEWIS BLAKE
PERIYAGARAM SUBRAMANIAM
YADAV SANDEEP
PRAKASH ASHISH
SUBRAMANIAN ANANTHAN
FAITH RICKARD E
KESAVAN RAM
description A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2014201168A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2014201168A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2014201168A13</originalsourceid><addsrcrecordid>eNrjZNB1cXUJDfDxdHYM8fT3U_D0U3D0U3CNCHH1C9F1cgx2dVFwDHL28AxxdQ4JDXLlYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBoYmQGxoZuFoaEycKgBLeyZM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE</title><source>esp@cenet</source><creator>LEWIS BLAKE ; PERIYAGARAM SUBRAMANIAM ; YADAV SANDEEP ; PRAKASH ASHISH ; SUBRAMANIAN ANANTHAN ; FAITH RICKARD E ; KESAVAN RAM</creator><creatorcontrib>LEWIS BLAKE ; PERIYAGARAM SUBRAMANIAM ; YADAV SANDEEP ; PRAKASH ASHISH ; SUBRAMANIAN ANANTHAN ; FAITH RICKARD E ; KESAVAN RAM</creatorcontrib><description>A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2014</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140717&amp;DB=EPODOC&amp;CC=US&amp;NR=2014201168A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140717&amp;DB=EPODOC&amp;CC=US&amp;NR=2014201168A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LEWIS BLAKE</creatorcontrib><creatorcontrib>PERIYAGARAM SUBRAMANIAM</creatorcontrib><creatorcontrib>YADAV SANDEEP</creatorcontrib><creatorcontrib>PRAKASH ASHISH</creatorcontrib><creatorcontrib>SUBRAMANIAN ANANTHAN</creatorcontrib><creatorcontrib>FAITH RICKARD E</creatorcontrib><creatorcontrib>KESAVAN RAM</creatorcontrib><title>DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE</title><description>A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2014</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNB1cXUJDfDxdHYM8fT3U_D0U3D0U3CNCHH1C9F1cgx2dVFwDHL28AxxdQ4JDXLlYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBoYmQGxoZuFoaEycKgBLeyZM</recordid><startdate>20140717</startdate><enddate>20140717</enddate><creator>LEWIS BLAKE</creator><creator>PERIYAGARAM SUBRAMANIAM</creator><creator>YADAV SANDEEP</creator><creator>PRAKASH ASHISH</creator><creator>SUBRAMANIAN ANANTHAN</creator><creator>FAITH RICKARD E</creator><creator>KESAVAN RAM</creator><scope>EVB</scope></search><sort><creationdate>20140717</creationdate><title>DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE</title><author>LEWIS BLAKE ; PERIYAGARAM SUBRAMANIAM ; YADAV SANDEEP ; PRAKASH ASHISH ; SUBRAMANIAN ANANTHAN ; FAITH RICKARD E ; KESAVAN RAM</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2014201168A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2014</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>LEWIS BLAKE</creatorcontrib><creatorcontrib>PERIYAGARAM SUBRAMANIAM</creatorcontrib><creatorcontrib>YADAV SANDEEP</creatorcontrib><creatorcontrib>PRAKASH ASHISH</creatorcontrib><creatorcontrib>SUBRAMANIAN ANANTHAN</creatorcontrib><creatorcontrib>FAITH RICKARD E</creatorcontrib><creatorcontrib>KESAVAN RAM</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LEWIS BLAKE</au><au>PERIYAGARAM SUBRAMANIAM</au><au>YADAV SANDEEP</au><au>PRAKASH ASHISH</au><au>SUBRAMANIAN ANANTHAN</au><au>FAITH RICKARD E</au><au>KESAVAN RAM</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE</title><date>2014-07-17</date><risdate>2014</risdate><abstract>A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2014201168A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T22%3A02%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=LEWIS%20BLAKE&rft.date=2014-07-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2014201168A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true