For fast data structures for disjoint intervals, consider Guava's Table and Range functionality if using Java for its ease of visualization and maintenance. Alternatively, a custom B-tree that understands ranges, implemented in Rust for performance and cache locality, can be highly effective. Both approaches handle complex availability and interval management efficiently.