01845naa a2200229 a 450000100080000000500110000800800410001902400270006010000150008724500800010226000090018252011700019165300190136165300180138065300250139865300280142365300240145165300190147570000150149470000140150977300920152310068312019-04-01       1995    bl uuuu     u00u1 u    #d7 a10.1109/69.3902482DOI1 aLEE, D. L.  aEfficient signature file methods for text retrieval.h[electronic resource]  c1995  aSignature files have been studied extensively, as an access method for textual databases. Many approaches have been proposed for searching signatures files efficiently. However, different methods make different assumptions and use different performance measures, making it difficult to compare their performance. In this paper, we study three basic methods proposed in the literature, namely, the indexed descriptor file, the two-level superimposed coding scheme, and the partitioned signature file approach. The contribution of this paper is two-fold. First, we present a uniform analytical performance model so that the methods can be compared fairly and consistently. The analysis shows that the two-level superimposed coding scheme, if stored in a transposed file, has the best performance. Second, we extend the two-level superimposed coding method into a multilevel superimposed coding method, we obtain the optimal number of levels for the multilevel method and show that for databases with reasonable size the optimal value is much larger than 2, which is assumed in the two-level method. The accuracy of the analytical formula is demonstrated by simulation  aAccess methods  aCodificação  aPerformance analysis  aRecuperação de textos  aSuperimposed coding  aText retrieval1 aKIM, Y. M.1 aPATEL, G.  tIEEE Transactions on Knowledge and Data Engineeringgv. 7, n. 3, p. 423-435, June 1995.