Abstract
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, we propose an efficient in-memory processing of continuous queries on the moving object streams. We model moving objects using function of time and use it in the prediction of usefulness of objects with respect to the continuous queries. To effectively utilize the limited memory, we derive several replacement policies to discard objects that are of no potential interest to the queries and design efficient algorithms with light data structures. Experimental studies are conducted and the results show that our proposed method is both memory and query efficient.
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
Chen, Y., Rao, F., Yu, X., Liu, D., Zhang, L.: Managing Location Stream Using Moving Object Database. In: Proc. DEXA, pp. 916–920 (2003)
Čivilis, A., Jensen, C.S., Nenortaitė, J., Pakalnis, S.: Efficient Tracking of Moving Objects with Precision Guarantees. In: Proc. Mobiquitous, pp. 164–173 (2004)
Elmongui, H.G., Ouzzani, M., Aref, W.G.: Challenges in Spatio-temporal Stream Query Optimization. In: Proc. MobiDE, pp. 27–34 (2006)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In: Proc. VLDB, pp. 768–779 (2004)
Kalashnikov, D.V., Prabhakar, S., Hambrusch, S., Aref, W.G.: 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)
Li, Y., Yang, J., Han, J.: Continuous K-Nearest Neighbor Search for Moving Objects. In: Proc. SSDBM, pp. 123–126 (2004)
Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In: Proc. SIGMOD, pp. 623–634 (2004)
Mokbel, M.F., Xiong, X., Hammad, M.A., Aref, W.G.: Continuous Query Processing of Spatio-temporall Data Streams in PLACE. In: Proc. STDBM, pp. 57–64 (2004)
Nehme, R.V., Rundensteiner, E.A.: SCUBA: Scalable Cluster-Based Algorithm for Evaluating Continuous Spatio-temporal Queries on Moving Objects. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 1001–1019. Springer, Heidelberg (2006)
Patel, J.M., Chen, Y., Chakka, V.P.: STRIPES: An Efficient Index for Predicted Trajectories. In: Proc. SIGMOD, pp. 637–646 (2004)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proc. SIGMOD, pp. 331–342 (2000)
Kalashnikov, D.V., Prabhakar, S., Hambrusch, S.E.: Main Memory Evaluation of Monitoring Queries Over Moving Objects. In: Distributed and Parallel Databases, pp. 117–135 (2004)
Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proc. VLDB, pp. 287–298 (2002)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: Proc. VLDB, pp. 790–801 (2003)
Wu, K.L., Chen, S.K., Yu, P.S.: Indexing continual Range Queries with Covering Tiles for Fast Locating of Moving Objects. In: Proc. ICDCSW, pp. 470–475 (2004)
Yiu, M., Tao, Y., Mamoulis, N.: The Bdual-Tree: Indexing Moving Objects by Space-Filling Curves in the Dual Space. To appear in VLDB Journal (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, D., Cui, B., Yang, D. (2007). Optimizing Moving Queries over Moving Object Data Streams. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)