Weight-balanced trees (WBTs), originally introduced as binary search trees of bounded balance or BB-trees by Nievergelt and Reingold [Nievergelt1973Binary], later gained more attention through the seminal work by Knuth [Knuth1998Art], which also coined the name weight-balanced trees that is better known today. WBTs are balancing binary search trees. As many other flavours of balancing binary search trees, they employ rotations to correct imbalances caused by modifications to the tree. The specialty of weight-balanced trees is that the balancing is done based on the weight of subtrees, which is the number of nodes in the respective subtree.
This entails some interesting properties, such as the fact that it can be shown that rotations around heavy nodes, i.e., nodes that are roots of subtrees of a large weight, occur only rarely (see Mehlhorn [Mehlhorn1984Data]). Using this analysis, weight-balanced trees can serve as basis for augmented binary search trees, i.e., trees that carry additional annotations at every node. Usually, e.g. in the case of dynamic segment trees, these annotations depend on a node’s children, thus the annotation must be repaired if the children are changed. If the effort to repair the annotation at a node after rotation correlates with the weight of the subtree rooted in that node, weight-balanced trees can be used to show amortized bounds on the necessary work. Annotated trees that require this property are often used in computational geometry, examples include Kurt Mehlhorn’s Segment Trees (Mehlhorn [Mehlhorn1984Multi, VIII.5.1.3]) or Interval Trees (Mehlhorn [Mehlhorn1984Multi, VIII.5.1.1]). Also, the weight annotation that every node in a weight-balanced tree carries can be used to efficiently implement order statistic trees (Cormen et al. [Cormen1989Introduction, Chapter 15.1]).
These advantages of weight-balanced trees have led to them receiving ample attention throughout the literature. Adams [adams_functional_1993] gives a functional implementation of weight-balanced trees and claims they perform as well as red-black trees, however does not provide a practical evaluation. With weight-balanced trees, a set of balancing parameters (see Section 2.1) play a crucial role. While Nievergelt and Reingold introduced the technique and conjectured its correctness, the balancing technique does not work for the whole range of balance parameters they state in their paper. Later, Blum and Mehlhorn [DBLP:journals/tcs/BlumM80] not only point out this incorrectness, but also give a rigorous proof for a smaller space of the balancing parameters. Hirai and Yamamoto [hirai2011balancing] use a computer-assisted proof system to discover the whole space of feasible balancing parameters. Cho and Sahni [Cho2000New] present a variation of weight-balanced trees, which rotates subtrees even if they are not out of balance if the rotation reduces path lengths, thus reducing the expected average node depths within the tree. Roura presents two variations, one that uses logarithmic subtree sizes for balancing [DBLP:conf/icalp/Roura01] and one that uses the inverse of the Fibonacci function for balancing [ROURA201348].
This work focuses on analyzing the advantages of two variations in the weight-balanced trees: first, using a top-down balancing scheme, i.e., repairing the balance constraint while descending the tree for an insertion (resp. removal), instead of having a second bottom-up pass over the traversed tree path. Second, the effect that the choice of balancing parameters (especially “infeasible” parameters) has. The idea of top-down rebalancing has also been explored for other types of balanced binary search trees, such as red-black trees (Tarjan [Tarjan1985Efficient]) or weak AVL trees (Haeupler et al. [Haeupler2015Rank]). Rebalancing weight-balanced trees from the top down has an interesting history: While the original proposal (although incorrect, as Blum and Mehlhorn have shown) by Nievergelt and Reingold was already a top-down algorithm, the supplied proof by Blum and Mehlhorn only works for a bottom-up rebalancing. Later, Lai and Wood [DBLP:journals/ijfcs/LaiW93] have provided a top-down rebalancing algorithm and shown its correctness. This is the foundation for our contribution. However, the top-down variant of weight-balanced trees has received little attention so far. To our knowledge, no empirical analysis of top-down weight-balanced trees has been done yet.
In this paper, we provide a comprehensive experimental evaluation of top-down as well as bottom-up weight-balanced trees and the possible choices for the balancing parameters, resulting in recommendations when to use which tree variant based on the expected usage pattern. We gain the insight that top-down weight-balanced trees should be preferred over bottom-up weight-balanced trees, and most of the time they can compete with the performance of red-black trees. Moreover, we gain the surprising insight that regarding the choice of balancing parameters, it often is beneficial to chose parameters that violate the theoretical guarantees in favor of a better empirical balance. We also publish thoroughly engineered implementations of all evaluated trees.
2 Top-Down Weight-Balanced Trees
In this section, we describe the top-down balancing approach for weight-balanced trees. We start by introducing notation and recapitulating the workings of bottom-up weight-balanced trees in Section 2.1.
2.1 Weight-Balanced Trees
We denote a tree with node set and edge set as . Every node can have a left (resp. right) child, which we denote by (resp. ), and say (resp. ) if has no left (resp. right) child. Additionally, in a weight-balanced tree, each node has an associated weight. Note that different notions as to what the weight of a node is are found throughout the literature. For us, the weight of , denoted as , is the number of nodes in the subtree rooted in plus one.111Note that this corresponds to the number of entries in the subtree rooted in . Thus, a leaf has weight . Also, since in the case the left subtree has zero nodes, it results that .
The balance criterion for weight-balanced trees limits the relative difference between the weight of the left subtree and the right subtree at every node. The balance criterion and the balancing mechanism use two parameters, .222We are using the notation from Hirai and Yamamoto [hirai2011balancing]. Balance is achieved at node if both
Note that the parameter is not directly relevant for the balance criterion. If the balance criterion is violated during a modification of the tree, the parameter is used to determine the correct balancing procedure. In [DBLP:journals/tcs/BlumM80], Blum and Mehlhorn show that if are chosen in a particular way, and rotations are applied as described in [Nievergelt1973Binary], this balance criterion is an invariant of the data structure at every node. The proof is technical and tedious, so we do not summarize it here.
Insertion and Deletion in Bottom-Up Weight-Balanced Trees
The first pass for insertion and deletion in bottom-up weight-balanced trees is performed as with unbalanced binary search trees. For an insertion, follow the search path for the new node until you walk out of a leaf. This is the position where to insert the new node. For a deletion of , if is a leaf, just delete it. If it has only one child, replace by its only child, splicing the node out of the tree. Otherwise, find the largest node in (resp. the smallest node in ), and swap with that node. Now, has at most one child and we can proceed as above. The insertion procedure is also shown in Algorithm 1.
During the above, we do not pay attention to any balance criterion. Thus, after insertion and deletion, the balance might be violated at several nodes on the path from the tree’s root to the position of insertion or deletion. In bottom-up weight-balanced trees, we repair the tree by traversing that path back up, repairing imbalances using single rotations and double rotations as necessary.
Whenever the balance criterion at a node is violated, a single or double rotation as depicted in Figure 1 is performed to reestablish balance. Since the process is symmetric for the right and left subtrees, we only discuss the case that the right subtree has become too heavy (because of an insertion into or a deletion from ).
Given a pair as defined above, the first decision at is whether to perform a rotation at all. A rotation is performed if (in the case of a possible right-overhang) . A left rotation around will certainly reduce the weight of ’s right subtree, essentially removing and the subtree rooted in from below . However if is too heavy, after the rotation, the balance at the old could be violated. Thus, if , we perform a double rotation as shown in Figure 1.333Note that the node names in the figure differ from the node names in text to allow for consistent names before and after rotation. This procedure has been shown to always reestablish balance at all involved nodes by Blum and Mehlhorn if is chosen appropriately.
Balancing Parameter Space
When talking about the balancing parameters , we often call them feasible or infeasible. A parameter set is feasible (for bottom-up rebalancing resp. top-down rebalancing) if the respective balancing algorithm has been shown to be correct for , i.e., if it is guaranteed that all nodes satisfy (1) and (2) after rebalancing. Otherwise, the parameter set is called infeasible. Note that an infeasible parameter set still yields a valid binary search tree.
Regarding the feasible values for , the first thing to note is that the two correctness proofs from Blum and Mehlhorn as well as Lai and Wood [DBLP:journals/ijfcs/LaiW93] use a different notation than . In these proofs, the balancing factor is , and the balancing criterion is
Looking at only one side of both types of balance constraints (the other side is symmetric), from and , we get that . In fact, using the upper bound on given by Blum and Mehlhorn, , this leads to . Note that the larger the value for (and the smaller the value for ), the better we expect the tree to be balanced, i.e., we expect the smallest average node depths for these values. For their correctness proofs, both Blum and Mehlhorn as well as Lai and Wood fix the second balance parameter (the parameter deciding whether to use single or double rotation, call it ) to . Again, taking the two different forms of constraints for a double rotation, namely and , it follows that and therefore . With this, for , it follows that , and with that the most common (and maximally balanced) choice for .
However, Hirai and Yamamoto [hirai2011balancing] have shown that in the bottom-up balancing case, the feasible space for is in fact a nonempty polytope, i.e., the linear dependency between and (resp. and ) is not necessary. The only integral choice for within the polytope is . Integral values for are interesting since (as Roura [DBLP:conf/icalp/Roura01]
shows), using floating point arithmetic, or even worse, computingduring balancing, is a major factor slowing down weight-balanced trees. Note that with the relationship between and (resp. and ) established by Blum and Mehlhorn, the value for would have been .
The correctness proof for top-down balancing from Lai and Wood holds only for , meaning that we expect the best balanced top-down weight-balanced trees for , which translates to . Note that even though this means that is feasible for top-down balancing, the aforementioned possibly is not a feasible choice in the top-down case, since it is unclear how the feasible polytope looks like.
2.2 From Bottom-Up to Top-Down
Weight-balanced trees as described above perform two full traversals of the path from the tree’s root to a leaf (resp. to-be-deleted node) for each insertion and deletion: One traversal down to perform the deletion or insertion, and one traversal up to check for and repair the balance. However, whenever we know that we will definitely delete a node (e.g., because we know that the value to be deleted is in the set represented by the tree), or that we will definitely insert a node (e.g., because we allow multiple nodes with the same value to be inserted), it is possible to perform necessary repair operations on the first traversal towards the leaves.
Algorithm 1 shows pseudocode for such an insertion. Note that while Insert descends the tree towards the insertion position for , RepairDuringInsertion is called at every node, performing rotations as if was already inserted into the appropriate subtree, but without that subtree being rebalanced before. The pseudocode omits some technical details, such as correctly adjusting the weights of the nodes that become ancestors of because of a rotation, and correctly descending in case of a rotation. Consider as an example for a more complicated procedure the case that , , that the insertion causes and that . Then, RepairDuringInsertion calls a double rotation (see Figure 1), after which should of course still be inserted below the old ( in Figure 1). However, that node is not a descendant of anymore.
Note that this approach does not lead to the same trees as the bottom-up approach. In the bottom-up approach, during rebalancing at node , balance is already established at , and all nodes below. In the top-down approach, this balance can be violated by up to one node. For the top-down procedure, Lai and Wood show that even though the lower nodes cannot yet be assumed to be balanced, the above procedure balances all involved nodes, if is chosen appropriately.
The approach outlined here assumes that every insertion and removal always changes the tree. This is not necessarily the case, as a removal of a value that is not in the tree will fail, and so will insertion if the tree is used to implement a set (instead of a multiset) and the value is already in the tree. The case that the tree is not modified can naively be accommodated by having a second pass over the modified path in that case. Obviously, with this naive solution, top-down rebalancing is only a useful approach if the number of modifying insertions and removals is way higher than the number of non-modifying ones. However, careful analysis by Lai and Wood [DBLP:journals/ijfcs/LaiW93] shows that for a correct choice of rebalancing parameters, top-down rebalancing keeps the balancing criterion intact even if the algorithm aborts the operation during descend, either because a key to be deleted is not in the tree or because a key to be inserted is already in the tree.444Lai and Wood call this a redundant operation.
We now provide an in-depth experimental evaluation of the various flavours of weight-balanced trees. This evaluation encompasses multiple parts: First, we measure the time that operations such as inserting into and removing from the trees take in Section 3.1. Since the time necessary to search for a vertex in a tree is only dependent on the depth of the respective node, and measuring the average node depth is less noisy than measuring the time a search takes, we use this measure instead of measuring search timings in Section 3.2. Also in that section we look at how much the balancing criterion is violated when one chooses balancing parameters outside the feasible space. All these analyses are done for different kinds of test data, resembling a broad spectrum of use cases. To study the various rebalancing schemes in even more realistic scenarios, we use sequences of tree operations captured during the execution of an optimization algorithm utilizing a balancing search tree in Section 3.3. Finally, we take a look at the total number and weight of rotated nodes in Section 3.4.
We implemented all trees in C++, our implementation including all the benchmarking code can be found at:
Additionally, we publish all raw results obtained from our experiments as a separate data publication [data-publication]. See Section A in the appendix for further details.
All measurements are taken on a machine with 192 GBs of DDR4 memory and two eight-core Intel® Xeon® Gold 6144 CPUs, which have 32 KB of L1 data cache per core, 1 MB of L2 cache per core and a total of 25 MB of L3 cache per CPU. However, we did not run multiple benchmarks concurrently. The size of our trees’ nodes is 40 bytes. In the following experiments, the largest tested trees usually have size , which leads to a memory footprint of around , well above L3 cache sizes. We therefore expect to see the effects of caching for the larger tested trees, and little to no caching effects for trees of at most nodes.
In the following evaluation, we compare the following balanced binary search trees: First, a (bottom-up) red-black tree as baseline, denoted red-black. Second, the basic version of a weight-balanced tree, with bottom-up balancing, denoted bottom-up. Third, the top-down weight-balanced tree, denoted top-down. For the top-down weight-balanced trees, we evaluate different choices for the balancing parameters : First, the choices listed and explained in Section 2.1: (the original parameter set given by Blum and Mehlhorn [DBLP:journals/tcs/BlumM80]), (the integral parameters suggested by Hirai and Yamamoto [hirai2011balancing]) and (the parameters from the top-down correctness proofs by Lai and Wood [DBLP:journals/ijfcs/LaiW93]). Note that even though the first two are not feasible in the sense of the top-down correctness proof by Lai and Wood, we still use them for the top-down balancing technique. Similarly, we try the additional choice of . Even though is not a feasible choice for top-down or bottom-up balancing, we want to evaluate how this smaller value (which we expect to lead to a better balance) performs in practice. For an even more extreme example, we also evaluate .
3.1 Timing Operations
We first benchmark the two basic operations insertion and deletion. Our aim is to measure the time these operations take on trees of various sizes for different distributions of nodes’ keys. Specifically, for each benchmark we first create a random tree of a certain base size (the base tree), and then remove five percent of the nodes resp. insert five percent new nodes. For all benchmarks, we employ four different methods to generate nodes’ keys: First in the uniform case, we generate keys uniformly at random. Second, we assume that the search tree may be used to index data that pertains to physical or social sciences. In this case, Zipf’s Law (see [powers1998applications]) states that this data, e.g. text corpora, often follow a Zipf distribution. We accommodate this fact with the zipf case, in which nodes’ keys are picked using a Zipf distribution. Third, it seems prudent to study cases with a heavy concentration of the keys in one or two areas of the key space. For this, we use the skewed distribution suggested by Mäkinen [Mäkinen1987]
in his analysis of top-down splay trees. In this distribution, every third value is drawn from a uniform distribution over the whole key space, and the other two thirds are drawn from two uniform distributions each spanning onlyof the key space. Finally, an obvious benchmark case for balancing search trees is partially pre-sorted data. In the pre-sorted case, we first take a sequence of sorted numbers, and then randomly permute half of them. For the deletion benchmark, the node to be deleted is picked uniformly at random in each case.
Note that we do not discuss each plot individually in this section, but only those from which interesting insights can be drawn. The plots that are not mentioned in the text can be found in Appendix B.
To account for randomness effects and measurement noise, we run each experiment for each base tree size on different base trees, and in turn repeat the experiment itself on each base tree until the experiment ran for at least one second on each base tree.
axis reports the time needed for a single insertion in microseconds. Shaded areas indicate standard deviation.
Figure 1(a) shows the time (averaged over all the iterations explained above) it takes to insert new nodes into the seven different trees of various base sizes, for the uniform case. We first see that the bottom-up variant (with ) is about (resp. ) slower than the corresponding top-down variant. We then see that the red-black tree and the , and the top-down variants all show almost the same performance. Interestingly, the variant with the tightest balancing parameter, performs as bad as the bottom-up variant. Note that in this (and all following) plots, shaded areas indicate standard deviation. Where no shaded area is visible, the standard deviation is too small to be visible.
When performing the same experiment with node keys chosen from a Zipf distribution (shown in Figure 1(b)), results look very different: Here, the two strongly balanced variants ( and ) outclass all other variants. Also, all but the top-down variant outclass the red-black tree, with a factor of between the best balanced weight-balanced tree and the red-black tree. Results for the skewed distribution (shown in Figure 7(a) in Appendix B) are less pronounced, but similar. For the pre-sorted case, the results are very similar to the uniform case and can be found in Figure 7(b) in Appendix B.
Since we implemented all mentioned trees ourselves, the question of how efficient our implementations are as a whole comes to mind. For the insertion benchmark, we added the C++ STL’s std::multiset555STL bundled with GCC 8.1, which implements std::multiset as a red-black tree. and Boost’s intrusive::multiset to the comparison. The plot can be found in Appendix B, Figure 10. As can be seen, all our trees perform slightly better than std::multiset, but slightly worse than boost::intrusive::multiset. We may therefore assume that our implementations are properly optimized.
Next, we look at the deletion operation. Figure 2(a) shows the uniform case. We see that the variant has a slight advantage over the red-black tree and all other variants. For deletion, the pre-sorted case (shown in Figure 2(b)) is especially interesting: Here, all weight-balanced trees, but especially the variant, clearly outperform the red-black tree. On the other side of the spectrum, for the skewed and zipf cases (shown in Appendix B, Figure 9), the red-black tree has a slight advantage over the weight-balanced trees.
Our benchmark findings are summarized in Table 1. From the results, we can deduce that one should always use the top-down variant, and should never use as balancing parameter. Whether or is the wiser choice depends on the expected usage pattern. We can also see that the race between red-black trees and weight-balanced trees is a toss-up: While weight-balanced trees seem to be ahead in the uniform and pre-sorted cases, red-black trees exhibit better performance in the skewed and zipf cases.
3.2 Tree Balance
Aside from insertion and deletion times, an interesting metric is the average depth of a node. The average depth determines the expected length of the search path for that node, which not only influences insertion and removal speeds, but even more strongly the search performance. In fact, we do not benchmark runtimes for searches within the trees, since the average depth of the nodes should be the only influencing parameter, with everything else being measurement noise. To analyze the average node depth, we again create random trees of various sizes. Since just creating a tree does not involve the remove operation, and we also want to evaluate the effects of this operation, we iterate over all nodes after creating the tree, and first remove each node from the tree, change its key, and then reinsert it. After this, we compute the average depth of all nodes. Figure 3(a) shows the results for keys being drawn from a uniform distribution.
We see that red-black trees and weight-balanced trees using as balance parameters are virtually equally well balanced. The weight-balanced tree using has a slight advantage over them — as we expected, since enforces a stricter balance than . However, the variant is the worst in terms of balance, even though it is using the smallest . This suggests that choosing parameters that are too far outside of the space of feasible choices for , the balancing criterion is violated too badly for the smaller to make up for it.
Using a Zipf distribution instead of a uniform distribution for the nodes’ keys (shown in Figure 3(b)) reveals that while the various weight-balanced trees are almost unaffected by the heavily skewed distribution, the red-black tree handles it a lot worse, with more than difference between the best weight-balanced tree and the red-black tree. Interestingly, the skewed case, shown in Figure 11 in Appendix B, shows results very similar to the uniform case.
The fact that in Figure 4, the values for the top-down weight-balanced tree with do not differ much from the bottom-up weight-balanced tree with the same balancing parameters (which are infeasible for a top-down balancing approach), and that the (infeasible) parameter pair outperforms all other trees, hint at the fact that even infeasible balancing parameters for a top-down balancing approach may produce little to no balance violations in practice. We examine this claim by continually counting the number of nodes at which balance is violated while repeatedly removing and re-inserting (with a changed value) random nodes from resp. into a random tree. Figure 5 shows the results for a tree of size . We repeat the experiment with different seeds, the line indicates the mean, the shaded areas indicate the standard deviation. We see that for all three666We excluded here, since it breaks the balancing so badly that it distorts the plot. evaluated variants, the number of nodes at which balance is violated stabilizes after approximately removals and insertions.777One removal and one insertion count as one operation. We also see that even for the worst of the parameter choices, , only about of all nodes are unbalanced after operations. This behavior can be explained by the fact that unbalanced nodes will likely be rebalanced by the next operation that passes over them. Thus, we also expect the unbalanced nodes to have large depths, since nodes close to the root are passed over very frequently.
3.3 Real-Life Sequences
After the experiments on randomly generated data, we finally take a look at tree operations generated from an algorithm that heavily relies on balancing binary trees. To this end, we instrumented the SWAG algorithm by Barth and Wagner [barth2019shaving]. This is a scheduling algorithm that in its innermost loop uses a dynamic segment tree, which is built on top of a balancing binary search tree. Note that the algorithm only deletes from and inserts into the tree and never performs any searches.888While this might seem useless, the information needed by the scheduling algorithm is computed in an annotation at the root of the tree. We collected a total of sequences of tree operations. To benchmark our weight-balanced trees, we replay each sequence ten times for every weight-balanced tree variant. Figure 6 shows the results, where every dot is the time (averaged over the ten iterations) it took the tree indicated by the axis to execute one sequence, normalized to the time it took the bottom-up variant to execute the same sequence. We see that in this specific use case, the variant suggested by Hirai and Yamamoto (for the bottom-up variant) performs the best, being about faster than the bottom-up variant — again, we see the best results for a parameter choice that is infeasible for top-down rebalancing. The top-down feasible variant performs slightly worse. But even the worst variant, still is more than faster than the bottom-up variant. Note that we have excluded the variant here. It has its mean at approximately and would distort the plot.
3.4 Rotated Node Weight
For the final evaluation step, we consider that weight-balanced trees are often chosen because the total weight of the nodes rotated around can be theoretically bounded. This is useful if rotations around larger nodes are expensive, for example because of annotations that need to be repaired. We explore their behavior in this regard by creating random trees of size , performing a number of operations (where every operation consists of one node removal and reinsertion with changed key) on them and counting how many rotations occurred, and what the total weight of the rotated nodes is. Figure 6(a) shows how the number of rotations increases with increasing number of operations, Figure 6(b) shows the same for the total weight of the rotated nodes. Note that we excluded the variant here, since is such a strong balancing requirement that the number of rotations is about times larger than for all the other variants, thus including it would have distorted the plot. The most striking point is that both numbers are significantly smaller for the variants with , usually roughly half the number of rotations (resp. total rotation weight) than for the other variants or the red-black tree. The less strict balancing requirement apparently drastically reduces the number of necessary rotations. Whether one uses top-down or bottom-up balancing does not seem to make a serious difference.
It is also notable that the red-black tree, although not possessing a similar theoretical guarantee, does not perform significantly worse in terms of rotation count or weight than the weight-balanced trees with , although its total rotation weight has a much larger standard deviation. Consistent with the finding for , the weight-balanced tree with performs the worst in terms of rotations.
In the paper on hand, we evaluated and engineered top-down weight-balanced trees. A rigorous evaluation has shown that using a top-down balancing approach instead of a bottom-up approach in fact leads to a significant performance increase, if one chooses the correct balancing parameters. The correct choice of balancing parameters can even make weight-balanced trees more performant than red-black trees, which is surprising considering the fact that red-black trees are used widely, while weight-balanced trees have received little attention in practice. However, the balancing parameters should be chosen with the intended use for the weight-balanced tree in mind. If little modification and a lot of searches are expected, we recommend using because of its superior average node depth. Even stronger balanced choices such as do not look advisable. One should also consider the expected distribution of nodes’ keys. For strongly skewed distributions, as for example the zipf case, smaller values such as tend to be advantageous. Also, for these distributions, weight-balanced trees should be chosen over red-black trees, as our analysis of average node depth has shown.
In case that the weight-balanced tree is annotated and rotations, especially around large nodes, are costly, using or even larger values is likely to be the best of the evaluated choice. In fact, our benchmark of insert and deletion suggests that and are overall fairly performant choices, even if their average path lengths might be slightly inferior. It never seems to be a good choice to use the classic variant. Summarizing these recommendations, it is surprising that empirically, many times the best choice for balancing parameters are parameters for which the theoretical guarantees do not hold, especially in the top-down rebalancing case. Of course, these parameters are only a viable choice if one does not have to worry about artificially crafted adversarial instances.
In the future, it would be interesting to determine the space of feasible balancing parameters for top-down weight-balanced trees similar to how Hirai and Yamamoto have done for bottom-up weight-balanced trees.
Appendix A Code and Data Publication
All evaluated trees as well as all benchmarking code is implemented in C++17. We publish the code (including all benchmarking code) at
Note that this is an ongoing project subject to changes. The exact code revision used in this paper can be accessed at
The code includes a file README.md with build instructions. After building, the directory “benchmark” contains all binaries necessary to reproduce our benchmarks. The file BENCHMARKING.md contains instructions on how to run the benchmarks.
We also publish all raw results we obtained from the benchmarks in a separate data publication [data-publication]. This publication can be accessed at
It also contains a detailled description of the data format output by the various benchmarking tools.