Analysis and Evaluation of Non-Blocking Interpolation Search Trees

Parallel Batched Interpolation Search Tree

Ordered set (and map) is one of the most used data type. In addition to standard set operations, like insert, delete and contains, it can provide set-set operations such as union, intersection, and difference. Each of these set-set operations is equivalent to batched operations: the data structure should process a set of operations insert, delete, and contains. It is obvious that we want these "large" operations to be parallelized. Typically, these sets are implemented with the trees of logarithmic height, such as 2-3 tree, Treap, AVL tree, Red-Black tree, etc. Until now, little attention was …

Unexpected Scaling in Path Copying Trees

Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructions or UCs) for building concurrent data structures. These approaches (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks that protect a sequential data structure and allow only one process to access it at a time. The resulting data structures use locks, and hence are blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees s…

Clustering with shallow trees

We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique…

Quadboost: A Scalable Concurrent Quadtree

Building concurrent spatial trees is more complicated than binary search trees since a space hierarchy should be preserved during modifications. We present a non-blocking quadtree-quadboost-that supports concurrent insert, remove, move, and contain operations. To increase its concurrency, we propose a decoupling approach that separates physical adjustment from logical removal within the remove operation. In addition, we design a continuous find mechanism to reduce its search cost. The move operation combines the searches for different keys together and modifies different positions with atomici…

最小度数生成树的加法一近似：突破O(mn)时间障碍

Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier

本文提出了一种在~O(mn^{3/4})时间内求解最小度数生成树加法一近似的确定性算法，突破了传统O(mn)时间界限。

基于惰性更新的高效自调整搜索树

Efficient Self-Adjusting Search Trees via Lazy Updates

针对现有自调整搜索树存在的无静态最优性、实现复杂低效等问题，提出基于非自适应结构、通过惰性更新构建自调整搜索树的新方法，得到多种高效自调整树，降低指针操作、提升缓存效率并支持并发实现。