A novel framework for processing continuous queries on moving objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6184 LNCS, Issue , 2010, Pages 321-332

  Zhao, Liang ^a   Jing, Ning ^a   Chen, Luo ^a   Zhong, Zhinong ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

continuous queries; framework; grid index; KNN query; multi threading

Indexed keywords

CONTINUOUS QUERIES; K-NN ALGORITHM; K-NN QUERY; MOVING OBJECTS; MULTI CORE; MULTI-THREADING; MULTIPLE QUERIES; PARALLEL COMPUTING; QUERY ALGORITHMS; RE-COMPUTING; SINGLE-THREADED; THREE PHASIS; TRADITIONAL TECHNIQUES;

ALGORITHMS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS; UBIQUITOUS COMPUTING;

INFORMATION MANAGEMENT;

EID: 77955021315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14246-8_32     Document Type: Conference Paper

References (11)

1. 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)
2. 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) (Pubitemid 35327427)
3. 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)
4. 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)
5. Yu, X., Pu, K.Q., Koudas, N.: Mointoring k-Nearest Neighbor Queries over Moving Objects. In: Proc. of ICDE, pp. 631-642 (2005) (Pubitemid 41731189)
6. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. of SIGMOD, pp. 634-645 (2005)
7. 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)
8. Hsueh, Y.-L., Zimmermann, R., Wang, H., et al.: Partition-Based Lazy Updates for Continuous Queries over Moving Objects. In: Proc. of GIS (2007)
9. Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: Proc. of VLDB, pp. 43-54 (2006)
10. 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) (Pubitemid 127451945)
11. 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)