Optimal tree lists for information storage and retrieval

摘要

Combining the concepts of doubly-chained tree and list one may produce files with expected search time smaller than that of the pure tree. A best such structure is found to lie within a very large set of candidates, but a sort of convexity property is found to prevail and it is possible to devise extremely efficient solution procedures for even quite large problems of this variety.