Optimal Elimination Scheme to De-Duplication - Subbarayudu, Yerragudipadu;Sureshbabu, Alladi
26,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Broschiertes Buch

Information depletion has become increasingly important in disk and record storage systems due to the rapid growth of information in the universe that has assisted in the large information period. One of the important summons facing massive-scale information depletion, is how to totally find out and reduce redundancy at extreme moderate expenses.So introduced DARE,a low overhead duplicate adjacency resemblance detection and elimination scheme that explicitly overcomes conventional replica-adjacent data for largely efficient similarity identification in data that located in disk and record…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Information depletion has become increasingly important in disk and record storage systems due to the rapid growth of information in the universe that has assisted in the large information period. One of the important summons facing massive-scale information depletion, is how to totally find out and reduce redundancy at extreme moderate expenses.So introduced DARE,a low overhead duplicate adjacency resemblance detection and elimination scheme that explicitly overcomes conventional replica-adjacent data for largely efficient similarity identification in data that located in disk and record storage structures. The main objective of DARE is to implement a strategy, replicate adjacency based similarity discovery, by taking any two information blocks to be almost identical if their adjacent information blocks are replica in a non-replica system, and then additionally supplement the similarity identification efficiency by an modern tremendous-feature method.
Autorenporträt
Yerragudipadu Subbarayudu - Becario de investigación, B.Tech, M.Tech, MISTE, IAENG, (Ph.D), Departamento de Ciencia e Ingeniería Informática, Universidad Tecnológica Jawaharlal Nehru, Anantapur, AP, India.