
Shadowjoin
io.github.harsh-chandak由 GitHub 账号 harsh-chandak 发布v0.3.2更新于 Oct 24, 2026
Measure the matches your exact join is silently dropping, and get the rule that fixes each.
概览
本地 MCP 服务器,用于测量精确连接静默丢失了多少匹配、解释丢失原因,并建议可恢复匹配的规范化规则。
- 可以做什么
- 测量两个已配置数据源之间的连接,报告丢失匹配的下界,并附可人工核对的样本对。解释未匹配项,区分机械性规范化缺口与需要别名表的语义性缺口。建议规范化规则和贪心规则组合,并在过度规范化导致恢复更少时发出警告。对比多次运行,验证所提修复是否真的改善了连接。列出可用的规范化规则。
- 适用场景
- 当流水线按姓名、邮箱、SKU 或公司名连接两个数据源,且怀疑存在静默丢失时适用;也适合需要可重复、可在 CI 中检查的测量,而非临时探索性 SQL 的场景,或用于判断是否需要真正的实体解析库。
- 运行要求
- 通过 npx 在本地运行(需要 Node.js;SQLite 需 Node 22.5+)。需要环境变量 SHADOWJOIN_CONFIG 指向配置文件绝对路径,文件中列出数据源及其连接字符串。Postgres 和 MySQL 适配器需要可选的 pg 或 mysql2 对等依赖;MCP 服务器需要 Model Context Protocol SDK 对等依赖。对所扫描数据源需有读取权限。
安装
在 SourceWeft 中
- 打开 控制台中的 Shadowjoin,将其添加到工作区。
- 为需要使用其工具的对话启用该服务。
Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。
其他 MCP 客户端
参照 仓库 中的启动说明。
README
shadowjoin
Measure the matches your exact join is silently dropping.
Your pipeline joins two sources on a name, an email, a SKU, a company. It matches what matches. Everything else just... isn't there. No error, no exception, no alert — the query returns, the dashboard renders, and a quarter of the rows that should have matched quietly don't.
shadowjoin runs a shadow matcher alongside your real join key and tells you how many matches you are losing, which normalization rule would recover each one, and — if you have any ground truth at all — proves the recoveries are real.
Fourteen seconds, no sound. Every figure in it is verbatim CLI output from the committed example below — higher-resolution version.
The progress output above is real: shadowjoin shows what it is doing while it
works. All of it is suppressed automatically when stdout is not a terminal, so
piping to a file, to jq, or running in CI produces byte-identical output to
before — and there is no postinstall script, because a tool you point at a
production database has no business running code at install time.
What it found on public data
Joining the S&P 500 constituent list against NYSE + Nasdaq listings on company name. Both files carry ticker symbols, so every recovered match can be checked rather than believed:
The exact join found one match. There were four hundred and twenty-eight, and 419 of them are confirmed correct by ticker.
Reproduce it yourself — the data ships with the repo:
A join you would actually ship
The example above is deliberately unflattering — a short index name against a full security description. Here is the realistic case.
Unicode CLDR country names (what your UI displays) joined to UN official country names (what your reference data uses), on the country name, with ISO 3166 alpha-3 as ground truth. That is a join people write every week.
It looks healthy. 82% matched, no errors, nobody investigating. And it is
silently dropping Antigua & Barbuda, Trinidad & Tobago,
São Tomé & Príncipe, Turks & Caicos Islands and Vietnam — the last one
because the UN spells it Viet Nam.
Two things this example shows that the first one does not:
Applying every rule finds nothing. The full rule set recovers zero here; the two-rule subset recovers five. Over-normalization collapses keys that should stay distinct, and shadowjoin names the better subset instead of letting you assume more rules is better.
It separates mechanical misses from semantic ones. The 39 it cannot explain are not normalization problems at all:
No string transform recovers those. They need an alias table or a real entity resolution library. Knowing which of your misses are mechanical and which are semantic is the difference between a one-line fix and a project.
That particular join is deliberately unflattering — a short index name against a full security description. It is a worked example of the measurement, not a claim that anyone ships that join. Point it at your own data to get a figure that means something about you.
The number is a floor, not an estimate
You cannot compute recall without labels. The entity-resolution literature calls the metric pair completeness, and it assumes an oracle you do not have in production.
So shadowjoin reports a lower bound: matches the shadow matcher found that exact matching missed. The shadow matcher has unknown recall of its own, so the true loss is at least this large and may be larger. Every figure ships with sample pairs so a human can verify them by hand, and when ground truth is available on both sides, the report carries a precision figure too.
This is deliberately the weaker claim. It is also the one that survives being questioned.
Why not just ask an LLM to check?
For a one-off look at a small table, do that — it is faster and this tool is redundant. It stops working when:
- You need the same number twice. An agent writes different SQL every run, so you cannot tell whether the pipeline changed or the query did.
- You need rules nobody thought of. Asked "is this join lossy," an agent tries
lower()andtrim(). It does not systematically try NFKD folding, diacritics, leading zeros, corporate suffixes, token reordering or listing boilerplate. The exhaustive rule set is the product. - You need it in CI.
--max-lossexits non-zero. "Ask Claude" has no exit code. - Exploratory SQL on production is expensive. This does hash joins on precomputed keys, under a statement timeout, in a read-only transaction.
Install
Zero runtime dependencies. pg and @modelcontextprotocol/sdk are optional
peers, pulled in only if you use the Postgres adapter or the MCP server.
Use it
CLI
Sources: CSV, JSON, Postgres, MySQL and SQLite. SQLite uses Node's built-in
node:sqlite (Node 22.5+), so it needs nothing installed; Postgres and MySQL
need pg or mysql2, which are optional peers.
Anything else works through the library in three lines, because the core takes two arrays rather than a connection:
Library
Claude Code plugin (easiest)
One command installs the skill and the MCP server together, and prompts for your config path:
Also listed in the official MCP registry
as io.github.harsh-chandak/shadowjoin.
MCP server
Lets an agent measure a join, look at real examples, propose a fix, and then prove the fix worked — a loop it cannot fake, because the measurement is not something it writes.
Tools: scan_join, explain_misses, suggest_normalization, compare_runs.
Two things this MCP server deliberately does not have:
- No tool that executes arbitrary SQL. An agent can name a configured source, a table and a column. That is the entire surface.
- No tool that accepts a connection string. Credentials live in your config file and never enter a tool call, because tool calls end up in transcripts.
Pointing it at a real database
shadowjoin opens a READ ONLY transaction with statement_timeout,
lock_timeout and idle_in_transaction_session_timeout set, and it refuses to
run if the role it connected with can write to the table it is about to read.
Give it a role that makes trust unnecessary:
Point it at a replica where you can.
It makes no outbound network connection except to the source you give it. No telemetry, not even opt-out. Check the imports — there are three dependencies and none of them is an HTTP client.
Limits
Read these before quoting a number from it.
- The figure is a floor. The shadow matcher's own recall is unknown. True loss is at least this, possibly more.
- Recoveries can be wrong. In the bundled example, 1 of 428 was contradicted
by ground truth and 8 were ambiguous — mostly share classes, where stripping
"Class A" merges genuinely different securities. Ambiguous matches need a
tie-breaker, not a normalization rule. Always read
samplePairs. - Per-rule counts overlap and will not sum to the total. Each is measured
independently against the exact baseline, deliberately, so the numbers are not
an artifact of the order rules happen to run in. Use
stack— the greedy ordering — to decide what to actually adopt. - More rules is not better. Applying every rule can recover fewer matches than the best subset, because over-normalization merges keys that should stay apart. shadowjoin warns when this happens and names the better subset.
- It reads your join keys, so those values are in memory while it runs.
--redacthashes them in sample output and server-side normalization keeps whole rows in the database, but neither makes the keys invisible. For regulated data, run it on a replica inside your own environment. - It does not write, fix or migrate anything. It measures.
unaccentin emitted SQL needs the Postgres extension of the same name.
Prior art
Blocking recall — pair completeness — is well established in the entity-resolution literature, along with its companions pairs quality and reduction ratio:
- A Survey of Blocking and Filtering Techniques for Entity Resolution
- Comparative Analysis of Approximate Blocking Techniques for Entity Resolution
- Supervised Meta-blocking
Those papers assume a labelled gold standard. shadowjoin's contribution is not the metric — it is computing a defensible version of it against a live pipeline with no labels at all, and reporting it as a bound rather than a point estimate.
For doing the matching rather than measuring what yours misses, use Splink, Dedupe or recordlinkage. shadowjoin is complementary: it tells you whether you need them.
License
MIT © Harsh N. Chandak
来源:README.md,提交 adf3faf
工具
0版本历史
2- v0.3.2最新Oct 17, 2026
- v0.3.1Oct 11, 2026
评分
已满足适用检查项的 50%
该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。
- 近 30 天内可连通25 分
请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。
- 已声明认证方式10 分
请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。
- 已列出工具15 分
请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。
- 描述必需15 分
- 图标10 分
- 文档15 分
- 许可证10 分