doi: 10.18178/ijfcc.2016.5.6.478
Full-Text Search Using Double-Array CDAWG
Yuma Fujita
1
,
,
,
,
- 1 Department of Information Science and Intelligent Systems, Faculty of Engineering, Tokushima University, 2-1 Minamijosanjima-cho, Tokushima-shi, Tokushima 770-8506, Japan.
- 2 Toshiba Solutions Corporation, 72-34 Horikawa-cho, Saiwai-ku, Kawasaki-shi, Kanagawa, 212-8585, Japan.
Abstract
Double-Array is a method widely used forhandling sets of strings. While the method can conduct fastretrieval, there are not application examples for Full-TextSearch. Compact directed acyclic word graph (CDAWG) is adata structure preserving some features of directed acyclicword graph (DAWG), and requires less space than DAWG.When using CDAWG for Full-Text Search, it can make a graphto conduct fast retrieval not depending on a text size. A methodthat represents DAWG using Double-Array has been proposed.Therefore, we propose a new method using Double-ArrayCDAWG for high speed Full-Text Search. Experimental resultsshow the effectiveness of the proposed method.
Keywords
- CDAWG
- double-array
- full-text search
- genome search
How to 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. https://doi.org/ 10.18178/ijfcc.2016.5.6.478
Copyright & License
Copyright © 2016 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).