Moving Objects Database And Simulation To Achieve

Moving objects databases (MOD), which manage the moving objects and their location, belongs to spatio-temporal database, and has received much attention in many fields. As a newly developing technology, research on MOD is at the beginning both in international and domestic domain.Recently, the research of MOD has four directions: location model, query language, index structure and uncertainty handling. Because of the location of moving objects changes as time passes, the raw data stored in the database is imprecise.how to return the satisfied query results to users, not only refer to query algorithm, but also include location model and index structure.Based on the existing uncertainty model, there are primary uncertainty handlings in range query and nearest neighbor query. However, the application environment considered being not extensive, MOD involves many query algorithms, not combining with uncertainty handling. The dissertation propose the nearest neighbor query algorithm on trajectories based on the uncertainty model, and solve the problem of imprecision in the nearest neighbor query on trajectories in MOD. It extends algorithm of Reynold Cheng, advaces the index structure TBU-tree adapting to the trajectory's uncertainty based on TB-tree, integrating with TBU-tree, achieves the nearest neighbor query algorithm on trajectories with uncertainty model efficiently.Firstly, the dissertation introduces MOD and its model, query languages, index structure; Secondly, an overview of the current research on the query algorithem with uncertainty model in MOD is analyzed; Thirdly, on the basis of theory and existing problem, the algorithm of nearest neighbor query on trajectories is proposed. Finally, the algorithm is programmed and its performance is analyzed.The nature of MOD determines that, only the late uncertainty handling, can solve the problems arosing from data itself's imprecision, such as error query results.