摘要
With the development of wireless communications and positioning technologies, tracking the positions of moving objects has increased necessary. This paper proposes a Cache-Conscious TPR -Link tree called CTPR Link tree which store in main memory. To satisfy continuous movement, the QRMBR definition is modified. The compression leads to the reduction of the tree height, which improves the cache behavior of the index and reduces the memory access time. In order to achieve high concurrency control, optimistic dynamic versioning and sibling-link scheme is presented, which not only enable read-only transactions not to fail with latch-free but also reduce cache misses during index updates.
With the development of wireless communications and positioning technologies, tracking the positions of moving objects has increased necessary. This paper proposes a Cache-Conscious TPR -Link tree called CTPR Link tree which store in main memory. To satisfy continuous movement, the QRMBR definition is modified. The compression leads to the reduction of the tree height, which improves the cache behavior of the index and reduces the memory access time. In order to achieve high concurrency control, optimistic dynamic versioning and sibling-link scheme is presented, which not only enable read-only transactions not to fail with latch-free but also reduce cache misses during index updates.
基金
This workis supported by Ministry of Information and Communication( MIC)
Korea,under the Information Technology Research Center(ITRC)
sup-port programsupervised by the Institute of Informationtechnology Assessment(IITA)
Sino-Korea GIS Research Center ,China.
