| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 97 === Search is a traditional problem in computer science. There are a lot of applications for search problem. There are also many variants of search problem. One variant is called fuzzy search problem. In fuzzy search, it supports fault tolerance. This capability has many applications, e.g., network, bibliographic search, computational biology, and so on. Most fuzzy searches concentrate on the number of mismatches. In this thesis, we propose the concept of proportional fuzzy search. In the search the fault tolerance is a proportional value with respect to the size of query set. We propose a bit-mapping method for this proportional fuzzy search problem. Comparing with a straightforward method, our experiment shows that the proposed method is promoted.
|
|---|
