蒙混过关有个叫冷青的人面见开封知.ppt

Buffer management Buffer Management in a DBMS Data must be in RAM for DBMS to operate on it! Buffer Mgr hides the fact that not all data is in RAM When a Page is Requested ... Buffer pool information table contains: frame#, pageid, pin_count, dirty If requested page is not in pool: Choose a frame for replacement.Only “un-pinned” pages are candidates! If frame is “dirty”, write it to disk Read requested page into chosen frame Pin the page and return its address. More on Buffer Management Requestor of page must eventually unpin it, and indicate whether page has been modified: dirty bit is used for this. Page in pool may be requested many times, a pin count is used. To pin a page, pin_count++ A page is a candidate for replacement iff pin count == 0 (“unpinned”) CC recovery may entail additional I/O when a frame is chosen for replacement. Write-Ahead Log protocol; more later! Buffer Replacement Policy Frame is chosen for replacement by a replacement policy: Least-recently-used (LRU) Most-recently-used (MRU) Also called toss-immediate Clock Policy can have big impact on # of I/O’s; depends on the access pattern. LRU Replacement Policy Least Recently Used (LRU) for each page in buffer pool, keep track of time when last unpinned replace the frame which has the oldest (earliest) time very common policy: intuitive and simple Works well for repeated accesses to popular pages Problems? Problem: Sequential flooding LRU + repeated sequential scans. # buffer frames # pages in file means each page request causes an I/O. Idea: MRU better in this scenario? We’ll see in HW1! “Clock” Replacement Policy An approximation of LRU Instead of maintaining sorting time-stamps, find a ‘reasonably old’ frame to evict. How? by round-robin, and marking each frame - frames are evicted the second time they are visited. Arrange frames into a cycle, store one reference bit per frame , Can think of this as the 2nd chance bit W