January 22, 2009 at 4:10 am
Hi Guys/Gals, first time poster here.
I've been an architect/developer professionally for a few years now since leaving university, but been coding for many years. I have one question that I'm trying to understand, and it might be possible in SQL, but it might not. By the way, I'm definately not beginner by the way!
I have a smallish SQL Server 2005 database, with 25 tables with solid DB design. My main two tables have around 500,000 rows in each which seems fair. It's powering an ASP.NET front end, but this is kind of irrelevant. Part of the ASP.NET front end is that the user should be able to search on the data in the database and it'll bring back a ranked list etc. There are 8 criteria in the search, and one is postcode (and it calculates the distance). It's also using a simple full text search on two fields.When running on a quad xeon with 8GB RAM it takes around 3 seconds per search which although is pretty decent, when there are 100 people searching at a time it's unacceptable.
Now there are quite a few websites, such as DatingDirect, that can search 15 criteria... calculate distances... rank... etc in 0.05 seconds, and they have literally millions of rows that they are querying.
Is this sort of performance even achievable using someting like SQL Server?! If not, how are these companies achieving such performance?
Forgive me if this isn't the place to have this sort of discussion!
Regards,
Stu
January 22, 2009 at 4:22 am
This post has been posted on 2 locations 🙂
January 22, 2009 at 4:33 am
hi, sorry. I mention in the second one that I posted it in the wrong place the first time! Can a mod please delete this thread!
Sorry!
Viewing 3 posts - 1 through 3 (of 3 total)
You must be logged in to reply to this topic. Login to reply