Extended R-tree Based Spatial Top-K Query Method over Spatial Multi Data Streams

摘要

Advanced information Technology make every subject have its current station and share it with human. Through the large quantity data, in order to catch the interesting data only, top-k query is used. The current studied top-k query algorithms over general data focus on reducing time complexity and memory complexity only. However ubiquitous computing require location based analyze. Network monitoring police systems hope to catch the criminal position as soon as the network attacks happen. Over these systems spatial top-k query could solve the problem quickly. This paper studied current top-k query method over traditional database systems also with data stream systems. Then this paper proposed extended r-tree based spatial top-k query method over spatial multi data streams. The proposed method manages local topk' elements over data streams using R-tree nodes that constructed with binary list structure. By this way it can find the top-k elements' position efficiently and continuously. Through the experiment test, the proposed method is developed and compared with current method space saving method and TA(Threshold algorithm), and performed its efficiency.