Abstract—Double-Array is a method widely used for
handling sets of strings. While the method can conduct fast
retrieval, there are not application examples for Full-Text
Search. Compact directed acyclic word graph (CDAWG) is a
data structure preserving some features of directed acyclic
word graph (DAWG), and requires less space than DAWG.
When using CDAWG for Full-Text Search, it can make a graph
to conduct fast retrieval not depending on a text size. A method
that represents DAWG using Double-Array has been proposed.
Therefore, we propose a new method using Double-Array
CDAWG for high speed Full-Text Search. Experimental results
show the effectiveness of the proposed method.
Index Terms—CDAWG, double-array, full-text search,
genome search.
Yuma Fujita, Shunsuke Kanda, Kazuhiro Morita, and Masao Fuketa are
with the Department of Information Science and Intelligent Systems, Faculty
of Engineering, Tokushima University, 2-1 Minamijosanjima-cho,
Tokushima-shi, Tokushima 770-8506, Japan.
Yoshiaki Ichihashi was with the Department of Information Science and
Intelligent Systems, Faculty of Engineering, Tokushima University. He is
now with Toshiba Solutions Corporation, 72-34 Horikawa-cho, Saiwai-ku,
Kawasaki-shi, Kanagawa, 212-8585, Japan (e-mail: yuma@jo-studio.com).
[PDF]
Cite: Yuma Fujita, Yoshiaki Ichihashi, Shunsuke Kanda, Kazuhiro Morita, and Masao Fuketa, "Full-Text Search Using Double-Array CDAWG," International Journal of Future Computer and Communication vol. 5, no. 6, pp. 237-240, 2016.
