having 1 million customer addresses, how to store and search them efficiently. Suppose you can search the address by phone number or name or account n

having 1 million customer addresses, how to store and search them efficiently. Suppose you can search the address by phone number or name or account number. My response is to use a hashtable with phone number as the key and address as the value. But how to implement multiple keys to the same value? Any other options?

Use kd tree to partition the address, 3 dimensions are phone number, name and account number