{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81678"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81678","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimization of Data Accesses for Database Applications","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chen, Zhifeng"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Zhou, Yuanyuan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:59Z","date_published":"2015-09-25T20:19:59Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3198944"],"render_values":[{"text":"(MiAaPQ)AAI3198944","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81678","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Zhou, Yuanyuan"]},{"key":"dc:creator","label":"Author","values":["Chen, Zhifeng"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:59Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81678","(MiAaPQ)AAI3198944"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2015-09-25T20:19:59Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3198944.pdf: 3661941 bytes, checksum: 5805fb5acaa0588affbc5629b0826ed7 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82959 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","115 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Optimization of Data Accesses for Database Applications"]}]}],"canonical_facts":{"dc:contributor":["Zhou, Yuanyuan"],"dc:creator":["Chen, Zhifeng"],"dc:date":["2015-09-25T20:19:59Z","10000-01-01","2005"],"dc:description":["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.","Made available in DSpace on 2015-09-25T20:19:59Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3198944.pdf: 3661941 bytes, checksum: 5805fb5acaa0588affbc5629b0826ed7 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82959 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","115 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/81678","(MiAaPQ)AAI3198944"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Optimization of Data Accesses for Database Applications"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}