Abstract

Estimating the cost of a query plan is one of the hardest problems in query optimization. This includes cardinality estimates of string search patterns, of multi-word strings like phrases or text snippets in particular. At first sight, suffix trees address this problem. To curb the memory usage of a suffix tree, one often prunes the tree to a certain depth. But this pruning method "takes away" more information from long strings than from short ones. This problem is particularly severe with sets of long strings, the setting studied here. In this article, we propose respective pruning techniques. Our approaches remove characters with low information value. The various variants determine a character's information value in different ways, e.g., by using conditional entropy with respect to previous characters in the string. Our experiments show that, in contrast to the well-known pruned suffix tree, our technique provides significantly better estimations when the tree size is reduced by 60% or less. Due to the redundancy of natural language, our pruning techniques yield hardly any error for tree-size reductions of up to 50%.

KITopen

Citation

Bibtex:
@techreport{Willkomm:2021:10.5445/IR/1000128678,
            author  = {Jens Willkomm and Martin Schäler and Klemens Böhm},
            title      = {Accurate Cardinality Estimation of Co-occurring Words Using Suffix Trees (Extended Version)},
            year     = {2021},
            copyright         = {Open Access},
            doi       = {10.5445/IR/1000128678},
            keywords         = {Query optimization, cardinality estimation, suffix tree},
            language          = {en},
            publisher         = {Karlsruher Institut für Technologie (KIT)},
}