{"id":"storage-operations-have-unbounded-memory-consumption","text":"Three core storage operations materialize entire datasets in memory with no streaming, pagination, or backpressure: LSM range scans load all matching entries into a dict before returning, compaction buffers all merged entries into a list before writing, and SSTable lookups rebuild the sparse index key list on every call — creating O(n) memory pressure proportional to total data size rather than result size.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["lsm-range-scan-materializes-all","compaction-buffers-all-entries","sstable-get-rebuilds-key-list-every-call"],"outlist":[],"label":"All three operations eagerly materialize full datasets with no memory bound"}],"dependents":["materialization-barriers-span-storage-and-processing"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"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"}]}}