finesse · research · also Finesse resemblance detection

Finesse

Finesse selects candidate chunks for delta compression using features extracted from equal-sized subchunks and grouped by local rank.

Mechanism: Each subchunk contributes its largest rolling Rabin fingerprint. Features are split into contiguous groups, sorted within each group, then combined across groups at matching ranks into super-features. This removes the repeated fingerprint transformations of N-transform matching. [1]

Evaluation: Across six backup datasets, feature computation averaged 3.5x and 3.2x faster on the two tested processors; complete prototype throughput improved by 41%-85%. These are different measurements, not interchangeable speedups. The setup used 8 KB expected chunks, twelve features, three super-features, first-match base selection and a 400 MB base cache. [1]

Boundary: Very different chunk sizes can disrupt the corresponding subchunks and lose matches. A resemblance candidate still needs base retrieval and delta encoding; matching a super-feature does not establish byte equality. [1]

Relations

related
Resemblance detection, Delta compression, Data deduplication, Rolling hash, Destor

Citations

  1. Zhang et al. Finesse: Fine-Grained Feature Locality based Fast Resemblance Detection for Post-Deduplication Delta Compression. FAST 2019, pp. 121-128. (accessed 2026-11-22)
Sources & caveats
  • Primary-source review of sections 3-5, Algorithms 1-2 and Figure 3; reported prototype results were not independently reproduced. [1]

JSON: /data/terms/finesse.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Finesse. Hesela. 2026-11-22. https://hesela.dev/terms/finesse/