{"id":"https://openalex.org/W3021064876","doi":"https://doi.org/10.34048/2019.1.f1","title":"Erasure Coding for Big Data","display_name":"Erasure Coding for Big Data","alternate_titles":[],"publication_year":2019,"publication_date":"2019-03-10","ids":{"openalex":"https://openalex.org/W3021064876","doi":"https://doi.org/10.34048/2019.1.f1","mag":"3021064876"},"language":"en","primary_location":{"id":"doi:10.34048/2019.1.f1","doi":"https://doi.org/10.34048/2019.1.f1","is_oa":false,"landing_page_url":"https://doi.org/10.34048/2019.1.f1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Computing and Communications","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W3021064876"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056042146","display_name":"M. Nikhil Krishnan","orcid":"https://orcid.org/0000-0003-0089-676X","observed_orcids":["https://orcid.org/0000-0003-0089-676X"]},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"M. Nikhil Krishnan","raw_affiliation_strings":["Indian Institute of Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056042146"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.1266,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47904151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/erasure-codes","display_name":"erasure coding","score":0.8529999852180481},{"id":"https://openalex.org/keywords/big-data-storage","display_name":"big data storage","score":0.9380000233650208},{"id":"https://openalex.org/keywords/distributed-storage","display_name":"distributed storage","score":0.6700000166893005},{"id":"https://openalex.org/keywords/reed-solomon-codes","display_name":"Reed-Solomon codes","score":0.8090000152587891},{"id":"https://openalex.org/keywords/regenerating-codes","display_name":"regenerating codes","score":0.9679999947547913},{"id":"https://openalex.org/keywords/locally-recoverable-codes","display_name":"locally repairable codes","score":0.9990000128746033},{"id":"https://openalex.org/keywords/storage-overhead","display_name":"storage overhead","score":0.6830000281333923},{"id":"https://openalex.org/keywords/data-center-reliability","display_name":"data center reliability","score":0.6790000200271606}],"concepts":[{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.8698121309280396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7507882118225098},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6268628239631653},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5664699077606201},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.5352132320404053},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.4895847737789154},{"id":"https://openalex.org/C194739806","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Computer data storage","level":2,"score":0.461905300617218},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3093119263648987},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22228854894638062},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1258021891117096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11318019032478333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06579232215881348},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.34048/2019.1.f1","doi":"https://doi.org/10.34048/2019.1.f1","is_oa":false,"landing_page_url":"https://doi.org/10.34048/2019.1.f1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Computing and Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2047187164","https://openalex.org/W7028303239","https://openalex.org/W2138744797","https://openalex.org/W3091603075","https://openalex.org/W1968265558","https://openalex.org/W3119991309","https://openalex.org/W2993345055","https://openalex.org/W2078239881","https://openalex.org/W7056027128","https://openalex.org/W2572345100"],"abstract_inverted_index":{"This":[0,203],"article":[1,204],"deals":[2],"with":[3,162],"the":[4,16,67,83,93,105,112,132,138,185,201,214,219],"reliable":[5],"and":[6,51,61,174],"efficient":[7],"storage":[8,30,56,113,143],"of":[9,19,72,121,140,166,187,208,218],"\u2018Big":[10],"Data\u2019,":[11],"by":[12,195],"which":[13],"is":[14,47,75,100,124],"meant":[15],"vast":[17],"quantities":[18],"data":[20,25,39,41,45,73,129],"that":[21,29,74,101,131],"are":[22,32,148],"stored":[23,48],"in":[24,49,70,150],"centers":[26],"worldwide.":[27],"Given":[28],"units":[31],"prone":[33],"to":[34,36,43,63,85,88,107,109,116,183,200],"failure,":[35],"protect":[37],"against":[38],"loss,":[40],"pertaining":[42],"a":[44,78,110,118,141],"file":[46],"distributed":[50],"redundant":[52],"fashion":[53],"across":[54],"multiple":[55],"units.":[57],"While":[58],"replication":[59],"was":[60],"continues":[62],"be":[64],"commonly":[65],"employed,":[66],"explosive":[68],"growth":[69],"amount":[71],"generated":[76],"on":[77],"daily":[79],"basis,":[80],"has":[81],"forced":[82],"industry":[84,188],"increasingly":[86],"turn":[87],"erasure":[89,102,167],"codes":[90,103,168,173,179],"such":[91,130],"as":[92,171,189,191],"Reed-Solomon":[94],"code.":[95],"The":[96],"reason":[97],"for":[98,127],"this":[99,151,155],"have":[104,159,180],"potential":[106],"keep":[108],"minimum,":[111],"overhead":[114],"required":[115],"ensure":[117],"given":[119],"level":[120],"reliability.":[122],"There":[123],"also":[125],"need":[126],"storing":[128],"system":[133],"can":[134],"recover":[135],"efficiently":[136],"from":[137,213],"failure":[139],"single":[142],"unit.":[144],"Conventional":[145],"erasure-coding":[146],"techniques":[147],"inefficient":[149],"respect.":[152],"To":[153],"address":[154,184],"situation,":[156],"coding":[157,193],"theorists":[158],"come":[160],"up":[161],"two":[163,197],"new":[164,198,211],"classes":[165],"known":[169],"respectively":[170],"regenerating":[172],"locally":[175],"recoverable":[176],"codes.":[177],"These":[178],"served":[181],"both":[182],"needs":[186],"well":[190],"enrich":[192],"theory":[194],"adding":[196],"branches":[199],"discipline.":[202],"provides":[205],"an":[206],"overview":[207],"these":[209],"exciting":[210],"developments,":[212],"(somewhat":[215],"biased)":[216],"perspective":[217],"authors.":[220]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3021064876","counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2020-05-13T00:00:00"}
