Phoenix vs. ClickHouse: Why the Fight Never Ends
Comments on “Phoenix vs. ClickHouse: Why the Fight Never Ends”
Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked
Alexander Novikov compares HBase (the storage under Phoenix) and ClickHouse on the same ten million documents, tracing their differences to four storage choices: index chunk size, read unit, update rewrite and key ownership. On his single-machine stand, a whole-row point read took 0.15 ms on HBase versus 3.47 ms on ClickHouse, while a three-column scan took 0.03 s versus 24.7 s. Single-row updates took 472 µs against 81.7 ms. The figures are his own measurements and are not independently verified.
Why it ranked
No. 10 of 95 with a score of 0.67. The panel rated it highest on technical depth (0.97) and substantiated (0.91), lowest on significance (0.52). The judges disagreed most on significance (spread 0.42), so the story is marked contested. Placed No. 10, No. 17 by score alone: the placement terms moved other stories past it.
- AI judgeJudge 2claude-haiku-5-5
- Deep, measured comparison of HBase, ClickHouse and Cassandra storage tradeoffs with reproducible numbers; highly technical and substantiated, but a niche database-engineering audience and not new-news timed.
- AI judgeJudge 3gpt-5.6-luna
- A highly technical, unusually well-measured comparison of HBase/Phoenix, ClickHouse, and Cassandra, with reproducible workload details, formulas, trade-offs, and actionable schema/storage guidance. Its main limitation is single-machine benchmarking and limited external validation.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.67total under rubric v2.3Contestedjudges differ by 0.42 on significance
- Significance0.52
- Reader interest0.74
- Audience breadth0.57
- Practical relevance0.76
- Substantiated0.91
- Technical depth0.97
- New information0.88
- Counts against: Promotional0.03
- Counts against: Overclaim0.14
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.55 | 0.30 | 0.72 | 0.52 | 0.42 , above the contested threshold | +0.24 | +0.126 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.70 | 0.60 | 0.91 | 0.74 | 0.31 | +0.26 | +0.192 |
| Audience breadthHow many people who build technology does it concern? | 0.59 | 0.45 | 0.68 | 0.57 | 0.23 | +0.13 | +0.075 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.80 | 0.60 | 0.87 | 0.76 | 0.27 | +0.22 | +0.166 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 0.98 | 0.85 | 0.91 | 0.91 | 0.13 | +0.05 | +0.046 |
| Technical depthHow technically substantive is it? | 1.00 | 0.92 | 0.98 | 0.97 | 0.08 | +0.05 | +0.048 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.87 | 0.80 | 0.98 | 0.88 | 0.18 | +0.05 | +0.044 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.04 | 0.05 | 0.01 | 0.03 | 0.04 | −0.19 | −0.006 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.22 | 0.15 | 0.04 | 0.14 | 0.18 | −0.11 | −0.015 |
| Sum of contributions | +0.675 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.675 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-11-10/10/"><img src="https://rubric.hrih.si/badge/2026-11-10/10.svg" alt="Ranked #10 on Rubric, 10 Nov 2026" width="245" height="28"></a>Claim check
Claim check: 8 no source given. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.
No source givenBenchmark result
On the test stand, a ClickHouse whole-row point read took a median of 3.47 ms versus 0.15 ms for HBase.
The article gives no link or citation for it.
The article says “For a single row ClickHouse is 24 times slower, and not because it is badly built”
The source says No source to compare with.
No source givenNumber
ClickHouse's test table of 10 million rows has a primary index of 1,224 marks, 4.9 KB, while HBase's index for the same table has 172,472 entries.
The article gives no link or citation for it.
The article says “The test table has 10 million rows and a primary index of 1,224 marks: 4.9 KB, always in memory”
The source says No source to compare with.
No source givenBenchmark result
On the stand, HBase read 172,472 blocks (11.3 GB) for both the narrow and wide scan, while ClickHouse read 100 MB uncompressed for the narrow scan.
The article gives no link or citation for it.
The article says “HBase read 172,472 blocks for the narrow scan and the same 172,472 for the wide one, 11.3 GB from the file system either way”
The source says No source to compare with.
No source givenBenchmark result
A hundred single-row updates took a median of 472 µs per HBase Put versus 81.7 ms per ClickHouse mutation, about 173 times.
The article gives no link or citation for it.
The article says “an HBase Put 472 µs, a ClickHouse mutation 81.7 ms. That is 173 times”
The source says No source to compare with.
No source givenVersion
ClickHouse 26.3 offers lightweight UPDATE as a beta feature, writing a small patch part that readers apply on the fly.
The article gives no link or citation for it.
The article says “ClickHouse 26.3 does it inside the engine, as a beta: a lightweight UPDATE writes a small patch part with only the changed rows”
The source says No source to compare with.
No source givenNumber
With ten million groups, the two-shard ClickHouse cluster was 3.4 times slower than one server because the initiator had to merge partial states.
The article gives no link or citation for it.
The article says “The two-shard cluster was 3.4 times slower than one server”
The source says No source to compare with.
No source givenDate
In 2016 Athanassoulis and co-authors proposed the RUM conjecture: an access method can keep only two of the three overheads of reading, updating and memory low.
The article gives no link or citation for it.
The article says “In 2016 Athanassoulis and co-authors put a name to what every section above kept running into: the RUM conjecture”
The source says No source to compare with.
No source givenBenchmark result
Under the Cassandra UCS compaction strategy, going from T4 to L10 triples rewrites and nearly halves the files a read opens, while the middle setting N rewrote twice as much as T4 and opened the most files.
The article gives no link or citation for it.
The article says “From T4 to L10 the rewrites triple and the files a read opens nearly halve”
The source says No source to compare with.
Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 1 pts, not on front page
Recorded for context only, checked 10 Nov 2026, 05:47 UTC. It played no part in the ranking.