\chapter{Evaluation}\label{ch:eval}

In this chapter, we demonstrate why X-trees are so good.

\section{Evaluating Indexing Methods}

Indexing methods are typically evaluated based on page fetches
over a range of queries.

\section{Experimental Testbed}

We wrote a simulator that accepted queries in our own little
language and emulated what would happen in a real X-tree.

\section{Results}

Thhe following table shows the number of pages fetched for each
of a range of queries on a range of data sizes from $10^5$ tuples
to $10^8$ tuples.

\section{Discussion}

X-trees work well for queries of type Y, but under certain
circumstances, Z queries are particularly slow.
