Abstract. Document retrieval aims at finding the most important doc-uments where a pattern appears in a collection of strings. Traditional pattern-matching techniques yield brute-force document retrieval solu-tions, which has motivated the research on tailored indexes that offer near-optimal performance. However, an experimental study establish-ing which alternatives are actually better than brute force, and which perform best depending on the collection characteristics, has not been carried out. In this paper we address this shortcoming by exploring the relationship between the nature of the underlying collection and the per-formance of current methods. Via extensive experiments we show that established solutions are often beaten in practi...
[[abstract]]In the document retrieval problem [9], we are given a collection of documents (strings) ...
Document retrieval is one of the best established information retrieval activities since the sixties...
International audienceWe study a new variant of the pattern matching problem called cross-document p...
Most of the fastest-growing string collections today are repetitive, that is, most of the constituen...
Most of the fastest-growing string collections today are repetitive, that is, most of the constituen...
We consider document listing on string collections, that is, finding in which strings a given patter...
We consider document listing on string collections, that is, finding in which strings a given patter...
Given a collection of strings, document listing refers to the problem of finding all the strings (or...
This work introduces a companion reproducible paper with the aim of allowing the exact replication o...
Given a collection of strings, document listing refers to the problem of finding all the strings (or...
In this thesis, we propose to study methods of leveraging collection structure in document ranking a...
Abstract. We address the problem of counting the number of strings in a collection where a given pat...
A Web archive usually contains multiple versions of documents crawled from the Web at different poin...
International audienceWe study a new variant of the string matching problem called cross-document st...
Traditional research in information retrieval (IR) focuses on retrieving documents. This paper intro...
[[abstract]]In the document retrieval problem [9], we are given a collection of documents (strings) ...
Document retrieval is one of the best established information retrieval activities since the sixties...
International audienceWe study a new variant of the pattern matching problem called cross-document p...
Most of the fastest-growing string collections today are repetitive, that is, most of the constituen...
Most of the fastest-growing string collections today are repetitive, that is, most of the constituen...
We consider document listing on string collections, that is, finding in which strings a given patter...
We consider document listing on string collections, that is, finding in which strings a given patter...
Given a collection of strings, document listing refers to the problem of finding all the strings (or...
This work introduces a companion reproducible paper with the aim of allowing the exact replication o...
Given a collection of strings, document listing refers to the problem of finding all the strings (or...
In this thesis, we propose to study methods of leveraging collection structure in document ranking a...
Abstract. We address the problem of counting the number of strings in a collection where a given pat...
A Web archive usually contains multiple versions of documents crawled from the Web at different poin...
International audienceWe study a new variant of the string matching problem called cross-document st...
Traditional research in information retrieval (IR) focuses on retrieving documents. This paper intro...
[[abstract]]In the document retrieval problem [9], we are given a collection of documents (strings) ...
Document retrieval is one of the best established information retrieval activities since the sixties...
International audienceWe study a new variant of the pattern matching problem called cross-document p...