This thesis focuses on top-k document retrieval. The study of such query evaluation method is motivated by a large number of application domains. The efficiency of the evaluation process in particularly relevant due to the rapid growth of Big Data. The basic problem has been recognised by researchers and has motivated a lot of work on optimisation techniques. A new algorithm based on a two-level approach is proposed and compared to the state-of-the-art
Let D={T1,T2,…,TD} be a collection of D documents having n characters in total. Given two patterns P...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typica...
Abstract: An optimal index solving top-k document retrieval [Navarro and Nekrich, SODA’12] takes O(m...
Text search engines return a set of k documents ranked by similarity to a query. Typically, document...
This Thesis aims to improve state-of-the-art algorithms for Top-K document retrieval problem. This p...
Let D = {d1, d2, d3,..., dD} be a given set of D (string) docu-ments of total length n. The top-k do...
International audienceThe general problem of answering top-k queries can be modeled using lists of d...
[[abstract]]In the document retrieval problem [9], we are given a collection of documents (strings) ...
When using Information Retrieval Systems (IRS), users often present search queries made of ad-hoc ke...
Abstract:- Text Information Retrieval(TIR) is considered the heart of many applications such as Docu...
Large web search engines are facing formidable performance challenges because they have to process t...
Top-k queries are useful in retrieving top-k records from a given set of records depending on the va...
Given text which is a union of d documents of strings, D = d1, d2,...., dd, the emphasis of this the...
Abstract. Given a collection of strings (called documents), the top-k document retrieval problem is ...
Let D={T1,T2,…,TD} be a collection of D documents having n characters in total. Given two patterns P...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typica...
Abstract: An optimal index solving top-k document retrieval [Navarro and Nekrich, SODA’12] takes O(m...
Text search engines return a set of k documents ranked by similarity to a query. Typically, document...
This Thesis aims to improve state-of-the-art algorithms for Top-K document retrieval problem. This p...
Let D = {d1, d2, d3,..., dD} be a given set of D (string) docu-ments of total length n. The top-k do...
International audienceThe general problem of answering top-k queries can be modeled using lists of d...
[[abstract]]In the document retrieval problem [9], we are given a collection of documents (strings) ...
When using Information Retrieval Systems (IRS), users often present search queries made of ad-hoc ke...
Abstract:- Text Information Retrieval(TIR) is considered the heart of many applications such as Docu...
Large web search engines are facing formidable performance challenges because they have to process t...
Top-k queries are useful in retrieving top-k records from a given set of records depending on the va...
Given text which is a union of d documents of strings, D = d1, d2,...., dd, the emphasis of this the...
Abstract. Given a collection of strings (called documents), the top-k document retrieval problem is ...
Let D={T1,T2,…,TD} be a collection of D documents having n characters in total. Given two patterns P...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typica...