5 citations · 7 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019
-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping i…
cs.DS2019
Dynamic Path-Decomposed Tries
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2
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 impl…