115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.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.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent ...
Commercial link : http://www.springerlink.de/ ALCHEMY/http://www.springer.comCache memories were inv...
107 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.To recompute from scratch, ca...
htmlabstractMany applications with manually implemented data management exhibit a data storage patte...
As the speed of microprocessors increases according to Moore's law, access speeds of the main memory...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
The memory system is a major bottleneck in achieving high performance and energy efficiency for vari...
In the past decade, the exponential growth in commodity CPUs speed has far outpaced advances in memo...
During the last two decades, computer hardware has experienced remarkable developments. Especially C...
We present and evaluate a simple, yet efficient dynamic optimization technique that increases memory...
Data access management in web-based applications that use relational databases must be well thought ...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Abstract. As the ever-increasing gap between the speed of processor and the speed of memory has beco...
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent ...
Commercial link : http://www.springerlink.de/ ALCHEMY/http://www.springer.comCache memories were inv...
107 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.To recompute from scratch, ca...
htmlabstractMany applications with manually implemented data management exhibit a data storage patte...
As the speed of microprocessors increases according to Moore's law, access speeds of the main memory...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
The memory system is a major bottleneck in achieving high performance and energy efficiency for vari...
In the past decade, the exponential growth in commodity CPUs speed has far outpaced advances in memo...
During the last two decades, computer hardware has experienced remarkable developments. Especially C...
We present and evaluate a simple, yet efficient dynamic optimization technique that increases memory...
Data access management in web-based applications that use relational databases must be well thought ...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Abstract. As the ever-increasing gap between the speed of processor and the speed of memory has beco...
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent ...
Commercial link : http://www.springerlink.de/ ALCHEMY/http://www.springer.comCache memories were inv...
107 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.To recompute from scratch, ca...