The rectangle cover problem arises in geographic data base applications where it is required to retrieve rectangles wholly or partly covered by a given rectangle. A structure based on allocation of linear keys developed by a quadtree decomposition of the region is described, together with an algorithm. Analysis shows that for a large data base and small search rectangles the number of rectangles in the data base inspected is O(√n) where n is the number of rectangles.