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.

https://hornad.fei.tuke.sk/~genci/Vyucba/OOBDS/Archiv/Podklady/TExtoveIS&IR/Information%20Retrieval%20Data%20Structures%20&%20Algorithms.PDF

Information Retrieval: Data Structures and Algorithms

The signature-file access method for text retrieval is studied. According to this method, documents are stored sequentially in the \"text file.\" Abstractions (\"signatures\") of the documents are stored in the \"signature file.\" The latter serves as a filter on retrieval: It helps in discarding a large number of nonqualifying documents. In this paper two methods for creating signatures are studied analytically, one based on word signatures and the other on superimposed coding. Closed-form formulas are derived for the false-drop probability of the two methods, factors tha t affect it are studied, and performance comparisons of the two methods based on these formulas are provided.

Signature files: an access method for documents and its analytical performance evaluation

Two well-known indexing methods are inverted files and signature files. We have undertaken a detailed comparison of these two approaches in the context of text indexing, paying particular attention to query evaluation speed and space requirements. We have examined their relative performance using both experimentation and a refined approach to modeling of signature files, and demonstrate that inverted files are distinctly superior to signature files. Not only can inverted files be used to evaluate typical queries in less time than can signature files, but inverted files require less space and provide greater functionality. Our results also show that a synthetic text database can provide a realistic indication of the behavior of an actual text database. The tools used to generate the synthetic database have been made publicly available

/pdf/inverted-files-versus-signature-files-for-text-indexing-3bn9z11rp2.pdf

Inverted files versus signature files for text indexing

This paper compares text retrieval methods intended for office systems. The operational requirements of the office environment are discussed, and retrieval methods from database systems and from information retrieval systems are examined. We classify these methods and examine the most interesting representatives of each class. Attempts to speed up retrieval with special purpose hardware are also presented, and issues such as approximate string matching and compression are discussed. A qualitative comparison of the examined methods is presented. The signature file method is discussed in more detail.

Access methods for text

Preface. 1. Introduction. Part I: Database Indexing Methods. 2. Introduction to Relational DBMS. 3. Primary Key Access Methods. 4. Secondary Key Access Methods. 5. Spatial Access Methods (SAMS) 6. Access Methods for Text. Part II: Indexing Signals. 7. Problem - Intuition. 8. 1-D Time Sequences. 9. 2-D Color Images. 10. Sub-Pattern Matching. 11. Fastmap. 12. Conclusions. III: Mathematical Toolbox. A. Preliminaries. B. Fourier Analysis. C. Wavelets. D. K-L and SVD. References. Index.

Searching Multimedia Databases by Content

/pdf/special-purpose-processors-for-text-retrieval-2mrexl0jj5.pdf

Roger L. Haskin

Papers

Special-Purpose Processors for Text Retrieval.