{"id":"materialization-barriers-span-storage-and-processing","text":"Unbounded in-memory materialization is a cross-cutting concern from storage through batch processing: storage operations (LSM range scans, compaction, SSTable index rebuilds) materialize entire datasets, and pipeline stages (Count) silently accumulate all input before producing output, meaning the materialization problem exists at every layer of the data processing stack.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["storage-operations-have-unbounded-memory-consumption","count-is-barrier"],"outlist":[],"label":"Both storage reads and batch processing stages have unbounded materialization points"}],"dependents":["data-distribution-and-processing-hit-independent-scalability-ceilings"],"metadata":{"last_reviewed":"2026-05-30T09:01:17","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"materialization-barriers-span-storage-and-processing","truth_value":"IN","reason":"SL justification valid","antecedents":["storage-operations-have-unbounded-memory-consumption","count-is-barrier"],"label":"Both storage reads and batch processing stages have unbounded materialization points"},{"node":"storage-operations-have-unbounded-memory-consumption","truth_value":"IN","reason":"SL justification valid","antecedents":["lsm-range-scan-materializes-all","compaction-buffers-all-entries","sstable-get-rebuilds-key-list-every-call"],"label":"All three operations eagerly materialize full datasets with no memory bound"},{"node":"lsm-range-scan-materializes-all","truth_value":"IN","reason":"premise"},{"node":"compaction-buffers-all-entries","truth_value":"IN","reason":"premise"},{"node":"sstable-get-rebuilds-key-list-every-call","truth_value":"IN","reason":"premise"},{"node":"count-is-barrier","truth_value":"IN","reason":"premise"}]}}