Chris H. Perleberg

Learn More
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk(More)
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk(More)
Single character searching (SCS) methods have wide application in text processing, since many text processing algorithms need to search for a single character in a text string. In this paper, we compare three SCS methods. Two SCS methods are applied to the shift-or patternmatching algorithm of Baeza-Yates and Gonnet [ 2 1, and the performance of the(More)
  • 1