Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Space-partitioned Moving Objects Databases (SP-MODs) allow for the scalable, distributed management of large sets of mobile objects' trajectories by partitioning the trajectory data to a network of database servers. Processing a spatio-temporal query q therefore requires efficiently routing q to the servers storing the affected trajectory segments. With a coordinate-based query --- like a spatio-temporal range query --- the relevant servers are directly determined by the queried range. However, with trajectory-based queries --- like retrieving the distance covered by a certain object during a given time interval --- the relevant servers depend on actual movement of the queried object. Therefore, efficient routing mechanisms for trajectory-based queries are an important challenge in SP-MODs. In this paper, we present the Distributed Trajectory Index (DTI) that allows for such efficient query routing by creating an overlay network for each trajectory. We further present an enhanced index called DTI+S. It accelerates the processing of queries on aggregates of dynamic attributes, like the maximum speed during a time interval, by augmenting DTI with summaries of trajectory segments. Our simulations with a network of 1000 database servers show that DTI+S can reduce the overall processing time by more than 98%.

[1]  Chinya V. Ravishankar,et al.  Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations , 2007, IEEE Transactions on Knowledge and Data Engineering.

[2]  Kurt Rothermel,et al.  A Comparison of Protocols for Updating Location Information , 2001, Cluster Computing.

[3]  Kurt Rothermel,et al.  Architecture of a large-scale location service , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[4]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[5]  Hicham G. Elmongui,et al.  Place: A Distributed Spatio-Temporal Data Stream Management System for Moving Objects , 2007, 2007 International Conference on Mobile Data Management.

[6]  Ling Liu,et al.  GeoGrid: A Scalable Location Service Network , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[7]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[8]  Hui Ding,et al.  BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries , 2007, 2007 International Conference on Mobile Data Management.

[9]  Evaggelia Pitoura,et al.  Locating Objects in Mobile Computing , 2001, IEEE Trans. Knowl. Data Eng..

[10]  M. Liljenstam,et al.  Development of an Internet backbone topology for large-scale network simulations , 2003 .

[11]  Dimitrios Gunopulos,et al.  Indexing spatiotemporal archives , 2006, The VLDB Journal.

[12]  David M. Nicol,et al.  Simulation of large scale networks II: development of an internet backbone topology for large-scale network simulations , 2003, WSC '03.

[13]  Amit P. Sheth,et al.  Semantic (Web) Technology In Action: Ontology Driven Information Systems for Search, Integration and Analysis , 2003, IEEE Data Eng. Bull..

[14]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[15]  Christian S. Jensen,et al.  Indexing the past, present, and anticipated future positions of moving objects , 2006, TODS.

[16]  Ralf Hartmut Güting,et al.  Moving Objects Databases , 2005 .

[17]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[18]  Walid G. Aref,et al.  Spatio-Temporal Access Methods , 2003, IEEE Data Eng. Bull..

[19]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.