The cost of a lookup on the term is O(1) with one perhaps two main memory accesses and measured in nanoseconds. The search index is likely a tree, and will be

The cost of a lookup on the term is O(1) with one perhaps two main memory accesses and measured in nanoseconds. The search index is likely a tree, and will be taking a main memory stall every node traversal. There are hundreds of easter eggs. There a trillions of search entries. The cost of even a byte per entry would be massive.