Unit SS, Part A: PAT, PAT Arrays

• Sorted sistrings -> small array of IDs
• Simulate tree op: O(log n) accesses
• Fast prefix, range searches
• Naive build would require n log n disk accesses -- too long!
• Fast builds --> recall FAST-INV
  • Memory loads, merging