Information Retrieval: Data Structures and Algorithms

An edited volume containing data structures and algorithms for information retrieved including a disk with examples written in C. For programmers 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.

[1]  Calvin N. Mooers,et al.  Application of random codes to the gathering of statistical information , 1948 .

[2]  Hans Peter Luhn,et al.  A Statistical Approach to Mechanized Encoding and Searching of Literary Information , 1957, IBM J. Res. Dev..

[3]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[4]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[5]  Francis A. Williams.  Handling identifies as internal symbols in language processors , 1959, CACM.

[6]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[7]  Simon Stiassny.  Mathematical analysis of various superimposed coding methods , 1960 .

[8]  M. E. Maron,et al.  On Relevance, Probabilistic Indexing and Information Retrieval , 1960, JACM.

[9]  B F SKINNER,et al.  Teaching Machines , 1962 .

[10]  J A Swets,et al.  Computer-aided instruction. , 1965, Science.

[11]  S. Golomb.  Run-length encodings. , 1966 .

[12]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[13]  Julie Beth Lovins,et al.  Development of a stemming algorithm , 1968, Mech. Transl. Comput. Linguistics.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[15]  Gerard Salton,et al.  Automatic Information Organization And Retrieval , 1968 .

[16]  Michael Lesk,et al.  Word-word associations in document retrieval systems , 1969 .

[17]  F. W. Lancaster,et al.  MEDLARS: Report on the Evaluation of Its Operating Efficiency. , 1997 .

[18]  Gerard Salton,et al.  Evaluation problems in interactive information retrieval , 1969, Inf. Storage Retr..

[19]  James R. Bell,et al.  The linear quotient hash code , 1970, CACM.

[20]  Karen Sparck Jones.  Information Retrieval Experiment , 1971 .

[21]  J. J. Rocchio,et al.  Relevance feedback in information retrieval , 1971 .

[22]  Malcolm C. Harrison,et al.  Implementation of the substring test by hashing , 1971, CACM.

[23]  Gerard Salton,et al.  The SMART Retrieval System , 1971 .

[24]  Richard A. Gustafson.  Elements of the randomized combinatorial file structure , 1971, SIGIR '71.

[25]  K. Sparck Jones,et al.  What makes an automatic keyword classification effective , 1971 .

[26]  Jeffrey D. Ullman.  A Note on the Efficiency of Hashing Functions , 1972, JACM.

[27]  Jack Minker,et al.  An evaluation of query expansion by the addition of clustered terms for a document retrieval system , 1972, Inf. Storage Retr..

[28]  Alan Gilchrist,et al.  Thesaurus construction: a practical manual , 1972 .

[29]  D. L. Parnas,et al.  On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.

[30]  Karen Sparck Jones.  A statistical interpretation of term specificity and its application in retrieval , 1972 .

[31]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[32]  Gerard Salton,et al.  On the Specification of Term Values in Automatic Indexing , 1973 .

[33]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[34]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[35]  Dagobert Soergel,et al.  Automatic and Semi-Automatic Methods as an Aid in the Construction of Indexing Languages and Thesauri , 1974 .

[36]  Stephen F. Weiss,et al.  Word segmentation by letter successor varieties , 1974, Inf. Storage Retr..

[37]  Don R. Swanson,et al.  Probabilistic models for automatic indexing , 1974, J. Am. Soc. Inf. Sci..

[38]  Stephen P. Harter,et al.  A probabilistic approach to automatic keyword indexing , 1974 .

[39]  George W. Adamson,et al.  The use of an association measure based on character structure to identify semantically related pairs of words and document titles , 1974, Inf. Storage Retr..

[40]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[41]  David C. van Voorhis,et al.  Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[42]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[43]  Stephen E. Robertson,et al.  Relevance weighting of search terms , 1976, J. Am. Soc. Inf. Sci..

[44]  Rudolf Bayer,et al.  Prefix B-trees , 1977, TODS.

[45]  Robert N. Oddy,et al.  INFORMATION RETRIEVAL THROUGH MAN‐MACHINE DIALOGUE , 1977 .

[46]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[47]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[48]  Ronald L. Rivest.  On the Worst-Case Behavior of String-Searching Algorithms , 1977, SIAM J. Comput..

[49]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[50]  Carlo Vernimb,et al.  Automatic query adjustment in document retrieval , 1977, Inf. Process. Manag..

[51]  C. J. van Rijsbergen,et al.  An Evaluation of feedback in Document Retrieval using Co‐Occurrence Data , 1978, J. Documentation.

