关于「多域名舰队:独立价值、查询分工与 hreflang 簇」,《长尾页信息增益与收录排程》给出的定量结论是什么?
结论:第六章讨论多域名舰队的独立价值与查询分工,分工后覆盖查询从 1,548 条增到 1,782 条,并给出 hreflang 簇的维护方法。
数据口径:书中参数为示意,全部计算由书中程序生成。 本书是非个人化经营建议;房产内容不构成法律、税务或投资建议,塔罗部分不做个人占断,宗祠资料须经本人同意,书中数据全部合成。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1548, 1782
before: 8 sites, 1,548 distinct target queries creator-MY creator-SG Jaccard 0.2500 FLAG prop-1 prop-2 Jaccard 0.3077 FLAG prop-1 prop-3 Jaccard 0.5385 FLAG prop-2 prop-3 Jaccard 0.3077 FLAG tarot-MY tarot-TW Jaccard 0.5000 FLAG flagged pairs: 5 after: 8 sites, 1,782 distinct target queries flagged pairs: 0
查看完整验算程序
# Chapter 6. p61: query cannibalisation inside a multi-domain fleet.
# Each site targets a set of query families (synthetic ids). Overlap of
# two sites = Jaccard index of their target sets; a pair above 0.20 is
# flagged: two of our own domains would compete for the same searches
# and split links, crawl and attention. "Before" is a fleet grown by
# copying; "after" gives each domain one job. Sizes are illustrative.
import itertools
FAM = {"national guide": 200, "KV areas": 300, "Penang areas": 150,
"Johor areas": 150, "tarot en": 234, "tarot zh-MY": 234,
"tarot zh-TW": 234, "creators MY": 100, "creators SG": 100,
"clan records": 80}
def ids(fam, frac=1.0):
n = int(FAM[fam] * frac)
return {"{}:{}".format(fam, i) for i in range(n)}
BEFORE = {
"prop-1": ids("national guide") | ids("KV areas"),
"prop-2": ids("national guide") | ids("Penang areas"),
"prop-3": ids("national guide") | ids("Johor areas")
| ids("KV areas", 0.5),
"tarot-MY": ids("tarot en") | ids("tarot zh-TW"),
"tarot-TW": ids("tarot zh-TW"),
"creator-MY": ids("creators MY") | ids("creators SG", 0.5),
"creator-SG": ids("creators SG"),
"clan": ids("clan records"),
}
AFTER = {
"prop-1": ids("national guide") | ids("KV areas"),
"prop-2": ids("Penang areas"),
"prop-3": ids("Johor areas"),
"tarot-MY": ids("tarot en") | ids("tarot zh-MY"),
"tarot-TW": ids("tarot zh-TW"),
"creator-MY": ids("creators MY"),
"creator-SG": ids("creators SG"),
"clan": ids("clan records"),
}
def report(name, fleet):
flagged = 0
rows = []
for a, b in itertools.combinations(sorted(fleet), 2):
sa, sb = fleet[a], fleet[b]
j = len(sa & sb) / float(len(sa | sb))
if j > 0.0:
rows.append((a, b, j))
if j > 0.20:
flagged += 1
targets = set()
for s in fleet.values():
targets |= s
print("{}: {} sites, {:,} distinct target queries".format(
name, len(fleet), len(targets)))
for a, b, j in rows:
print(" {:<10} {:<10} Jaccard {:.4f}{}".format(
a, b, j, " FLAG" if j > 0.20 else ""))
print(" flagged pairs: {}".format(flagged))
if __name__ == "__main__":
report("before", BEFORE)
report("after", AFTER)唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多域名程序化SEO长尾拓扑、新站沙盒极速收录与高意图自然流量收割母典》第 6 章「多域名舰队:独立价值、查询分工与 hreflang 簇」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-346 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026346,
author = {Fan, Yafu},
title = {Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}