Study Of Shortest Path Problem With Path Constraint And Query Processing Of Data Stream

As one of the classic problems in GIS spatial analysis, the shortest path problem is very important in modern traffic network analysis. Due to the complexity of traffic network models, the research of the shortest path problem with path constraint is gaining momentum.With the development of sensor network applications, data stream query processing technology is becoming an active research topic in modern data processing and information systems.This paper studies the key techniques of the shortest path problem with path constraint and the sensor network data stream query processing. The main work and contribution are as follows:(1) To solve the shortest path problem with path constraint, we set focus on solutions which include the construction of road network model with path constraint, the preprocessing of original map paths, and the efficient implementation of shortest path algorithm. we implement the shortest path algoritms with path constraint based on the improvement of DIKB algorithm.(2) To deal with the data stream query processing, we propose the join query algorithm and the aggregation query algorithm based on the sliding window continuous query. Experimental results prove the effectiveness and efficiency of the algorithms we present.In addition, our achiements are applied to a practical Integrated Information Management System based on GIS which shows approving results.