Decomposable Searching Problems


In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each based on a, different counting scheme for representing the integers, and then use a combinatorial model to show the optimality of many of the transformations. Issues such as online data structures and deletion of elements are also examined* To demonstrate the applicability of these tools, we will study six new data structures that have been developed by applying the transformations. 1 T h i s research w a s supported in part by the Off ice of Naval Research under Contract N 0 0 0 1 4 7 6 C 0 3 7 0 . 2 A l s o w i t h the Department of Mathematics, Table of

DOI: 10.1016/0020-0190(79)90117-0

Extracted Key Phrases

9 Figures and Tables

Citations per Year

258 Citations

Semantic Scholar estimates that this publication has 258 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bentley1979DecomposableSP, title={Decomposable Searching Problems}, author={Jon Louis Bentley}, journal={Inf. Process. Lett.}, year={1979}, volume={8}, pages={244-251} }