2026-03-12T22:48:11Z https://hiroshima-cu.repo.nii.ac.jp/oai

oai:hiroshima-cu.repo.nii.ac.jp:00001420 2023-07-25T10:46:19Z 52:239

大規模文字列データベースに対する索引方式の考察 Study on an indexing method for large-scale string databases NGUYEN, Phuong Bac グエン, フーン バック 高橋, 誉文 タカハシ, ヨシフミ 田村, 慶一 タムラ, ケイイチ 北上, 始 キタカミ, ハジメ グエン, フーン バック TAKAHASHI, Yoshifumi TAMURA, Keiichi KITAKAMI, Hajime application/pdf 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若手研究会, 2012年7月14日, 広島市立大学 conference paper IEEE SMC Hiroshima Chapter 2012-07 AM application/pdf 2012 IEEE SMC Hiroshima Chapter Young Researchers' Workshop Proceedings = 2012 IEEE SMC Hiroshima Chapter 若手研究会講演論文集 13 16 https://hiroshima-cu.repo.nii.ac.jp/record/1420/files/SMCHiroshima2012_13.pdf https://hiroshima-cu.repo.nii.ac.jp/records/1420 jpn http://www.smc-hiroshima.info.hiroshima-cu.ac.jp/ http://www.smc-hiroshima.info.hiroshima-cu.ac.jp/ ©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.