Efficient Storage and Retrieval by Content and Address of Static Files

Journal of the ACM (JACM)

Volumn 21, Issue 2, 1974, Pages 246-260

  Elias, Peter ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

access; computational complexity; efficiency; file; inverted file; retrieval; storage

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS;

EID: 0016047467     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321812.321820     Document Type: Article

References (10)

1. Cover, T. M. Enumerative source encoding. IEEE Trans. IT-19 (Jan. 1973), 73-77.
2. Elias, P. On binary representations of monotone sequences. Proc. Sixth Princeton Conference on Information Sciences and Systems, March 1972, Dep. of Electrical Engineering, Princeton U., Princeton, N. J., 1972, pp. 54-57.
3. Fano, R. M. On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC, MIT, Cambridge, Mass., n.d.
4. Fano, R. M. Transmission of Information, MIT Press, Cambridge, Mass., and Wiley, New York, 1961.
5. Gallager, R. G. Information Theory and Reliable Communication. Wiley, New York, 1968.
6. Lehmer, D. H. Teaching combinatorial tricks to a computer. Proceedings of Symposia in Applied Mathematics, Vol. X, Combinatorial Analysis, Amer. Math. Soc., Providence, R.I., 1960, Ch. 1, pp. 5-31.
7. Minsky, M., and Papert, S. Perceptrons. MIT Press, Cambridge, Mass., 1969, pp. 215-225.
8. Schalkwijk, J. P. M. An algorithm for source coding. IEEE Trans. IT-18 (May 1972), 395-399.
9. Wozencraft, J. M., and Reiffen, B. Sequential Decoding. MIT Press, Cambridge, Mass., 1961, pp. 71-73.
10. Flower, R. A. Computer updating of a data structure. Quart Progress Rep. 110, Res. Lab. of Electronics, MIT, Cambridge, Mass., July 1973.