This paper presents a new spatial index structure - cache quadtree. Cache quadtree combined with the advantages of spatial indexing and caching. According to the characteristics of spatial data, query uses the previous query results as much as possible, only the necessary queries are performed on the server. Meanwhile, full use of query results in the cache tree; reduce the server's query and its query range. Our paper gives the cache quadtree structure and the key algorithm in detail.