Reputation
4,086
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
2 15 40
Impact
~188k people reached

Apr
12
comment 'Id' with the format: YYYYNNNNNN with the NNNNNN part restarting each year
Maybe it's cleaner to have one sequence per year. That way there is no need to execute DDL as part of regular operations.
Mar
29
comment What problems are solved by splitting street addresses into individual columns?
So why is it useful to split at all? What about just providing 3 string "lines" for the address?
Mar
23
comment A significant part of SQL Server process memory has been paged out
I don't know why DB backups would cause significant memory pressure. The transfer buffers are tiny.
Feb
25
awarded  Popular Question
Feb
22
comment How are SQL backups different from IT regular nightly server backups?
Aren't Windows volume snapshots supposed to be consistent?
Feb
21
comment Field order in a composite index order with high selectivity and low selectivity fields
@Thinkinger also, indexed views are not EE-only. Indexed view matching is EE-only. You can directly target them using NOEXPAND.
Feb
19
awarded  Yearling
Feb
18
comment Field order in a composite index order with high selectivity and low selectivity fields
@Thinkinger in case you're not accepting Aarons approach you've got a tough choice :)
Feb
18
awarded  Nice Answer
Feb
17
comment Field order in a composite index order with high selectivity and low selectivity fields
@DanielHutmacher OMG, will we manage to almost match our posts for a 3rd time?! +1 to you! How could I not upvote an identical answer?
Feb
17
comment Field order in a composite index order with high selectivity and low selectivity fields
Funny, 4 seconds apart and the same answer.
Feb
17
answered Field order in a composite index order with high selectivity and low selectivity fields
Feb
17
comment Why SqlBulkCopy gets slower by table's row count?
You can capture the bulk plan using SQL Profiler and the Showplan XML event. But it will be just as boring. The 1 row plan is sufficient here.
Feb
17
comment Why SqlBulkCopy gets slower by table's row count?
Two more ideas: Auto-grow and changing size of rows being inserted (becoming bigger). You need to investigate that.
Feb
17
comment Why SqlBulkCopy gets slower by table's row count?
Provide the execution plan. Probably, there is a non-append-only component to the inserts. Maybe an index that causes randomly placed writes. Eventually, the buffer pool cannot buffer those write anymore and performance tanks big time. Append-only inserts never get slower over time.
Feb
15
comment Why does SQL Server require non-clustered index to use unique keys?
What you propose is theoretically possible. It would be a form of data compression built into the b-tree. The space savings depend on how big index prefixes typically are.
Feb
15
comment Why does SQL Server require non-clustered index to use unique keys?
This is not how b-trees work in SQL Server. An index (b-tree) is just a copy of the base table with a subset of columns and sorted differently. It's a "sorted list". This is a rather nice and general model because all indexes are the same. SQL Server does not distinguish (in a a relevant way) between CI and NCI on a physical level.
Feb
15
answered Why does SQL Server require non-clustered index to use unique keys?
Feb
12
comment Progress of SELECT INTO statement
This is creative. Just want to add a warning that enumerating a big buffer pool is very slow.
Feb
11
comment SQL Server : Included columns in an Index: is there something like “too many”?
it feels like duplicating the table itself that's exactly right but it's not a problem by itself.