<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1904.07467/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1904.07467/feed.xml" rel="self" type="application/rss+xml" /><item><title>c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches — mentioned by gvinciguerra</title><link>https://news.ycombinator.com/item?id=25905133</link><guid isPermaLink="false">urn:hackerpapers:mention:1904.07467:25905133</guid><pubDate>Mon, 25 Jan 2021 16:35:43 GMT</pubDate><description>&lt;p&gt;Hi @Gh0stRAT, you are very welcome! For prefix search on strings, I recommend the classic String B-tree paper (https://dl.acm.org/doi/10.1145/301970.301973). Among recent results, there&amp;#x27;s the c-trie++ paper (https://arxiv.org/pdf/1904.07467.pdf) and the papers mentioned in their Related Work section.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1904.07467/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
