.png){kind=icon}
返回
Logic and computational complexity for Boolean information retrieval
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2006.193.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the complexity of query satisfiability and entailment for the Boolean Information Retrieval models WP and AWP using techniques from propositional logic and computational complexity. WP and AWP can be used to represent and query textual information under the Boolean model using the concept of attribute with values of type text, the concept of word, and word proximity constraints. Variations of WP and AWP are in use in most deployed digital libraries using the Boolean model, text extenders for relational database systems (e.g., Oracle 10g), search engines, and P2P systems for information retrieval and filtering.
Keyword:
Boolean information retrieval
computational complexity
data models
query languages
satisfiability
entailment
proximity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Density dependence and the augmentative release of egg parasitoids against graminaceous stalk borers
PREAI
分享收藏
查看更多内容