.png){kind=icon}
返回
Stochastic Query Covering for Fast Approximate Document Retrieval
.png){kind=icon}
OA
AI
DOI：10.1145/2699671.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We design algorithms that, given a collection of documents and a distribution over user queries, return a small subset of the document collection in such a way that we can efficiently provide high-quality answers to user queries using only the selected subset. This approach has applications when space is a constraint or when the query-processing time increases significantly with the size of the collection. We study our algorithms through the lens of stochastic analysis and prove that even though they use only a small fraction of the entire collection, they can provide answers to most user queries, achieving a performance close to the optimal. To complement our theoretical findings, we experimentally show the versatility of our approach by considering two important cases in the context of Web search. In the first case, we favor the retrieval of documents that are relevant to the query, whereas in the second case we aim for document diversification. Both the theoretical and the experimental analysis provide strong evidence of the potential value of query covering in diverse application scenarios.
Keyword:
Algorithms
Measurement
Algorithms
query covering
stochastic analysis
caching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
引用论文
.png){kind=icon}
EFFICACY OF BREMELANOTIDE (BMT) TO STABILIZE PODOCYTE FUNCTION AND REDUCE PROTEINURIA IN ADULTS WITH TYPE II DIABETIC NEPHROPATHY: RESULTS FROM A PHASE IIB, OPEN- LABEL STUDY玻璃酸钠(BMT)稳定足细胞功能并减少成人2型糖尿病肾病患者蛋白尿的疗效：一项IIb期、开放标签研究的结果
PREAI
分享收藏
分享收藏
查看更多内容