Search Results for author: Shunsuke Kanda

Found 5 papers, 5 papers with code

Dynamic Similarity Search on Integer Sketches

1 code implementation24 Sep 2020 Shunsuke Kanda, Yasuo Tabei

However, most similarity search methods are designed for binary sketches and inefficient for integer sketches.

Succinct Trit-array Trie for Scalable Trajectory Similarity Search

1 code implementation21 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.

$b$-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches

1 code implementation18 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.

Dynamic Path-Decomposed Tries

2 code implementations14 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.

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

1 code implementation16 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$.

Cannot find the paper you are looking for? You can Submit a new open access paper.