Search (2 results, page 1 of 1)

0.010965433 = product of:
  0.0657926 = sum of:
    0.0657926 = weight(_text_:b in 7024) [ClassicSimilarity], result of:
      0.0657926 = score(doc=7024,freq=4.0), product of:
        0.14855953 = queryWeight, product of:
          3.542962 = idf(docFreq=3476, maxDocs=44218)
          0.041930884 = queryNorm
        0.44287026 = fieldWeight in 7024, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.542962 = idf(docFreq=3476, maxDocs=44218)
          0.0625 = fieldNorm(doc=7024)
  0.16666667 = coord(1/6)

Abstract

Reviews the basic techniques of computerized indexing, including various file accessing methods such as: Sequential Access Method (SAM); Direct Access Method (DAM); Indexed Sequential Access Method (ISAM), and Virtual Indexed Sequential Access Method (VSAM); and various B-tree (balanced tree)structures. Illustrates how records are stored and accessed, and how B-trees are used to for improving the operations of information retrieval and maintenance

0.010965433 = product of:
  0.0657926 = sum of:
    0.0657926 = weight(_text_:b in 7223) [ClassicSimilarity], result of:
      0.0657926 = score(doc=7223,freq=4.0), product of:
        0.14855953 = queryWeight, product of:
          3.542962 = idf(docFreq=3476, maxDocs=44218)
          0.041930884 = queryNorm
        0.44287026 = fieldWeight in 7223, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.542962 = idf(docFreq=3476, maxDocs=44218)
          0.0625 = fieldNorm(doc=7223)
  0.16666667 = coord(1/6)

Abstract

Explains how a computer indexing system works. Reviews fundamentals of how data are stored and retrieved by computers. Describes B-Tree and B+-Tree indexing structures. Gives basic keyword searching techniques that the user must apply to make use of the indexing programs. The demand for keyword retrieval is increasing and librarians should expect to see the keyword-indexing feature become commonly available