[52]  Leonidas J. Guibas,et al.  The Analysis of Double Hashing , 1978, J. Comput. Syst. Sci..

[53]  Tamas E. Doszkocs,et al.  AID, an Associative Interactive Dictionary for online searching , 1978 .

[54]  W. Bruce Croft,et al.  Using Probabilistic Models of Document Retrieval without Relevance Information , 1979, J. Documentation.

[55]  Terry Noreault.  User directed relevance feedback , 1979 .

[56]  Zvi Galil.  On improving the worst case running time of the Boyer-Moore string matching algorithm , 1979, CACM.

[57]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[58]  C.S. Roberts,et al.  Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.

[59]  Lee A. Hollaar,et al.  Text Retrieval Computers , 1979, Computer.

[60]  Andrew Chi-Chih Yao,et al.  The Complexity of Pattern Matching for a Random String , 1977, SIAM J. Comput..

[61]  Beate Commentz-Walter,et al.  A String Matching Algorithm Fast on the Average , 1979, ICALP.

[62]  Karen Spärck Jones.  Search Term Relevance Weighting given Little Relevance Information , 1997, J. Documentation.

[63]  Karen Spärck Jones.  Experiments in relevance weighting of search terms , 1979, Inf. Process. Manag..

[64]  Michael McGill,et al.  An Evaluation of Factors Affecting Document Ranking by Information Retrieval Systems. , 1979 .

[65]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[66]  James L. Peterson,et al.  Computer programs for detecting and correcting spelling errors , 1980, CACM.

[67]  Roger L. Haskin.  Hardware for Searching Very Large Text Datahases , 1980, CAW '80.

[68]  Zvi Galil,et al.  Saving Space in Fast String-Matching , 1980, SIAM J. Comput..

[69]  R. Geoff Dromey,et al.  Fast String Searching by Finding Subkeys in Subtext , 1980, Inf. Process. Lett..

[70]  Richard J. Cichelli.  Minimal perfect hash functions made simple , 1980, CACM.

[71]  Mila E. Majster.  Efficient On-Line Construction and Correction of Position Trees , 1980 .

[72]  Leonidas J. Guibas,et al.  A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm , 1980, SIAM J. Comput..

[73]  Per-Åke Larson,et al.  Linear Hashing with Partial Expansions , 1980, VLDB.

[74]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[75]  Wojciech Rytter.  A Correct Preprocessing Algorithm for Boyer-Moore String-Searching , 1980, SIAM J. Comput..

[76]  Edward A. Fox,et al.  Lexical relations: enhancing effectiveness of information retrieval systems , 1980, SIGF.

[77]  A. O. Slisenko,et al.  Detection of periodicities and string-matching in real time , 1983 .

[78]  R. Nigel Horspool,et al.  Practical fast searching in strings , 1980, Softw. Pract. Exp..

[79]  Alfred V. Aho,et al.  Pattern Matching in Strings , 1980 .

[80]  Aviezri S. Fraenkel,et al.  Experiments in Local Metrical Feedback in Full-Text Retrieval Systems. , 1981 .

[81]  Roger L. Haskin,et al.  Special-Purpose Processors for Text Retrieval. , 1981 .

[82]  Mireille Régnier,et al.  On the Average Height of Trees in Digital Search and Dynamic Hashing , 1981, Inf. Process. Lett..

[83]  Peter Willett,et al.  An evaluation of some conflation algorithms for information retrieval , 1981 .

[84]  R. K. Waldstein.  DIATOM: A DIALOG Simulator. , 1981 .

[85]  Gerard Salton,et al.  The estimation of Term Relevance weights using Relevance feedback , 1981, J. Documentation.

[86]  D. H. Mellor,et al.  Real time , 1981 .

[87]  Zvi Galil,et al.  String Matching in Real Time , 1981, JACM.

[88]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[89]  Tamas E. Doszkocs.  From Research to Application: The Cite Natural Language Information System , 1982, SIGIR.

[90]  G. de V. Smit,et al.  A Comparison of Three String Matching Algorithms , 1982, Softw. Pract. Exp..

[91]  Jon Louis Bentley,et al.  Writing efficient programs , 1982 .

[92]  Kurt Mehlhorn,et al.  On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[93]  Yu. A. Gur'yan,et al.  Parts I and II , 1982 .

[94]  M. D. McIlroy,et al.  Development of a Spelling List , 1982, IEEE Trans. Commun..

[95]  Martin Dillon,et al.  A prevalence formula for automatic relevance feedback in Boolean systems , 1983, Inf. Process. Manag..

