Thanks would you suggest a btree or a hash? My guess would a hash since it uses an =.
You can pretty much ignore hash indexes in Postgres. They are, in nearly every case (every case that I know of), slower than btree. Just make the indexes using the default indexing scheme. Again, do not forget to analyze the table after creating the indexes.
