×
In this paper we present a parallel document ranking algorithm suitable for use on databases of 1-1000 GB, resident on primary or secondary storage.
In this paper we present a parallel document ranking algorithm suitable for use on databases of l-1000. GB, resident on primary or secondary storage. The.
People also ask
A parallel indexed algorithm for information retrieval. Overview of attention for article published in ACM SIGIR Forum, May 1989. Altmetric Badge. About this ...
Abstract: In this paper we present a parallel document ranking algorithm suitable for use on databases of 1-1000 GB, resident on primary or secondary ...
Abstract: The increasing data size in Chinese information-based applications renders conventional information retrieval (IR) systems unsuitable.
A parallel indexed algorithm for information retrieval. Overview of attention for article published in ACM SIGIR Forum, May 1989. Altmetric Badge. About this ...
This paper describes algorithms and data structures for applying a parallel computer to information retrieval. Previous work has described an implementation ...
In this paper we present a parallel document ranking algorithm suitable for use on databases of 1-1000 GB, resident on primary or secondary storage.
In this paper we present a parallel document ranking algorithm suitable for use on databases of 1-1000 GB, resident on primary or secondary storage.
This paper presents a parallel PIR (ParPIR) with index anonymity for untrusted databases, which uses the batch encoding to compress request size.