In this thesis, we propose a multi-term query processing scheme. It allows us to solve the three problems, duplicate access of bit-slices, access path selection and unsuccessful block match which can occur in two-path two-level signature file methods (TPSMs). The proposed scheme is based upon abstract bit information which describes inclusion between accessing bit-slices and accessed bit-slices. With the bit information, we gain efficient access of bit-slices and resolve path selection problem. By simulation, we found that unsuccessful block match is negligible in TPSMs.
We compare the proposed scheme with Chang's and Sacks-Davis' in terms of retrieval time and storage overhead. According to the simulation results, the proposed scheme outperforms other schemes with the range of 12 to 83 percent.
