Modular Concept for Iteratively Merging Compressed Occurrence Strings Belonging to Search Words And/Or Their Combinations in Information Retrieval and Data Base Systems
Original Publication Date: 1984-Nov-01
Included in the Prior Art Database: 2005-Feb-05
Merging (by Boolean operations, such as AND, XOR) is applied to occurrence strings that have been compressed in at least one iteration step. For each such step, only those partial strings are decompressed, for which the respective position information merge process has yielded a non-zero merge result. A multitude of identical decompression chips, operating in parallel in an iteration step, are used for the iterative decompression operations. For a particular first search word, say, "IBM", there is a first (occurrence) string of uncompressed data UD S1. A binary one denotes a reference source in which the search word "IBM" is contained. For addressing the reference source, the position (bit) number of the binary one is used. In the example shown in Fig. 1, the position numbers concerned are 9, 11 and 15.