Module overlap 

Structs

FileOverlapIndex 🔒

Snapshot-local overlap candidates, ordered by start time. Each subtree stores its maximum active end. Removing visited files prunes dense internal overlaps. PK-disjoint files with overlapping times can still cost O(N) per query, so a complete closure has O(N²) worst-case time and O(N) auxiliary space.

OverlapQuery 🔒

Functions

files_may_overlap 🔒

SST bounds are inclusive. Missing statistics, foreign encodings and schema evolution must not exclude a possible logical-key dependency.