Abstract
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 multi-core platform outperforms the traditional YPK-CNN algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kalashnikov, D.V., Prabhakar, S., Hambrusch, S.E.: Efficient Evaluation of Continuous Range Queries on Moving Objects. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 731–740. Springer, Heidelberg (2002)
Prabhakar, S., Xia, Y., Kalashnikov, D.V., et al.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers 51(10), 1124–1140 (2002)
Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases. In: Proc. of SIGMOD, pp. 623–634 (2004)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: Proc. of ICDE, pp. 643–654 (2005)
Yu, X., Pu, K.Q., Koudas, N.: Mointoring k-Nearest Neighbor Queries over Moving Objects. In: Proc. of ICDE, pp. 631–642 (2005)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. of SIGMOD, pp. 634–645 (2005)
Hu, H., Xu, J., Lee, D.L.: A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects. In: Proc. of SIGMOD, pp. 479–490 (2005)
Hsueh, Y.-L., Zimmermann, R., Wang, H., et al.: Partition-Based Lazy Updates for Continuous Queries over Moving Objects. In: Proc. of GIS (2007)
Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: Proc. of VLDB, pp. 43–54 (2006)
Asano, T., Ranjan, D., Roos, T., et al.: Space filling curves and their use in the design of geometric data structures. Theoretical Computer Science 181(1), 3–15 (1997)
Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) Advances in Spatial and Temporal Databases. LNCS, vol. 5644, pp. 25–43. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, L., Jing, N., Chen, L., Zhong, Z. (2010). A Novel Framework for Processing Continuous Queries on Moving Objects. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds) Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14246-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-14246-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14245-1
Online ISBN: 978-3-642-14246-8
eBook Packages: Computer ScienceComputer Science (R0)