{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-17",
  "slug": "dedupsearch",
  "term": "DedupSearch",
  "aliases": [
    "deduplication-aware keyword search"
  ],
  "definition": "DedupSearch is a two-phase research algorithm that scans unique stored chunks for byte strings and then resolves matches to logical files.",
  "note": "The physical phase records complete matches and boundary prefixes and suffixes; the logical phase follows file recipes to join partial matches in file order. Physical adjacency alone cannot establish a cross-chunk match. [elias2022]\n\nUnlike a persistent inverted index, the result database is built for the submitted keywords. Recipe traversal and partial-result storage remain costs even when duplicate payload is scanned only once. The evaluation includes text, source code and binary VM backups, not just natural-language terms. [elias2022]",
  "related": [
    "deduplication",
    "destor",
    "idea-index"
  ],
  "citations": [
    {
      "id": "elias2022",
      "title": "Elias et al. DedupSearch: Two-Phase Deduplication Aware Keyword Search. FAST 2022, pp. 233-246.",
      "url": "https://www.usenix.org/system/files/fast22-elias.pdf",
      "accessed": "2026-11-17"
    },
    {
      "id": "hesela",
      "title": "Hesela: searching shared chunks and reconstructing file boundaries.",
      "url": "https://hesela.com/analyses/deduplication-restore-fragmentation/#dedup-aware-search",
      "accessed": "2026-11-17"
    }
  ],
  "provenance": [
    "Full-text source review, especially sections 3, 5 and 6; no native DedupSearch benchmark or paper-result reproduction."
  ]
}
