%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.277",
%%% date = "23 November 2018",
%%% time = "16:24:15 MDT",
%%% filename = "hash.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% checksum = "55646 78154 361911 3596324",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography; BibTeX; chaining; cuckoo
%%% hashing; double hashing; fast set member
%%% access; hash table; hashing; hashing with
%%% linked lists; quadratic hashing; open
%%% addressing; scatter-table storage",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This bibliography records publications on
%%% the subject of hashing, i.e., algorithms for
%%% lookup of keys in large lists in (on
%%% average) constant time.
%%%
%%% At version 2.277, the year coverage looks
%%% like this:
%%%
%%% 1939 ( 2) 1966 ( 0) 1993 ( 116)
%%% 1940 ( 0) 1967 ( 0) 1994 ( 115)
%%% 1941 ( 0) 1968 ( 6) 1995 ( 76)
%%% 1942 ( 0) 1969 ( 6) 1996 ( 48)
%%% 1943 ( 0) 1970 ( 10) 1997 ( 49)
%%% 1944 ( 0) 1971 ( 7) 1998 ( 41)
%%% 1945 ( 0) 1972 ( 15) 1999 ( 34)
%%% 1946 ( 0) 1973 ( 21) 2000 ( 24)
%%% 1947 ( 0) 1974 ( 22) 2001 ( 40)
%%% 1948 ( 0) 1975 ( 24) 2002 ( 44)
%%% 1949 ( 0) 1976 ( 23) 2003 ( 22)
%%% 1950 ( 1) 1977 ( 31) 2004 ( 23)
%%% 1951 ( 0) 1978 ( 24) 2005 ( 45)
%%% 1952 ( 0) 1979 ( 32) 2006 ( 53)
%%% 1953 ( 3) 1980 ( 38) 2007 ( 86)
%%% 1954 ( 0) 1981 ( 37) 2008 ( 76)
%%% 1955 ( 0) 1982 ( 58) 2009 ( 86)
%%% 1956 ( 1) 1983 ( 77) 2010 ( 61)
%%% 1957 ( 1) 1984 ( 70) 2011 ( 63)
%%% 1958 ( 2) 1985 ( 83) 2012 ( 138)
%%% 1959 ( 1) 1986 ( 72) 2013 ( 49)
%%% 1960 ( 0) 1987 ( 59) 2014 ( 53)
%%% 1961 ( 1) 1988 ( 90) 2015 ( 50)
%%% 1962 ( 1) 1989 ( 115) 2016 ( 46)
%%% 1963 ( 8) 1990 ( 103) 2017 ( 48)
%%% 1964 ( 1) 1991 ( 108) 2018 ( 25)
%%% 1965 ( 1) 1992 ( 91)
%%% 19xx ( 7)
%%%
%%% Article: 1704
%%% Book: 111
%%% InCollection: 9
%%% InProceedings: 437
%%% Manual: 12
%%% MastersThesis: 12
%%% Misc: 22
%%% PhdThesis: 18
%%% Proceedings: 283
%%% TechReport: 150
%%% Unpublished: 6
%%%
%%% Total entries: 2764
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% This bibliography is sorted by year, and
%%% within each year, by author and title key,
%%% with ``bibsort -byyear''. Year order has
%%% been chosen to make it easier to identify
%%% the most recent work. Cross-referenced
%%% proceedings entries appear at the end,
%%% because of a restriction in the current
%%% BibTeX.
%%%
%%% 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--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.
%%%
%%% 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).
%%%
%%% 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
%%% <at>String{} abbreviations, occupying 94.8MB
%%% of disk space.
%%%
%%% At version 0.34, about 65 new entries were
%%% added from a search of the OCLC Article1st
%%% database, and another 60 existing entries
%%% were updated with new information. At version
%%% 0.37, another 46 entries were added from a
%%% search of the OCLC Proceedings database.
%%%
%%% At version 0.56, a search of the Compendex
%%% databases (1970--1996) added 185 new
%%% entries, and provided additional data
%%% for many other entries.
%%%
%%% 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.
%%%
%%% 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
%%% with extension .sok.
%%%
%%% 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.
%%%
%%% 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.
%%%
%%% Journal, organization, and publisher names,
%%% and publisher addresses, have all been
%%% replaced by consistent abbreviations of the
%%% form j-xyz, org-xyz, pub-xyz, and
%%% pub-xyz:adr. The variation in spelling and
%%% abbreviation in the original data was
%%% distressingly large.
%%%
%%% LCCN (Library of Congress Call Numbers) are
%%% given wherever applicable, because they are
%%% widely used by libraries in the United
%%% States and possibly elsewhere. Please note
%%% that these are letter-digit-year
%%% combinations like QA76.9.D35 D48 1986,
%%% rather than the field LCCN: 85-26850 r91
%%% which appears in Library of Congress
%%% catalog entries, and is an internal number
%%% of apparent little use elsewhere.
%%%
%%% 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.
%%%
%%% Missing data are indicated throughout by
%%% question marks. Approximately a third of the
%%% bibliographic entries contain them, sigh...
%%%
%%% 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.
%%%
%%% 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.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================