What does Long-Tail Information Gain and Indexation conclude, in numbers, about “A Fleet of Domains: Independent Value, a Division of Queries and hreflang Clusters”?
Answer: Chapter 6 treats the independent value and division of queries in a fleet of domains, raising covered queries from 1,548 to 1,782, and shows how to maintain hreflang clusters.
Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs. This is general business analysis, not personalised advice: property content is not legal, tax or investment advice, the tarot material offers no personal readings, and all data are synthetic.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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)Single source and citation
Fan, Y. (2026). Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets (Version 1.0.0), Chapter 6: A Fleet of Domains: Independent Value, a Division of Queries and hreflang Clusters. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · The Zipf Long Tail: Head, Tail and Intent-Weighted Cash
- Chapter 2 · The Keyword Matrix: Cartesian Products, Feasible Cells and the First Hundred Pages
- Chapter 3 · A Floor on Information Gain: Shingles, SimHash and Unique Facts per Page
- Chapter 4 · Internal-Link Topology: the PageRank Funnel and the Stationary Share of the Inquiry Page
- Chapter 5 · The Indexation Schedule: Poisson Discovery, Host Queues and Batch Launches in the First Thirty Days
- Chapter 7 · Reading the Sources: Zheng Qiao's Classes in the Tongzhi and Vannevar Bush's Associative Trails
- Chapter 8 · Closing the Loop: the Batch Ledger, the Information-Gain and Indexation Scheduler, and Pre-Registered Refutation