Memory-based index structures K-d-tree, Range tree, Quadtree, etc. No page-based organization of nodes. Fanout (i.e., number of children) does not depend on page capacity. Mostly used for low-dimensional data.