[ספר][B] An introduction to information retrieval
CD Manning - 2009 - edl.emi.gov.et
As recently as the 1990s, studies showed that most people preferred getting information
from other people rather than from information retrieval systems. Of course, in that time …
from other people rather than from information retrieval systems. Of course, in that time …
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents,
making query processing a major performance bottleneck. An important class of optimization …
making query processing a major performance bottleneck. An important class of optimization …
Quasi-succinct indices
Compressed inverted indices in use today are based on the idea of gap compression:
documents pointers are stored in increasing order, and the gaps between successive …
documents pointers are stored in increasing order, and the gaps between successive …
Scalability challenges in web search engines
Continuous growth of the Web and user bases forces web search engine companies to
make costly investments on very large compute infrastructures. The scalability of these …
make costly investments on very large compute infrastructures. The scalability of these …
Examining the additivity of top-k query processing innovations
Research activity spanning more than five decades has led to index organizations,
compression schemes, and traversal algorithms that allow extremely rapid response to …
compression schemes, and traversal algorithms that allow extremely rapid response to …
Compressing inverted indexes with recursive graph bisection: A reproducibility study
Document reordering is an important but often overlooked preprocessing stage in index
construction. Reordering document identifiers in graphs and inverted indexes has been …
construction. Reordering document identifiers in graphs and inverted indexes has been …
Scalable techniques for document identifier assignment in inverted indexes
Web search engines depend on the full-text inverted index data structure. Because the
query processing performance is so dependent on the size of the inverted index, a plethora …
query processing performance is so dependent on the size of the inverted index, a plethora …
Faster index reordering with bipartite graph partitioning
We revisit the Bipartite Graph Partitioning approach to document reordering (Dhulipala et al.,
KDD 2016), and consider a range of algorithmic and heuristic refinements that lead to faster …
KDD 2016), and consider a range of algorithmic and heuristic refinements that lead to faster …
Tradeoff options for bipartite graph partitioning
Web connectivity graphs and similar linked data such as inverted indexes are important
components of the information access systems provided by social media and web search …
components of the information access systems provided by social media and web search …
Compact full-text indexing of versioned document collections
We study the problem of creating highly compressed full-text index structures for versioned
document collections, that is, collections that contain multiple versions of each document …
document collections, that is, collections that contain multiple versions of each document …