.png){kind=icon}
返回
Burst tries: A fast, efficient data structure for string keys
.png){kind=icon}
PRE
AI
DOI：10.1145/506309.506312.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each distinct word in the text, containing the word itself and information such as counters. We propose a new data structure, the burst trie, that has significant advantages over existing options for such applications: it uses about the same memory as a binary search tree; it is as fast as a trie; and, while not as fast as a hash table, a burst trie maintains the strings in sorted or near-sorted order. In this paper we describe burst tries and explore the parameters that govern their performance. We experimentally determine good choices of parameters, and compare burst tries to other structures used for the same task, with a variety of data sets. These experiments show that the burst trie is particularly effective for the skewed frequency distributions common in text collections, and dramatically outperforms all other data structures for the task of managing strings while maintaining sort order.
Keyword:
algorithms
binary trees
splay trees
string data structures
text databases
tries
vocabulary accumulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
暂无机构信息
引用论文
.png){kind=icon}
TRAVEL AS A MOTIVATING FACTOR IN DECISION TO UNDERGO KIDNEY TRANSPLANT IN AN UNDERSERVED ETHNIC POPULATION旅行作为服务不足的少数民族人群中接受肾脏移植决定的一个激励因素
PREAI
分享收藏
查看更多内容