Partial match queries in relaxed multidimensional search trees

International audience The variance of partial match queries in $k$-dimensional tries was investigated in a couple of papers in the mid-nineties, the resulting analysis being long and complicated. In this paper, we are going to re-derive these results with a much easier approach. Moreover, our approach works for $k$-dimensional PATRICIA tries, $k$-dimensional digital search trees and bucket versions as well.

Download Full-text

RCU‐HTM: A generic synchronization technique for highly efficient concurrent search trees

Concurrency and Computation Practice and Experience ◽

10.1002/cpe.6174 ◽

2021 ◽

Author(s):

Dimitrios Siakavaras ◽

Konstantinos Nikas ◽

Georgios Goumas ◽

Nectarios Koziris

Keyword(s):

Search Trees ◽

Highly Efficient

Download Full-text

Practical concurrent traversals in search trees

ACM SIGPLAN Notices ◽

10.1145/3200691.3178503 ◽

2018 ◽

Vol 53 (1) ◽

pp. 207-218

Author(s):

Dana Drachsler-Cohen ◽

Martin Vechev ◽

Eran Yahav

Keyword(s):

Search Trees

Download Full-text

Extremal Values of the Sackin Tree Balance Index

Annals of Combinatorics ◽

10.1007/s00026-021-00539-2 ◽

2021 ◽

Author(s):

Mareike Fischer

Keyword(s):

Phylogenetic Trees ◽

Theoretical Computer Science ◽

Search Trees ◽

Formal Proofs ◽

Birth Process ◽

Ordered Trees ◽

Research Areas ◽

New Findings ◽

Mathematical Phylogenetics ◽

Extremal Values

AbstractTree balance plays an important role in different research areas like theoretical computer science and mathematical phylogenetics. For example, it has long been known that under the Yule model, a pure birth process, imbalanced trees are more likely than balanced ones. Also, concerning ordered search trees, more balanced ones allow for more efficient data structuring than imbalanced ones. Therefore, different methods to measure the balance of trees were introduced. The Sackin index is one of the most frequently used measures for this purpose. In many contexts, statements about the minimal and maximal values of this index have been discussed, but formal proofs have only been provided for some of them, and only in the context of ordered binary (search) trees, not for general rooted trees. Moreover, while the number of trees with maximal Sackin index as well as the number of trees with minimal Sackin index when the number of leaves is a power of 2 are relatively easy to understand, the number of trees with minimal Sackin index for all other numbers of leaves has been completely unknown. In this manuscript, we extend the findings on trees with minimal and maximal Sackin indices from the literature on ordered trees and subsequently use our results to provide formulas to explicitly calculate the numbers of such trees. We also extend previous studies by analyzing the case when the underlying trees need not be binary. Finally, we use our results to contribute both to the phylogenetic as well as the computer scientific literature using the new findings on Sackin minimal and maximal trees to derive formulas to calculate the number of both minimal and maximal phylogenetic trees as well as minimal and maximal ordered trees both in the binary and non-binary settings. All our results have been implemented in the Mathematica package SackinMinimizer, which has been made publicly available.

Download Full-text