マルチコアCPU上におけるサフィックス木を用いた文字列検索の並列処理

URI http://harp.lib.hiroshima-u.ac.jp/hiroshima-cu/metadata/10447
File
Title
マルチコアCPU上におけるサフィックス木を用いた文字列検索の並列処理
Title Alternative
Parallel Processing of String Search using Suffix Tree on Multi-core CPU
Author
氏名 綿貫 陽介
ヨミ ワタヌキ ヨウスケ
別名 WATANUKI Yosuke
氏名 田村 慶一
ヨミ タムラ ケイイチ
別名 TAMURA Keiichi
氏名 北上 始
ヨミ キタカミ ハジメ
別名 KITAKAMI Hajime
氏名 NGUYEN Phuong Bac
ヨミ グエン フーン バック
別名 グエン フーン バック
氏名 高橋 誉文
ヨミ タカハシ ヨシフミ
別名 TAKAHASHI Yoshifumi
Abstract

A suffix tree is the index structure of n-ary tree structure which represented as a tree structure of the suffix string. It is widely used in including bioinformatics, to search engines and data clustering, because it is an index structure that can process string fast and efficiently in string databases. In recent years, an efficient construction of suffix tree and speed up the search process a string using suffix tree has become an import ant issue, because the number and size of the data string that is stored in the string databases has been large-scale. This paper focuses on the processing speed search a string using suffix tree, we propose a parallel processing of the search in the suffix tree based on multi-core CPU.

Journal Title
2012 IEEE SMC Hiroshima Chapter Young Researchers' Workshop Proceedings = 2012 IEEE SMC Hiroshima Chapter 若手研究会講演論文集
Spage
35
Epage
38
Published Date
2012-07
Publisher
IEEE SMC Hiroshima Chapter
Language
jpn
NIIType
Conference Paper
Text Version
著者版
Rights
©Copyright by IEEE SMC Hiroshima Chapter. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting
republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Relation URL
Note

2012 IEEE SMC Hiroshima Chapter若手研究会, 2012年7月14日, 広島市立大学

Old URI
Set
hiroshima-cu