Moffat, A.; Bell, T.A.H.: In situ generation of compressed inverted files (1995)
0.01
0.0080434345 = product of:
0.024130303 = sum of:
0.024130303 = product of:
0.048260607 = sum of:
0.048260607 = weight(_text_:indexing in 2648) [ClassicSimilarity], result of:
0.048260607 = score(doc=2648,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.2537542 = fieldWeight in 2648, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.046875 = fieldNorm(doc=2648)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- An inverted index stores, for each term that appears in a collection of documents, a list of document numbers containing that term. Such an index is indispensible when Boolean or informal ranked queries are to be answered. Construction of the index ist, however, a non trivial task. Simple methods using in.memory data structures cannot be used for large collections because they require too much random access storage, and traditional disc based methods require large amounts of temporary file space. Describes a new indexing algorithm designed to create large compressed inverted indexes in situ. It makes use of simple compression codes for the positive integers and an in place external multi way merge sort. The new techniques has been used to invert a 2-gigabyte text collection in under 4 hours, using less than 40 megabytes of temporary disc space, and less than 20 megabytes of main memory
