Now showing items 1-5 of 5
An Effective Approach to Temporally Anchored Information Retrieval
We consider in this paper the information retrieval problem over a collection of time-evolving documents such that the search has to be carried out based on a query text and a temporal specification. A solution to this ...
Optimization of Linked List Prefix Computations on Multithreaded GPUs Using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures involve in general highly irregular fine ...
Effective Strategies for Temporally Anchored Information Retrieval
A number of emerging large scale applications such as web archiving and time-stamped web objects generated through information feeds involve time-evolving objects that can be most effectively explored through search ...
Constructing Inverted Files on a Cluster of Multicore Processors Near Peak I/O Throughput
We develop a new strategy for processing a collection of documents on a cluster of multicore processors to build the inverted files at almost the peak I/O throughput of the underlying system. Our algorithm is based on a ...
Constructing Inverted Files: To MapReduce or Not Revisited
Current high-throughput algorithms for constructing inverted files all follow the MapReduce framework, which presents a high-level programming model that hides the complexities of parallel programming. In this paper, ...