大規模文字列データベースに対する索引方式の考察-Hiroshima City University Institutional Repository

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.

Journal Title

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

Spage

Epage

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

http://www.smc-hiroshima.info.hiroshima-cu.ac.jp/

Note

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

Old URI

http://harp.lib.hiroshima-u.ac.jp/handle/harp/10441

Set

hiroshima-cu