动态路径分解Tries
Dynamic Path-Decomposed Tries
摘要：
关键字字典是一个关联数组，其键是字符串。最近的应用程序在主存储器中处理大量的关键字字典，需要一个空间效率的实现。当局限于静态应用程序时，有许多基于实用简洁数据结构进步的高度压缩的关键字字典。然而，由于大多数简洁的数据结构仅在静态情况下有效，因此仍然难以实现空间有效且动态的关键字字典。在这篇文章中，我们提出了这样一个关键字字典。我们的主要思想是拥抱路径分解技术，这是为了构建缓存友好的尝试。为了将路径分解后的trie树存储在较小的内存中，我们设计了基于最近的紧凑哈希trie树表示的数据结构。在真实世界数据集上的实验表明，我们的动态关键字字典需要的空间比现有的最小的少68%，同时实现了相关的时空权衡。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
