Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Optimal Elimination Scheme to De-Duplication
Details
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.
Autorentext
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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786139929276
- Sprache Englisch
- Titel Optimal Elimination Scheme to De-Duplication
- Veröffentlichung 12.07.2019
- ISBN 613992927X
- Format Kartonierter Einband
- EAN 9786139929276
- Jahr 2019
- Größe H220mm x B150mm x T4mm
- Autor Yerragudipadu Subbarayudu , Alladi Sureshbabu
- Untertitel For Reduction of Data in Storage System
- Genre Sprach- und Literaturwissenschaften
- Anzahl Seiten 64
- Herausgeber LAP LAMBERT Academic Publishing
- Gewicht 113g