A Note on Median Split Trees

Authors:
Douglas Comer
Affiliations:
Computer Science Department, Purdue University, West Lafayette, IN
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1980

Citing 1
Cited 1

Median split trees: a fast lookup technique for frequently occuring keys

Communications of the ACM

A compendium of key search references

ACM SIGIR Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

The median split tree is an elegant technique for searching static sets of keys when the frequency of access is highly skewed. This paper generalizes the median split search technique, relates it to sequential search and binary search, discusses the choice of an optimum search strategy for a given set of keys, and poses several related optimization problems.