Search (2 results, page 1 of 1)

  • × author_ss:"Chang, M."
  1. Chang, M.: ¬An electronic finding aid using extensible markup language (XML) and encoded archival description (EAD) (2000) 0.01 
    0.0073902505 = product of:
  0.018475626 = sum of:
    0.010661141 = weight(_text_:a in 4886) [ClassicSimilarity], result of:
      0.010661141 = score(doc=4886,freq=10.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.19940455 = fieldWeight in 4886, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4886)
    0.007814486 = product of:
      0.015628971 = sum of:
        0.015628971 = weight(_text_:information in 4886) [ClassicSimilarity], result of:
          0.015628971 = score(doc=4886,freq=4.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.1920054 = fieldWeight in 4886, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4886)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    Increasingly, XML applications are appearing on the World Wide Web, from e-commerce to information management. In the case of libraries and archives, XML enables more flexible information management and retrieval than using MARC or a relational database management system. Describes a project to explore the use of XML and the EAD, and the development of a prototype electronic finding aid. It focuses on the technical aspects, and reviews the options available and the choices made. This is done within the setting of a small- to medium-sized archive with minimal tools and resources.
    Type
    a
  2. Chang, M.; Poon, C.K.: Efficient phrase querying with common phrase index (2008) 0.01 
    0.005549766 = product of:
  0.013874415 = sum of:
    0.009138121 = weight(_text_:a in 2061) [ClassicSimilarity], result of:
      0.009138121 = score(doc=2061,freq=10.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.1709182 = fieldWeight in 2061, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=2061)
    0.0047362936 = product of:
      0.009472587 = sum of:
        0.009472587 = weight(_text_:information in 2061) [ClassicSimilarity], result of:
          0.009472587 = score(doc=2061,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.116372846 = fieldWeight in 2061, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046875 = fieldNorm(doc=2061)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    In this paper, we propose a common phrase index as an efficient index structure to support phrase queries in a very large text database. Our structure is an extension of previous index structures for phrases and achieves better query efficiency with modest extra storage cost. Further improvement in efficiency can be attained by implementing our index according to our observation of the dynamic nature of common word set. In experimental evaluation, a common phrase index using 255 common words has an improvement of about 11% and 62% in query time for the overall and large queries (queries of long phrases) respectively over an auxiliary nextword index. Moreover, it has only about 19% extra storage cost. Compared with an inverted index, our improvement is about 72% and 87% for the overall and large queries respectively. We also propose to implement a common phrase index with dynamic update feature. Our experiments show that more improvement in time efficiency can be achieved.
    Source
    Information processing and management. 44(2008) no.2, S.756-769
    Type
    a

Themes