Search (37 results, page 1 of 2)

  • × theme_ss:"Retrievalalgorithmen"
  • × year_i:[1990 TO 2000}
  1. Paris, L.A.H.; Tibbo, H.R.: Freestyle vs. Boolean : a comparison of partial and exact match retrieval systems (1998) 0.05 
    0.045378976 = product of:
  0.15882641 = sum of:
    0.05205557 = weight(_text_:processing in 3329) [ClassicSimilarity], result of:
      0.05205557 = score(doc=3329,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.3130829 = fieldWeight in 3329, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3329)
    0.106770836 = weight(_text_:techniques in 3329) [ClassicSimilarity], result of:
      0.106770836 = score(doc=3329,freq=6.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.5901092 = fieldWeight in 3329, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3329)
  0.2857143 = coord(2/7)
    Abstract
    Compares the performance of partial match options, LEXIS/NEXIS's Freestyle, with that of traditional Boolean retrieval. Defines natural language and the natural language search engines currently available. Although the Boolean searches had better results more often than the Freestyle searches, neither mechanism demonstrated superior performance for every query. These results do not in any way prove the superiority of partial match techniques or exact match techniques, but they do suggest that different queries demand different techniques. Further study and analysis are needed to determine which elements of a query make it best suited for partial match or exact match retrieval
    Source
    Information processing and management. 34(1998) nos.2/3, S.175-190
  2. Pfeifer, U.; Pennekamp, S.: Incremental processing of vague queries in interactive retrieval systems (1997) 0.04 
    0.044167142 = product of:
  0.15458499 = sum of:
    0.08413451 = weight(_text_:processing in 735) [ClassicSimilarity], result of:
      0.08413451 = score(doc=735,freq=4.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.5060184 = fieldWeight in 735, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0625 = fieldNorm(doc=735)
    0.07045048 = weight(_text_:techniques in 735) [ClassicSimilarity], result of:
      0.07045048 = score(doc=735,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3893711 = fieldWeight in 735, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=735)
  0.2857143 = coord(2/7)
    Abstract
    The application of information retrieval techniques in interactive environments requires systems capable of effeciently processing vague queries. To reach reasonable response times, new data structures and algorithms have to be developed. In this paper we describe an approach taking advantage of the conditions of interactive usage and special access paths. To have a reference we investigate text queries and compared our algorithms to the well known 'Buckley/Lewit' algorithm. We achieved significant improvements for the response times
  3. Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999) 0.03 
    0.0335502 = product of:
  0.117425695 = sum of:
    0.06310088 = weight(_text_:processing in 5777) [ClassicSimilarity], result of:
      0.06310088 = score(doc=5777,freq=4.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.3795138 = fieldWeight in 5777, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.046875 = fieldNorm(doc=5777)
    0.05432481 = product of:
      0.10864962 = sum of:
        0.10864962 = weight(_text_:mathematics in 5777) [ClassicSimilarity], result of:
          0.10864962 = score(doc=5777,freq=2.0), product of:
            0.25945482 = queryWeight, product of:
              6.31699 = idf(docFreq=216, maxDocs=44218)
              0.04107254 = queryNorm
            0.41876122 = fieldWeight in 5777, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.31699 = idf(docFreq=216, maxDocs=44218)
              0.046875 = fieldNorm(doc=5777)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Abstract
    This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing
    LCSH
    Text processing (Computer science)
    Subject
    Text processing (Computer science)
  4. Chen, H.; Zhang, Y.; Houston, A.L.: Semantic indexing and searching using a Hopfield net (1998) 0.03 
    0.027844835 = product of:
  0.09745692 = sum of:
    0.04461906 = weight(_text_:processing in 5704) [ClassicSimilarity], result of:
      0.04461906 = score(doc=5704,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.26835677 = fieldWeight in 5704, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.046875 = fieldNorm(doc=5704)
    0.052837856 = weight(_text_:techniques in 5704) [ClassicSimilarity], result of:
      0.052837856 = score(doc=5704,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.2920283 = fieldWeight in 5704, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.046875 = fieldNorm(doc=5704)
  0.2857143 = coord(2/7)
    Abstract
    Presents a neural network approach to document semantic indexing. Reports results of a study to apply a Hopfield net algorithm to simulate human associative memory for concept exploration in the domain of computer science and engineering. The INSPEC database, consisting of 320.000 abstracts from leading periodical articles was used as the document test bed. Benchmark tests conformed that 3 parameters: maximum number of activated nodes; maximum allowable error; and maximum number of iterations; were useful in positively influencing network convergence behaviour without negatively impacting central processing unit performance. Another series of benchmark tests was performed to determine the effectiveness of various filtering techniques in reducing the negative impact of noisy input terms. Preliminary user tests conformed expectations that the Hopfield net is potentially useful as an associative memory technique to improve document recall and precision by solving discrepancies between indexer vocabularies and end user vocabularies
  5. Information retrieval : data structures and algorithms (1992) 0.02 
    0.02320403 = product of:
  0.0812141 = sum of:
    0.03718255 = weight(_text_:processing in 3495) [ClassicSimilarity], result of:
      0.03718255 = score(doc=3495,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.22363065 = fieldWeight in 3495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3495)
    0.044031553 = weight(_text_:techniques in 3495) [ClassicSimilarity], result of:
      0.044031553 = score(doc=3495,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.24335694 = fieldWeight in 3495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3495)
  0.2857143 = coord(2/7)
    Abstract
    The book consists of separate chapters by some 20 different authors. It covers many of the information retrieval algorithms, including methods of file organization, file search and access, and query processing
    Content
    An edited volume containing data structures and algorithms for information retrieval including a disk with examples written in C. for prgrammers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents. ------------------Enthält die Kapitel: FRAKES, W.B.: Introduction to information storage and retrieval systems; BAEZA-YATES, R.S.: Introduction to data structures and algorithms related to information retrieval; HARMAN, D. u.a.: Inverted files; FALOUTSOS, C.: Signature files; GONNET, G.H. u.a.: New indices for text: PAT trees and PAT arrays; FORD, D.A. u. S. CHRISTODOULAKIS: File organizations for optical disks; FOX, C.: Lexical analysis and stoplists; FRAKES, W.B.: Stemming algorithms; SRINIVASAN, P.: Thesaurus construction; BAEZA-YATES, R.A.: String searching algorithms; HARMAN, D.: Relevance feedback and other query modification techniques; WARTIK, S.: Boolean operators; WARTIK, S. u.a.: Hashing algorithms; HARMAN, D.: Ranking algorithms; FOX, E.: u.a.: Extended Boolean models; RASMUSSEN, E.: Clustering algorithms; HOLLAAR, L.: Special-purpose hardware for information retrieval; STANFILL, C.: Parallel information retrieval algorithms
  6. Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.02 
    0.023177382 = product of:
  0.081120834 = sum of:
    0.06164417 = weight(_text_:techniques in 1319) [ClassicSimilarity], result of:
      0.06164417 = score(doc=1319,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3406997 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.019476667 = product of:
      0.038953334 = sum of:
        0.038953334 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.038953334 = score(doc=1319,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = queryNorm
            0.2708308 = fieldWeight in 1319, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1319)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Abstract
    Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
    Date
    1. 8.1996 22:08:06
  7. Reddaway, S.: High speed text retrieval from large databases on a massively parallel processor (1991) 0.02 
    0.016997738 = product of:
  0.11898416 = sum of:
    0.11898416 = weight(_text_:processing in 7745) [ClassicSimilarity], result of:
      0.11898416 = score(doc=7745,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.7156181 = fieldWeight in 7745, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.125 = fieldNorm(doc=7745)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 27(1991), S.311-316
  8. Ciocca, G.; Schettini, R.: ¬A relevance feedback mechanism for content-based image retrieval (1999) 0.01 
    0.014873021 = product of:
  0.10411114 = sum of:
    0.10411114 = weight(_text_:processing in 6498) [ClassicSimilarity], result of:
      0.10411114 = score(doc=6498,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.6261658 = fieldWeight in 6498, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.109375 = fieldNorm(doc=6498)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 35(1999) no.5, S.605-632
  9. Koyama, M.: ¬A fast retrieving algorithm of hierarchical relationships using tree structures (1998) 0.01 
    0.014873021 = product of:
  0.10411114 = sum of:
    0.10411114 = weight(_text_:processing in 6403) [ClassicSimilarity], result of:
      0.10411114 = score(doc=6403,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.6261658 = fieldWeight in 6403, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.109375 = fieldNorm(doc=6403)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 34(1998) no.6, S.761-763
  10. Lee, J.H.: Combining the evidence of different relevance feedback methods for information retrieval (1998) 0.01 
    0.014873021 = product of:
  0.10411114 = sum of:
    0.10411114 = weight(_text_:processing in 6469) [ClassicSimilarity], result of:
      0.10411114 = score(doc=6469,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.6261658 = fieldWeight in 6469, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.109375 = fieldNorm(doc=6469)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 34(1998) no.6, S.681-691
  11. Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995) 0.01 
    0.014598417 = product of:
  0.051094458 = sum of:
    0.03718255 = weight(_text_:processing in 5697) [ClassicSimilarity], result of:
      0.03718255 = score(doc=5697,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.22363065 = fieldWeight in 5697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5697)
    0.013911906 = product of:
      0.027823811 = sum of:
        0.027823811 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
          0.027823811 = score(doc=5697,freq=2.0), product of:
            0.14382903 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04107254 = queryNorm
            0.19345059 = fieldWeight in 5697, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5697)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
    Date
    22. 2.1996 13:14:10
    Source
    Information processing and management. 31(1995) no.4, S.605-620
  12. Harman, D.: Relevance feedback and other query modification techniques (1992) 0.01 
    0.014233147 = product of:
  0.099632025 = sum of:
    0.099632025 = weight(_text_:techniques in 3508) [ClassicSimilarity], result of:
      0.099632025 = score(doc=3508,freq=4.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.5506539 = fieldWeight in 3508, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=3508)
  0.14285715 = coord(1/7)
    Abstract
    Presents a survey of relevance feedback techniques that have been used in past research, recommends various query modification approaches for use in different retrieval systems, and gives some guidelines for the efficient design of the relevance feedback component of a retrieval system
  13. Cole, C.: Intelligent information retrieval: diagnosing information need : Part I: the theoretical framework for developing an intelligent IR tool (1998) 0.01 
    0.012748304 = product of:
  0.08923812 = sum of:
    0.08923812 = weight(_text_:processing in 6431) [ClassicSimilarity], result of:
      0.08923812 = score(doc=6431,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.53671354 = fieldWeight in 6431, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.09375 = fieldNorm(doc=6431)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 34(1998) no.6, S.709-720
  14. Cole, C.: Intelligent information retrieval: diagnosing information need : Part II: uncertainty expansion in a prototype of a diagnostic IR tool (1998) 0.01 
    0.012748304 = product of:
  0.08923812 = sum of:
    0.08923812 = weight(_text_:processing in 6432) [ClassicSimilarity], result of:
      0.08923812 = score(doc=6432,freq=2.0), product of:
        0.1662677 = queryWeight, product of:
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.04107254 = queryNorm
        0.53671354 = fieldWeight in 6432, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.048147 = idf(docFreq=2097, maxDocs=44218)
          0.09375 = fieldNorm(doc=6432)
  0.14285715 = coord(1/7)
    Source
    Information processing and management. 34(1998) no.6, S.721-731
  15. Willett, P.: Best-match text retrieval (1993) 0.01 
    0.012580444 = product of:
  0.088063106 = sum of:
    0.088063106 = weight(_text_:techniques in 7818) [ClassicSimilarity], result of:
      0.088063106 = score(doc=7818,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.4867139 = fieldWeight in 7818, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.078125 = fieldNorm(doc=7818)
  0.14285715 = coord(1/7)
    Abstract
    Provides an introduction to the computational techniques that underlie best match searching retrieval systems. Discusses: problems of traditional Boolean systems; characteristics of best-match searching; automatic indexing; term conflation; matching of documents and queries (dealing with similarity measures, initial weights, relevance weights, and the matching algorithm); and describes operational best-match systems
  16. Longshu, L.; Xia, Z.: On an aproximate fuzzy information retrieval agent (1998) 0.01 
    0.010347582 = product of:
  0.07243308 = sum of:
    0.07243308 = product of:
      0.14486615 = sum of:
        0.14486615 = weight(_text_:mathematics in 3294) [ClassicSimilarity], result of:
          0.14486615 = score(doc=3294,freq=2.0), product of:
            0.25945482 = queryWeight, product of:
              6.31699 = idf(docFreq=216, maxDocs=44218)
              0.04107254 = queryNorm
            0.5583483 = fieldWeight in 3294, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.31699 = idf(docFreq=216, maxDocs=44218)
              0.0625 = fieldNorm(doc=3294)
      0.5 = coord(1/2)
  0.14285715 = coord(1/7)
    Abstract
    Discusses online approximate information retrieval based on fuzzy mathematics. Defines fuzzy semantics. Presents an approximate fuzzy matching algorithm and an algorithm for a fuzzy word indexing agent for approximate retrieval. Also presents a case study demonstrating approximate fuzzy matching
  17. Ruthven, I.; Lalmas, M.: Selective relevance feedback using term characteristics (1999) 0.01 
    0.010086811 = product of:
  0.07060768 = sum of:
    0.07060768 = weight(_text_:digital in 3824) [ClassicSimilarity], result of:
      0.07060768 = score(doc=3824,freq=2.0), product of:
        0.16201277 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.04107254 = queryNorm
        0.4358155 = fieldWeight in 3824, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.078125 = fieldNorm(doc=3824)
  0.14285715 = coord(1/7)
    Source
    Vocabulary as a central concept in digital libraries: interdisciplinary concepts, challenges, and opportunities : proceedings of the Third International Conference an Conceptions of Library and Information Science (COLIS3), Dubrovnik, Croatia, 23-26 May 1999. Ed. by T. Arpanac et al
  18. Al-Hawamdeh, S.; Smith, G.; Willett, P.; Vere, R. de: Using nearest-neighbour searching techniques to access full-text documents (1991) 0.01 
    0.010064354 = product of:
  0.07045048 = sum of:
    0.07045048 = weight(_text_:techniques in 2300) [ClassicSimilarity], result of:
      0.07045048 = score(doc=2300,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3893711 = fieldWeight in 2300, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=2300)
  0.14285715 = coord(1/7)
  19. Chang, R.: ¬The development of indexing technology (1993) 0.01 
    0.010064354 = product of:
  0.07045048 = sum of:
    0.07045048 = weight(_text_:techniques in 7024) [ClassicSimilarity], result of:
      0.07045048 = score(doc=7024,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3893711 = fieldWeight in 7024, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=7024)
  0.14285715 = coord(1/7)
    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
  20. Chang, R.: Keyword searching and indexing (1993) 0.01 
    0.010064354 = product of:
  0.07045048 = sum of:
    0.07045048 = weight(_text_:techniques in 7223) [ClassicSimilarity], result of:
      0.07045048 = score(doc=7223,freq=2.0), product of:
        0.18093403 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.04107254 = queryNorm
        0.3893711 = fieldWeight in 7223, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0625 = fieldNorm(doc=7223)
  0.14285715 = coord(1/7)
    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

Authors

Languages

  • e 36
  • chi 1
  • More… Less…

Types

  • a 32
  • m 2
  • s 2
  • el 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications