c. Partition based on the hash of the term: Each term will be passed to a hash function, which will generate a server number and we will store the term on that server. This will make our term distribution random and hence minimize hotspots. To find typeahead suggestions for a term we have to ask all the servers and then aggregate the results. We have to use consistent hashing for fault tolerance and load distribution.
Q: since the hash function generate only one server number and we store the term on that server, what does it mean by that “we have to ask all the servers for typeahead suggestions”?