This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
Could some one give me some advice here on the best way to appraoch this problem.
I have a database with a one to many relationship, the many in this case is lets say 1000 single rows of reference data.
Now my question is, how to achieve performance rather than searching all these rows is it better to store the data as a serialized object in this case an array, reducing the amount of rows in the database or should I just store the data as a one to many?
Reggie, The number of rows isn't a factor, it's the amount of data. I would go with the one to many relationship. I assume you have a table that has a foreign key along with the large objects. As long as there is an index on the foreign key, performance shouldn't be an issue.