1. A method of processing a set of intersection queries in a multi-dimensional data structure, the method comprising: receiving the set of intersection queries for the multi-dimensional data structure; determining whether to process each of the set the intersection queries individually, or whether to process the set of intersection queries together using pre-cached modifier mappings, wherein: the pre-cached modifier mappings comprise mappings between values in nodes in the multi-dimensional data structure and values used to adjust the respective nodes before the respective nodes are rolled up into parent nodes; and processing the set of intersection queries together comprises: determining a set of intersection nodes from the set of intersection queries; enumerating a set of base nodes that descend from the set of intersection nodes; removing any duplicate base nodes from the set of base nodes; projecting each base node in the set of base nodes onto one or more corresponding intersection nodes using the pre-cached modifier mappings to compute intersection values for the intersection nodes; and providing the intersection values; processing the set of intersection queries; and providing the intersection values that correspond to the set of intersection queries.