Unverified50% confidenceBenchmarkExact time
Indexing the entire Linux kernel (about 2.1 million nodes) took only about three minutes, showing that the cost of graph indexing does not explode linearly with codebase size.
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhen a table contains 4 million 120 KB small files, the manifest files themselves can number in the thousands and total several GB, and merely reading this metadata tree can exhaust the Trino coordinator's heap space.61% similarUnverifiedThe write rate given in the article's chart is approximately 1,000 sectors/minute, which converts to approximately 0.27 TB/year based on Linux's 512-byte sectors.61% similarUnverifiedThe performance data provided by Logic42 shows that when the number of files per partition increases from 4 (512 MB/file) to 18,500 (120 KB/file), Trino planning latency rises from 45 ms to 38,000 ms, and end-to-end query time goes from 480 ms to timeout (OOM).60% similarUnverifiedWhen the 120B coordinator is resident (about 77GB), only about 3GB of memory is free in the system; in a multi-image run the first image completes and the remaining images time out at the 300-second limit and fall back to placeholders.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1040814API
curl https://kongchang.com/api/v1/knowledge/claims/1040814MCP
get_claim(id=1040814)