1 code implementation • 16 Apr 2019 • Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters are drawn from an alphabet of size $\sigma$, a keyword dictionary is a data structure built on $K$ that provides locate, prefix search, and update operations on $K$.
2 code implementations • 14 Jun 2019 • Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation.
1 code implementation • 18 Oct 2019 • Shunsuke Kanda, Yasuo Tabei
In this paper, we present a novel space-efficient trie named $b$-bit sketch trie on integer sketches for scalable similarity searches by leveraging the idea behind succinct data structures (i. e., space-efficient data structures while supporting various data operations in the compressed format) and a favorable property of integer sketches as fixed-length strings.
1 code implementation • 21 May 2020 • Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii, Yasuo Tabei
To address this problem, we present the trajectory-indexing succinct trit-array trie (tSTAT), which is a scalable method leveraging LSH for trajectory similarity searches.
1 code implementation • 24 Sep 2020 • Shunsuke Kanda, Yasuo Tabei
However, most similarity search methods are designed for binary sketches and inefficient for integer sketches.
