To efficiently process continuous spatiotemporal queries, the authors need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, they propose a framework that employs a new indexing algorithm that is built on top of SQL server 2008 and avoid the overhead related to R-tree indexing. To answer range queries, they utilize dynamic materialized view concept to efficiently handle update queries. They propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework.