I agree. In the "new" FK-based approach, you'll still need to scan indexes to match the IP and email addresses (now in their own tables) to find the FKs, then do one more scan to match the FK values. I would think this would be significantly slower than a single compound index scan, assuming index scans are O(log(n))
Key thing is to use EXPLAIN and benchmark whatever you do. Then the right path will reveal itself...
Key thing is to use EXPLAIN and benchmark whatever you do. Then the right path will reveal itself...