Das, A.; Jain, A.: Indexing the World Wide Web : the journey so far (2012)
0.03
0.033518154 = product of:
0.117313534 = sum of:
0.054539118 = weight(_text_:wide in 95) [ClassicSimilarity], result of:
0.054539118 = score(doc=95,freq=4.0), product of:
0.1312982 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.029633347 = queryNorm
0.4153836 = fieldWeight in 95, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.046875 = fieldNorm(doc=95)
0.036238287 = weight(_text_:web in 95) [ClassicSimilarity], result of:
0.036238287 = score(doc=95,freq=6.0), product of:
0.09670874 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.029633347 = queryNorm
0.37471575 = fieldWeight in 95, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=95)
0.00856136 = weight(_text_:information in 95) [ClassicSimilarity], result of:
0.00856136 = score(doc=95,freq=4.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.16457605 = fieldWeight in 95, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=95)
0.01797477 = weight(_text_:retrieval in 95) [ClassicSimilarity], result of:
0.01797477 = score(doc=95,freq=2.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = queryNorm
0.20052543 = fieldWeight in 95, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.046875 = fieldNorm(doc=95)
0.2857143 = coord(4/14)
- Abstract
- In this chapter, the authors describe the key indexing components of today's web search engines. As the World Wide Web has grown, the systems and methods for indexing have changed significantly. The authors present the data structures used, the features extracted, the infrastructure needed, and the options available for designing a brand new search engine. Techniques are highlighted that improve relevance of results, discuss trade-offs to best utilize machine resources, and cover distributed processing concepts in this context. In particular, the authors delve into the topics of indexing phrases instead of terms, storage in memory vs. on disk, and data partitioning. Some thoughts on information organization for the newly emerging data-forms conclude the chapter.
- Source
- Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
