<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>Bibliography on Hashing</title>
<link rel="stylesheet" href="../bibliography.css" type="text/css" />
<link rev="made" href="mailto:liinwwwa@ira.uka.de" />
<link rel="copyright" href="../Copyright.html" />
<link rel="up" href="index.html" />
<link rel="home" href="../index.html" />
<link rel="top" href="../index.html" />
<meta name="description" content="Bibliography on Hashing. This bibliography is a part of the Computer Science Bibliography Collection." />
<meta name="DC.DESCRIPTION" content="Bibliography on Hashing. This bibliography is a part of the Computer Science Bibliography Collection." />
<meta name="keywords" content="searchable bibliography, computer science, RSS, 
, hashing" />
<meta name="DC.SUBJECT" content="searchable bibliography, computer science, RSS, 
, hashing" />
<meta name="robots" content="noarchive,nofollow" />
<meta name="resource-type" content="document" />
<meta name="distribution" content="global" />
<meta name="copyright" content="1995-2008, Alf-Christian Achilles" />
<meta name="DC.COPYRIGHT" content="1995-2008, Alf-Christian Achilles" />
<meta name="DC.CREATOR" content="Alf-Christian Achilles" />
<meta name="DC.CREATOR" content="Paul Ortyl" />
</head>
<body>
<h1 class="page_title">The Collection of<br />Computer Science Bibliographies</h1><ul class="top_nav"><li><a href="../index.html" title="Home page of The Collection of Computer Science Bibliographies">Collection Home</a></li>
<li><a href="index.html">Up: Bibliographies on Theory/Foundations of Computer Science</a></li>
</ul>
<h1 class="subcollectiontitle">Bibliography on Hashing</h1>
<p style="text-align:center; font-size:small">[ &nbsp; <a href="#about">About</a> &nbsp; | &nbsp;<a href="#browse">Browse</a> &nbsp; | &nbsp; <a href="#stats">Statistics</a> &nbsp; ]</p><table width="100%" cellpadding="0"><colgroup span="4" width="1*" /><tr><th align="right">Number of references:</th><td align="left">1668</td><th align="right">Last update:</th><td align="left">November 18, 2008</td></tr><tr><th align="right">Number of online publications:</th><td align="left">775</td><th align="right">Supported:</th><td align="left">yes</td>
</tr><tr><th align="right">Most recent reference:</th><td align="left">October 2008</td>
<th align="right">Info:</th><td>Version 2.24</td></tr></table>

<!-- short form -->
<!-- short search form -->
<h2 class="h2bar"><a id="about">Information on the Bibliography</a></h2>
<dl>
<dt><strong>Author:</strong></dt>
<dd><a href="http://www.math.utah.edu/~beebe/">Nelson H. F. Beebe</a> &lt;beebe @ math . utah . edu (Internet)&gt; <i>(email mangled to prevent spamming)</i><br />
Center for Scientific Computing<br /> Department of Mathematics<br /> University of Utah<br /> Salt Lake City, UT 84112<br /> USA
</dd><dt><strong>Abstract:</strong></dt><dd>
This bibliography records publications on the subject of hashing, i.e., algorithms for lookup of keys in large lists in (on average) constant time.<br /> For static collections of text, such as data on CD ROMs, minimal perfect hash functions are of considerable interest, and the reader's attention is drawn to the important breakthroughs represented by the work of E. Fox and collaborators (1988&ndash;1992), which now permit derivation of hash functions for collections of millions of keys, instead of at most a few hundred with the methods of earlier work. <br /> Witten, Moffat, and Bell (Witten:1994:MGC) describe very recent work on minimal ordered perfect hash functions, that is, ones in which entries are stored in some predefined order, such as alphabetical; this makes enumeration of a sorted key list trivial. The methods of their book are implemented in software (retrievable on the Internet) for solving the full text search problem: given a word, or word, find all documents in a large collection that contain that word. Their software also supports Boolean search (find A and B or C and not D), and query ranked search (given a list of several words, find documents containing them, and rank them by the number of matches).</dd>
<dt><strong>Keywords:</strong></dt><dd>
hashing</dd>
<dt><strong>Author Comments:</strong></dt><dd>
These references have been extracted from a very large computer science bibliography collection on ftp.ira.uka.de in /pub/bibliography to which many people of have contributed. The snapshot of this collection was taken on 5-May-1994, and it consists of 441 BibTeX files, 2,672,675 lines, 205,289 entries, and 6,375 &lt;at&gt;String abbreviations, occupying 94.8MB of disk space. <br /> Regrettably, the quality of many of those bibliography files is low, with incomplete bibliographic data (missing author initials, page numbers, titles, proceedings cross-references, ....) and spelling and typing errors. Also, because the collection came from many sources, there is much duplication, and I had to spend much longer than I expected identifying duplicates, and merging them manually into single entries with maximal bibliographic information. <br /> I have corrected all spelling errors that I could identify with the help of two separate spelling programs, though this is difficult with multi-lingual text. The list of spelling exceptions (i.e. words believed to be correctly spelled, but absent from the spelling program dictionaries) is kept in the companion file, hash.sok. <br /> I have supplied publisher, ISBN, LCCN, page number data to the extent possible with the resources of the U.S. Library of Congress catalog, and other university catalogs accessible on the Internet, particularly the University of California MELVYL catalog, and the Stanford University RLIN catalog (thanks to the willow software from the University of Washington). Their availability is gratefully acknowledged. <br /> For books published since 1972, when the International Standard Book Numbering system was introduced, ISBNs are particularly important, because they are unique numbers that identify the country group, publisher, and book; bookstores routinely request ISBNs from their customers. <br /> More than 235 of these references are papers in conference proceedings, and regrettably, for about 30 of them, I have been unable to locate an exact reference to the conference volume in the various on-line library catalogs that I consulted. This is disappointing, because it suggests that the papers will be largely inaccessible. <br /> Missing data are indicated throughout by question marks. Approximately a third of the bibliographic entries contain them, sigh... <br /> I will be very grateful to users of this bibliography who can supply me with corrected conference proceedings data for future editions of this bibliography, as well as for new entries. Despite the very large collection from which this data was extracted, more than half of the papers in my personal files of papers on hashing were absent from that collection. Also, most of the references from Knuth's exhaustive study (Knuth:1973:ACP), and from the books by Vitter and Chen (Vitter:1987:DAC), Pieprzyk and Sadeghiyan (Pieprzyk:1993:DHA), and Devroye (Devroye:1986:LNB) were absent, and have been included below. <br /> Because of my dissatisfaction with the completeness of many of these entries, I have assigned a major version number of 0 to this bibliography, rather than the more usual 1. A substantial amount of updating work remains to be done to remedy this situation, and bring this bibliography up to the standards which should be expected of professionals in the field. This bibliography is nevertheless being made available in its present state in the belief that it will be useful to many people.</dd>

