Optimal Signature Extraction and Information Loss

ACM Transactions on Database Systems (TODS)

Volumn 12, Issue 3, 1987, Pages 395-428

  Faloutsos, Christos ^a   Christodoulakis, Stavros ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Hashing; information theory; signature files; superimposed coding

Indexed keywords

DATABASE SYSTEMS;

INFORMATION LOSS; OPTIMAL SIGNATURE EXTRACTION; SIGNATURE FILES;

DATA PROCESSING;

EID: 0023417725     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/27629.214285     Document Type: Article

References (31)

1. Aho, A. V., and Ullman, J. D. Optimal partial-match retrieval when fields are independently specified. ACM Trans. Database Syst. 4, 2 (June 1979), 168–179.
2. Carter, L. J., and Wegman, M. L. Universal classes of hash functions. J. Comput. Syst. Sci. 18 (1979), 143–154.
3. Chang, C. C. The study of an ordered minimal perfect hashing scheme. Commun. ACM 27, 4 (Apr. 1984), 384–387.
4. Christodoulakis, S., and Faloutsos, C. Design considerations for a message file server. IEEE Trans. Softw. Eng. SE-10, 2 (Mar. 1984), 201–210.
5. Faloutsos, C. Signature files: Design and performance comparison of some signature extraction methods. In Proceedings of ACM SIGMOD (Austin, Tex., May 28-31, 1985), ACM, New York, 1985, pp. 63–82.
6. Faloutsos, C., and Christodoulakis, S. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Off. Inf. Syst. 2, 4 (Oct. 1984), 267–288.
7. Files, J. R., and Huskey, H. D. An information retrieval system based on superimposed coding. In Proceedings of AFIPS Fall Joint Computer Conference, vol. 35 (Las Vegas, Nev., Nov. 18-20, 1969). AFIPS Press, Reston, Va., 1969, pp. 423–432.
8. Gallager, R. G. Information Theory and Reliable Communication. Wiley, New York, 1968.
9. Gonnet, G. H. Unstructured data bases. Tech. Rep. CS-82-09, Dept. of Computer Sciences, Univ. of Waterloo, Ontario, 1982.
10. Gustafson, R. A. Elements of the randomized combinatorial file structure. In ACM SIGIR, Proceedings of the Symposium on Information Storage and Retrieval (College Park, Md., Apr. 1971). ACM, New York, 1971, pp. 163–174.
11. Hardy, G. H., Littlewood, J. E., AND Polya, G. Inequalities. 2nd ed. Cambridge University Press, New York, 1952.
12. Harrison, M. C. Implementation of the substring test by hashing. Commun. ACM 14, 12 (Dec. 1971), 777–779.
13. Huffman, D. A. A method for the construction of minimum redundancy codes. In Proceedings of IRE, vol. 40, 1962, pp. 1098–1101.
14. Jaeschke, G. Reciprocal hashing: A method for generating minimal perfect hashing functions. Commun. ACM 24, 12 (Dec. 1981), 829–833.
15. Larson, P. A. A method for speeding up text retrieval. Unpublished manuscript, Dept. of Computer Sciences, Univ. of Waterloo, Ontario, 1983.
16. Lloyd, J. W. Optimal partial-match retrieval. BIT 20 (1980), 406–413.
17. Lloyd, J. W., and Ramamohanarao, K. Partial-match retrieval for dynamic files. BIT 22 (1982), 150–168.
18. MacKay, D. M. Information, Mechanism and Meaning. MIT Press, Cambridge, Mass., 1969.
19. Marshall, A. W., and Olkin, I. Inequalities: Theory of Majorization and Its Applications. Academic Press, New York, 1979.
20. McIlroy, M. D. Development of a spelling list. IEEE Trans. Commun. COM-30,1 (Jan. 1982), 91–99.
21. Mooers, C. Application of random codes to the gathering of statistical information. Bull. 31, Zator Co., Cambridge, Mass., 1949 (based on M.S. thesis, MIT, Cambridge, Mass., 1948).
22. Papoulis, A. Probability, Random Variables and Stochastic Processes. McGraw-Hill, New York, 1965.
23. Pfaltz, J. L., Berman, W. J., AND Cagley, E. M. Partial-match retrieval using indexed descriptor files. Commun. ACM 23, 9 (Sept. 1980), 522–528.
24. Reingold, E. M., Nievergelt, J., and Deo, N. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Englewood Cliffs, N.J., 1977.
25. Rivest, R. L. Partial match retrieval algorithms. SI AM J. Comput. 5, 1 (Mar. 1976), 19–50.
26. Roberts, C. S. Partial-match retrieval via the method of superimposed codes. Proc. IEEE 67, 12 (Dec. 1979), 1624–1642.
27. Rothnie, J. B., Jr., and Lozano, T. Attribute based file organization in a paged memory environment. Commun. ACM 17,2 (Feb. 1974), 63–69.
28. Sacks-Davis, R., and Ramamohanarao, K. A two level superimposed coding scheme for partial match retrieval. Inf. Syst. 8, 4 (1983), 273–280.
29. Severance, D. G., and Lohman, G. M. Differential files: Their application to the maintenance of large databases. ACM Trans. Database Syst. 1, 3 (Sept. 1976), 256–267.
30. Sprugnoli, R. Perfect hashing functions: A single probe retrieving method for static sets. Commun. ACM 20, 11 (Nov. 1977), 841–850.
31. Tsichritzis, D., and Christodoulakis, S. Message files. ACM Trans. Off. Inf. Syst. 1, 1 (Jan. 1983), 88–98.