Supporting High Updates Disk-based Indez in Road Network
With the development of GPS and wireless techniques, more and more applications require maintaining the current position of moving objects on road network environment. It is the key stone that how to built an efficient index to supporting very high rates of spatial-index updates. Previous works in this domain assume that system holds enough main memory to buffer operations. This specialty enable these approaches dont work as main memories is unavailable. To buffer the operations without main memory, we propose a new R*-tree-based indexing technique, called diskbased R*-tree (DBR*tree for short), which buffers update operations in disk page as well as grouping them to reduce disk 1/0. DBR*-tree employs R*-tree to index the edges on the network (for example the road), not moving object, which eliminates the expensive costs caused by frequent changes in R*-tree structure while indexing moving objects by R*-tree. Finally, we present performance analysis and experimental results. And both of them show the proposed technique holds high performance on update and query operations.
Liangxu Liu Weimin Li Yongming Guo Jiajin Le
School of Computer Science and Technology, Donghua University, Shanghai, China School of Electric an School of Computer Engineering and Science, Shanghai University, Shanghai, China School of Computer Science and Technology, Donghua University, Shanghai, China
国际会议
AiR08，EM2108，SOAIC08，SIOKM08，BIMA08，DKEEE08(2008IEEE国际电子商务工程学术会议)
西安
英文
517-522
2008-10-22（万方平台首次上网日期，不代表论文的发表时间）