.png){kind=icon}
返回
Engineering Basic Algorithms of an In-Memory Text Search Engine
.png){kind=icon}
PRE
AI
DOI：10.1145/1877766.1877768.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Inverted index data structures are the key to fast text search engines. We first investigate one of the predominant operation on inverted indexes, which asks for intersecting two sorted lists of document IDs of different lengths. We explore compression and performance of different inverted list data structures. In particular, we present Lookup, a new data structure that allows intersection in expected time linear in the smaller list. Based on this result, we present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system uses a carefully choreographed combination of classical data compression techniques and inverted-index-based search data structures. Our experiments show that inverted indexes are preferable over purely suffix-array-based techniques for in-memory (English) text search engines. A similar system is now running in practice in each core of the distributed data base engine TREX of SAP.
Keyword:
Algorithms
Performance
Inverted index
in-memory search engine
randomization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
引用论文
.png){kind=icon}
TRIAD OF RENAL ARTERY STENOSIS, POLYCTHEMIA VERA, POSTERIOR REVERSIBLE ENCEPHALOPATHY SYNDROME肾动脉狭窄、真性红细胞增多症和可逆性后部白质脑病综合征三联征
PREAI
分享收藏
查看更多内容