Burst tries

Author:

Heinz Steffen1,Zobel Justin1,Williams Hugh E.1

Affiliation:

1. RMIT University, Melbourne, Victoria, Australia

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference56 articles.

1. Aho A. V. Hopcroft J. E. and Ullman J. D. 1983. Data Structures and Algorithms. Addison-Wesley Reading Massachusetts. Aho A. V. Hopcroft J. E. and Ullman J. D. 1983. Data Structures and Algorithms. Addison-Wesley Reading Massachusetts.

2. Aho A. V. Sethi R. and Ullman J. D. 1986. Compilers Principle Techniques and Tools. Addison-Wesley Reading Massachusetts. Aho A. V. Sethi R. and Ullman J. D. 1986. Compilers Principle Techniques and Tools. Addison-Wesley Reading Massachusetts.

3. Algorithms for trie compaction

4. Improved behaviour of tries by adaptive branching

5. An efficient implementation of trie structures

Cited by 98 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3