On Efficient Unsuccessful Search

  title={On Efficient Unsuccessful Search},
  author={Lucas Chi Kwong Hui and Charles U. Martel},
This paper introduces a general technique for speeding up unsuccessful search using very little extra space (2 bits per key). This technique is applicable to many data structures including linear lists, and search trees. For linear lists we get on-line algorithms for processing a sequence of successful and unsuccessful searches which are competitive with strong off-line algorithms. In a virtual memory environment our self-adjusting algorithm for multi-way search trees is competitive with an… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
4 Extracted Citations
1 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…