In this thesis, the rectangle enclosure searching and containment searching problems are considered.
We presents efficient algorithms for these searching problems using the new layered segment tree called D-tree. And it is also shown that this D-tree can be applied to the problems such as horizontal line segment enclosure searching and dominance searching.