Advertisement

Performance analysis of superimposing-coded signature files

  • Sam. Y. Sung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 730)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Carter, L. J., Wegman, M. L.: Universal classes of hash functions. J. Comput. Syst. Sci.18 (1979) 143–154Google Scholar
  2. 2.
    Du, H. C.: On the File Design Problem for Partial Match Retrieval. IEEE Trans. Software Engi. SE-11, No. 2 (Feb. 1985) 213–222Google Scholar
  3. 3.
    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–288Google Scholar
  4. 4.
    Faloutsos, C., Christodoulakis, S.: Optimal Signature Extraction and Information Loss. ACM Trans. Database Syst.12, No. 3 (Sept. 1987) 395–428Google Scholar
  5. 5.
    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–257Google Scholar
  6. 6.
    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–359Google Scholar
  7. 7.
    Lee, D. L., Leng, C. W.: Partitioned Signature Files: Design Issues and Performance Evaluation. ACM Trans. Inf. Syst.7, No. 2 (Apr. 1989) 158–180Google Scholar
  8. 8.
    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–397Google Scholar
  9. 9.
    Leng, C. W., Lee, D. L.: Optimal Weight Assignment for Signature Generation. ACM Trans. Database Sys.17, No. 2 (June 1992) 346–373Google Scholar
  10. 10.
    Mullin, J. K.: A Second Look at Bloom Filters. Commun. ACM. 26, No. 8 (Aug. 1983) 57–571Google Scholar
  11. 11.
    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–88Google Scholar
  12. 12.
    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–696Google Scholar
  13. 13.
    Stanfill, C., Kahle, B.: Parallel free-text search on the connection machine system. Commun. ACM 29, No. 12 (Dec. 1986) 1229–1239Google Scholar
  14. 14.
    Stiassny S.: Mathematical analysis of various superimposed coding methods. Am. Dic. 11, No. 2 (Feb. 1960) 155–169Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Sam. Y. Sung
    • 1
  1. 1.Department of Information Systems and Computer ScienceNational University of SingaporeSingapore

Personalised recommendations