[96]  Christos Faloutsos,et al.  A Multimedia Office Filing System , 1983, VLDB.

[97]  Roger L. Haskin,et al.  Architecture and Operation of a Large, Full-Text Information-Retrieval System , 1983, Advanced Database Machine Architecture.

[98]  Gaston H. Gonnet,et al.  Unstructured data bases or very efficient text searching , 1983, PODS.

[99]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[100]  Stavros Christodoulakis,et al.  Message files , 1982, TOIS.

[101]  Kotagiri Ramamohanarao,et al.  A two level superimposed coding scheme for partial match retrieval , 1983, Inf. Syst..

[102]  Nick Cercone,et al.  Minimal and almost minimal perfect hash function search with application to natural language lexicon design , 1983 .

[103]  Alan F. Smeaton,et al.  The Retrieval Effects of Query Expansion on a Feedback Document Retrieval System , 1983, Comput. J..

[104]  Zvi Galil,et al.  Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..

[105]  Thomas A. Standish.  An Essay on Software Reuse , 1984, IEEE Transactions on Software Engineering.

[106]  William B. Frakes.  Term Conflation for Information Retrieval , 1984, SIGIR.

[107]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[108]  Peter Ingwersen,et al.  A cognitive view of three selected online search facilities , 1984 .

[109]  Jørgen Staunstrup,et al.  Experiments With a Fast String Searching Algorithm , 1984, Inf. Process. Lett..

[110]  Larry Fujitani.  Laser optical disk: the coming revolution in on-line storage , 1984, CACM.

[111]  Per-Åke Larson,et al.  File organization: implementation of a method guaranteeing retrieval in one access , 1984, CACM.

[112]  Christos Faloutsos,et al.  Design Considerations for a Message File Server , 1984, IEEE Transactions on Software Engineering.

[113]  Christos Faloutsos,et al.  Signature files: an access method for documents and its analytical performance evaluation , 1984, TOIS.

[114]  Fazli Can,et al.  Concepts of the cover coefficient-based clustering methodology , 1985, SIGIR '85.

[115]  Tohru Kikuno,et al.  Design of hardware algorithms by recurrence relations , 1985, Systems and Computers in Japan.

[116]  Bertrand Meyer.  Incremental String Matching , 1985, Inf. Process. Lett..

[117]  George R. Thoma,et al.  A prototype system for the electronic storage and retrieval of document images , 1985, TOIS.

[118]  B. Pittel.  Asymptotical Growth of a Class of Random Trees , 1985 .

[119]  R. Nigel Horspool,et al.  Practical Perfect Hashing , 1985, Comput. J..

[120]  D. Lipman,et al.  Rapid and sensitive protein similarity searches. , 1985, Science.

[121]  David Haussler,et al.  The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[122]  Uzi Vishkin,et al.  Optimal Parallel Pattern Matching in Strings , 2017, Inf. Control..

[123]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[124]  Thomas J. Sager.  A polynomial time generator for minimal perfect hash functions , 1985, CACM.

[125]  Zvi Galil.  Optimal Parallel Algorithms for String Matching , 1985, Inf. Control..

[126]  Christos Faloutsos,et al.  Access methods for text , 1985, CSUR.

[127]  Ben Shneiderman,et al.  An Experimental Comparison of a Mouse and Arrow-Jump Keys for an Interactive Encyclopedia , 1986, Int. J. Man Mach. Stud..

[128]  Donna K. Harman,et al.  An experimental study of factors important in document ranking , 1986, SIGIR '86.

[129]  Malcolm C. Easton,et al.  Key-Sequence Data Sets on Inedible Storage , 1986, IBM J. Res. Dev..

[130]  Tadao Takaoka,et al.  An On-Line Pattern Matching Algorithm , 1986, Inf. Process. Lett..

[131]  J. D. Bovey,et al.  Weighting, ranking and relevance feedback in a front—end system , 1986, J. Inf. Sci..

[132]  Raffaele Giancarlo,et al.  The Boyer-Moore-Galil String Searching Strategies Revisited , 1986, SIAM J. Comput..

[133]  G. Davies,et al.  Algorithms for pattern matching , 1986, Softw. Pract. Exp..

[134]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[135]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[136]  Craig Stanfill,et al.  Parallel free-text search on the connection machine system , 1986, CACM.

[137]  Stavros Christodoulakis,et al.  Multimedia document presentation, information extraction, and document formation in MINOS: a model and a system , 1986, TOIS.

