Linear hashing with overflow-handling by linear probing

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Per-Åke Larson Univ. of Waterloo, Waterloo, Ont., Canada
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 10 Issue 1, March 1985
Pages 75 - 89
ACM New York, NY, USA
table of contents doi>10.1145/3148.3324
Linear hashing with overflow-handling by linear probing Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 16
· Downloads (cumulative): 961
· Citation Count: 10


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder