MARC 主機 00000nam  2200349   4500 
001    AAI3198944 
005    20070102084747.5 
008    070102s2005                        eng d 
020    9780542445729 
035    (UnM)AAI3198944 
040    UnM|cUnM 
100 1  Chen, Zhifeng 
245 10 Optimization of data accesses for database applications 
300    115 p 
500    Source: Dissertation Abstracts International, Volume: 66-
       12, Section: B, page: 6718 
500    Adviser: Yuanyuan Zhou 
502    Thesis (Ph.D.)--University of Illinois at Urbana-Champaign,
520    Access speeds of the main memory and disks lag far behind 
       the microprocessor speed. Consequently, disk and memory 
       accesses pose significant performance bottlenecks for many
       applications. This dissertation investigates techniques 
       that improve the effectiveness of buffer caches and 
       processor caches to bridge these two speed gaps for 
       database servers in a data center environment 
520    To address the disk bottleneck, this dissertation proposes
       the global management of the database-storage buffer cache
       hierarchy to deliver the performance comparable to that of
       the aggregate cache size. To manage buffer caches globally,
       this dissertation answers two challenging questions: (1) 
       without the modifying the I/O interface, namely hierarchy-
       aware, how to collaborate database and storage caches 
       globally; (2) with the extension of the I/O interface, 
       namely aggressively-collaborative, whether the consequent 
       performance improvement is worthwhile 
520    To answer the first question, this dissertation proposes 
       the hierarchy-aware caching. This method tracks the 
       eviction of database server buffer caches transparently. 
       Upon the eviction, the storage server fetches the 
       corresponding block from the disk selectively. The 
       evaluation shows that this method improves the storage 
       cache hit ratio and database transaction rate 
520    To answer the second question, this dissertation explores 
       empirically the design space for the database-storage 
       collaborative caching. This design space has three 
       dimensions: collaboration approaches, replacement 
       algorithms and workload specific optimizations. Through 
       both simulation and implementation, this dissertation 
       evaluates 248 design combinations, which include all the 
       previous proposed and many new solutions. The results 
       indicate that the aggressively-collaborative caching only 
       provides marginal performance improvement over the 
       hierarchy-aware caching in all the tested cases. In short,
       the hierarchy-aware caching, without changing the I/O 
       interface, can perform as well as the aggressively-
       collaborative caching 
520    To address the memory access bottleneck, this dissertation
       proposes Hanuman, which reformats data dynamically in the 
       database buffer. By adapting data layouts to the changing 
       workload, Hanuman improves the data spatial locality and 
       the processor cache hit ratio accordingly. To determine 
       the best data layout, Hanuman conducts the heuristic cost 
       analysis for candidate layouts and chooses the best layout
       that minimizes the estimated cache misses. Our result 
       indicates that Hanuman is effective and efficient 
590    School code: 0090 
590    DDC 
650  4 Computer Science 
690    0984 
710 20 University of Illinois at Urbana-Champaign 
773 0  |tDissertation Abstracts International|g66-12B 
856 40 |u