[138]  Philippe Flajolet,et al.  Digital Search Trees Revisited , 1986, SIAM J. Comput..

[139]  William M. Waite,et al.  The cost of lexical analysis , 1986, Softw. Pract. Exp..

[140]  Uwe Deppisch,et al.  S-tree: a dynamic balanced signature index for office retrieval , 1986, SIGIR '86.

[141]  Roy Rada,et al.  Machine learning - applications in expert systems and information retrieval , 1986, Ellis Horwood series in artificial intelligence.

[142]  W. Daniel Hillis,et al.  Data parallel algorithms , 1986, CACM.

[143]  Chin-Chen Chang.  Letter-oriented reciprocal hashing scheme , 1986, Inf. Sci..

[144]  B. Pittel.  Paths in a random digital tree: limiting distributions , 1986, Advances in Applied Probability.

[145]  H. D. Cheng,et al.  VLSI architectures for string matching and pattern matching , 1987, Pattern Recognit..

[146]  Witold Litwin,et al.  A New Method for Fast Data Searches with Keys , 1987, IEEE Software.

[147]  Peter Willett,et al.  Use of text signatures for document retrieval in a highly parallel environment , 1987, Parallel Comput..

[148]  Nicholas J. Belkin,et al.  Retrieval techniques , 1987 .

[149]  C. O. Frost.  Subject Searching in an Online Catalog. , 1987 .

[150]  Gaston H. Gonnet,et al.  Mind Your Grammar: a New Approach to Modelling Text , 1987, VLDB.

[151]  Harold S. Stone,et al.  Parallel Querying of Large Databases: A Case Study , 1987, Computer.

[152]  Christos Faloutsos,et al.  Description and performance analysis of signature file methods for office filing , 1987, TOIS.

[153]  Edward A. Fox,et al.  Testing the applicability of intelligent methods for information retrieval , 1987 .

[154]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[155]  Kotagiri Ramamohanarao,et al.  Multikey access methods based on superimposed coding techniques , 1987, TODS.

[156]  Stavros Christodoulakis,et al.  Analysis of retrieval performance for records and objects using optical disk technology , 1987, TODS.

[157]  David B. Lomet,et al.  Partial expansions for file organizations with an index , 1987, TODS.

[158]  Christos Faloutsos.  Signature files: An integrated access method for text and attributes, suitable for optical disk storage , 1988, BIT Comput. Sci. Sect..

[159]  Jason Gait,et al.  The Optical File Cabinet: a random-access file system for write-once optical disks , 1988, Computer.

[160]  W. Bruce Croft,et al.  Implementing ranking strategies using text signatures , 1988, TOIS.

[161]  J. Kamin.  MS-DOS , 1988 .

[162]  Peter Willett,et al.  Improving subject retrieval in online catalogues: S. Walker, R.M. Jones. (British Library Research Paper 24). British Library, London (1987) xi + 193 pp. £10. ISBN 0-7123-3129-8. (Distributed by Longwood Publishing Group, Wolfeboro, NH, USA.) , 1988 .

[163]  Christos Faloutsos,et al.  Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison , 1988, VLDB.

[164]  Roy E. Kimbrell,et al.  Searching for text? Send an N-gram] , 1988 .

[165]  Robert Schaback,et al.  On the Expected Sublinearity of the Boyer-Moore Algorithm , 1988, SIAM J. Comput..

[166]  Valerie Galpin,et al.  Relevance feedback in a public access catalogue for a research library: MUSCAT at the Scott Polar Research Institute Library , 1988 .

[167]  Gerard Salton,et al.  Parallel text search methods , 1988, CACM.

[168]  Maxime Crochemore,et al.  String Matching with Constraints , 1988, MFCS.

[169]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[170]  Carolyn J. Crouch,et al.  A cluster-based approach to thesaurus construction , 1988, SIGIR '88.

[171]  Yaacov Choueka,et al.  Looking for Needles in a Haystack or Locating Interesting Collocational Expressions in Large Textual Databases , 1988, RIAO Conference.

[172]  Edward A. Fox,et al.  Building a Large Thesaurus for Information Retrieval , 1988, ANLP.

[173]  Alfred V. Aho,et al.  The awk programming language , 1988 .

[174]  Stavros Christodoulakis,et al.  Retrieval performance versus disc space utilization on WORM optical discs , 1989, SIGMOD '89.

[175]  Craig Stanfill.  Partitioned posting files: a parallel inverted file structure for information retrieval , 1989, SIGIR '90.

