Show simple item record

Architecture-conscious storage management.

dc.contributor.authorHankins, Richard A.
dc.contributor.advisorPatel, Jignesh M.
dc.date.accessioned2016-08-30T15:37:21Z
dc.date.available2016-08-30T15:37:21Z
dc.date.issued2004
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3138166
dc.identifier.urihttps://hdl.handle.net/2027.42/124420
dc.description.abstractDesigners of database management systems (DBMS) have traditionally focussed on alleviating the disk I/O performance bottleneck. Because of the decreasing price and the increasing capacity of random access memory, systems with large main-memory configurations are becoming more prevalent. As the amount of main memory grows larger, data sets reside in main memory longer, and the disk I/O bottleneck shifts to the main-memory hierarchy. Because of this shift, DBMSs must become aware of the underlying architecture to maximize performance. This dissertation explores architecture-conscious design techniques that exploit the underlying architecture to improve DBMS performance. The first contribution of this thesis is an architecture-conscious data-storage technique, called Data Morphing (DM). The DM process dynamically analyzes the query workload and reorganizes the data to improve its spatial locality. The improved spatial locality reduces the number of processor cache misses that occur during query processing, thereby significantly improving performance. The second contribution of this thesis is an analysis of two architecture-conscious secondary index structures: the CSB<super>+</super>-tree and an extendible hash index. Analytical models based on the underlying microarchitectural behavior are developed for both indexes. Analysis of the CSB<super>+</super>-tree index shows that using a larger node size than originally proposed improves performance. Similar analysis of the extendible hash index shows that the overflow chain length is more critical than bucket size. Because of the tight coupling between DBMS performance and the underlying architecture, research for future processor design must take place in the simulation domain. Unfortunately, simulating large-scale database workloads is difficult due to their high complexity and cost. The third contribution of this thesis shows that the architectural behavior of a large scale database workload can be approximated by a much smaller workload. Using this smaller workload is much more conducive to simulation because of the reduced complexity and cost. This research is on the cusp of a new effort in main-memory database research. The techniques presented within are not only applicable on current DMBSs, but apply to future systems as well.
dc.format.extent155 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectArchitecture
dc.subjectConscious
dc.subjectCsb+ Tree
dc.subjectData Morphing
dc.subjectI/o
dc.subjectStorage Management
dc.titleArchitecture-conscious storage management.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineApplied Sciences
dc.description.thesisdegreedisciplineComputer science
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/124420/2/3138166.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.