Algorithms For Querying The Trajectories Of Moving Objects In Networks

Spatial-Temporal database is a new field in computer science. It is extensivelyused in various areas for having some characteristics. This paper compares the queryindex to the network trajectories of moving objects, and presents a kind of queryextensions to the SQL language.This paper introduces basic introduction to the spatio-temporal database, gives abrief summary to spatial data, and briefly recommends the existing mobile objecttrajectories. In real life, we can find the moving objects in most sports relativelyfixed in orbit. It has a lot of query index aiming at the trajectories of moving objects,for different mobile object types have different index structure. This paper focuses onthe network trajectories of moving objects in the query applies the index structure arecompared, the optimum index structure algorithm, and proof the efficiency of thisindex structure during insertion and query operation.In the real life, we can find that moving objects mostly moving in a relativelyfixed orbit. This paper will do more detail index and query for such moving objects.After the careful study of a variety of spatial and temporal database query, wepropose a new query method. This query method is the expansion of the SQLlanguage. The keywords TIME and NET_ROUTE were added in this language. TheNET_ROUTE here is the key difference between traditional SQL language and itmeans network path query. According to TIME conditions moving object trajectoriescan be divided into past, now and future query. Different index structure can beprovided to different types of queries, and show the efficient indexing results. Theresearch of this subject has great significance to the development of spatial andtemporal database query technology.