What’s generally faster in programming with databases: querying many small tables, or is it better to have a big table?
What’s generally faster in programming with databases: querying many small tables, or is it
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What’s generally faster in programming with databases: querying many small tables, or is it better to have a big table?
I don’t think the size of a table as such should be your criteria… modern relational databases can pull one row out of millions of rows very quickly – that’s really not a concern.
What you should do however is design your tables in such a way that they make sense, e.g. contain one entity and only one entity. Don’t start mixing multiple entities into a single table…
Like classes in your C# application, a database table should always be dealing with one responsibility (or concern) only. Don’t store disparate data into a single data – just for the sake of a perceived performance benefit…..