Abstract
Spatio-temporal database systems aim to answer continuous spatio-temporal queries issued over moving objects. In many scenarios such as in a wide area, the number of outstanding queries and the number of moving objects are so large that a server fails to process queries promptly. In our work, we aim to develop scalable techniques for spatio-temporal database systems. We focus on two aspects of spatio-temporal database systems: 1) the query processing algorithms for a large set of concurrent queries, and 2) the underlying indexing structures for constantly moving objects. For continuous query processing, we explore the techniques of Incremental Evaluation and Shared Execution, especially to k-nearest-neighbor queries. For moving object indexing, we utilize Update Memos to support frequent updates efficiently in spatial indexes such as R-trees. In this paper, we first identify the challenges towards scalable spatio-temporal databases, then review the current contributions we have achieved so far and discuss future research directions.
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
Agarwal, P.K., Arge, L., Erickson, J.: Indexing Moving Points. In: PODS (May 2000)
An, N., Ravi Kanth, K.V., Ravada, S.: Improving performance with bulk-inserts in oracle r-trees. In: VLDB (2003)
Aref, W.G., Hambrusch, S.E., Prabhakar, S.: Pervasive Location Aware Computing Environments (PLACE), http://www.cs.purdue.edu/place/
Aref, W.G., Ilyas, I.F.: SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees. Journal of Intelligent Information Systems, JIIS 17(2-3) (2001)
Arge, L., Hinrichs, K., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic r-trees. Algorithmica 33(1) (2002)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD (1990)
Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: IDEAS (2002)
Bohm, C., Krebs, F.: The k-Nearest Neighbor Join: Turbo Charging the KDD Process. In: Knowledge and Information Systems (KAIS) (in print, 2004)
Cai, Y., Hua, K.A., Cao, G.: Processing Range-Monitoring Queries on Heterogeneous Mobile Objects. In: Mobile Data Management, MDM (2004)
Prasad Chakka, V., Everspaugh, A., Patel, J.M.: Indexing Large Trajectory Data Sets with SETI. In: Proc. of the Conf. on Innovative Data Systems Research, CIDR (2003)
Chakrabarti, K., Mehrotra, S.: Dynamic granular locking approach to phantom protection in r-trees. In: ICDE (1998)
Chandrasekaran, S., Franklin, M.J.: Streaming Queries over Streaming Data. In: VLDB (2002)
Chandrasekaran, S., Franklin, M.J.: Psoup: a system for streaming queries over streaming data. VLDB Journal 12(2) (2003)
Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In: SIGMOD (2000)
Chen, L., Choubey, R., Rundensteiner, E.A.: Bulk-insertions into r-trees using the small-tree-large-tree approach. In: GIS (1998)
Chon, H.D., Agrawal, D., El Abbadi, A.: Storage and retrieval of moving objects. In: Tan, K.-L., Franklin, M.J., Lui, J.C.-S. (eds.) MDM 2001. LNCS, vol. 1987, pp. 173–184. Springer, Heidelberg (2000)
Choubey, R., Chen, L., Rundensteiner, E.A.: Gbi: A generalized R-tree bulk-insertion strategy. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 91. Springer, Heidelberg (1999)
Van den Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: VLDB (1997)
Gedik, B., Liu, L.: MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 67–87. Springer, Heidelberg (2004)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. TODS 24(2) (1999)
Iwerks, G.S., Samet, H., Smith, K.: Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: VLDB (2003)
Iwerks, G.S., Samet, H., Smith, K.P.: Maintenance of Spatial Semijoin Queries on Moving Points. In: VLDB (2004)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In: VLDB (2004)
Kamel, I., Faloutsos, C.: On packing r-trees. In: CIKM (1993)
Katayama, N., Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In: SIGMOD (May 1997)
Kollios, G., Gunopulos, D., Tsotras, V.J.: On Indexing Mobile Objects. In: PODS (1999)
Kwon, D., Lee, S., Lee, S.: Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In: Mobile Data Management, MDM (2002)
Lazaridis, I., Porkaew, K., Mehrotra, S.: Dynamic queries over mobile objects. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, p. 269. Springer, Heidelberg (2002)
Lee, M.-L., Hsu, W., Jensen, C.S., Teo, K.L.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB (2003)
Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: Str: A simple and efficient algorithm for r-tree packing. In: ICDE (1997)
Mokbel, M.F., Aref, W.G., Hambrusch, S.E., Prabhakar, S.: Towards Scalable Location-aware Services: Requirements and Research Issues. In: GIS (2003)
Mokbel, M.F., Ghanem, T.M., Aref, W.G.: Spatio-temporal Access Methods. IEEE Data Engineering Bulletin 26(2) (2003)
Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In: SIGMOD (2004)
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The Grid File: An Adaptable, Symmetric Multikey File Structure. TODS 9(1) (1984)
Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-Trees. In: ICDT (1997)
Patel, J.M., Chen, Y., Prasad Chakka, V.: STRIPES: An Efficient Index for Predicted Trajectories. In: SIGMOD (2004)
Porkaew, K., Lazaridis, I., Mehrotra, S.: Querying Mobile Objects in Spatio-Temporal Databases. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 59. Springer, Heidelberg (2001)
Prabhakar, S., Xia, Y., Kalashnikov, D.V., Aref, W.G., Hambrusch, S.E.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers 51(10) (2002)
García, R.Y.J., López, M.A., Leutenegger, S.T.: A greedy algorithm for bulk loading r-trees. In: GIS (1998)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD (1995)
Saltenis, S., Jensen, C.S.: Indexing of Moving Objects for Location-Based Services. In: ICDE (2002)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: SIGMOD (2000)
Prasad Sistla, A., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and Querying Moving Objects. In: ICDE (1997)
Song, Z., Roussopoulos, N.: Hashing Moving Objects. In: Tan, K.-L., Franklin, M.J., Lui, J.C.-S. (eds.) MDM 2001. LNCS, vol. 1987, pp. 161–172. Springer, Heidelberg (2000)
Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 79. Springer, Heidelberg (2001)
Song, Z., Roussopoulos, N.: SEB-tree: An Approach to Index Continuously Moving Objects. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 340–344. Springer, Heidelberg (2003)
Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: VLDB (2002)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In: VLDB (2003)
Tayeb, J., Ulusoy, Ö., Wolfson, O.: A Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal 41(3) (1998)
Xia, C., Lu, H., Ooi, B.C., Hu, J.: Gorder: An Efficient Method for KNN Join Processing. In: VLDB (2004)
Xiong, X., Aref, W.G.: R-trees with Update Memos. In: ICDE (2006)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: ICDE (2005)
Xiong, X., Mokbel, M.F., Aref, W.G., Hambrusch, S., Prabhakar, S.: Scalable Spatio-temporal Continuous Query Processing for Location-aware Services. In: SSDBM (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiong, X. (2006). Scalable Continuous Query Processing and Moving Object Indexing in Spatio-temporal Databases. In: Grust, T., et al. Current Trends in Database Technology – EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 4254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11896548_2
Download citation
DOI: https://doi.org/10.1007/11896548_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46788-5
Online ISBN: 978-3-540-46790-8
eBook Packages: Computer ScienceComputer Science (R0)