Showing papers on "Binary tree published in 1969"
TL;DR: A mathematical model is developed for the mean and variance of the number of trials to recover a given document in a randomly received list of files to offer new potential for information retrieval systems.
Abstract: A mathematical model is developed for the mean and variance of the number of trials to recover a given document in a randomly received list of files. The search method described is binary in nature and offers new potential for information retrieval systems.
24 citations
5 citations
TL;DR: It is imagined that items are stored in a random-access memory along with binary-valued attributes and the problem of looking up all items having at least a particular subset of attributes is attacked by representing the attributes in a bit vector, then “or-merging” bit vectors pairwise into a binary tree.
Abstract: It is imagined that items are stored in a random-access memory along with binary-valued attributes. The problem of looking up all items having at least a particular subset of attributes is attacked by representing the attributes in a bit vector, then “or-merging” bit vectors pairwise into a binary tree. The efficiency of this method increases with the size of the lookup subset. However, the increase is disappointingly slow, and the overall efficiency is about equal to that associated with a conventional inverted file.