Investigates the manipulation of large sets of two-dimensional data representing multiple overlapping features, and presents a new access method, the MOF-tree. Analyzes storage requirements and time with respect to window query operations involving multiple features. Examines both the pointer-based and pointerless MOF-tree representations. Concludes that the MOF-tree can efficiently support spatial join processing in a spatial DBMS. (Author/AEF)