Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/nlfiedler/fastcdc-rs
FastCDC implementation in Rust
https://github.com/nlfiedler/fastcdc-rs
chunking-algorithm deduplication rust
Last synced: 10 days ago
JSON representation
FastCDC implementation in Rust
- Host: GitHub
- URL: https://github.com/nlfiedler/fastcdc-rs
- Owner: nlfiedler
- License: mit
- Created: 2019-02-03T22:53:46.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2023-10-01T21:58:27.000Z (about 1 year ago)
- Last Synced: 2024-10-16T05:26:30.635Z (27 days ago)
- Topics: chunking-algorithm, deduplication, rust
- Language: Rust
- Homepage: https://crates.io/crates/fastcdc
- Size: 202 KB
- Stars: 140
- Watchers: 8
- Forks: 24
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- License: LICENSE
Awesome Lists containing this project
README
# FastCDC [](https://docs.rs/fastcdc) [](https://crates.io/crates/fastcdc) 
This crate contains multiple implementations of the "FastCDC" content defined chunking algorithm originally described in 2016, and later enhanced in 2020, by Wen Xia, et al. A critical aspect of its behavior is that it returns exactly the same results for the same input. To learn more about content defined chunking and its applications, see the reference material linked below.
## Requirements
* [Rust](https://www.rust-lang.org) stable (2018 edition)
## Building and Testing
```shell
$ cargo clean
$ cargo build
$ cargo test
```
## Example Usage
Examples can be found in the `examples` directory of the source repository, which demonstrate finding chunk boundaries in a given file. There are both streaming and non-streaming examples, where the non-streaming examples use the `memmap2` crate to read large files efficiently.
```shell
$ cargo run --example v2020 -- --size 16384 test/fixtures/SekienAkashita.jpg
Finished dev [unoptimized + debuginfo] target(s) in 0.03s
Running `target/debug/examples/v2020 --size 16384 test/fixtures/SekienAkashita.jpg`
hash=17968276318003433923 offset=0 size=21325
hash=4098594969649699419 offset=21325 size=17140
hash=15733367461443853673 offset=38465 size=28084
hash=4509236223063678303 offset=66549 size=18217
hash=2504464741100432583 offset=84766 size=24700
```
### Non-streaming
An example using `FastCDC` to find chunk boundaries in data loaded into memory:
```rust
let contents = std::fs::read("test/fixtures/SekienAkashita.jpg").unwrap();
let chunker = fastcdc::v2020::FastCDC::new(&contents, 16384, 32768, 65536);
for chunk in chunker {
println!("offset={} length={}", chunk.offset, chunk.length);
}
```
### Streaming
Both the `v2016` and `v2020` modules have a streaming version of FastCDC named `StreamCDC`, which takes a `Read` and uses a byte vector with capacity equal to the specified maximum chunk size.
```rust
let source = std::fs::File::open("test/fixtures/SekienAkashita.jpg").unwrap();
let chunker = fastcdc::v2020::StreamCDC::new(source, 4096, 16384, 65535);
for result in chunker {
let chunk = result.unwrap();
println!("offset={} length={}", chunk.offset, chunk.length);
}
```
### Async Streaming
The `v2020` module has an async streaming version of FastCDC named `AsyncStreamCDC`, which takes an `AsyncRead` (both `tokio` and `futures` are supported via feature flags) and uses a byte vector with capacity equal to the specified maximum chunk size.
```rust
let source = std::fs::File::open("test/fixtures/SekienAkashita.jpg").unwrap();
let chunker = fastcdc::v2020::AsyncStreamCDC::new(&source, 4096, 16384, 65535);
let stream = chunker.as_stream();
let chunks = stream.collect::>().await;
for result in chunks {
let chunk = result.unwrap();
println!("offset={} length={}", chunk.offset, chunk.length);
}
```
## Migration from pre-3.0
If you were using a release of this crate from before the 3.0 release, you will need to make a small adjustment to continue using the same implementation as before.
Before the 3.0 release:
```rust
let chunker = fastcdc::FastCDC::new(&contents, 8192, 16384, 32768);
```
After the 3.0 release:
```rust
let chunker = fastcdc::ronomon::FastCDC::new(&contents, 8192, 16384, 32768);
```
The cut points produced will be identical to previous releases as the `ronomon` implementation was never changed in that manner. Note, however, that the other implementations _will_ produce different results.
## Reference Material
The original algorithm from 2016 is described in [FastCDC: a Fast and Efficient Content-Defined Chunking Approach for Data Deduplication](https://www.usenix.org/system/files/conference/atc16/atc16-paper-xia.pdf), while the improved "rolling two bytes each time" version from 2020 is detailed in [The Design of Fast Content-Defined Chunking for Data Deduplication Based Storage Systems](https://ieeexplore.ieee.org/document/9055082).
## Other Implementations
* [jrobhoward/quickcdc](https://github.com/jrobhoward/quickcdc)
+ Similar but slightly earlier algorithm by some of the same authors?
* [rdedup_cdc at docs.rs](https://docs.rs/crate/rdedup-cdc/0.1.0/source/src/fastcdc.rs)
+ Alternative implementation in Rust.
* [ronomon/deduplication](https://github.com/ronomon/deduplication)
+ C++ and JavaScript implementation of a variation of FastCDC.
* [titusz/fastcdc-py](https://github.com/titusz/fastcdc-py)
+ Pure Python port of FastCDC. Compatible with this implementation.
* [wxiacode/FastCDC-c](https://github.com/wxiacode/FastCDC-c)
+ Canonical algorithm in C with gear table generation and mask values.
* [wxiacode/restic-FastCDC](https://github.com/wxiacode/restic-FastCDC)
+ Alternative implementation in Go with additional mask values.