A Cache Sensitive Moving Object Index that Supports Concurrent Access
Current literature on indexing current and future positions of the moving objects lacks of the mechanisms on concurrent access. To solve this problem an efficient moving object index that supports concurrent access is proposed which is called CS2B-tree(Concurrent Space-filling curve enabled Cache Sensitive B+ -tree). CS2-B-tree combines the characteristics of both the Br-tree and CSB -tree, thus it can support querying the predicted future positions of the moving objects and is cache sensitive. Focus is put on studying a concurrent access mechanism to CS2B-tree which results in a two-level lock mechanism and particularly a lock memo structure is designed. Based on the concurrent access mechanism, a CS2B-tree concurrent location update algorithm and a concurrent predicted range query algo rithm are proposed respectively. Experimental results show that compared to Br-tree, the throughput of the CS2B-tree improves by 15.1％, and the response time decreases by 14.9％.
Luo Chen Liang Zhao Ning Jing
College of Electronic Science and Engineering National University of Defense Technology,Changsha, Ch College of Electronic Science and Engineering National University of Defense Technology, Changsha, C
国际会议
厦门
英文
764-768
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）