Dr. Shunsuke Kanda
Dr. Shunsuke Kanda
Embedded Files
My homepage has been moved to https://kampersanda.github.io
Basic Info
Basic Info
Affiliation
Affiliation
Postdoctoral researcher at the RIKEN Center for Advanced Intelligence Project [HP]
Succinct Information Processing Unit [HP]
Research Interests
Research Interests
Trie and its applications
Compact data structures
String processing
Similarity search
Trajectory data mining
Research Activities
Research Activities
One of organizers of StringBeginners workshop [HP]
Email
Email
shnsk.knd (at) gmail.com
shunsuke.kanda (at) riken.jp
Work Experience
Work Experience
Apr. 2018 – present
Postdoctoral researcher at the RIKEN Center for Advanced Intelligence Project
Apr. 2017 – Mar. 2018
JSPS research fellowship
Education
Education
Apr. 2016 – Mar. 2018 (Early completion)
PhD student in Graduate School of Advanced Technology and Science, Tokushima University
Apr. 2014 – Mar. 2016
Master student in Graduate School of Advanced Technology and Science, Tokushima University
Apr. 2010 – Mar. 2014
Bachelor student in Information Technology and Intelligent Science, Tokushima University
Links
Links
Achievements
Achievements
Refereed Papers (Journals and Proceedings)
Refereed Papers (Journals and Proceedings)
Giulio Ermanno Pibiri and Shunsuke Kanda. Rank/Select Queries over Mutable Bitmaps. Information Systems (INFOSYS), in press [arXiv] [GitHub]
Shunsuke Kanda and Yasuo Tabei. Dynamic Similarity Search on Integer Sketches. In Proceedings of the 20th IEEE International Conference on Data Mining (ICDM), pp 242–251, 2020 (Full-paper acceptance rate: 91/930=10%) [arXiv] [Slide] [GitHub]
Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii and Yasuo Tabei. Succinct Trit-array Trie for Scalable Trajectory Similarity Search. In Proceedings of the 28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp 518–529, 2020 (Full-paper acceptance rate: 33/149=22%) [arXiv] [Slide] [Video] [GitHub]
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita and Masao Fuketa. Dynamic Path-decomposed Tries. ACM Journal of Experimental Algorithmics (JEA), 25(1): 1–28, 2020 [arXiv] [GitHub]
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches. In Proceedings of the 2020 Data Compression Conference (DCC), pp 243–252, 2020 [arXiv] [Slide] [GitLab]
Shunsuke Kanda and Yasuo Tabei. b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches. In Proceedings of the 2019 IEEE International Conference on Big Data (BigData), pp 810–819, 2019 (Full-paper acceptance rate: 106/550=19%) [arXiv] [GitHub]
Shunsuke Kanda, Kazuhiro Morita and Masao Fuketa. Efficient String Dictionary Compression Using String Dictionaries. DBSJ Japanese Journal, Vol. 16-J, Article No. 7, 2018
Shunsuke Kanda, Yuma Fujita, Kazuhiro Morita and Masao Fuketa. Practical Rearrangement Methods for Dynamic Double-array Dictionaries. Software: Practice and Experience (SPE), 48(1): 65–83, 2018 [PDF] [GitHub]
Shunsuke Kanda, Kazuhiro Morita and Masao Fuketa. Practical Implementation of Space-efficient Dynamic Keyword Dictionaries. In Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE), pp 221–233, 2017 (Acceptance rate: 26/71=36%) [PDF] [Slide] [GitHub]
Shunsuke Kanda, Kazuhiro Morita and Masao Fuketa. Practical String Dictionary Compression Using String Dictionary Encoding. In Proceedings of the 3rd International Conference on Big Data Innovations and Applications (Innovate-Data), pp 1–8, 2017 (Acceptance rate: 6/25=24%) [PDF] [Slide]
Shunsuke Kanda, Kazuhiro Morita and Masao Fuketa. Compressed Double-array Tries for String Dictionaries Supporting Fast Lookup. Knowledge and Information Systems (KAIS), 51(3): 1023–1042, 2017 [PDF] [GitHub] [GitHub]
Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe. A Compression Method of Double-array Structures Using Linear Functions. Knowledge and Information Systems (KAIS), 48(1): 55–80, 2016 [PDF]
Masao Fuketa and Shunsuke Kanda. A Construction Method by Divided Double Array Structures. International Journal of Intelligent Systems Technologies and Applications (IJISTA), 14(3/4): 273–283, 2015
Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Akio Tomotoshi and Jun-ichi Aoe. A New Compression Method for Double-array Structures by a Hierarchical Representation. International Journal of Intelligent Systems Technologies and Applications (IJISTA), 14(3/4): 221–236, 2015
arXiv
arXiv
Giulio Ermanno Pibiri and Shunsuke Kanda. Rank/Select Queries over Mutable Bitmaps. Sep 2020 (accepted by INFOSYS in 2021)
Shunsuke Kanda and Yasuo Tabei. Dynamic Similarity Search on Integer Sketches. Sep 2020 (accepted by IEEE ICDM 2020)
Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii and Yasuo Tabei. Succinct Trit-array Trie for Scalable Trajectory Similarity Search. May 2020 (accepted by ACM SIGSPATIAL 2020)
Shunsuke Kanda and Yasuo Tabei. b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches. Oct 2019 (accepted by IEEE BigData 2019)
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita and Masao Fuketa. Dynamic Path-decomposed Tries. Jun 2019 (accepted by ACM JEA in 2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches. Apr 2019 (accepted by DCC 2020)
Talks
Talks
Thesis
Thesis
Grants
Grants
Grant-in-Aid for JSPS Fellows, Apr. 2017 – Mar. 2018 [KAKEN]
Software
Software
String Dictionaries
String Dictionaries
constexpr_doublearray: C++17 implementation of constexpr double-array trie
poplar-trie: C++17 implementation of memory-efficient dynamic string dictionaries based on dynamic path-decomposed tries (JEA 2020)
dictionary_bench: C++17 library for benchmarking dynamic string dictionaries (JEA 2020)
doublearray-go: Go implementation of double-array minimal-prefix trie
fast_succinct_trie: C++14 implementation of fast succinct trie
ddd: C++11 implementation of dynamic double-array dictionaries through some techniques (SPE 2018)
dynpdt: C++14 implementation of dynamic path-decomposed tries (SPIRE 2017)
bonsais: C++11 implementation of Bonsai-trie structures (SPIRE 2017)
xcdat: C++17 implementation of XOR-compressed double-array trie (KAIS 2017)
cda-tries: C++11 library for comparing compressed double-array tries (KAIS 2017)
Similarity Search
Similarity Search
dyft: C++17 implementation of dynamic filter trie (ICDM 2020)
frechet_simsearch: C++17 implementation of data structures for approximate trajectory similarity search under Fréchet distance (SIGSPATIAL 2020)
mih-rs: Rust implementation of multi-index hashing
integer_sketch_search: C++17 implementation of b-bit sketch trie (BigData 2019)
consistent-weighted-sampling: C++17 implementation of top-k search via consistent weighted sampling
hmsearch: C++14 implementation of HmSearch
Succinct Data Structures
Succinct Data Structures
mutable_rank_select: C++17 implementation of rank/select queries on mutable bitmaps (INFOSYS 2021 as a collaborator)
succinctrits: C++17 implementation of succinct rank/select data structures on trits (SIGSPATIAL 2020)
Kernels
Kernels
kdtw: C++11 implementation of the regularized dynamic time warping kernel and its Python binding
Datasets
Datasets
LUBM-URIs: Generator of URI-string dataset via Lehigh University Benchmark (JEA 2020)
Games
Games
xchecker: Browser game of constructing double arrays
Google Sites
Report abuse