Home -> Usenet -> comp.databases.theory -> Disk IO scheduling

Disk IO scheduling

From: hantheman <hantheman12_at_hotmail.com>
Date: 23 Dec 2003 01:34:07 -0800
Message-ID: <580fae16.0312230134.30b34053_at_posting.google.com> 





Hi all,



I'm looking into how databases work.



    
  
  1.   Is it possible for DBMS's to schedule disk IO such that if 3
transactions are running concurrently, it sorts the accessess by how
near they are to eachother (to reduce the number of seeks).

  
  2.   I think this is a good idea, but does this complicate transaction
handling? What if timestamp ordering is used?

  
  3.   Does asynchronous IO API's schedule disk IO this way?






Best,


han
Received on Tue Dec 23 2003 - 10:34:07 CET












Original text of this message