摘要： 随着定位技术的发展，基于定位的服务对数据库技术的要求越来越高，需要用它记录和管理大量持续运动物体的位置。TPR*树是支持移动物体现在和将来位置查询的索引结构，面临多个事务同时访问数据的问题。该文提出了基于内存的TPR*树的并发控制方案，能满足事务的一致性要求。通过结合加锁技术和时间戳技术，使得冲突减少，提高了并发效率和处理速度。

关键词: 并发控制, 索引结点, 时间戳

Abstract:

With the development of location technology, advanced location-based services will increasingly require database technologies capable of tracking the positions of large amounts of continuously moving objects in the following years. TPR*-tree is a kind of index structure which supports to query the current and future positions of moving objects. TPR*-tree concurrency control scheme in main memory is presented, which can satisfy to correctly query positions of moving objects. Two most important techniques for implementing scheduler are combined: locking and timestamping technologies which drop conflict and execution time. The scheme improves concurrent efficiency.

Key words: Concurrency control, Index node, Timestamp

中图分类号: 

• TP311