Optimizing large databases : a study on index structures

The following research is about comparing index structures for large databases, both analytically and experimentally. The study is divided into two main parts. The first part is centered around hash-based indexing and B-trees. Both of which are set in the context of the widely known external memory model. The second part presents the cache-oblivious model, describing its implications on the design of algorithms for any arbitrary pair of memory levels...