[176]  Ricardo Baeza-Yates,et al.  Efficient text searching , 1989 .

[177]  Ricardo A. Baeza-Yates,et al.  Performance of B+-Trees with Partial Expansions , 1989, IEEE Trans. Knowl. Data Eng..

[178]  M. V. Ramakrishna,et al.  File organization using composite perfect hashing , 1989, ACM Trans. Database Syst..

[179]  Norbert Fuhr,et al.  Models for retrieval with probabilistic indexing , 1989, Inf. Process. Manag..

[180]  Christopher J. Fox,et al.  A stop list for general text , 1989, SIGF.

[181]  Gad M. Landau,et al.  Optimal parallel suffix-prefix matching algorithm and applications , 1989, SPAA '89.

[182]  David L. Waltz,et al.  A parallel indexed algorithm for information retrieval , 1989, SIGIR '89.

[183]  Ricardo A. Baeza-Yates,et al.  Improved string searching , 1989, Softw. Pract. Exp..

[184]  Stavros Christodoulakis,et al.  File Organizations and Access Methods for CLV Optical Disks. , 1989, SIGIR 1989.

[185]  Edward A. Fox,et al.  A more cost effective algorithm for finding perfect hash functions , 1989, CSC '89.

[186]  Gaston H. Gonnet,et al.  Efficient Text Searching of Regular Expressions (Extended Abstract) , 1989, ICALP.

[187]  Jan O. Pedersen,et al.  Optimization for dynamic inverted index maintenance , 1989, SIGIR '90.

[188]  Ricardo A. Baeza-Yates,et al.  String Searching Algorithms Revisited , 1989, WADS.

[189]  Jun-Ichi Aoe.  An Efficient Implementation of Static String Pattern Matching Machines , 1989, IEEE Trans. Software Eng..

[190]  Ulrich Güntzer,et al.  Automatic thesaurus construction by machine learning from retrieval sessions , 1989, Inf. Process. Manag..

[191]  Edward A. Fox,et al.  An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions , 1989 .

[192]  Edward A. Fox,et al.  Implementation of a Perfect Hash Function Scheme , 1989 .

[193]  S. K. M. Wong,et al.  Query formulation in linear retrieval models , 1990, J. Am. Soc. Inf. Sci..

[194]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[195]  Donna Harman,et al.  Retrieving Records from a Gigabyte of Text on a Minicomputer Using Statistical Ranking. , 1990 .

[196]  E. Schmidt,et al.  Lex—a lexical analyzer generator , 1990 .

[197]  Gaston H. Gonnet,et al.  An Analysis of the Karp-Rabin String Matching Algorithm , 1990, Inf. Process. Lett..

[198]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[199]  Padmini Srinivasan.  A comparison of two-poisson, inverse document frequency and discrimination value models of document representation , 1990, Inf. Process. Manag..

[200]  Daniel Sunday,et al.  A very fast substring search algorithm , 1990, CACM.

[201]  Susan T. Dumais,et al.  Enhancing Performance in Latent Semantic Indexing (LSI) Retrieval , 1990 .

[202]  Ricardo Baeza-Yates,et al.  Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version) , 1990, SWAT.

[203]  C. Stanfill.  Information Retrieval Using Parallel Signature Files , 1990, IEEE Data Eng. Bull..

[204]  Chris D. Paice,et al.  Another stemmer , 1990, SIGF.

[205]  G. H. Gonnet,et al.  Handbook of algorithms and data structures: in Pascal and C (2nd ed.) , 1991 .

[206]  Ricardo A. Baeza-Yates,et al.  An Algorithm for String Matching with a Sequence of don't Cares , 1991, Inf. Process. Lett..

[207]  Bjarne Stroustrup,et al.  The C++ programming language (2nd ed.) , 1991 .

[208]  Donna Harman,et al.  How effective is suffixing , 1991 .

[209]  Edward A. Fox,et al.  FAST-INV: A Fast Algorithm for building large inverted files , 1991 .

[210]  Andrew Hume,et al.  Fast string searching , 1991, USENIX Summer.

[211]  Craig Stanfill,et al.  Information retrieval on the connection machine: 1 to 8192 gigabytes , 1991, Inf. Process. Manag..

[212]  Donna K. Harman,et al.  Relevance feedback revisited , 1992, SIGIR '92.

[213]  Gaston H. Gonnet,et al.  A new approach to text searching , 1992, CACM.

[214]  Zheng Lin,et al.  Frame-Sliced Signature Files , 1992, IEEE Trans. Knowl. Data Eng..