Dynamic Path-decomposed Tries

Author:

Kanda Shunsuke1ORCID,Köppl Dominik2,Tabei Yasuo1,Morita Kazuhiro3,Fuketa Masao3

Affiliation:

1. RIKEN Center for Advanced Intelligence Project, Chuo-ku, Tokyo, Japan

2. Kyushu University and Japan Society for Promotion of Science

3. Tokushima University, Minamijyousanjima-cho, Tokushima, Japan

Abstract

A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation. When limited to static applications, there are a number of highly compressed keyword dictionaries based on the advancements of practical succinct data structures. However, as most succinct data structures are only efficient in the static case, it is still difficult to implement a keyword dictionary that is space efficient and dynamic . In this article, we propose such a keyword dictionary. Our main idea is to embrace the path decomposition technique, which was proposed for constructing cache-friendly tries. To store the path-decomposed trie in small memory, we design data structures based on recent compact hash trie representations. Experiments on real-world datasets reveal that our dynamic keyword dictionary needs up to 68% less space than the existing smallest ones, while achieving a relevant space-time tradeoff.

Funder

JSPS KAKENHI

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

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

1. CoCo-trie: Data-aware compression and indexing of strings;Information Systems;2024-02

2. Applying burst-tries for error-tolerant prefix search;Information Retrieval Journal;2022-10-18

3. Compressed String Dictionaries via Data-Aware Subtrie Compaction;String Processing and Information Retrieval;2022

4. Engineering Practical Lempel-Ziv Tries;ACM Journal of Experimental Algorithmics;2021-12-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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