We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to solve the orthogonal range search problem in k dimensions, requires linear space, and supports dynamic operations. An expected time analysis of the algorithm indicates it is competitive with the best known k-d range search algorithms when k is large (i.e. k ≈ log n).