chore(deps): bump github.com/minio/minlz from 1.1.1 to 1.2.0

[dependabot]

Bumps github.com/minio/minlz from 1.1.1 to 1.2.0.

Release notes

Sourced from github.com/minio/minlz's releases.

v1.2.0

feat: Search compressed data without decompression

Compression saves space, but it usually makes your data opaque: to find anything you first have to decompress the whole thing. MinLZ changes that. A MinLZ stream can carry a small per-block search index that lets mz search find a byte sequence while skipping every block that provably can't contain it — those blocks are never decompressed, and (with a sidecar) never even read from disk.

The result: you keep your data compressed and searchable.

One number to set the scene: finding a specific string in a 10 GB CockroachDB log (compressed to 578 MB) takes 0.14 s with mz search, reading about 133 MB. Decompressing that log and piping it to grep — the usual way to search compressed data — takes ~5 s and reads the whole file. zstd -dc | grep takes ~5 s, lz4 -dc | grep ~10 s. Scanning the raw 10 GB with rg takes ~8 s.

The search index is stored as skippable chunks: older MinLZ readers ignore them and the compressed payload is byte-for-byte unchanged, so adding search is always backward-compatible.

Search indexes can be built while compressing or after the fact as sidecar streams, allowing them to be used separately from the compressed data.

---

How it works (in 30 seconds)

Every block gets a tiny bloom-filter table: the byte-windows in the block are hashed and their bits set. To search, mz search hashes the same-length windows of your pattern and checks each block's table:

• any window bit missing → the pattern is definitely not in that block → skip it (no decode);
• all bits present → the block might match → decode and scan it.

Longer/rarer patterns produce more independent window checks, so blocks that don't contain them are rejected with near-certainty. Tables can live inline in the .mz, or in a sidecar .mzs file you build afterwards — handy for data you can't or don't want to re-compress.

This is why it matches with compression. Compressible data is very likely to produce search indexes that are also useful, meaning there is a reasonable reduction in the search table compared to the raw data.

For full details: SEARCH.md (usage & tuning) and SPEC_SEARCH.md (wire format).

---

When to use it — and when not

... (truncated)

Commits

• 6613957 Upgrade compression dependency (#56)
• 6af501e docs: Fix outdated docs and errors. (#55)
• 0051ca9 Minor amd64 decoder tweaks (#54)
• c9c2bdf l3: Do re-matching on borders (#53)
• 05790d8 Add github.com/KarpelesLab/minlz-rs to ports (#52)
• df67e49 search: Fix miscounting (#50)
• 8ac7c53 Don't skip uncompressed indexing when having a prefix (#51)
• cfcc325 Add prefix only test (#49)
• eadfacd Bump the github-actions group with 6 updates (#48)
• c8038d8 Align assembly encoders with Go (#47)
• Additional commits viewable in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)