Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