</dl>
<h2 class="h2bar"><a id="browse">Browsing the bibliography</a></h2>
<ul><li><dl>
<dt><strong>Original source:</strong></dt>
<dd><a href="http://www.math.utah.edu/pub/tex/bib/hash.bib">http://www.math.utah.edu</a>...
(Format: bibtex) 
</dd><dt><strong>Other sites:</strong></dt>
<dd><a href="ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib">ftp://ftp.math.utah.edu</a>...
(Format: bibtex)
<br />
</dd>
</dl></li></ul>
<h2 class="h2bar"><a id="stats">Bibliographic Statistics</a></h2>
<dl>
<dt><strong>Types:</strong></dt>
<dd>article(880), inproceedings(322), proceedings(201),
techreport(121), book(99), phdthesis(16),
 mastersthesis(11), incollection(5), manual(5), misc(4),
 unpublished(4)</dd><dt><strong>Fields:</strong></dt>
<dd>title(1668), year(1668), acknowledgement(1666),
pages(1656), bibdate(1617), author(1464), volume(965),
 issn(894), journal(885), number(872), coden(852),
 month(796), address(738), publisher(657),
 keywords(603), booktitle(542), isbn(522), isbn-13(522),
 abstract(487), classification(421), editor(335),
 lccn(308), journalabr(273), note(256),
 affiliationaddress(198), annote(165), series(157),
 affiliation(141), sponsor(128), meetingaddress(127),
 institution(122), url(119), day(118), key(117),
 conference(107), descriptor(83), mrclass(65),
 mrnumber(59), meetingdate(58), meetingdate2(58),
 mrnumber-url(58), price(58), subject(48), doi(47),
 doi-url(44), conferenceyear(42), corpsource(40),
 treatment(39), thesaurus(34), type(32), school(30),
 pagecount(28), meetingabr(27), publisherinfo(24),
 classcodes(23), review(22), language(21),
 xxcrossref(17), edition(13), oldlabel(12),
 mrreviewer(11), pubcountry(11), fjournal(10),
 generalterms(10), xmldata(10), xxnote(8), location(7),
 organization(6), referencedin(6), articleno(5),
 remark(5), country(4), date(4), enum(4), references(4),
 revision(4), comment(3), howpublished(3), issue(3),
 libnote(3), note2(3), xxauthor(3), xxisbn(3),
 author-2-adr(2), email-1(2), meetingname(2),
 romanvolume(2), town(2), xxpages(2), xxtitle(2),
 xxvolume(2), altjournal(1), annote-2(1),
 author-1-adr(1), author-3-adr(1), author-4-adr(1),
 bookpages(1), chapter(1), checked(1), city(1),
 conflocation(1), conftitle(1), fixme(1), note1(1),
 oldbibdate(1), onlinedate(1), ordernumber(1), ref(1),
 refs(1), sjb(1), sponsororg(1), zmnumber(1)</dd><dt><strong>Distribution of publication dates:</strong></dt>
<dd style="text-align:center">
<object data="hash.years.stats.svgz" type="image/svg+xml" width="800" height="400" style="width: 80ex; height: 40ex;">
<img src="hash.years.stats.png" alt="Distribution of publication dates" title="Distribution of publication dates" />
</object></dd>
</dl>
<p class="footer">
<a href="http://liinwww.ira.uka.de/bibliography/Copyright.html">Copyright</a> &copy; 1995-2008 Alf-Christian Achilles, All rights reserved.
<br />
This service is brought to you by
<a href="http://liinwww.ira.uka.de/~achilles/">Alf-Christian Achilles</a> 
and <a href="http://3miasto.net.pl/~ortylp">Paul Ortyl</a>
<br />
Please direct <a href="http://liinwww.ira.uka.de/bibliography/Comments.html" title="Send your comments via form.">comments</a> 
to <kbd><a href="mailto:liinwwwa@ira.uka.de" title="Send your comments via email.">liinwwwa@ira.uka.de</a></kbd>
</p>

<p>
<a href="http://validator.w3.org/check?uri=referer"><img src="/valid-xhtml11.png" alt="Valid XHTML 1.1!" /></a>&nbsp;
<a href="http://jigsaw.w3.org/css-validator/check/referer"><img src="/vcss.png" alt="Valid CSS!" /></a>
</p>
</body>
</html>
