9786139929276 - Optimal Elimination Scheme to De-Duplication: For Reduction of Data in Storage System di Subbarayudu, Yerragudipadu; Sureshbabu, Alladi (6 risultati)

Paperback. Condizione: Brand New. 64 pages. 8.66x5.91x0.15 inches. In Stock.

Taschenbuch. Condizione: Neu. Optimal Elimination Scheme to De-Duplication | For Reduction of Data in Storage System | Yerragudipadu Subbarayudu (u. a.) | Taschenbuch | 64 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786139929276 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 64 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Subbarayudu YerragudipaduYerragudipadu Subbarayudu - Research scholar, B.Tech, M.Tech, MISTE, IAENG, (Ph.D), Department of Computer Science and Engineering, Jawaharlal Nehru Technological University, Anantapur, AP, India.Informa.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.