Abstract
Signature file has been shown as a very good filtering mechanism to reduce the amount of information that needs to be retrieved for a query. The main concern in the signature construction is to find the optimal signatrue weight to minimize the false drop probability. In this paper, a new formula of computing the false drop probability is presented. Different from previous works, our formula is based on the bit probability and which is independent of the signature size. Our formula is easier to analyze so that optimal solutions can be more adequately derived. Performance results show that our solutions are better than the solutions obtained before. Some interesting properties of the optimal solutions are also discussed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Carter, L. J., Wegman, M. L.: Universal classes of hash functions. J. Comput. Syst. Sci.18 (1979) 143–154
Du, H. C.: On the File Design Problem for Partial Match Retrieval. IEEE Trans. Software Engi. SE-11, No. 2 (Feb. 1985) 213–222
Faloutsos, C., Christodoulakis, S.: Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation. ACM Trans. Office Inf. Syst. 2, No. 4 (Oct. 1984) 267–288
Faloutsos, C., Christodoulakis, S.: Optimal Signature Extraction and Information Loss. ACM Trans. Database Syst.12, No. 3 (Sept. 1987) 395–428
Faloutsos, C., Christodoulakis, S.: Description and Performance Analysis of Signature File Methods for Office Filing. ACM Trans. Office Inf. Syst. 5, No. 3 (July, 1987) 237–257
Lee, D. L.: A word-parallel, bit-serial signature processor for superimposed coding. Proc. of 2nd International Conference on Data Engineering, Los Angels. (Feb. 1986) 352–359
Lee, D. L., Leng, C. W.: Partitioned Signature Files: Design Issues and Performance Evaluation. ACM Trans. Inf. Syst.7, No. 2 (Apr. 1989) 158–180
Lee, D. L, Leng, C. W.: A Partitioned Signature File Structure for Multiattribute and Text Retrieval. Proceedings of the 6th International Conference on Data Engineering (Los Angels, 1990) 389–397
Leng, C. W., Lee, D. L.: Optimal Weight Assignment for Signature Generation. ACM Trans. Database Sys.17, No. 2 (June 1992) 346–373
Mullin, J. K.: A Second Look at Bloom Filters. Commun. ACM. 26, No. 8 (Aug. 1983) 57–571
Ramakrishna, M. V., Ramos, E. A.: Optimal Distribution of Signatures in Signature Hashing. IEEE trans. Knowl. and Data Engi.4, No. 1 (Feb. 1992) 83–88
Sacks-Davis, R., Kent, A., Ramamohanarao, K.: Multikey Access Methods Based on Superimposed Coding Techniques. ACM Trans. Database Syst. 12, No. 4 (Dec 1987) 655–696
Stanfill, C., Kahle, B.: Parallel free-text search on the connection machine system. Commun. ACM 29, No. 12 (Dec. 1986) 1229–1239
Stiassny S.: Mathematical analysis of various superimposed coding methods. Am. Dic. 11, No. 2 (Feb. 1960) 155–169
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sung, S.Y. (1993). Performance analysis of superimposing-coded signature files. In: Lomet, D.B. (eds) Foundations of Data Organization and Algorithms. FODO 1993. Lecture Notes in Computer Science, vol 730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57301-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-57301-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57301-2
Online ISBN: 978-3-540-48047-1
eBook Packages: Springer Book Archive