Partial-Match Retrieval via the Method of Superimposed Codes

Proceedings of the IEEE

Volumn 67, Issue 12, 1979, Pages 1624-1642

  Roberts, Charles S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS;

EID: 0018681752     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1979.11543     Document Type: Article

References (44)

1. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968, p. 6.
2. J. D. Beyer, J. D. Gabbe, and R. E. Miller, “Suffolk telephone directory data base for information retrieval research,” unpublished memo., 1976.
3. B. H. Bloom, “Some techniques and tradeoffs affecting large data base retrieval times,” in Proc. ACM Nat. Conf., vol. 24, pp. 83-95, 1969.
4. “Space/time tradeoffs in hash coding with allowable errors,” Comm. ACM, vol. 1 3, no. 7, pp. 422-426, July 1970.
5. C. P. Bourne, Methods of Information Handling. New York: Wiley, 1963.
6. C. W. Brenner and C N. Mooers, “History of a Zatocoding Information retrieval system,” in Punched Cards, R. S. Casey, J. W. Perry, M. M. Berry, and A. Kent, Eds. New York: Reinhold, pp. 340-356, 1958.
7. W. A. Burkhard, “Hashing and trie algorithms for partial match retrieval,” ACM Trans. Database Syst., vol. 1, no. 2, pp. 175-187, June 1976.
8. R. S. Casey, J. W. Perry, M. M. Berry, and A. Kent, Eds., Punched Cards: Their Applications to Science and Industry. New York: Reinhold, 1958.
9. R. R. Coveyou and R. D. MacPherson, “Fourier analysis of uniform random number generators,” J. ACM, vol. 14, no. 1, pp. 100-119, Jan. 1967.
10. D. R. Davis and A. D. Lin, “Secondary key retrieval using an IBM 7090-1301 system,” Comm. ACM, vol. 8, no. 4, pp. 243-246, Apr. 1965.
11. G. G. Dodd, “Elements of data management systems,” Comput. Sur., vol. 1, no. 2, pp. 117-133, June 1969.
12. P. Dubost and J. M. Trousse, “Software implementation of a new method of combinatorial hashing,” STANCS-75, 511, Computer Science Dep., Stanford Univ., Stanford, CA., Sept. 1975.
13. R. A. Gustafson, “A randomized combinatorial file structure for storage and retrieval systems” Ph.D. thesis, Univ. of South Carolina, Columbia, SC, 1969.
14. M. C. Harrison, “Implementation of the substring test by hashing,” Comm. ACM, vol. 14, no. 12, pp. 777-779, Dec. 1971.
15. F. C. Hutton, “PEEKABIT, computer offspring of punched card PEEKABOO, for natural language searching,” Comm. ACM, vol. 11, no. 9, pp. 595-598, Sept. 1968.
16. W. H. Kautz and R. C. Singleton, “Nonrandom binary superimposed codes,” IEEE Trans. Inform. Theory, IT-10, pp. 363-377, Oct. 1964.
17. G. D. Knott, “Hashing functions,” Comput. J., vol. 18, no. 3, pp. 265-278, Aug. 1975.
18. D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Reading, MA: Addison-Wesley, 1973.
19. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969.
20. The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
21. M. Kochen, Ed., Some Problems in Information Science. New York: Scarecrow, 1965.
22. The Growth of Knowledge. New York: Wiley, 1967.
23. C. Y. Lee and M. C Paull, “A content addressable distributed logic memory with applications to information retrieval,” Proc. IEEE, vol. 51, pp. 924-932, June 1963.
24. D. Lefkovitz, File Structures for Online Systems. New York: Spartan Books, 1969.
25. H. P. Luhn, “Superimposed coding with the aid of randomizing squares for use in mechanical information searching systems,” in Punched Cards, R. S. Casey, J. W. Perry, M. M. Berry, and A. Kent, Eds. New York: Reinhold, pp. 492-509, 1958.
26. W. D. Maurer and T. G. Lewis, “Hash table methods,” Comput. Ser., vol. 7, no. 1, pp. 5-19, Mar. 1975.
27. C. N. Mooers, “Putting probability to work in coding punched cards,” Amer. Chem. Soc. Meeting, vol. 112, pp. 14E-15E, Sept. 1947
28. “Zatocoding applied to mechanical organization of knowledge,” Amer. Document., vol. 2, no. 1, pp. 20-32, Jan. 1951.
29. “Zatocoding and developments in information retrieval,” ASLIB Proc., vol. 8, no. 1, pp. 3-22, Feb. 1956.
30. “The next twenty years in information retrieval: some goals and predictions,” Proc. Western Joint Comput. Conf., pp. 81-86, 1959.
31. R. Morris, “Scatter storage techniques,” Comm. ACM, vol. 11, no. 1, pp. 38-44, Jan. 1968.
32. G. Orosz and L. Takacs, “Some probability problems concerning the marking of codes into the superimposition field,” J. Document., vol. 12, no. 4, pp. 231-234, Dec. 1956.
33. D. M. Ritchie and K. Thompson, “The UNIX timesharing system,” Comm. ACM, vol. 17, no. 7, pp. 365-375, July 1974.
34. B. W. Kernighan and D. M. Ritchie, The C Programming Language. Englewood Cliffs, NJ: Prentice-Hall, 1978.
35. R. L. Rivest, “Analysis of associative retrieval algorithms,” STAN- CS-74-415, Comput. Sci. Dep., Stanford Univ., Stanford, CA., May 1974.
36. “Partial-match retrieval algorithms,” SIAM J. Comput., vol. 5, no. 1, pp. 19-50, Mar. 1976.
37. C. K. Schultz, “Application of random codes for literature searching,” in Punched Cards, R. S. Casey, J. W. Perry, M. M. Berry, and A. Kent, Eds. New York: Reinhold, pp. 232-247, 1958.
38. D. G. Severance, “Identifier search mechanisms: A survey and generalized model,” Comput. Sur., vol. 6, no. 3, pp. 175-194, Sept. 1974.
39. D. G. Severance and R. A. Duhne, “A practitioner's guide to addressing algorithms, Comm. ACM, vol. 19, no. 6, pp. 314-326, June 1976.
40. S. Stiassny, “Mathematical analysis of various superimposed coding methods,” Amer. Document., vol. 11, no. 2, pp. 155-169, Feb. 1960.
41. K. J. Thurber and L. D. Wald, “Associative and parallel processors,” Comput. Sur., vol. 7, no. 4, pp. 215-255, Dec. 1975.
42. O. Vallarino, “On the use of bit maps for multiple key retrieval,” Conf. Proc. on Data: Abstraction, Definition, and Structure, in ACM SIGPLAN Notices, vol. 11, Special Issue, pp. 108-114, Mar. 1976.
43. C S. Wise, “Mathematical analysis of coding systems,”in Punched Cards, R. S. Casey, J. W. Perry, M. M. Berry, and A. Kent, Eds. New York: Reinhold, pp. 438-464, 1958.
44. A. L. Zobrist and F. R. Carlson, Jr., “Detection of combined occurrences,” Comm. ACM, vol. 20, no. 1, pp. 31-35, Jan. 1977.