<?xml version="1.0" standalone="yes"?>
<Paper uid="C69-5101">
  <Title>A SEARCH ALGORITHM AND DATA STRUCTURE FOR AN EFFICIENT INFORMATION SYSTEM</Title>
  <Section position="4" start_page="0" end_page="0" type="intro">
    <SectionTitle>
3. Binary Search
</SectionTitle>
    <Paragraph position="0"> Using the binary search method will yield a more satisfactory result. The search starts with the midpoint of the file, and goes to the midpoint of the associated remaining half if a match fails. The comparison of their values Will decide which half of the file should be tried next time. This process will be repeated until a n~tch is found. The average number of searches in the example is calculated through the following formula as 15.6 searches:</Paragraph>
    <Paragraph position="2"> if N is a large number.</Paragraph>
    <Paragraph position="3"> The Hibbard's Double Chain Method and Sussenguth's Distributed Key Method are compatible to the binary search in search efficiency but have a much better update efficiency because of the list-structured address-chaining mechanism. The respective calculations of the example are: Hibbard: S = 1.4 log2N = 21.9 and Sussenguth: S = 1.24 Iog2N = 19.4</Paragraph>
  </Section>
class="xml-element"></Paper>