SIGN IN
SIGN UP
Space/time trade-offs in hash coding with allowable errors
Full Text:
PDF
Buy this Article
Author:
Burton H. Bloom
Computer Usage Company, Newton Upper Falls, MA
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 13 Issue 7, July 1970
Pages 422-426
ACM
New York, NY
, USA
table of contents
doi>
10.1145/362686.362692
1970 Article
Bibliometrics
· Downloads (6 Weeks): 65
· Downloads (12 Months): 545
· Downloads (cumulative): 7,297
· Citation Count: 907
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
hash addressing
hash coding
retrieval efficiency
retrieval trade-offs
scatter storage
searching
storage efficiency
storage layout
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder