Vector Database Sharding

1. The Pattern

When the similarity index outgrows one machine, split it: but similarity search breaks Module 3's best rule. A nearest-neighbor query has no key: the closest vectors could live anywhere: so the default is scatter-gather to every shard, and the craft is finding the cases where a routable key returns.