Search (3 results, page 1 of 1)

  • × author_ss:"Chang, R."
  • × language_ss:"e"
  1. Chang, R.: ¬The development of indexing technology (1993) 0.00
    0.0045768693 = product of:
      0.032038085 = sum of:
        0.008071727 = weight(_text_:information in 7024) [ClassicSimilarity], result of:
          0.008071727 = score(doc=7024,freq=2.0), product of:
            0.052020688 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.029633347 = queryNorm
            0.1551638 = fieldWeight in 7024, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=7024)
        0.023966359 = weight(_text_:retrieval in 7024) [ClassicSimilarity], result of:
          0.023966359 = score(doc=7024,freq=2.0), product of:
            0.08963835 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.029633347 = queryNorm
            0.26736724 = fieldWeight in 7024, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=7024)
      0.14285715 = coord(2/14)
    
    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
  2. Chang, R.; Raatjes, R.: Understanding MARC : another look (1990) 0.00
    0.0036728554 = product of:
      0.051419973 = sum of:
        0.051419973 = weight(_text_:wide in 3542) [ClassicSimilarity], result of:
          0.051419973 = score(doc=3542,freq=2.0), product of:
            0.1312982 = queryWeight, product of:
              4.4307585 = idf(docFreq=1430, maxDocs=44218)
              0.029633347 = queryNorm
            0.3916274 = fieldWeight in 3542, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4307585 = idf(docFreq=1430, maxDocs=44218)
              0.0625 = fieldNorm(doc=3542)
      0.071428575 = coord(1/14)
    
    Abstract
    MARC (Machine Readable Cataloguing) format has been widely used and discussed in the library profession. However, there appear to have a wide spread misunderstanding of its real structure and attributes. Discusses the need for use to understand it a little more. Presents the general misconceptions about MARC, the structure of MARC format. In this library automation age, MARC is a key element in library services, and it deserves another look.
  3. Chang, R.: Keyword searching and indexing (1993) 0.00
    0.0017118829 = product of:
      0.023966359 = sum of:
        0.023966359 = weight(_text_:retrieval in 7223) [ClassicSimilarity], result of:
          0.023966359 = score(doc=7223,freq=2.0), product of:
            0.08963835 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.029633347 = queryNorm
            0.26736724 = fieldWeight in 7223, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=7223)
      0.071428575 = coord(1/14)
    
    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