Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3198944.pdf (4MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Optimization of Data Accesses for Database Applications
Author(s):Chen, Zhifeng
Doctoral Committee Chair(s):Zhou, Yuanyuan
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
Abstract: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.
Issue Date:2005
Type:Text
Language:English
Description:115 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.
URI:http://hdl.handle.net/2142/81678
Other Identifier(s):(MiAaPQ)AAI3198944
Date Available in IDEALS:2015-09-25
Date Deposited:2005


This item appears in the following Collection(s)

Item Statistics