.png){kind=icon}
返回
Efficient Set Intersection for Inverted Indexing
.png){kind=icon}
PRE
AI
DOI：10.1145/1877766.1877767.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Conjunctive Boolean queries are a key component of modern information retrieval systems, especially when Web-scale repositories are being searched. A conjunctive query q is equivalent to a vertical bar q vertical bar-way intersection over ordered sets of integers, where each set represents the documents containing one of the terms, and each integer in each set is an ordinal document identifier. As is the case with many computing applications, there is tension between the way in which the data is represented, and the ways in which it is to be manipulated. In particular, the sets representing index data for typical document collections are highly compressible, but are processed using random access techniques, meaning that methods for carrying out set intersections must be alert to issues to do with access patterns and data representation. Our purpose in this article is to explore these trade-offs, by investigating intersection techniques that make use of both uncompressed integer representations, as well as compressed arrangements. We also propose a simple hybrid method that provides both compact storage, and also faster intersection computations for conjunctive querying than is possible even with uncompressed representations.
Keyword:
Algorithms
Experimentation
Measurement
Performance
Compact data structures
information retrieval
set intersection
set representation
bitvector
byte-code
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
引用论文
Vasal vessel‐sparing microsurgical single‐armed vasoepididymostomy to epididymal obstructive azoospermia: A retrospective control study.png)
Andrologia
OAAI
AndrologiaIF0
OAAI分享收藏分享收藏Selective determination of catecholamine in the presence of ascorbic acid or uric acid on the membrane of silver nanoparticles/poly l-phenylalanineIonics
IonicsIF0
PREAI
分享收藏
查看更多内容