大規模文字列データベースに対する索引方式の考察-広島市立大学機関リポジトリ

In order to achieve high-speed searches on a large-scale string database, we implement an indexing system based on DynaCluster algorithm that constructs an index structure, called a suffix tree on disk, and evaluate performance of the system. In experiments conducted in this study, we have created an indexing structure for the database with 223MB of DNA sequences. The experiments resulted in achieving high performance related to query processing time.

掲載雑誌名

2012 IEEE SMC Hiroshima Chapter Young Researchers' Workshop Proceedings = 2012 IEEE SMC Hiroshima Chapter 若手研究会講演論文集

開始ページ

終了ページ

出版年月日

2012-07

出版者

IEEE SMC Hiroshima Chapter

本文言語

日本語

資料タイプ

会議発表論文

著者版フラグ

著者版

権利情報

©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.