段階的一般化法の高速化に関する考察-広島市立大学機関リポジトリ

An ambiguous query processing returns a large number of similar subsequences, called a mismatch cluster, to the user. It is difficult for the user to discover the characteristics from a mismatch cluster. The step-wise generalization method has proposed for extracting the minimum generalization set that expresses the mismatch cluster. In this paper, we discuss speedup for step-wise generalization method by using cache-conscious data structures and reducing the amount of data transfers between main memory and caches.

掲載雑誌名

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.