Rather than wait for the other thread to finish the current thread can help it out by finishing the operation for it by moving the tail pointer forward ( B ) .

不必等候其他线程完成，当前线程就可以“帮助”它完成操作，把 尾 指针向前移动（B）。

It keeps checking the tail pointer and advancing it if necessary until the queue is in the quiescent state at which point it can begin its own insertion .

如果有必要，它还会继续检查 尾 指针并向前 移动 指针，直到队列处于静止状态，这时它就可以开始自己的插入了。

In connection level parallelization we use the lock-free algorithm to cancel the coupling of the head pointer and the tail pointer . This optimization lowers the cost of the queue operation and reduces the cost of thread blocking .

针对连接级别并行方式的特点，本文使用单生产者-单消费者无锁队列算法消除了任务队列的头指针和 尾 指针的耦合关系，降低了队列相关操作的开销，同时减少了线程阻塞带来的开销。

In this paper T-st index is proposed it is improved base on T-tree index the successor and tail pointer are added and the corresponding algorithm is designed the ability of range searching inserting and deletion are all improved .

本文针对T树索引进行了改进，在原有的节点结构中加入后继 指针 和 尾 指针，提出了T-st树索引，设计了相应的算法，使范围查询、插入和删除等方面的性能有较大提高。