c# Querying a large readonly table in memory

Guys I'm stumped on this one,

I have a large table with 100,000 rows of names with 15 columns of integers.

I need to query this table about 50 times or so per request searching for the integers that are less than a certain threshold.

For Example:

Tim: 10, 20, 10, 0, 5, 0

Janet: 20, 10, 20, 0, 0, 0

I would have a query that would find the people who have at least 0, 10, 0, 5, 0.

The bottle neck is of course this query in linq would have to iterate through all of the people

I need a data access strategy (in memory tables, hash tab开发者_Go百科les, dictionary, etc) in order to solve this dilemma. Does anyone have a suggestion??

Maybe this can be something for you : http://i4o.codeplex.com/ Indexed Linq to Objects, I haven't tried it though, but the idea fits your needs.

Since you are trying to find all the people who have at least a certain value, you're gonna endup having to iterate through all the people at least once.

You could use PLINQ to achieve this better.