查看“Stoltzfus”的源代码

One of the greatest problems to the data storage area is just how to effectively store data without using the precise same data and keeping again and again in various areas on the same hosts, hard drives, record libraries an such like. There have been many attempts to deal with these redundancie more effective than others. There's been an in the data storage cmmuninty that even as we saw important value reductins the expense of many data storage options that data storage savings was a fitness whose time had passed. With the regulatory enviorment becming more strict, the quantity of stored data again begain to increase and more and more options began to be looked at to handle data storage problems. 

The response provided by the data storage area may be the technology known as data deduplication. Also referred to as "single-instance storage" and "intelligent compression"this advanced data storage process requires a piece of data and stores it once. It then describes this data as often as it's asked with a pointer (or pointers) that changes the entire line of data. These ideas then refer back to the initial sequence of data. This is specially helpful when multiple copies of exactly the same data are now being archived. The preserving of just one example of the information is needed. This reduces storage requirements and back-up times considerably. 

If a department large email attachment,( 2 megaytes in size) is distributed to 50 different e-mail accounts and each one must certanly be aged, then intead of preserving the attachment 50 times, it is preserved once with a of 98 megabytes of storage room for this one attachment. Flourish this over numerous divisions and 1000s of emails over the span of per year and the savings could be very large. Recovery time aims (RTO )improve significantly with the utilization of Data Deduplication reducing the 
 [http://www.zeitreise-2030.de/sites/mediawiki/index.php?title=When+Internet+Hosting%2C+Contemplate+Devoted+Servers remote data storage]
Dependence on back-up tape libraries.This also reduces most storage space needs realizing significant savings in every area of hardware storage purchase 

Requires. 

Operating at the block( sometimes byte )level enables smaller pieces of information to saved, as the special iterations of every block or bit that has been changed are identified and saved. Instead of having a complete file saved each time there is an alteration in somewhat of information within that file, only the information is saved. Hash formulas such as SHA-1 or MD5 are used to build special numbers for blocks of data that's changed.Most effective data deplication is used in combination 

with other methods knowledge decline delta differencing and traditional pressure are two such methods. This combination can reduce any errors non-redundant sytems may possibly get.