段階的一般化法の高速化に関する考察-Hiroshima City University Institutional Repository

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.

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/10439

Set

hiroshima-cu