Please start any new threads on our new
site at https://forums.sqlteam.com. We've got lots of great SQL Server
experts to answer whatever question you can come up with.
| Author |
Topic |
|
totmacher
Starting Member
1 Post |
 Posted - 2009-08-24 : 15:01:09
|
| We have a database with 400K records... a SELECT with an INNER SELECT with a where clause with 3 fields basically returns in about 2 seconds on our server. Originally, this one table was partitioned into 20-30 tables and selected from by passing the table name. For obvious reasons, we wanted to go away from that and so we used an ID that identifies these sections and then cluster over that with a clustered index. However this doesn't solve our problem. I've looked into partition tables and I don't think this would help as we don't have access to the server our production code would go to. Is there any other technique that takes a semi-large recordset partitioned by an Id and will retrieve the resulting query fairly quickly? |
|
|
russell
Pyro-ma-ni-yak
5072 Posts |
Posted - 2009-08-24 : 15:04:24
|
| show us the query and desired output. table schema with indexes would help too |
 |
|
|
|
|
|
SQL Optimization question