1. A computer-implemented method of managing a database contained in a storage facility, comprising: structuring the database to a have a plurality of tables having indexes to related rows and having keys associated with particular rows, the database including a first table and a first index for accessing the first table, the first index being organized as a search tree having a plurality of nodes, the plurality of nodes including a plurality of lower-most child nodes, each lower-most child node storing a key corresponding with a row of the first table; and deleting three or more rows in the first table by deleting keys in corresponding lower-most child nodes of the first index in a first order, the first order beginning at a first lower-most child node to be deleted, the first lower-most child node being a node closest to one side of the tree, the first order including a first subsequent node to be next deleted after the first lower-most child node, the first subsequent node being a second lower-most child node reachable from the first lower-most child node in a first number of jumps in the tree, wherein a second number of jumps from the second lower-most child node is required to reach a third lower-most child node to be deleted, wherein the first number of jumps is fewer than the second number of jumps.