 <p>I would skip the database for reasons listed above. A simple hash in memory will perform about as fast a lookup in the database. </p> <p>Even if the database was a bit faster for the lookup, you're still wasting time with the DB having to parse the query and create a plan for the lookup, then assemble the results and send them back to your program. Plus you can save yourself a dependency.</p> <p>If you plan on moving other parts of your program to a persistent store, then go for it. But a hashmap should be sufficient for your use.</p>