SQL Server – Arrange Rows in Paired Sequence

sql server

I have a database table in which a row has its matching pair. Checkpoint A has a matching pair checkpoint B. Every IN status has a matching OUT status. To match these exists a 'related_id' column with the id of the row it is related to.
Normally the table order can be as follows:

id | registration_no | checkpoint | related_id | status
 1      H2080              A            2          IN
 2      H2080              B            1          OUT
 3      H2081              A            8          IN
 4      H2070              A            6          IN
 5      H2087              A            7          IN          
 6      H2070              B            4          OUT          
 7      H2087              B            5          OUT
 8      H2081              B            3          OUT

but instead i would like it to be ordered in this way

id | registration_no | checkpoint | related_id | status
 1      H2080              A            2          IN
 2      H2080              B            1          OUT
 3      H2081              A            8          IN
 8      H2081              B            3          OUT
 4      H2070              A            6          IN          
 6      H2070              B            4          OUT          
 5      H2087              A            7          IN
 7      H2087              B            5          OUT

in which the leading checkpoint A is immediately followed by the matching checkpoint B by somehow using the related_id to tell which columns are paired together. So the rows will alternate between A->B then A->B and so on.

I hope i managed to explain the question.

Any help is greatly appreciated. thank you

Best Answer

You can use this ORDER BY:

SELECT  ...
FROM ...
ORDER BY
    CASE checkpoint WHEN 'A' THEN id 
                    WHEN 'B' THEN related_id
    END,
    checkpoint ;

Related Solutions

SQL Server – Cache Flush and Disk I/O Performance

Others have already pointed out the culprit: SQL Server accumulates updates in memory (in the buffer pool) and only flushes them out periodically (at checkpoints). The two options suggested (-k and checkpoint interval) are complementary:

-k will make the cause the checkpoint to produce less aggressive IO requests and last longer
lowering recovery interval will cause the checkpoint to start more often

But I did not respond only to regurgitate the fine comments you received do far :)

What you're seeing is, unfortunately, a very typical behavior of queued processing. Whether you use Service Broker queues or opt for using tables as queues approach, the system is very prone to this kind of behavior. This is because queuing based processing is write heavy, even more write heavy than OLTP processing. Both enqueue and dequeue primitives are write operations and there are almost no read operations. Simply put, queue processing will generated the most writes (= most dirty pages, and most log) compared to any other workload, even OLTP (ie. TPC-C like workload).

Very importantly, the writes of a queue workload follow an the insert/delete pattern: every row inserted is very quickly deleted. This is important to distinguish from an append-only pattern of a insert heavy (ETL) workload. You are basically feeding the ghost cleanup task a full meal, and you can easily outrun it. Think about what that means:

enqueue is an insert, it will create a dirty page
dequeue is a delete, it will dirty the same page again (it may be lucky and catch the page before checkpoint, so it will avoid double-flush, but only if is lucky)
ghost cleanup will cleanup the page, making it dirty again

Yes, it really means that you may end up writing a page three times to disk, in three different IO requests, for each message you process (worst case). And it also means that the random IO of checkpoints will be really random as the write point of the page will be visited by those moving heads again between two checkpoints (compare with many OLTP workloads tend to group the writes on some 'hot spots', not queues...).

So you have these three write points, racing to mark the same page dirty again and again. And that is before we consider any page splits, which queue processing may be prone too because of the insert key order. By comparison 'typical' OLTP workloads have a much more balanced read/write ratio and the OLTP writes distribute across inserts/updates/deletes, often with updates ('status' changes) and inserts taking the lion's share. Queue processing writes are exclusively insert/delete with, by definition, 50/50 split.

Some consequences follow:

Checkpoint becomes a very hot issue (no longer a surprise for you)
You'll see heavy fragmentation (the fragmentation per-se won't matter much as you are not going to do range scans, but your IO efficiency suffers and ghost cleanup has more to work, slowing it down even more)
Your MDF storage random IO throughput is going to be your bottleneck

My recommendation comes in 3 letters: S, S and D. Move your MDF to a storage that can handle fast random IO. SSD. Fusion-IO if you have the moneys. Unfortunately this is one of those symptoms that cannot be resolved with more cheap RAM...

Edit:

As Mark points out you have two logical disks backed by one physical disk. Perhaps you tried to follow best practices and split log on D: and data on C: but alas is to no avail, C and D are the same disk. Between checkpoints you achieve sequential throughput but as soon as checkpoint starts the disk heads start to move and your log throughput collapses, taking down the entire app throughput. Make sure you separate the DB log so that is not affected by data IO (separate disk).

Sql-server – Query Rows That Have a Following Row That Meets Criteria

I've used MySQL, but it should apply to virtually all database servers.

CREATE TABLE `test1` 
(
  `user` varchar(10) DEFAULT NULL,
  `logintype` int(11) DEFAULT NULL
);



mysql> SELECT * FROM test1;
+------+-----------+
| user | logintype |
+------+-----------+
| Bob  |         1 |
| Ryan |         1 |
| Tom  |         1 |
| Tom  |         3 |  <<== ALSO WORKS IF YOU HAVE ANOTHER 
+------+-----------+       RECORD TOM, 5
4 rows in set (0.00 sec)

mysql> 

SELECT t1.user, t1.logintype  
FROM test1 t1 
INNER JOIN test1 t2  
ON t1.user = t2.user 
AND t1.logintype != t2.logintype 
GROUP BY t1.user, t1.logintype  
ORDER BY logintype;    

+------+-----------+
| user | logintype |
+------+-----------+
| Tom  |         1 |
| Tom  |         3 |
+------+-----------+

Best Answer

Related Solutions

SQL Server – Cache Flush and Disk I/O Performance

Sql-server – Query Rows That Have a Following Row That Meets Criteria

Related Question