A Bibliography of Publications on Hashing Algorithms - Index of files in
A Bibliography of Publications on Hashing Algorithms - Index of files in
A Bibliography of Publications on Hashing Algorithms - Index of files in
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
REFERENCES 103<br />
flow records to compute average<br />
search lengths <strong>in</strong> hash <strong>files</strong><br />
with open address<strong>in</strong>g. Technical<br />
Report 84/154/12, University<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> Calgary, May 1984. ?? pp.<br />
(email par<strong>in</strong>@cpsc.ucalgary.ca).<br />
Bratbergsengen:1984:HMR<br />
[Bra84b] Kjell Bratbergsengen. <strong>Hash<strong>in</strong>g</strong><br />
methods and relati<strong>on</strong>al algebra<br />
operati<strong>on</strong>s. In Proceed<strong>in</strong>gs<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> the 10th C<strong>on</strong>ference<br />
<strong>on</strong> Very Large Databases, S<strong>in</strong>gapore,<br />
pages 323–333. Morgan<br />
Kaufmann Publishers, San<br />
Francisco, CA, August 1984.<br />
Bradley:1985:UMD<br />
[Bra85] James Bradley. Use <str<strong>on</strong>g>of</str<strong>on</strong>g><br />
mean distance between overflow<br />
records to compute average<br />
search lengths <strong>in</strong> hash <strong>files</strong> with<br />
open adress<strong>in</strong>g. The Computer<br />
Journal (to appear), ??(??):??,<br />
August 1985.<br />
Bradley:1986:UMD<br />
[Bra86] J. Bradley. Use <str<strong>on</strong>g>of</str<strong>on</strong>g> mean distance<br />
between overflow records<br />
to compute average search<br />
lengths <strong>in</strong> hash <strong>files</strong> with open<br />
address<strong>in</strong>g. The Computer<br />
Journal, 29(2):167–170, April<br />
1986. CODEN CMPJA6. ISSN<br />
0010-4620 (pr<strong>in</strong>t), 1460-2067<br />
(electr<strong>on</strong>ic).<br />
Bradley:1988:BFP<br />
[Bra88] James Bradley. Bus<strong>in</strong>ess file<br />
process<strong>in</strong>g!: COBOL, CICS,<br />
and SQL. Mitchell Publish<strong>in</strong>g,<br />
Inc., Santa Cruz, CA, USA,<br />
1988. ISBN 0-394-39217-5. 400<br />
pp. LCCN QA76.9.F5 B725<br />
1988. US$28.00. Includes two<br />
chapters <strong>on</strong> hash file process<strong>in</strong>g.<br />
Brassard:1990:ACC<br />
[Bra90] Gilles Brassard, editor. Advances<br />
<strong>in</strong> Cryptology–CRYPTO<br />
’89, volume 435 <str<strong>on</strong>g>of</str<strong>on</strong>g> Lecture<br />
Notes <strong>in</strong> Computer Science.<br />
Spr<strong>in</strong>ger-Verlag, Berl<strong>in</strong>, Germany<br />
/ Heidelberg, Germany /<br />
L<strong>on</strong>d<strong>on</strong>, UK / etc., 1990.<br />
ISBN 0-387-97317-6. LCCN<br />
QA76.9.A25 C79 1989. C<strong>on</strong>ference<br />
held Aug. 20–24, 1989<br />
at the University <str<strong>on</strong>g>of</str<strong>on</strong>g> California,<br />
Santa Barbara.<br />
Brass:2009:UHF<br />
[Bra09] Peter Brass. Universal hash<br />
functi<strong>on</strong>s for an <strong>in</strong>f<strong>in</strong>ite universe<br />
and hash trees. Informati<strong>on</strong><br />
Process<strong>in</strong>g Letters, 109<br />
(10):461–462, April 30, 2009.<br />
CODEN IFPLAT. ISSN 0020-<br />
0190 (pr<strong>in</strong>t), 1872-6119 (electr<strong>on</strong>ic).<br />
Brent:1973:RRT<br />
[Bre73] Richard P. Brent. Reduc<strong>in</strong>g<br />
the retrieval time <str<strong>on</strong>g>of</str<strong>on</strong>g> scatter<br />
storage techniques. Communicati<strong>on</strong>s<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong> for<br />
Comput<strong>in</strong>g Mach<strong>in</strong>ery, 16(2):<br />
105–109, February 1973. CO-<br />
DEN CACMA2. ISSN 0001-<br />
0782 (pr<strong>in</strong>t), 1557-7317 (electr<strong>on</strong>ic).<br />
Modificati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g> open<br />
address<strong>in</strong>g with double hash<strong>in</strong>g<br />
to reduce the average number <str<strong>on</strong>g>of</str<strong>on</strong>g><br />
probes for a successful search.
Change language