In our approach, two techniques are jointly used: clustering and multi-page requests. The technique of clustering takes care of storing pages on one cylinder which are frequently required by the same query in common. In contrast to issuing a request for each qualifying page of a query, one multi-page request is used for retrieving all qualifying pages from a cylinder. Due to these techniques, the access time of a qualifying page can be substantially reduced compared to the average (disk) access time. For the sake of concreteness, our discussion is based on the problem of supporting range queries on B+-trees. In an experimental performance study, we show that the response time of a range query can be reduced by several factors if the B+-tree exploits both techniques (clustering and multi-page requests).