Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
IEEE Transactions on Computers
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Partition-based lazy updates for continuous queries over moving objects
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Traditional techniques for processing continuous queries on moving objects reduce query re-computing through single-threaded and shared execution between multiple queries, and don't make use of the parallel computing capabilities of the ubiquitous multi-core CPUs. Thus, to explore this kind of parallelism, a Multi-threading based Framework for Continuous Queries (MFCQ) is proposed which adopts a strategy of re-computing all of the queries periodically. The framework divides the query process into three phases:the updating, optimization and execution stages; multi-threading based methods are used in each phase. Moreover, the framework is deemed to be general, because it is compatible with various index techniques and query algorithms. By using the framework, a query index based KNN algorithm and an object index based KNN algorithm are proposed respectively. Experimental results show that the multi-threading framework executed on the multicore platform outperforms the traditional YPK-CNN algorithm.