This paper introduces a solution to dynamic rectangle intersection searching problem．There are two semi-dynamic algorithms which are based on 1-dimensional data structure and 2-dimensional data structure respectively．The computational complexity Of 1-D searching algorithm is as follows：query time O(1ogM+k')，update time O(1ogMlogn)，space O(nlogM)．The computational complexity of 2-D searching algorithm is as follows：query time O(1og²M+k)，update time O(1og²Mlogn)，space O(nlog²M)．The two algorithms are implemented respectively．With an experimental comparison，the authors found that 1-D searching algorithm is far better than 2-D searching algorithm．