%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.66",
%%% date = "29 December 2011",
%%% time = "08:07:58 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 = "45340 54229 252263 2437118",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, BibTeX, hashing",
%%% 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.66, the year coverage looks
%%% like this:
%%%
%%% 1939 ( 2) 1964 ( 1) 1989 ( 117)
%%% 1940 ( 0) 1965 ( 1) 1990 ( 103)
%%% 1941 ( 0) 1966 ( 0) 1991 ( 108)
%%% 1942 ( 0) 1967 ( 0) 1992 ( 92)
%%% 1943 ( 0) 1968 ( 6) 1993 ( 113)
%%% 1944 ( 0) 1969 ( 6) 1994 ( 116)
%%% 1945 ( 0) 1970 ( 9) 1995 ( 77)
%%% 1946 ( 0) 1971 ( 7) 1996 ( 48)
%%% 1947 ( 0) 1972 ( 14) 1997 ( 44)
%%% 1948 ( 0) 1973 ( 20) 1998 ( 36)
%%% 1949 ( 0) 1974 ( 22) 1999 ( 29)
%%% 1950 ( 1) 1975 ( 23) 2000 ( 22)
%%% 1951 ( 0) 1976 ( 22) 2001 ( 34)
%%% 1952 ( 0) 1977 ( 31) 2002 ( 34)
%%% 1953 ( 3) 1978 ( 23) 2003 ( 15)
%%% 1954 ( 0) 1979 ( 33) 2004 ( 18)
%%% 1955 ( 0) 1980 ( 38) 2005 ( 34)
%%% 1956 ( 1) 1981 ( 36) 2006 ( 24)
%%% 1957 ( 1) 1982 ( 59) 2007 ( 31)
%%% 1958 ( 1) 1983 ( 78) 2008 ( 39)
%%% 1959 ( 1) 1984 ( 70) 2009 ( 34)
%%% 1960 ( 0) 1985 ( 83) 2010 ( 34)
%%% 1961 ( 1) 1986 ( 72) 2011 ( 21)
%%% 1962 ( 1) 1987 ( 59)
%%% 1963 ( 8) 1988 ( 87)
%%% 19xx ( 7)
%%%
%%% Article: 1150
%%% Book: 103
%%% InCollection: 6
%%% InProceedings: 372
%%% Manual: 12
%%% MastersThesis: 11
%%% Misc: 7
%%% PhdThesis: 17
%%% Proceedings: 240
%%% TechReport: 128
%%% Unpublished: 4
%%%
%%% Total entries: 2050
%%%
%%% 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.",
%%% }
%%% ====================================================================
@Preamble{
"\hyphenation{
Chris-to-dou-la-kis
Fach-ge-sprach
feh-ler-be-hand-lung
feh-ler-er-ken-nung
Han-over
Jean-ette
Mann-heim
Piep-rzyk
Reuh-ka-la
Rus-in-kie-wicz
Sa-degh-i-yan
Worm-ald
zu-griffs-ver-fahr-en
}" #
"\ifx \undefined \bbb \def \bbb #1{\mathbb{#1}} \fi" #
"\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi" #
"\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Institutional abbreviations:
@String{inst-BROWN-CS = "Department of Computer Science,
Brown University"}
@String{inst-BROWN-CS:adr = "Providence, RI, USA"}
@String{inst-CSC = "Center for Scientific Computing and
Department of Mathematics, University of
Utah"}
@String{inst-CSC:adr = "Salt Lake City, UT 84112, USA"}
@String{inst-CSRC = "Computing Sciences Research Center, Bell
Laboratories"}
@String{inst-CSRC:adr = "Murray Hill, NJ, USA"}
@String{inst-HARVARD-CRCT = "Centre for Research in Computing
Technology, Harvard University"}
@String{inst-HARVARD-CRCT:adr = "Cambridge, MA"}
@String{inst-IBM = "IBM Corporation"}
@String{inst-IBM:adr = "San Jose, CA, USA"}
@String{inst-MANCHESTER-CS = "Department of Computer Science,
University of Manchester"}
@String{inst-MANCHESTER-CS:adr = "Manchester, UK"}
@String{inst-MIT-AI = "Massachusetts Institute of
Technology, A. I. Lab."}
@String{inst-MIT-CS = "Massachusetts Institute of
Technology, Computer Science Lab."}
@String{inst-MIT:adr = "Cambridge, Massachusetts"}
@String{inst-PRINCETON-CS = "Department of Computer Science,
Princeton University"}
@String{inst-PRINCETON-CS:adr = "Princeton, NJ, USA"}
@String{inst-PURDUE-CS = "Department of Computer Science,
Purdue University"}
@String{inst-PURDUE-CS:adr = "West Lafayette, IN, USA"}
@String{inst-STANFORD = "Stanford University"}
@String{inst-STANFORD:adr = "Stanford, CA, USA"}
@String{inst-UC-BERKELEY-ICSI = "International Computer Science Institute"}
@String{inst-UC-BERKELEY-ICSI:adr = "Berkeley, CA, USA"}
@String{inst-UIUC-CSRD = "University of Illinois at Urbana-Champaign,
Center for Supercomputing Research and
Development"}
@String{inst-UIUC-CSRD:adr = "Urbana, IL 61801, USA"}
@String{inst-VIRGINIA-POLY-CS = "Department of Computer Science,
Virginia Polytechnic Institute and
State University"}
@String{inst-VIRGINIA-POLY-CS:adr = "Blacksburg, VA 24061-0106, USA"}
@String{inst-WATERLOO-CS = "Department of Computer Science,
University of Waterloo"}
@String{inst-WATERLOO-CS:adr = "Waterloo, Ontario, Canada"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-ACM-J-EXP-ALGORITHMICS = "ACM Journal of Experimental Algorithmics"}
@String{j-ACTA-INFO = "Acta Informatica"}
@String{j-ADA-LETT = "Ada Letters"}
@String{j-ADV-SOFT-SCI-TECH = "Advances in software science and
technology"}
@String{j-AEU = "AEU: Archiv f{\"u}r Elektronik und
Ubertragungstech"}
@String{j-ALGORITHMICA = "Algorithmica"}
@String{j-AMER-MATH-MONTHLY = "American Mathematical Monthly"}
@String{j-ANG-INFO = "Angewandte Informatik"}
@String{j-ANN-OPER-RESEARCH = "Annals of Operations Research"}
@String{j-APPL-MATH-COMP = "Applied Mathematics and Computation"}
@String{j-APPL-MATH-LETT = "Applied Mathematics Letters"}
@String{j-AUSTRALIAN-COMP-J = "Australian Computer Journal"}
@String{j-BIT = "BIT (Nordisk tidskrift for
informationsbehandling)"}
@String{j-BYTE = "Byte Magazine"}
@String{j-C-PLUS-PLUS-REPORT = "C++ Report"}
@String{j-CACM = "Communications of the Association for
Computing Machinery"}
@String{j-CCPE = "Concurrency and Computation: Prac\-tice and
Experience"}
@String{j-CCCUJ = "C/C++ Users Journal"}
@String{j-COMBIN-PROBAB-COMPUT = "Combinatorics, Probability and Computing"}
@String{j-COMBINATORICA = "Combinatorica"}
@String{j-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"}
@String{j-COMP-ART-INTELL = "Computers and Artificial Intelligence =
Vychislitel'nye mashiny i iskusstvennyi
intellekt"}
@String{j-COMP-AUTO = "Computers and Automation"}
@String{j-COMP-BULL = "The Computer Bulletin"}
@String{j-COMP-COMM = "Computer Communications"}
@String{j-COMP-COMM-REV = "Computer Communication Review"}
@String{j-COMP-GRAPHICS = "Computer Graphics"}
@String{j-COMP-J = "The Computer Journal"}
@String{j-COMP-LANG-MAG = "Computer Language Magazine"}
@String{j-COMP-LANGS = "Computer Languages"}
@String{j-COMP-MATH-APPL = "Computers and Mathematics and
Applications"}
@String{j-COMP-NET-AMSTERDAM = "Computer Networks (Amsterdam, Netherlands:
1999)"}
@String{j-COMP-PHYS-COMM = "Computer Physics Communications"}
@String{j-COMP-SURV = "ACM Computing Surveys"}
@String{j-COMP-SYS = "Computing Systems"}
@String{j-COMP-TECH-REV = "Computer Technology Review"}
@String{j-COMP-VIS-IMAGE-UNDERSTANDING = "Computer vision and image
understanding: CVIU"}
@String{j-COMPUT-ELECTRON-AGRIC = "Computers and Electronics in Agriculture"}
@String{j-COMPUT-METH-PROG-BIOMED = "Computer Methods and Programs in
Biomedicine"}
@String{j-COMPUT-SECUR = "Computers and Security"}
@String{j-COMPUTER = "Computer"}
@String{j-COMPUTERWORLD = "ComputerWorld"}
@String{j-COMPUTING = "Computing"}
@String{j-CONG-NUM = "Congressus Numerantium"}
@String{j-CRYPTOBYTES = "CryptoBytes"}
@String{j-CRYPTOLOGIA = "Cryptologia"}
@String{j-CUJ = "C Users Journal"}
@String{j-CVGIP-IU = "Computer Vision, Graphics, and Image
Processing. Image Understanding"}
@String{j-DATA-KNOWLEDGE-ENG = "Data and Knowledge Engineering"}
@String{j-DBMS = "DBMS"}
@String{j-DDJ = "Dr. Dobbs Journal"}
@String{j-DESIGNS-CODES-CRYPTOGR = "Designs, Codes, and Cryptography"}
@String{j-DISCRETE-APPL-MATH = "Discrete Applied Mathematics"}
@String{j-DOKL-AKAD-NAUK = "Doklady Adak. Nauk SSSR"}
@String{j-EL-COMM-LAB = "Rev. of the El. Commun. Lab."}
@String{j-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI = "Electronics and
communications in Japan. Part 3,
Fundamental electronic science"}
@String{j-ELECT-LETTERS = "Electronics Letters"}
@String{j-ELECTRONIC-DESIGN = "Electronic Design"}
@String{j-EUR-J-COMB = "European Journal of Combinatorics"}
@String{j-EUR-TRANS-TELECOMM = "Eur. Trans. Telecommun. Relat. Technol."}
@String{j-FORM-METHODS-SYST-DES = "Formal Methods in System Design"}
@String{j-FORTH-DIMENSIONS = "Forth Dimensions"}
@String{j-FSTTCS = "Foundations of Software Technology and
Theoretical Computer Science"}
@String{j-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"}
@String{j-IBM-JRD = "IBM Journal of Research and Development"}
@String{j-IBM-SYS-J = "IBM Systems Journal"}
@String{j-IBM-TDB = "IBM Technical Disclosure Bulletin"}
@String{j-IEE-PROC-E = "IEE proceedings, E: Computers and
digital techniques"}
@String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"}
@String{j-IEEE-COMPUT-SCI-ENG = "IEEE Computational Science \& Engineering"}
@String{j-IEEE-INT-SYMP-INF-THEORY = "IEEE International Symposium on
Information Theory"}
@String{j-IEEE-J-SEL-AREAS-COMMUN = "IEEE Journal on Selected Areas in
Communications"}
@String{j-IEEE-MICRO = "IEEE Micro"}
@String{j-IEEE-PROC = "IEEE Proceedings"}
@String{j-IEEE-SEC-PRIV = "IEEE Security \& Privacy"}
@String{j-IEEE-SOFTWARE = "IEEE Software"}
@String{j-IEEE-TIT = "IEEE Transactions on Information
Theory"}
@String{j-IEEE-TRANS-COMM = "IEEE Trans. Comm."}
@String{j-IEEE-TRANS-COMPUT = "IEEE Transactions on Computers"}
@String{j-IEEE-TRANS-INF-THEORY = "IEEE Transactions on Information Theory"}
@String{j-IEEE-TRANS-KNOWL-DATA-ENG = "IEEE Transactions on Knowledge and
Data Engineering"}
@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}
@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
Distributed Systems"}
@String{j-IEEE-TRANS-PATT-ANAL-MACH-INTEL = "IEEE Transactions on
Pattern Analysis and Machine Intelligence"}
@String{j-IEEE-TRANS-SOFTW-ENG = "IEEE Transactions on Software Engineering"}
@String{j-IEEE-TRANS-SYST-MAN-CYBERN = "IEEE Trans. Systems, Man, and
Cybernetics"}
@String{j-IEICE-TCEIS = "IEICE Transactions on
Communications\slash Electronics\slash
Information and Systems"}
@String{j-IEICE-TRANS-FUND-ELECT= "IEICE Transactions on Fundamentals
of Electronics Communications and
Computer Sciences"}
@String{j-IND-MATH = "Industrial Mathematics"}
@String{j-INF-CONTROL = "Information and Control"}
@String{j-INF-TECH-RES-DEV-APPL = "Inf. Tech. Res. Dev. Appl."}
@String{j-INFO-PROC-LETT = "Information Processing Letters"}
@String{j-INFO-SCI = "Information sciences"}
@String{j-INFO-SOFTWARE-TECH = "Information and Software Technology"}
@String{j-INFO-SYS = "Information system"}
@String{j-INT-J-COMP-PROC-ORIENTAL-LANG = "International Journal of
Computer Processing of Oriental Languages
(IJCPOL)"}
@String{j-INT-J-COMPUT-INF-SCI = "International Journal of Computer and
Information Sciences"}
@String{j-INT-J-COMPUT-MATH = "International Journal of Computer
Mathematics"}
@String{j-INT-J-COMPUT-SYST-SCI-ENG = "International Journal of Computer
Systems Science and Engineering"}
@String{j-INT-J-ELECTRON = "International Journal of Electronics
Theoretical \& Experimental"}
@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations
of Computer Science"}
@String{j-INT-J-ROBOTICS-RES = "International Journal of Robotics Research"}
@String{j-INTEGRATION-VLSI-J = "Integration, the VLSI journal"}
@String{j-ISR = "Information Storage and Retrieval"}
@String{j-J-ACM = "Journal of the Association for
Computing Machinery"}
@String{j-J-ALG = "Journal of Algorithms"}
@String{j-J-AM-SOC-INF-SCI = "Journal of the American Society for
Information Science"}
@String{j-J-AUTO-REASON = "Journal of Automated Reasoning"}
@String{j-J-CHEM-INFO-COMP-SCI = "Journal of Chemical Information and
Computer Sciences"}
@String{j-J-CHINESE-INST-ENG = "Journal of Chinese Institute of Engineers"}
@String{j-J-COMB-DES = "Journal of Combinatorial Designs"}
@String{j-J-COMB-THEORY-A = "Journal of Combinatorial Theory (Series A)"}
@String{j-J-COMP-SYS-SCI = "Journal of Computer and System
Sciences"}
@String{j-J-COMPUTATIONAL-CHEM = "Journal of Computational Chemistry"}
@String{j-J-CRYPTOLOGY = "Journal of Cryptology"}
@String{j-J-DATABASE-ADM = "J. Database Adm."}
@String{j-J-DOC = "Journal of Documentation"}
@String{j-J-ELISHA-MITCHELL-SCI-SOC = "Journal of the Elisha Mitchell
Scientific Society"}
@String{j-J-GRAPHICS-GPU-GAME-TOOLS = "Journal of Graphics, GPU, and Game Tools"}
@String{j-J-GRID-COMP = "Journal of Grid Computing"}
@String{j-J-INF-PROCESS = "Journal of the Information Processing
Society of Japan"}
@String{j-J-INFO-ENG = "Journal of Information and Engineering"}
@String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
@String{j-J-PAS-ADA-MOD = "Journal of Pascal, Ada and Modula-2"}
@String{j-J-SUPERCOMPUTING = "The Journal of Supercomputing"}
@String{j-J-SYST-SOFTW = "The Journal of Systems and Software"}
@String{j-J-UCS = "J.UCS: Journal of Universal Computer
Science"}
@String{j-JAVA-REPORT = "{Java} Report: The Source for {Java}
Development"}
@String{j-LAB-MICROCOMP = "Laboratory microcomputer"}
@String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in CS"}
@String{j-LINUX-J = "Linux Journal"}
@String{j-MAPLE-TECH-NEWS = "Maple Technical Newsletter"}
@String{j-MATH-COMPUT-SCI = "Mathematics in Computer Science"}
@String{j-MATH-MAG = "Mathematics Magazine"}
@String{j-MATH-RECR-ESSAYS = "Mathematical Recreations and Essays"}
@String{j-MATH-SYS-THEORY = "Mathematical Systems Theory"}
@String{j-MATHEMATICA-J = "Mathematica Journal"}
@String{j-MICROCOMPUT-APPL = "Microcomputer Applications"}
@String{j-MICROPROC-MICROPROG = "Microprocessing and Microprogramming"}
@String{j-NAMS = "Notices of the American Mathematical
Society"}
@String{j-NEURAL-NETWORKS = "Neural Networks"}
@String{j-NEW-GEN-COMP = "New Generation Computing"}
@String{j-NORDIC-J-COMPUT = "Nordic Journal of Computing"}
@String{j-NUCLEIC-ACIDS-RES = "Nucleic Acids Research"}
@String{j-OPER-RES-LETT = "Operations Research Letters"}
@String{j-OPER-SYS-REV = "Operating Systems Review"}
@String{j-ORSA-J-COMPUT = "ORSA Journal on Computing"}
@String{j-PARALLEL-ALGORITHMS-APPL = "Parallel Algorithms and Applications"}
@String{j-PARALLEL-COMPUTING = "Parallel Computing"}
@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}
@String{j-PATTERN-RECOGN = "Pattern Recognition"}
@String{j-PATTERN-RECOGN-LETT = "Pattern Recognition Letters"}
@String{j-PC-MAGAZINE = "PC Magazine"}
@String{j-PERF-EVAL = "Performance evaluation"}
@String{j-PROC-ICASSP = "Proceedings of the International Conference
on Acoustics, Speech, and Signal Processing"}
@String{j-PROC-INT-CONF-PAR-PROC = "Proceedings of the International
Conference on Parallel Processing"}
@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}
@String{j-PROG-COMP-SOFT = "Programming and Computer Software;
translation of Programmirovaniye,
(Moscow, USSR) Plenum"}
@String{j-PROGRAM-J = "Programmer's Journal"}
@String{j-RIV-INFO-MILANO = "Rivista di Informatica (Milano)"}
@String{j-SCIENCE = "Science"}
@String{j-SIAM-J-ALG-DISC-METH = "SIAM Journal of Algebraic Discrete Methods"}
@String{j-SIAM-J-COMPUT = "SIAM Journal on Computing"}
@String{j-SIAM-J-DISCR-MATH = "SIAM Journal on Discrete Mathematics"}
@String{j-SIGADA-LETTERS = "ACM SIGADA Ada Letters"}
@String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest
Group on Computer Science Education)"}
@String{j-SIGIR-FORUM = "SIGIR forum"}
@String{j-SIGMETRICS = "ACM SIGMETRICS Performance Evaluation Review"}
@String{j-SIGMOD = "SIGMOD Record (ACM Special Interest
Group on Management of Data)"}
@String{j-SIGPLAN = "SIGPLAN Notices"}
@String{j-SIGSAM = "SIGSAM Bulletin (ACM Special Interest Group
on Symbolic and Algebraic Manipulation)"}
@String{j-SIGSMALL-PC-NOTES = "SIGSMALLslash PC Notes"}
@String{j-SOVIET-PHYS-DOKL = "Soviet Physics---Doklady"}
@String{j-SPE = "Software---Practice and Experience"}
@String{j-SYS-COMP-JAPAN = "Systems and computers in Japan"}
@String{j-TAAS = "ACM Transactions on Autonomous and Adaptive
Systems (TAAS)"}
@String{j-TALG = "ACM Transactions on Algorithms"}
@String{j-TCBB = "IEEE/ACM Transactions on Computational
Biology and Bioinformatics"}
@String{j-TECS = "ACM Transactions on Embedded Computing
Systems"}
@String{j-THEOR-COMP-SCI = "Theoret. Comput. Sci."}
@String{j-TISSEC = "ACM Transactions on Information and System
Security"}
@String{j-TOCS = "ACM Transactions on Computer Systems"}
@String{j-TODAES = "ACM Transactions on Design Automation of
Electronic Systems."}
@String{j-TODS = "ACM Transactions on Database Systems"}
@String{j-TOG = "ACM Transactions on Graphics"}
@String{j-TOIS = "ACM Transactions on Information Systems"}
@String{j-TOIT = "ACM Transactions on Internet Technology
(TOIT)"}
@String{j-TOMCCAP = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOMS = "ACM Transactions on Mathematical Software"}
@String{j-TOOIS = "ACM Transactions on Office
Information Systems"}
@String{j-TOPLAS = "ACM Transactions on Programming
Languages and Systems"}
@String{j-TOSN = "ACM Transactions on Sensor Networks"}
@String{j-TRANS-SAIEE = "Transactions --- The South African
Institute of Electrical
Engineers. Handelinge --- Die
Suid-Afrikaanse Instituut van
Elektriese Ingenieurs"}
@String{j-TRETS = "ACM Transactions on Reconfigurable Technology
and Systems"}
@String{j-TUGboat = "TUGboat"}
@String{j-TWEB = "ACM Transactions on the Web (TWEB)"}
@String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"}
@String{j-WIRED = "Wired"}
%%% ====================================================================
%%% Organization abbreviations:
%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-AFIPS = "AFIPS Press"}
@String{pub-AFIPS:adr = "Montvale, NJ, USA"}
@String{pub-ANSI = "American National Standards Institute"}
@String{pub-ANSI:adr = "1430 Broadway, New York, NY 10018, USA"}
@String{pub-AP = "Academic Press"}
@String{pub-AP:adr = "New York, NY, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-BC = "Brooks\slash Cole"}
@String{pub-BC:adr = "Pacific Grove, CA, USA"}
@String{pub-BIBLIO-INST = "Bibliographisches Institut"}
@String{pub-BIBLIO-INST:adr = "Mannheim, Germany"}
@String{pub-BIRKHAUSER = "Birkh{\"{a}}user"}
@String{pub-BIRKHAUSER:adr = "Cambridge, MA, USA; Berlin, Germany; Basel,
Switzerland"}
@String{pub-CRC = "CRC Press"}
@String{pub-CRC:adr = "2000 N.W. Corporate Blvd., Boca Raton,
FL 33431-9868, USA"}
@String{pub-CSP = "Computer Science Press"}
@String{pub-CSP:adr = "11 Taft Court, Rockville, MD 20850,
USA"}
@String{pub-CUP = "Cambridge University Press"}
@String{pub-CUP:adr = "Cambridge, UK"}
@String{pub-ELLIS-HORWOOD = "Ellis Horwood"}
@String{pub-ELLIS-HORWOOD:adr = "New York, NY, USA"}
@String{pub-GORDON-BREACH = "Gordon and Breach"}
@String{pub-GORDON-BREACH:adr = "Langhorne, PA, USA"}
@String{pub-HANSER = "Carl Hanser"}
@String{pub-HANSER:adr = "M{\"u}nchen, Germany"}
@String{pub-HARTUNG-GORRE = "Hartung-Gorre Verlag"}
@String{pub-HARTUNG-GORRE:adr = "Konstanz, Switzerland"}
@String{pub-HRW = "Holt, Rinehart, and Winston"}
@String{pub-HRW:adr = "New York, NY, USA"}
@String{pub-IEEE = "IEEE Computer Society Press"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-ISO = "International Organization for
Standardization"}
@String{pub-ISO:adr = "Geneva, Switzerland"}
@String{pub-JW = "John Wiley"}
@String{pub-JW:adr = "New York, NY, USA"}
@String{pub-MACMILLAN = "Macmillan Publishing Company"}
@String{pub-MACMILLAN:adr = "New York, NY, USA"}
@String{pub-MH = "Mc{\-}Graw-Hill"}
@String{pub-MH:adr = "New York, NY, USA"}
@String{pub-MIT = "MIT Press"}
@String{pub-MIT:adr = "Cambridge, MA, USA"}
@String{pub-MITCHELL = "Mitchell Publishing, Inc."}
@String{pub-MITCHELL:adr = "Santa Cruz, CA, USA"}
@String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "San Francisco, CA"}
@String{pub-NASA = "National Aeronautics and Space
Administration"}
@String{pub-NASA:adr = "Washington, DC, USA"}
@String{pub-NH = "North-Hol{\-}land"}
@String{pub-NH:adr = "Amsterdam, The Netherlands"}
@String{pub-NIST = "National Institute for Standards and
Technology"}
@String{pub-NIST:adr = "Gaithersburg, MD 20899-8900, USA"}
@String{pub-OHMSHA = "Ohmsha, Ltd."}
@String{pub-OHMSHA:adr = "3-1 Kanda Nishiki-cho, Chiyoda-ku, Tokyo
101, Japan"}
@String{pub-OLDENBOURG = "R. Oldenbourg Verlag"}
@String{pub-OLDENBOURG:adr = "Munich, Germany and Vienna, Austria"}
@String{pub-OUP = "Oxford University Press"}
@String{pub-OUP:adr = "Walton Street, Oxford OX2 6DP, UK"}
@String{pub-PENN-STATE-UNIV-PRESS = "Pennsylvania State University
Press"}
@String{pub-PENN-STATE-UNIV-PRESS:adr = "University Park, PA, USA"}
@String{pub-PERGAMON = "Pergamon Press"}
@String{pub-PERGAMON:adr = "Oxford, UK"}
@String{pub-PH = "Pren{\-}tice-Hall"}
@String{pub-PH:adr = "Englewood Cliffs, NJ 07632, USA"}
@String{pub-PLENUM = "Plenum Press"}
@String{pub-PLENUM:adr = "New York, NY, USA"}
@String{pub-PRINCETON = "Princeton University Press"}
@String{pub-PRINCETON:adr = "Princeton, NJ, USA"}
@String{pub-RESTON = "Reston Publishing Co. Inc."}
@String{pub-RESTON:adr = "Reston, VA, USA"}
@String{pub-SF = "Scott, Foresman and Company"}
@String{pub-SF:adr = "Glenview, IL, USA"}
@String{pub-SIAM = "Society for Industrial and Applied
Mathematics"}
@String{pub-SIAM:adr = "Philadelphia, PA, USA"}
@String{pub-SPARTAN = "Spartan Books"}
@String{pub-SPARTAN:adr = "New York, NY, USA"}
@String{pub-SRA = "Science Research Associates, Inc."}
@String{pub-SRA:adr = "Chicago, IL, USA"}
@String{pub-SV = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg,
Germany~/ London, UK~/ etc."}
@String{pub-TEUBNER = "B. G. Teubner"}
@String{pub-TEUBNER:adr = "Stuttgart, Germany"}
@String{pub-USENIX = "USENIX"}
@String{pub-USENIX:adr = "San Francisco, CA, USA"}
@String{pub-USGPO = "United States Government Printing
Office"}
@String{pub-USGPO:adr = "Washington, DC, USA"}
@String{pub-VAHLEN = "Franz Vahlen"}
@String{pub-VAHLEN:adr = "M{\"u}nchen, Germany"}
@String{pub-VIEWEG = "Friedrich Vieweg und Sohn"}
@String{pub-VIEWEG:adr = "Braunschweig, Germany"}
@String{pub-VNR = "Van Nostrand Reinhold"}
@String{pub-VNR:adr = "New York, NY, USA"}
@String{pub-WESTERN-PERIODICALS = "Western Periodicals Co.,"}
@String{pub-WESTERN-PERIODICALS:adr = "North Hollywood, CA"}
@String{pub-WILEY-INTERSCIENCE = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}
@String{pub-WORLD-SCI = "World Scientific Publishing
Co. Pte. Ltd."}
@String{pub-WORLD-SCI:adr = "P. O. Box 128, Farrer Road,
Singapore 9128"}
%%% ====================================================================
%%% Series abbreviations:
@String{ser-LNAI = "Lecture Notes in Artificial Intelligence"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
%%% ====================================================================
%%% Bibliography entries.
@Book{Ball:1939:MRE,
author = "W. W. Rouse (Walter William Rouse) Ball and H. S. M.
(Harold Scott MacDonald [``Donald'']) Coxeter",
title = "Mathematical recreations and essays",
publisher = pub-MACMILLAN,
address = pub-MACMILLAN:adr,
edition = "11th",
pages = "45",
year = "1939",
LCCN = "QA95 .B3 1939",
bibdate = "Tue Nov 05 08:52:38 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "According to Knuth \cite[p.~507]{Knuth:1973:ACP}, this
is one of two papers that first discuss the birthday
paradox: ``if 23 or more people are present in the same
room, chances are good that two of them will have the
same month and day of birth! In other words, if we
select a random function which maps 23 keys into a
table of size 365, the probability that no two keys map
into the same location is only 0.4927 (less than
one-half).'' The discovery is credited to unpublished
work of H. Davenport (1927). See also
\cite{vonMises:1939:AB}.",
acknowledgement = ack-nhfb,
keywords = "Ball, W. W. Rouse (Walter William Rouse), 1850--1925",
remark = "A Web search turned up this truncated comment by David
Singmaster
(http://anduin.eldar.org/~problemi/singmast/queries.html):
``Birthday Paradox. Feller cites von Mises (1938--39),
but von Mises gets the expected number of repetitions,
not the usual result. Ball, MRE (11th ed., 1939) cites
Davenport, but Coxeter says that Davenport did not
publish anything on it and others, including Mrs
Davenport, say that Davenport explicitly denied
originality for it. However, George Tyson, who was a
student [text truncated]''",
}
@Article{vonMises:1939:AB,
author = "R. von Mises",
title = "{{\"U}ber Aufteilungs- und
Besetzungswahrscheinlichkeiten}. ({German}) [On
Partitioning and Occupation Probabilities]",
journal = "{\.I}stanbul {\"U}niversitesi Fen Fak{\"u}ltesi
Mecmuasi",
volume = "4",
number = "??",
pages = "145--163",
year = "1939",
bibdate = "Thu Jul 21 09:15:52 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also \cite{Ball:1939:MRE}.",
acknowledgement = ack-nhfb,
altjournal = "Revue de la Facult{\'e} des Sciences de l'Universite
d'Istanbul",
}
@Book{Feller:1950:IPT,
author = "W. Feller",
title = "An Introduction to Probability Theory and its
Applications",
publisher = pub-JW,
address = pub-JW:adr,
pages = "???",
year = "1950",
LCCN = "QA273 .F37",
bibdate = "Sat Jul 16 00:30:14 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See the discussion of the birthday paradox in Section
2.3.",
acknowledgement = ack-nhfb,
}
@Unpublished{Amdahl:1953:xxx,
author = "Gene M. Amdahl and Elaine M. Boehme and N. Rochester
and Arthur L. Samuel",
title = "???",
year = "1953",
bibdate = "Fri Jul 15 23:08:54 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "The year is uncertain (???). Amdahl originated the
idea of open addressing with linear probing, which was
later independently rediscovered and published
\cite{Ershov:1958:xxx}.",
acknowledgement = ack-nhfb,
}
@Unpublished{Lin:1953:xxx,
author = "A. D. Lin",
title = "???",
year = "1953",
bibdate = "Fri Jul 15 23:04:25 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "The year is uncertain (???). Extends
\cite{Luhn:1953:xxx} with an alternative overflow
handling technique using ``degenerative addresses''
\cite[p.~541]{Knuth:1973:ACP}.",
acknowledgement = ack-nhfb,
}
@Unpublished{Luhn:1953:xxx,
author = "Hans Peter Luhn",
title = "???",
month = jan,
year = "1953",
bibdate = "Fri Apr 30 11:13:48 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Internal IBM memo that first suggested the idea of
hashing, and one of the first applications of linked
linear lists. Luhn is also the inventor of KWIC
indexing, in 1960 \cite[p.~437]{Knuth:1973:ACP}. See
also \cite{Lin:1953:xxx}.",
acknowledgement = ack-nhfb,
note2 = "OCLC contains an entry for a 1953 IBM report entitled
``Self-demarcating code words; a set of three and four
letter code words with serially-unique and disjunctive
combination-forming characteristics''. Was this the one
Knuth refers to?",
}
@Article{Dumey:1956:IRR,
author = "Arnold I. Dumey",
title = "Indexing for Rapid Random Access Memory Systems",
journal = j-COMP-AUTO,
volume = "5",
number = "12",
pages = "6--9",
month = dec,
year = "1956",
CODEN = "CPAUAJ",
ISSN = "0010-4795, 0887-4549",
bibdate = "Sat Jul 16 10:47:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "First paper in open literature on hashing. First use
of hashing by taking the modulus of division by a prime
number. Mentions chaining for collision handling, but
not open addressing. See \cite{Ershov:1958:xxx} for the
latter.",
acknowledgement = ack-nhfb,
}
@Article{Peterson:1957:ARA,
author = "W. W. Peterson",
title = "Addressing for random-access storage",
journal = j-IBM-JRD,
volume = "1",
number = "2",
pages = "130--146",
month = apr,
year = "1957",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Tue Sep 06 20:55:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "First major paper dealing with the problem of
searching in large files. Defined open addressing in
general, analyzed the performance of uniform hashing,
and the behavior of linear open addressing with various
bucket sizes.",
acknowledgement = ack-nhfb,
country = "USA",
date = "00/00/00",
descriptor = "Hash coding;",
enum = "2417",
language = "English",
location = "PKI-OG: Li-Ord.Le",
references = "0",
revision = "21/04/91",
town = "Yorktown Heights",
}
@Article{Ershov:1958:xxx,
author = "A. P. Ershov",
title = "???",
journal = j-DOKL-AKAD-NAUK,
volume = "118",
number = "??",
pages = "427--430",
year = "1958",
CODEN = "DANKAS",
ISSN = "0002-3264",
bibdate = "Fri Apr 30 11:08:43 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Rediscovery and first publication of linear open
addressing. See
\cite{Amdahl:1953:xxx,Dumey:1956:IRR}.",
acknowledgement = ack-nhfb,
}
@Article{Williams:1959:HII,
author = "F. A. Williams",
title = "Handling Identifiers as Internal Symbols in Language
Processors",
journal = j-CACM,
volume = "2",
number = "6",
pages = "21--24",
month = jun,
year = "1959",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jul 16 11:42:12 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Johnson:1961:ICM,
author = "L. R. Johnson",
title = "An Indirect Chaining Method for Addressing on
Secondary Keys",
journal = j-CACM,
volume = "4",
number = "5",
pages = "218--222",
month = may,
year = "1961",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Sep 26 23:36:24 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Direct file with rings to access records by other
attributes, with analysis.",
}
@Article{Schay:1962:AFA,
author = "G. {Schay, Jr.} and W. G. Spruth",
title = "Analysis of a File Addressing Method",
journal = j-CACM,
volume = "5",
number = "8",
pages = "459--462",
month = aug,
year = "1962",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Nov 25 18:19:40 MST 2005",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Early analysis of linear probing.",
abstract = "This paper presents a new file addressing method based
on the calculation of an address from the
identification of a record. For large recirculating
type files, it seems to be more advantageous than
customary ones. The probability distribution of the
displacement of records from their calculated address,
which is one less than the number of probes required to
address a record, is computed on the basis of a Markov
chain model. For the reader not interested in the
mathematics, the introduction and the summary should be
sufficient.",
acknowledgement = ack-nhfb,
keywords = "hash table load factor; linear probing",
}
@Article{Buchholz:1963:FOA,
author = "Werner Buchholz",
title = "File Organization and Addressing",
journal = j-IBM-SYS-J,
volume = "2",
number = "1",
pages = "86--111",
month = jun,
year = "1963",
CODEN = "IBMSA7",
ISSN = "0018-8670",
bibdate = "Wed Jul 20 22:58:45 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Comprehensive survey of hashing, with a good
discussion of hash functions.",
acknowledgement = ack-nhfb,
}
@Article{Greniewski:1963:ELK,
author = "M. Greniewski and W. Turski",
title = "The External Language {KLIPA} for the {URAL-2} Digital
Computer",
journal = j-CACM,
volume = "6",
number = "6",
pages = "322--324",
month = jun,
year = "1963",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jul 16 10:47:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Early work on derivation of hash functions.",
acknowledgement = ack-nhfb,
}
@Article{Hanan:1963:ACT,
author = "M. Hanan and F. P. Palermo",
title = "An Application of Coding Theory to a File Address
Problem",
journal = j-IBM-JRD,
volume = "7",
number = "2",
pages = "127--129",
month = apr,
year = "1963",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Tue Sep 06 20:56:25 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Mathematical statement of direct access problem.
Polynomial hashing.",
}
@InProceedings{Lin:1963:KAR,
author = "A. D. Lin",
title = "Key addressing of random access memories by radix
transformation",
crossref = "AFIPS:1963:PSJ",
pages = "355--366",
year = "1963",
bibdate = "Mon Sep 26 23:41:05 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{McIlroy:1963:VMF,
author = "M. D. McIlroy",
title = "A Variant Method of File Searching",
journal = j-CACM,
volume = "6",
number = "3",
pages = "101--101",
year = "1963",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Sep 26 23:53:54 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Schay:1963:MKA,
author = "G. Schay and N. Raver",
title = "A Method for Key-to-Address Transformation",
journal = j-IBM-JRD,
volume = "7",
number = "2",
pages = "121--126",
month = apr,
year = "1963",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Mon Sep 26 23:59:15 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Trainiter:1963:ARA,
author = "M. Trainiter",
title = "Addressing for Random-Access Storage with Multiple
Bucket Capabilities",
journal = j-J-ACM,
volume = "??",
number = "3",
pages = "307--315",
month = jul,
year = "1963",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Mon Oct 24 17:55:13 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Martin:1964:HCF,
author = "William A. Martin",
title = "Hash-Coding Functions of a Complex Variable",
type = "Report",
number = "A. I. MEMO 70 and MAC-M-165",
institution = inst-MIT-AI,
address = inst-MIT:adr,
pages = "??",
month = jun,
year = "1964",
bibdate = "Thu Jul 21 08:37:46 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Batson:1965:OST,
author = "A. Batson",
title = "The organization of symbol tables",
journal = j-CACM,
volume = "8",
number = "2",
pages = "111--112",
month = feb,
year = "1965",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Sep 19 10:21:06 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "An efficient symbol table organization is an important
feature in the design of any compiler. During the
construction of the Virginia ALGOL 60 compiler for the
Burroughs B205, the primary consideration in the symbol
table design was that the recognition of identifiers
and reserved words should be as rapid as possible. the
general features of the technique are described.",
acknowledgement = ack-nhfb,
checked = "19940409",
refs = "0",
sjb = "Describes a technique where all identifiers are stored
in a stack and lookup is a linear search. Not
surprisingly criticizes this for being slow. Instead of
this method, suggests using a hash table with a linear
probe on collision.",
}
@Article{Ariwasa:1968:RHM,
author = "Makota Ariwasa",
title = "Residue Hash Method",
journal = j-J-INF-PROCESS,
volume = "12",
number = "??",
pages = "??",
month = feb,
year = "1968",
CODEN = "JIPRDE",
ISSN = "0387-6101",
bibdate = "Thu Jul 21 09:16:05 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Beyer:1968:LEC,
author = "J. D. Beyer and W. D. Maurer and Frank K. Bamberger",
title = "Letter to the {Editor}: Comments on ``An Improved Hash
Code for Scatter Storage''",
journal = j-CACM,
volume = "11",
number = "5",
pages = "378--378",
month = may,
year = "1968",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Nov 25 18:20:19 MST 2005",
bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Hopgood:1968:STO,
author = "F. R. A. Hopgood",
title = "A Solution for the Table Overflow Problem for Hash
Tables",
journal = j-COMP-BULL,
volume = "??",
number = "??",
pages = "??",
month = mar,
year = "1968",
bibdate = "Thu Jul 21 09:16:16 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Hopgood:1968:xxx,
author = "F. R. A. Hopgood",
title = "???",
journal = j-COMP-BULL,
volume = "11",
number = "??",
pages = "297--300",
year = "1968",
bibdate = "Fri Jul 15 22:51:48 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Presents algorithms for expanding and rehashing nearly
full hash tables.",
acknowledgement = ack-nhfb,
}
@Article{Maurer:1968:PTI,
author = "Ward Douglas Maurer",
title = "Programming Technique: An improved hash code for
scatter storage",
journal = j-CACM,
volume = "11",
number = "1",
pages = "35--38",
month = jan,
year = "1968",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Nov 25 18:20:17 MST 2005",
bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Maurer68;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Introduced is a hash coding method based on
fixed-point division rather than multiplication or
logical operations. This new method allows the hash
table to have almost any length. Also a new method of
handling collisions is discussed. Known as quadratic
search, this method is faster than random search and
free from the ``clusters'' that build up with a linear
search.",
acknowledgement = ack-nhfb,
keywords = "hash code; hash table; scatter storage; searching",
oldlabel = "Maurer68",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Maurer68",
}
@Article{Morris:1968:SST,
author = "Robert Morris",
title = "Scatter Storage Techniques",
journal = j-CACM,
volume = "11",
number = "1",
pages = "38--44",
month = jan,
year = "1968",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jul 16 10:46:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Influential survey of the subject of hashing, and
first introduction of random probing with secondary
clustering. Appears to be the first publication where
the word `hashing' appeared, although it was in common
use at the time. Knuth \cite[p.~542]{Knuth:1973:ACP}
found only one earlier printed use of the word, in a
1961 unpublished memorandum by W. W. Peterson.",
acknowledgement = ack-nhfb,
}
@PhdThesis{deBalbine:1969:CAR,
author = "Guy {de Balbine}",
title = "Computational Analysis of the Random Components
Induced by a Binary Equivalence Relation",
type = "Ph.D. thesis",
school = "California Institute of Technology",
address = "Pasadena, CA, USA",
pages = "168",
year = "1969",
bibdate = "Fri Apr 30 11:21:28 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "First use of second hash function for computing next
hash table location after a collision. See also
\cite{Bell:1970:LQH}.",
abstract = "The problem of partitioning into classes by means of a
binary equivalence relation is investigated. Several
algorithms for determining the number of components in
the graph associated with a particular set of elements
are constructed and compared. When the classification
process operates on independently-drawn samples of $n$
distinct elements from a population, the expected
number of components is shown to be obtainable
recursively for a class of problems called separable;
in all cases, estimates are available to reach any
desired level of accuracy. Clustering models in
Euclidean space are analyzed in detail and asymptotic
formulas obtained to complement experiments.
Conjectures concerning the general behavior of the
expected number of components are presented also.
Finally, several computational tools of general
interest are improved significantly.",
acknowledgement = ack-nhfb,
remark = "Abstract in Dissertation Abstracts, v30 n2 p645b
1969.",
}
@Article{Feldman:1969:ABA,
author = "Jerome A. Feldman and Paul D. Rovner",
title = "An {Algol}-Based Associative Language",
journal = j-CACM,
volume = "12",
number = "8",
pages = "439--449",
month = aug,
year = "1969",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Nov 25 18:20:27 MST 2005",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib;
ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A high level programming language for large, complex
associative structures has been designed and
implemented. The underlying data structure has been
implemented using a hash-coding technique. The
discussion includes a comparison with other work and
examples of applications of the language.",
acknowledgement = ack-nhfb,
classcodes = "C6140D (High level languages)",
corpsource = "Stanford Univ., CA, USA",
keywords = "ALGOL; associative; Associative; data structure; Data
Structure; data structures; LEAP; procedure oriented
languages; programming language; Programming Language;
SAIL",
remark = "Description of LEAP language and data structure of
binary relations.",
}
@InProceedings{Files:1969:IRS,
author = "John R. Files and Harry D. Huskey",
title = "An Information Retrieval System Based on Superimposed
Coding",
crossref = "AFIPS:1969:ACP",
pages = "??",
year = "1969",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Proposal for Word-in-text retrieval system with a hash
code for access to pointer tables for each word
class.",
}
@InProceedings{Olsen:1969:RRF,
author = "Charles A. Olsen",
title = "Random Access File Organization for Indirectly
Accessed Records",
crossref = "ACM:1969:PAN",
pages = "539--549",
year = "1969",
bibdate = "Tue Jul 19 22:10:27 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Discusses practical considerations in the design of
external scatter tables.",
acknowledgement = ack-nhfb,
}
@Article{Bell:1970:LQH,
author = "James R. Bell and Charles H. Kaman",
title = "The Linear Quotient Hash Code",
journal = j-CACM,
volume = "13",
number = "11",
pages = "675--677",
month = nov,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Jul 19 17:51:20 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Independent discovery of technique of secondary hash
functions first proposed by
\cite{deBalbine:1969:CAR}.",
acknowledgement = ack-nhfb,
}
@Article{Bell:1970:QQM,
author = "J. R. Bell",
title = "Quadratic Quotient Method --- {A} Hash Code
Eliminating Secondary Clustering",
journal = j-CACM,
volume = "13",
number = "2",
pages = "107--9",
month = feb,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Secondary clustering as a cause of hash code
inefficiency is discussed, and a new hashing method
based on its elimination is presented. Comparisons with
previous methods are made both analytically and
empirically.",
acknowledgement = ack-nhfb,
keywords = "computers; programming",
}
@Article{Bloom:1970:STO,
author = "Burton H. Bloom",
title = "Space/Time Trade-offs in Hash Coding with Allowable
Errors",
journal = j-CACM,
volume = "13",
number = "7",
pages = "422--426",
month = jul,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sun Jul 17 19:39:54 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "bit vector filter CACM",
remark = "Phantom use of a direct access list.",
}
@Article{Bloom:1970:STT,
author = "B. H. Bloom",
title = "Space\slash Time Trade-Offs in Hash Coding with
Allowable Errors",
journal = j-CACM,
volume = "13",
number = "7",
pages = "422--6",
month = jul,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Trade-offs among certain computational factors in hash
coding are analyzed. The paradigm problem considered is
that of testing a series of messages one-by-one for
membership in a given set of messages. Two new
hash-coding methods are examined and compared with a
particular conventional hash-coding method. The
computational factors considered are the size of the
hash area (space), the time required to identify a
message as a nonmember of the given set (reject time),
and an allowable error frequency. The new methods are
intended to reduce the amount of space required to
contain the hash-coded information from that associated
with conventional methods. The reduction in space is
accomplished by exploiting the possibility that a small
fraction of errors of commission may be tolerable in
some applications, in particular, applications in which
a large amount of data is involved and a core resident
hash area is consequently not feasible using
conventional methods. An example is discussed which
illustrates possible areas of application for the new
method.",
acknowledgement = ack-nhfb,
journalabr = "Commun ACM",
keywords = "codes; computers; computers, errors; hash coding;
inf",
}
@Article{Coffman:1970:FSU,
author = "E. G. {Coffman, Jr.} and J. Eve",
key = "Coffman \& Eve",
title = "File Structures Using Hashing Functions",
journal = j-CACM,
volume = "13",
number = "7",
pages = "427--432, 436",
month = jul,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A general method of file structuring is proposed which
uses a hashing function to define tree structure. Two
types of such trees are examined, and their relation to
trees studied in the past is explained. Results for the
probability distributions of path lengths are derived
and illustrated.",
acknowledgement = ack-nhfb,
journalabr = "Commun ACM",
keywords = "computers; data processing; data structures; file
organization; hash coding; information storage and
retrie; tree structures",
remark = "Tree structure with branching based on bit values of
key code.",
}
@Article{Day:1970:FTQ,
author = "A. C. Day",
title = "Full Table Quadratic Searching for Scatter Storage",
journal = j-CACM,
volume = "13",
number = "8",
pages = "481--482",
month = aug,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/Pre.1975.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The quadratic residue search method for hash tables
avoids much of the clustering experienced with a linear
search method. The simple quadratic search only
accesses half the table. It has been shown that when
the length of the table is a prime of the form 4n plus
3, where n is an integer, the whole table may be
accessed by two quadratic searches plus a separate
access for the original entry point. A search method is
presented which is computationally simple, has all the
advantages of the quadratic search, and yet accesses
all the table in one sweep.",
acknowledgement = ack-nhfb,
journalabr = "Commun ACM",
keywords = "CACMA; computers; computers, data storage; hash
coding; programming; table look-up",
}
@Article{Lamport:1970:CBQ,
author = "Leslie Lamport",
title = "Comment on {Bell}'s Quadratic Quotient Method for Hash
Code Searching",
journal = j-CACM,
volume = "13",
number = "9",
pages = "573--574",
month = sep,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Thu Jul 21 09:16:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Radke:1970:UQR,
author = "C. E. Radke",
title = "The Use of Quadratic Residue Research",
journal = j-CACM,
volume = "13",
number = "2",
pages = "103--150",
month = feb,
year = "1970",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Sep 26 23:56:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Ullman:1970:DHF,
author = "Jeffrey D. Ullman",
title = "The Design of Hashing Functions",
number = "85",
institution = "Princeton University, Electrical Engineering
Department, TR",
pages = "??",
month = sep,
year = "1970",
bibdate = "Thu Jul 21 08:40:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Book{Harrison:1971:DSP,
author = "Malcolm C. Harrison",
title = "Data Structures and Programming",
publisher = "Courant Institute of Mathematical Sciences, New York
University",
address = "New York, NY, USA",
pages = "xii + 381",
month = apr,
year = "1971",
LCCN = "QA76.5 .H37",
bibdate = "Mon Oct 24 18:42:52 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also \cite{Harrison:1973:DSP}.",
acknowledgement = ack-nhfb,
remark = "Mainly in core algorithms; Chapter 9 suggests comb.
hashing.",
}
@Article{Harrison:1971:IST,
author = "M. C. Harrison",
title = "Implementation of the Substring Test by Hashing",
journal = j-CACM,
volume = "14",
number = "12",
pages = "777--779",
month = dec,
year = "1971",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jul 18 20:21:49 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also \cite{Tharp:1982:PTS}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Knott:1971:EOA,
author = "G. D. Knott",
booktitle = "ACM SIGFIDET, Codd(ed), 1971",
title = "Expandable Open Addressing Hash Table Storage and
Retrieval",
publisher = "????",
address = "????",
pages = "??",
year = "1971",
bibdate = "Thu Jul 21 08:40:21 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Lum:1971:KAT,
author = "V. Y. Lum and P. S. T. Yuen and M. Dodd",
title = "Key-to-Address Transform Techniques: {A} Fundamental
Performance Study on Large Existing Formatted Files",
journal = j-CACM,
volume = "14",
number = "4",
pages = "228--239",
month = apr,
year = "1971",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jul 16 10:48:52 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Survey of several hash functions, with performance
results.",
acknowledgement = ack-nhfb,
}
@Article{Martin:1971:DEA,
author = "William A. Martin",
title = "Determining the Equivalence of Algebraic Expressions
by Hash Coding",
journal = j-J-ACM,
volume = "18",
number = "4",
pages = "549--558",
month = oct,
year = "1971",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Wed Jul 20 23:02:13 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Price:1971:TLT,
author = "C. E. Price",
title = "Table Lookup Techniques",
journal = j-COMP-SURV,
volume = "3",
number = "2",
pages = "49--64",
month = jun,
year = "1971",
CODEN = "CMSVAN",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
bibdate = "Mon Sep 26 20:49:51 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "binary search; hashing; search techniques; table
lookup techniques",
}
@Article{Williams:1971:SUM,
author = "J. G. Williams",
title = "Storage Utilization in a Memory Hierarchy When Storage
Assignment is Performed by a Hashing Algorithm",
journal = j-CACM,
volume = "14",
number = "3",
pages = "172--5",
month = mar,
year = "1971",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The utilization of storage is studied in a two-level
memory hierarchy. The first storage level, which is the
fast store, is divided into a number of storage areas.
When an entry is to be filed in the hierarchy, a
hashing algorithm will attempt to place the entry into
one of these areas. If this particular area is full,
then the entry will be placed into the slower
second-level store, even though other areas in the
first-level store may have space available. Given that
N entries have been filed in the entire hierarchy, an
expression is derived for the expected number of
entries filed in the first-level store. This expression
gives a measure of how effectively the first-level
store is being used. By means of examples, storage
utilization is then studied as a function of the
hashing algorithm, the number of storage areas into
which the first-level store is divided and the total
size of the first-level store.",
acknowledgement = ack-nhfb,
journalabr = "Commun ACM",
keywords = "CACMA; computers, digital; storage allocation; storage
units",
}
@Article{Bell:1972:QQM,
author = "James R. Bell",
title = "The Quadratic Quotient Method: {A} Hash Code
Eliminating Secondary Clustering",
journal = j-CACM,
volume = "13",
number = "2",
pages = "107--109",
month = feb,
year = "1972",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Sep 06 19:49:51 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Hashida:1972:AM,
author = "O. Hashida",
title = "Analysis of multiqueue",
journal = j-EL-COMM-LAB,
volume = "20",
number = "??",
pages = "189--199",
year = "1972",
bibdate = "Thu Jul 21 09:17:05 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
country = "J",
date = "18/02/88",
descriptor = "Queueing system; polling; gated service; exhaustive
service;",
enum = "1292",
language = "English",
location = "PKI-OG: Li-Ord.Le",
references = "9",
revision = "21/04/91",
}
@Article{Hashida:1972:LAC,
author = "O. Hashida and K. Ohara",
title = "Line accommodation capacity of a communication control
unit",
journal = j-EL-COMM-LAB,
volume = "20",
number = "??",
pages = "231--239",
year = "1972",
bibdate = "Thu Jul 21 09:17:10 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
country = "J",
date = "18/02/88",
descriptor = "Queueing system; polling;",
enum = "1293",
language = "English",
location = "PKI-OG: Li-Ord.Le",
references = "3",
revision = "21/04/91",
}
@Article{Healey:1972:CEP,
author = "M. J. R. Healey",
title = "Checking the Execution of Programs by Hashing",
journal = j-IBM-TDB,
volume = "15",
number = "7",
pages = "??--??",
month = dec,
year = "1972",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IBM Tech Disclosure Bull",
keywords = "computer programming",
}
@Article{Hopgood:1972:QHM,
author = "F. R. A. Hopgood and J. Davenport",
title = "The Quadratic Hash Method When the Table Size is a
Power of $2$",
journal = j-COMP-J,
volume = "15",
number = "4",
pages = "314--315",
month = nov,
year = "1972",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Sep 29 08:52:07 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/",
note = "See correspondence \cite{Pawson:1973:CHT}.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150314.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/314.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/315.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Atlas Computer Lab., Chilton, Didcot, UK",
keywords = "codes; data handling; hash table; power of 2;
quadratic; table size",
remark = "Criteria for rehashing to a larger space.",
treatment = "P Practical",
}
@TechReport{Koehler:1972:SDB,
author = "Ch. Koehler",
title = "Ein System zur Darstellung und Bearbeitung
Assoziativer Datenstrukturen",
institution = "????",
address = "Bonn, Germany",
pages = "??",
year = "1972",
bibdate = "Thu Jul 21 08:41:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Adressierung, Assoziativ, Baum, Datenstruktur,
Hash-code, Leap, Netzwerk, Relationensystem,
Speicherkonzept, Speicherstruktur, Strukturanalyse,
Systemanalyse",
}
@Article{Luccio:1972:WIL,
author = "Fabrizio Luccio",
title = "Weighted Increment Linear Search for Scatter Tables",
journal = j-CACM,
volume = "15",
number = "12",
pages = "1045--1047",
month = dec,
year = "1972",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Thu Sep 22 11:29:43 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Lum:1972:ARK,
author = "Vincent Y. Lum and P. S. T. Yuen",
title = "Additional results on key-to-address transform
techniques: a fundamental performance study on large
existing formatted files",
journal = j-CACM,
volume = "15",
number = "11",
pages = "996--997",
month = nov,
year = "1972",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 07:00:17 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#LumY72;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
keywords = "file; file organisation; fundamental performance; hash
coding; key to address transform techniques; large
existing formatted files; organization; study",
oldlabel = "LumY72",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LumY72",
}
@TechReport{Mergenthaler:1972:HCT,
author = "Erhard Mergenthaler",
title = "Hash-code-techniken, Uebersicht",
institution = "????",
address = "Stuttgart, Germany",
pages = "??",
year = "1972",
bibdate = "Thu Jul 21 08:41:19 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Hash-code, Hash-verfahren, Hashing",
remark = "Informatik Hausarbeit, Ausfuehrliche Uebersicht ueber
Hash-techniken. Interner Bericht 01/73.",
}
@Article{Mullin:1972:IIS,
author = "James K. Mullin",
title = "An Improved Indexed-Sequential Access Method Using
Hashed Overflow",
journal = j-CACM,
volume = "15",
number = "5",
pages = "301--307",
month = may,
year = "1972",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Thu Jul 21 08:41:25 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Simon:1972:APN,
author = "J. C. Simon and G. Guiho",
title = "On algorithms preserving neighborhood, to file and
retrieve information in a memory",
journal = j-INT-J-COMPUT-INF-SCI,
volume = "1",
number = "1",
pages = "3--15",
month = mar,
year = "1972",
CODEN = "IJCIAH",
ISSN = "0091-7036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Univ. Paris, France",
keywords = "algorithms; approximation methods; binary search;
distance; file; hash coding; memory; memory size;
neighbourhood; number of access operations; probability
properties; retrieve; storage management; variation
properties",
treatment = "P Practical",
}
@Article{Ullman:1972:NEH,
author = "Jeffrey D. Ullman",
title = "A Note on the Efficiency of Hashing Functions",
journal = j-J-ACM,
volume = "19",
number = "3",
pages = "569--575",
month = jul,
year = "1972",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Tue Sep 27 00:04:12 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Early work on the problem of finding optimal hash
functions for open addressing.",
acknowledgement = ack-nhfb,
}
@Article{vanderPool:1972:OSA,
author = "J. A. van der Pool",
title = "Optimum Storage Allocation for Initial Loading of a
File",
journal = j-IBM-JRD,
volume = "16",
number = "6",
pages = "579--586",
month = nov,
year = "1972",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Tue Sep 27 00:05:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@PhdThesis{Webb:1972:DAE,
author = "D. A. Webb",
title = "The Development and Application of an Evaluation Model
for Hash Coding Systems",
type = "Ph.D. Thesis",
school = "Syracuse University",
address = "Syracuse, NY, USA",
month = aug,
year = "1972",
bibdate = "Tue Sep 27 00:09:20 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Arnold:1973:UHA,
author = "R. F. Arnold and W. E. Bass and M. H. Hartung and F.
D. Snow and R. D. Iii Stephens",
title = "Uniform Hashing Algorithm",
journal = j-IBM-TDB,
volume = "16",
number = "7",
pages = "2214--2216",
month = dec,
year = "1973",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A hashing algorithm is described that achieves a
uniform distribution of the virtual space onto the real
space. If the functions defined in the algorithm have
the further property of uniform random distribution,
additional properties are satisfied.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IBM Tech Disclosure Bull",
keywords = "computer programming",
}
@Article{Bays:1973:NWC,
author = "Carter Bays",
title = "A note on when to chain overflow items within a
direct-access table",
journal = j-CACM,
volume = "16",
number = "1",
pages = "46--47",
month = jan,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:24:06 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bays73a;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Univ. South Carolina, Columbia, SC, USA",
keywords = "chaining; collision; data handling; direct access
table; hash code; information; open hash; overflow
items; retrieval",
oldlabel = "Bays73a",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bays73a",
}
@Article{Bays:1973:RHC,
author = "Carter Bays",
title = "The Reallocation of Hash-Coded Tables",
journal = j-CACM,
volume = "16",
number = "1",
pages = "11--14",
month = jan,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "When the space allocation for a hash-coded table is
altered, the table entries must be rescattered over the
new space. A technique for accomplishing this
rescattering is presented. The technique is independent
of both the length of the table and the hashing
function used, and can be utilized in conjunction with
a linear reallocation of the table being rescattered.
Moreover, it can be used to eliminate previously
flagged deletions from any hash-coded table, or to
change from one hashing method to another. The
efficiency of the technique is discussed and
theoretical statistics are given.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer systems programming; data storage, digital;
dynamic storage; hash code; reallocation; scatter
storage",
remark = "Algorithm to handle increase or decrease within a
direct access table containing entries.",
}
@Article{Bays:1973:STS,
author = "C. Bays",
title = "Some Techniques for Structuring Chained Hash Tables",
journal = j-COMP-J,
volume = "16",
number = "2",
pages = "126--131",
month = may,
year = "1973",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Sep 29 08:52:11 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/160126.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/126.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/127.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/128.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/129.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/130.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_02/tiff/131.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Univ. South Carolina, Columbia, SC, USA",
keywords = "chained hash tables; data handling; structuring;
techniques",
}
@Article{Bookstein:1973:HST,
author = "Abraham Bookstein",
title = "On {Harrison}'s Substring Testing Technique",
journal = j-CACM,
volume = "16",
number = "3",
pages = "180--181",
month = mar,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:27:21 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bookstein73;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Univ. Chicago, IL, USA",
keywords = "chaining; collision; data handling; direct access
retrieval; substring testing technique",
oldlabel = "Bookstein73",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bookstein73",
}
@Article{Brent:1973:RRT,
author = "Richard P. Brent",
title = "Reducing the Retrieval Time of Scatter Storage
Techniques",
journal = j-CACM,
volume = "16",
number = "2",
pages = "105--109",
month = feb,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Modification of open addressing with double hashing to
reduce the average number of probes for a successful
search.",
abstract = "A new method for entering and retrieving information
in a hash table is described. The method is intended to
be efficient if most entries are looked up several
times. The expected number of probes to look up an
entry, predicted theoretically and verified by Monte
Carlo experiments, is considerably less than for other
comparable methods if the table is nearly full. An
example of a possible Fortran implementation is
given.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "Commun ACM",
keywords = "address calculation; computer programming languages
--- fortran; content addressing; data storage, digital
--- Random Access; hash addressing; information
retrieval systems; linear quotient method",
}
@Article{Davison:1973:RSC,
author = "G. A. Davison",
title = "Rapidly Searching for Character String Matches Using
Hash Coding",
journal = j-IBM-TDB,
volume = "16",
number = "1",
pages = "??--??",
month = jun,
year = "1973",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IBM Tech Disclosure Bull",
keywords = "computer programming",
}
@Article{Feldman:1973:CBS,
author = "J. A. Feldman and J. R. Low",
title = "Comment on {Brent}'s Scatter Storage Algorithm",
journal = j-CACM,
volume = "16",
number = "11",
pages = "??--??",
month = nov,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue May 28 11:57:54 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "Hashing, information storage and retrieval, scatter
storage, searching, symbol table",
}
@TechReport{Ghosh:1973:ACW,
author = "S. P. Ghosh and V. Y. Lum",
title = "An Analysis of Collisions When Hashing by Division",
type = "Technical Report",
number = "RJ-1218",
institution = inst-IBM,
address = inst-IBM:adr,
month = may,
year = "1973",
bibdate = "Mon Sep 26 23:33:08 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Gurski:1973:NAK,
author = "Aaron Gurski",
title = "A Note on Analysis of Keys for Use in Hashing",
journal = j-BIT,
volume = "13",
number = "1",
pages = "120--122",
year = "1973",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Mon Nov 16 16:10:56 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Digit selection by bit.",
}
@Book{Harrison:1973:DSP,
author = "Malcolm C. Harrison",
title = "Data-structures and Programming",
publisher = pub-SF,
address = pub-SF:adr,
pages = "322",
year = "1973",
ISBN = "0-673-05964-2",
ISBN-13 = "978-0-673-05964-2",
LCCN = "QA76.6 .H37",
bibdate = "Wed Jul 13 19:05:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See \cite{Harrison:1971:DSP}.",
acknowledgement = ack-nhfb,
}
@TechReport{Kennedy:1973:RSU,
author = "Ken Kennedy",
title = "Reduction in strength using hashed temporaries",
type = "Technical Report",
number = "SETL Newsletter \#102",
institution = "Courant Inst. of Math. Sciences, New York University,
New York",
pages = "??",
month = mar,
year = "1973",
bibdate = "Thu Jul 21 08:43:53 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Book{Knuth:1973:ACP,
author = "D. E. Knuth",
title = "The Art of Computer Programming, Sorting and
Searching",
volume = "3",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xi + 723",
year = "1973",
ISBN = "0-201-03803-X",
ISBN-13 = "978-0-201-03803-3",
LCCN = "QA76.5 .K74",
bibdate = "Wed Dec 15 15:47:47 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
annote-2 = "A basic source for computational algorithms such as
hashing (pp.506--568), search tree
construction(pp.406--505), and some notes on disk
performance evaluation (pp.361--371).",
descriptor = "Algorithmus, B-baum, Baum, Binaer-baum, Gestreute
Speicherung, Hash-verfahren, Mischen, Sortieren,
Speicherung, Suchen, Zugriff",
remark = "Standardwerk ueber Suchen und Sortieren 5. Sorting
5.1. Combinatorial Properties of Permutations 5.2.
Internal Sorting 5.3. Optimum Sorting 5.4. External
Sorting 5.5. Summary, History, and Bibliography 6.
Searching 6.1. Sequential Search 6.2. Searching By
Comparison of Keys 6.3. Digital Searching 6.4. Hashing
6.5. Retrieval on Secondary Keys Answers to Exercises
Appendix A: Tables of Numerical Quantities Appendix B:
Index to Notations Index and Glossary.",
}
@Article{Lum:1973:GPA,
author = "Vincent Y. Lum",
title = "General Performance Analysis of Key-to-Address
Transformation Methods Using an Abstract File Concept",
journal = j-CACM,
volume = "16",
number = "10",
pages = "603--612",
month = oct,
year = "1973",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Wed Oct 05 14:01:15 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "analysis and results using distributions from the
entire key domain.",
}
@Article{Mitra:1973:SHP,
author = "Debasis Mitra",
title = "Solution to the Hashing Problem for Code Length 3",
journal = j-INF-CONTROL,
volume = "23",
number = "3",
pages = "205--220",
month = oct,
year = "1973",
CODEN = "IFCNA4",
ISSN = "0019-9958",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "In the hashing procedure considered, each name in a
long list of names is associated with a hash code which
is a permutation of the triplet (1, 2, 3). The code
denotes an ordering of preferences of locations for
storing the name; the ith element of the code denotes
the ith most preferred location. In each sample three
names are picked at random from the list; the names are
then stored in a collection of three numbered
locations. The policy for storing is based on the
respective codes, i. e., at any stage a name is stored
in the most preferred of the empty locations. For each
sample the number of excess pokes is defined to be the
number of searched-but-occupied locations. The solution
given is to the problem of obtaining all probability
distributions of codes which minimize the expected
number of excess pokes.",
acknowledgement = ack-nhfb,
classification = "723; 731",
journalabr = "Inf Control",
keywords = "codes, symbolic",
}
@Article{Pawson:1973:CHT,
author = "A. J. D. Pawson and F. R. A. Hopgood",
title = "Correspondence: Hashing techniques for table
searching",
journal = j-COMP-J,
volume = "16",
number = "3",
pages = "285--285",
month = aug,
year = "1973",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 07 17:13:59 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/",
note = "See \cite{Hopgood:1972:QHM}.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/285.tif",
acknowledgement = ack-nhfb,
}
@Article{Perry:1973:IME,
author = "O. R. Perry",
title = "Indexing Method Employing Hashing",
journal = j-IBM-TDB,
volume = "16",
number = "3",
pages = "694--697",
month = aug,
year = "1973",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IBM Tech Disclosure Bull",
keywords = "data processing",
}
@Article{Rickman:1973:SIO,
author = "J. Rickman and W. E. Walden",
title = "Structures for an interactive on-line thesaurus",
journal = j-INT-J-COMPUT-INF-SCI,
volume = "2",
number = "2",
pages = "115--127",
month = jun,
year = "1973",
CODEN = "IJCIAH",
ISSN = "0091-7036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C7240 (Information
analysis and indexing)",
corpsource = "Pennsylvania State Univ., University Park, PA, USA",
keywords = "data structure; data structures; display formats; file
blocking; file structure; hashing function;
interactive; online; partial spellings; plant
pathology; sequential searches; thesauri; thesaurus;
user command language",
treatment = "P Practical",
}
@Article{Stahl:1973:HLB,
author = "Hans Michael Stahl",
title = "{Hashcodingverfahren}. [Hash Coding Techniques]",
journal = "Angewandte Informatik/Applied Informatics",
volume = "15",
number = "10",
pages = "435--440",
month = oct,
year = "1973",
CODEN = "AWIFA7",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various hash-coding techniques are considered. An
extension of the quadratic method is included. Besides
the average number of probes for each of the different
methods, the amount of time needed for a single probe
is discussed. To prove the analytical results, all
methods were simulated. Those methods found to be best
are presented in greater detail with their simulation
results and their flow charts.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Angew Inf Appl Inf",
keywords = "codes, symbolic",
language = "German",
}
@Article{vanderPool:1973:OSA,
author = "J. A. van der Pool",
title = "Optimum Storage Allocation for a File in Steady
State",
journal = j-IBM-JRD,
volume = "17",
number = "1",
pages = "27--38",
month = jan,
year = "1973",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Tue Sep 27 00:07:03 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Ackerman:1974:QSH,
author = "A. Frank Ackerman",
title = "Quadratic Search for Hash Tables of Size $p^n$",
journal = j-CACM,
volume = "17",
number = "3",
pages = "164",
month = mar,
year = "1974",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Wed Jul 20 23:01:58 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Amble:1974:OHT,
author = "O. Amble and D. E. Knuth",
title = "Ordered Hash Tables",
journal = j-COMP-J,
volume = "17",
number = "2",
pages = "135--142",
month = may,
year = "1974",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/17.2.135",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68A10",
MRnumber = "50 #1559",
MRreviewer = "A. L. Rosenberg",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/135.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/136.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/137.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/138.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/139.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/140.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/141.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/142.tif",
abstract = "Some variants of the traditional hash method, making
use of the numerical or alphabetical order of the keys,
lead to faster searching at the expense of a little
extra work when items are inserted. This paper presents
the new algorithms and analyses their average running
time.",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "Univ. Oslo, Norway",
journalabr = "Comput J",
keywords = "address; average running time; calculation; computer
operating systems; computer programming ---
Subroutines; faster searching; hash tables; list
processing; method; ordered hash tables; table lookup;
variants of the traditional hash",
treatment = "P Practical",
}
@Article{Atkinson:1974:FPQ,
author = "L. V. Atkinson and A. J. Cornah",
title = "Full Period Quadratic Hashing",
journal = j-INT-J-COMPUT-MATH,
volume = "4",
number = "2",
pages = "177--189",
month = sep,
year = "1974",
CODEN = "IJCMAT",
ISSN = "0020-7160",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "If n, the size of an open hash table, is a prime
number then quadratic displacement guarantees that, in
the event of successive collisions, exactly (n plus
1)/2 different entries are eventually examined
(although more than (n plus 1)/2 probes may be
necessary to achieve this). If n is a power of 2 then
in general only a small portion of the table will be
searched. Two sets of quadratic polynomials are
presented here which guarantee full period search (n
different entries hit in n probes) for any table size
which is a power of 2. It is also proved that these are
the only quadratic polynomials with this property.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Int J Comput Math",
keywords = "computer systems programming; hashing",
}
@InProceedings{Bayer:1974:SCM,
author = "Rudolf Bayer",
title = "Storage Characteristics and Methods for Searching and
Addressing",
crossref = "Rosenfeld:1974:IPP",
pages = "??",
year = "1974",
bibdate = "Thu Jul 21 09:31:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Hashing versus trees.",
}
@Article{Bookstein:1974:HCN,
author = "Abraham Bookstein",
title = "Hash Coding with a Non-Unique Search Key",
journal = j-J-AM-SOC-INF-SCI,
volume = "25",
number = "4",
pages = "232--236",
month = jul # "--" # aug,
year = "1974",
CODEN = "AISJB6",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This paper defines a hash coding model for nonunique
search keys and derives the expected number of accesses
needed to retrieve all desired records from a computer
storage device. The assumption that the records are
stored on the basis of a nonunique key is often
realized in information retrieval environments. The
model assumes that the hashing algorithm and, should a
collision occur, the skipping algorithm, both
distribute the records randomly in memory. The results
of this analysis are compared with those from a
simulation in which the randomness criterion is not
strictly met.",
acknowledgement = ack-nhfb,
classification = "723; 731; 901",
journalabr = "J Am Soc Inf Sci",
keywords = "codes, symbolic --- Encoding; hash coding; information
retrieval systems; information science",
}
@Article{deVillers:1974:HSS,
author = "E. v. d. S. {de Villers} and L. B. Wilson",
title = "Hashing the Subscripts of a Sparse Matrix",
journal = j-BIT,
volume = "14",
number = "3",
pages = "347--358",
year = "1974",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Nov 14 20:58:37 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "nla, sparse, hashing",
remark = "Yes, first author name is ``E. v. d. S. {de
Villers}''",
}
@Article{DeVilliers:1974:HSS,
author = "E. v. d. S. {De Villiers} and L. B. Wilson",
title = "Hashing the Subscripts of a Sparse Matrix",
journal = "BIT (Copenhagen)",
volume = "14",
number = "3",
pages = "347--358",
month = "????",
year = "1974",
CODEN = "NBITAB",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "It has been suggested that key transformation
techniques might be a very effective way of
manipulating sparse matrices particularly if the
operations on the matrix access the elements in an
unsystematic way. The purpose of the present paper is
to investigate methods of hashing the subscripts of a
matrix to give a suitable address in the scatter
storage table. Various different types of sparse
matrices are considered.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "computer programming; data processing --- File
Organization",
}
@Article{Ecker:1974:BRL,
author = "A. Ecker",
title = "{Eine Bemerkung zum Restklassenhash} [{Remark} on the
Division Hash Code]",
journal = "Angewandte Informatik/Applied Informatics",
volume = "16",
number = "6",
pages = "253--256",
month = jun,
year = "1974",
CODEN = "AWIFA7",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A file addressing problem is proved to be equivalent
to a problem in the theory of AN codes for the division
hash code. Results in the theory of AN codes can thus
be used in solving this file addressing problem. An
algorithm is given to obtain the right table length.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Angew Inf Appl Inf",
keywords = "codes, symbolic; data processing --- File
Organization",
}
@Article{Ecker:1974:PSQ,
author = "A. Ecker",
title = "Period of Search for the Quadratic and Related Hash
Methods",
journal = j-COMP-J,
volume = "17",
number = "4",
pages = "340--343",
month = nov,
year = "1974",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A systematic approach to estimate the period of search
for the quadratic hash method is presented. A
generalization of that method is given and upper or
lower bounds for the search period are evaluated. It
turns out that contrary to what is normally believed in
most cases of practical interest, it is possible to
search the complete table.",
acknowledgement = ack-nhfb,
classification = "723; 921",
journalabr = "Comput J",
keywords = "computer programming; hash methods; mathematical
techniques",
}
@Article{Fabry:1974:CBA,
author = "Robert S. Fabry",
title = "Capability-Based Addressing",
journal = j-CACM,
volume = "17",
number = "7",
pages = "403--412",
month = jul,
year = "1974",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:38:27 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib
and ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Fabry74;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various addressing schemes making use of segment
tables are examined. The inadequacies of these schemes
when dealing with shared addresses are explained. These
inadequacies are traced to the lack of an efficient
absolute address for objects in these systems. The
direct use of a capability as an address is shown to
overcome these difficulties because it provides the
needed absolute address. Implementation of
capability-based addressing is discussed. It is
predicted that the use of tags to identify capabilities
will dominate. A hardware address translation scheme
which never requires the modification of the
representation of capabilities is suggested.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723; 901",
corpsource = "Univ. California, Berkeley, CA, USA",
journalabr = "Commun ACM",
keywords = "address translation scheme; addresses; addressing;
addressing hardware; addressing schemes; associative;
CACM memory management segments pages operating
security olit capabilities; capabilities; capability
based addressing; code; computer utility; data
structures; hardware; hash table; information retrieval
systems; information sharing; operating systems;
programming conventions; protection; protection
hardware; registers; security of data; segment tables;
shared; storage management; tagged architecture; tags",
oldlabel = "Fabry74",
remark = "The direct use of a capability as an address is shown
to be useful when dealing with shared addresses.
Implementation of capability-based addressing is
discussed.",
treatment = "A Application; P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fabry74",
}
@Article{Grimson:1974:PSS,
author = "J. B. Grimson",
title = "A Performance Study of Some Directory Structures for
Large Data Files",
journal = j-ISR,
volume = "10",
number = "11",
pages = "??",
year = "1974",
bibdate = "Thu Jul 21 09:31:37 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Tests on hashing.",
}
@InProceedings{Groner:1974:CHF,
author = "L. H. Groner and A. L. Goel",
title = "Concurrency in Hashed File Access",
crossref = "Rosenfeld:1974:IPP",
pages = "??",
year = "1974",
bibdate = "Thu Jul 21 09:31:52 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Look-up direct access records simultaneously in
primary and overflow files.",
}
@Article{Kaman:1974:HC,
author = "Charles H. Kaman",
title = "Hash Coding",
journal = "Polimery",
volume = "??",
number = "??",
pages = "229--232",
month = "????",
year = "1974",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Hash coding method is described for accessing tables
and for implementing associative memories in
software.",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Digital Equip Comput Users Soc, Fall Symp, DECUS Proc,
Pap and Presentations",
keywords = "codes, symbolic; computer programming; data
processing; hash coding",
meetingaddress = "San Francisco, CA, USA",
meetingdate = "Nov 28--30 1973",
meetingdate2 = "11/28--30/73",
}
@Article{Knuth:1974:CSR,
author = "Donald E. Knuth",
title = "Computer Science and its Relation to Mathematics",
journal = j-AMER-MATH-MONTHLY,
volume = "81",
pages = "323--343",
month = apr,
year = "1974",
CODEN = "AMMYAE",
ISSN = "0002-9890 (print), 1930-0972 (electronic)",
ISSN-L = "0002-9890",
bibdate = "Fri Aug 12 23:24:40 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "A~shorter form of this article appeared in {\sl
American Scientist\/ \bf 61} (1973), 707--713;
reprinted in {\sl Computers and People\/ \bf 23},9
(September 1974), 8--11; and in {\sl Mathematics:
People, Problems, Results}, ed.\ by Douglas M. Campbell
and John C. Higgins, vol.~3 (Belmont, Calif.:
Wadsworth, 1984), 37--47. Hungarian translation in {\sl
Matematikai Lapok\/ \bf 24} (1973, published 1975),
345--363. Slovenian translation in {\sl Obzornik za
Matematiko in Fiziko\/ \bf22} (1975), 129--138,
161--167. Slovak translation (abridged) in {\sl Pokroky
Matematiky, Fiziky a Astronomie\/ \bf21} (1976),
88--96. Russian translation by Natal'{\t\i{a}} G.
Gurevich in {\sl Sovremennye Problemy Matematiki\/
\bf11},12 (Moscow: Znanie, 1977), 4--32.",
acknowledgement = ack-nhfb,
}
@Article{Nishihara:1974:FTQ,
author = "S. Nishihara and H. Hagiwara",
title = "A full table quadratic search method eliminating
secondary clustering",
journal = j-INT-J-COMPUT-INF-SCI,
volume = "3",
number = "2",
pages = "123--128",
month = jun,
year = "1974",
CODEN = "IJCIAH",
ISSN = "0091-7036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Kyoto Univ., Japan",
keywords = "eliminating secondary clustering; file organisation;
full table; hash tables; quadratic search method; table
lookup",
treatment = "A Application; T Theoretical or Mathematical",
}
@TechReport{Rivest:1974:AAR,
author = "Ronald L. Rivest",
title = "Analysis of Associative Retrieval Algorithms",
type = "Technical Report",
number = "TR.54",
institution = "Institut de la Recherche en Informatique et
Automatique, now Institut National de Recherche en
Informatique et Automatique (INRIA)",
address = "Domaine de Voluceau --- Rocquencourt --- B.P. 105,
78153 Le Chesnay Cedex, France",
pages = "??",
month = feb,
year = "1974",
bibdate = "Thu Jul 21 09:32:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in/as: Stanford CSD report 74-415. Also
published in/as: SIAM Journal for Computing,
Springer-Verlag (Heidelberg, FRG and New York NY,
USA)-Verlag, 1976, with mod. title.",
acknowledgement = ack-nhfb,
remark = "Combinatorial hashing for retrieval.",
}
@InProceedings{Rivest:1974:HCA,
author = "R. L. Rivest",
title = "On hash-coding algorithms for partial-match
retrieval",
crossref = "IEEE:1974:ASS",
pages = "95--103",
year = "1974",
bibdate = "Mon Jul 18 10:06:22 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Rothnie:1974:ABF,
author = "James B. {Rothnie, Jr.} and Tomas Lozano",
title = "Attribute Based File Organization in a Paged Memory
Environment",
journal = j-CACM,
volume = "17",
number = "2",
pages = "63--69",
month = feb,
year = "1974",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Apr 30 11:16:38 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See remarks \cite{Chang:1984:OIR}.",
acknowledgement = ack-nhfb,
}
@Article{Severance:1974:ISM,
author = "Dennis G. Severance",
title = "Identifier Search Mechanisms: {A} Survey and
Generalized Model",
journal = j-COMP-SURV,
volume = "6",
number = "3",
pages = "175--194",
month = sep,
year = "1974",
CODEN = "CMSVAN",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
bibdate = "Sun Sep 18 11:25:49 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Evaluation model is core memory oriented.",
}
@Book{Waldschmidt:1974:OIC,
author = "Helmut Waldschmidt",
title = "Optimierungsfragen im Compilerbau",
publisher = pub-HANSER,
address = pub-HANSER:adr,
pages = "154",
year = "1974",
ISBN = "3-446-11895-0",
ISBN-13 = "978-3-446-11895-9",
LCCN = "QA76.6 .W326",
bibdate = "Wed Jul 13 19:00:58 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Compilerbau, Globale Programmoptimierung,
Hash-verfahren, Optimierung, Tabellenorganisation,
Uebersetzer",
}
@Article{Atkinson:1975:HMS,
author = "L. V. Atkinson",
title = "Hashing Matrix Subscripts",
journal = j-BIT,
volume = "15",
number = "3",
pages = "328--330",
year = "1975",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Mon Nov 16 14:36:22 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Banerjee:1975:DLD,
author = "J. Banerjee and V. Rajaraman",
title = "A dual link data structure for random file
organization",
journal = j-INFO-PROC-LETT,
volume = "4",
number = "3",
pages = "64--69",
day = "??",
month = dec,
year = "1975",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Tue Nov 17 17:37:30 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; C6120 (File organisation)",
corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur,
India",
journalabr = "Inf Process Lett",
keywords = "data processing; data structures; dual link data
structure; file organisation; hashing; random access
store; random file organisation; random-access
storage",
treatment = "T Theoretical or Mathematical",
}
@Article{Batagelj:1975:QHM,
author = "Vladimir Batagelj",
title = "Quadratic Hash Method When the Table Size is not a
Prime Number",
journal = j-CACM,
volume = "18",
number = "4",
pages = "216--217",
month = apr,
year = "1975",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Previous work on quadratic hash methods is limited
mainly to the case where the table size is a prime
number. Here, certain results are derived for composite
numbers. It is shown that all composite numbers
containing at least the square of one of the component
primes have full-period integer-coefficient quadratic
hash functions.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer programming",
}
@Article{Bobrow:1975:NHL,
author = "Daniel G. Bobrow",
title = "A Note on Hash Linking",
journal = j-CACM,
volume = "18",
number = "7",
pages = "413--415",
month = jul,
year = "1975",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Hash searching is a technique in which a key is mapped
into a unique address associated with that key. Most
applications of this technique are for insertion and
fast retrieval of data records containing key fields.
In the use of hash search described in this paper, the
key field is the virtual address of a machine cell with
which additional information is associated. An address
to auxiliary data not contained in that cell is called
hash linking. (A hash link function is one which maps
any machine virtual address into another unique address
where additional information can be stored. ) This note
describes several nonobvious applications of this
technique.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "Commun ACM",
keywords = "computer programming; hash linking; information
retrieval systems; LISP",
}
@InProceedings{Burkhard:1975:PMQ,
author = "Walter A. Burkhard",
title = "Partial-Match Queries and File Designs",
crossref = "Kerr:1975:PIC",
pages = "??",
year = "1975",
bibdate = "Thu Jul 21 08:44:14 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Tries and hashing.",
}
@InProceedings{Deutscher:1975:CSD,
author = "R. F. Deutscher and R. P. Tremblay and P. G.
Sorenson",
title = "A Comparative Study of Distribution-Dependent and
Distribution-Independent Hashing Functions",
crossref = "ACM:1975:DUO",
pages = "??",
year = "1975",
bibdate = "Sat Nov 12 21:01:57 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in/as: Dept. Computational Science,
Report 75.4, Mar. 1975.",
acknowledgement = ack-nhfb,
}
@TechReport{Dubost:1975:SIN,
author = "P. Dubost and J.-M. Trousse",
title = "Software Implementation of a new Method of
Combinatorial Hashing",
number = "STAN-CS-75-511",
institution = "Stanford University Computer Science Department",
pages = "??",
month = sep,
year = "1975",
bibdate = "Sat Nov 12 21:02:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "An Implementation of Burkhard's partial match
retrieval scheme using binary trees instead of binary
strings.",
}
@Article{Goble:1975:FRS,
author = "C. E. Goble",
title = "Free-Text Retrieval System Using Hash Codes",
journal = j-COMP-J,
volume = "18",
number = "1",
pages = "18--20",
month = feb,
year = "1975",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "An algorithm is presented for efficient serial
searching of files whose records have arbitrary length
free-text retrieval keys. It is most applicable when a
batch of enquiries is to search a given file once only,
which is an implicit feature of the SDI (Selective
Dissemination of Information) application for which it
was designed. Unlike some other serial systems, an
arbitrary number of enquiries can be handled with a
single pass of the search file, and the algorithm is
simple in concept, and straightforward to implement.
Specimen performance figures are quoted in the
appendix.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C7220 (Generation,
dissemination, and use of information); C7250
(Information storage and retrieval)",
classification = "723",
corpsource = "IEE, London, UK",
journalabr = "Comput J",
keywords = "algorithm; arbitrary length; data processing; files;
free text; hash codes; information dissemination;
information retrieval systems; keys; retrieval system;
SDI; serial searching",
treatment = "P Practical",
}
@InProceedings{Guibas:1975:HTE,
author = "Leo J. Guibas",
booktitle = "USA-Jpn Comput Conf, 2nd, Proc",
title = "Hashing Techniques that Exhibit Secondary or Tertiary
Clustering",
publisher = "AFIPS",
address = "Montvale, NJ",
pages = "324--328",
year = "1975",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A hashing technique is said to exhibit secondary (or
tertiary) clustering, if it begins a search into the
table with one random probe (or two independently
random probes) and from then on proves the table
positions in a fixed permutation that depends only on
the location of the initial probe (or the locations of
the two initial probes). The performance of such a
hashing technique is analyzed when the permutations
described above are randomly chosen. The results
obtained contribute insight to the issue of comparing
alternate strategies for collision resolution.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "computer programming",
meetingaddress = "Tokyo, Jpn",
meetingdate = "Aug 26--28 1975",
meetingdate2 = "08/26--28/75",
}
@Article{Herschel:1975:WHL,
author = "R. Herschel and B. Jonsson",
title = "{Was ist Hash-coding}? [What Is Hash-Coding?]",
journal = "{Elektronische Rechenanlagen mit Computer Praxis}",
volume = "17",
number = "4",
pages = "131--138",
month = jun,
year = "1975",
CODEN = "ERCPDJ",
bibdate = "Mon Oct 26 07:01:32 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Hash-coding is an effective method for the retrieval
of single data items within large quantities of data.
Two problems associated with the utilization of
hash-coding in practice are pointed out.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Elektron Rechenanlagen Comput Prax",
keywords = "codes, symbolic; hash coding",
language = "German",
}
@Article{Knott:1975:HF,
author = "Gary D. Knott",
title = "Hashing Functions",
journal = j-COMP-J,
volume = "18",
number = "3",
pages = "265--278",
month = aug,
year = "1975",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/18.3.265",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/",
note = "Also published in/as: Stanford University Report,
1975.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/265.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/266.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/267.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/268.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/269.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/270.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/271.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/272.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/273.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/274.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/275.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/276.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/277.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/278.tif",
abstract = "The object of this paper is to survey various hashing
functions, to present a brief history of hashing
schemes and their development, and to give an
exhaustive bibliography on hashing and hash table
storage and retrieval methods.",
acknowledgement = ack-nhfb,
annote = "All you wanted to know about hashing.",
classification = "901; 921",
journalabr = "Comput J",
keywords = "hashing functions; information retrieval systems;
mathematical techniques",
}
@Book{Knuth:1975:ACP,
author = "D. E. Knuth",
title = "The Art of Computer Programming, Sorting and
Searching",
publisher = pub-AW,
address = pub-AW:adr,
edition = "2",
pages = "xi + 723",
year = "1975",
ISBN = "0-201-03803-X",
ISBN-13 = "978-0-201-03803-3",
LCCN = "QA76.5 .K74",
bibdate = "Wed Jul 13 18:55:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Algorithmus, B-baum, Baum, Binaer-baum, Gestreute
Speicherung, Hash-verfahren, Mischen, Sortieren,
Speicherung, Suchen, Zugriff",
remark = "Standardwerk ueber Suchen und Sortieren 5. Sorting
5.1. Combinatorial Properties of Permutations 5.2.
Internal Sorting 5.3. Optimum Sorting 5.4. External
Sorting 5.5. Summary, History, and Bibliography 6.
Searching 6.1. Sequential Search 6.2. Searching By
Comparison of Keys 6.3. Digital Searching 6.4. Hashing
6.5. Retrieval on Secondary Keys Answers to Exercises
Appendix A: Tables of Numerical Quantities Appendix B:
Index to Notations Index and Glossary.",
}
@Book{Martin:1975:CDB,
author = "James Martin",
title = "Computer Data-base Organization",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xviii + 558",
year = "1975",
ISBN = "0-13-165506-X",
ISBN-13 = "978-0-13-165506-5",
LCCN = "QA76 .M324",
bibdate = "Thu Jul 14 16:38:51 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Computer, Datenbank, Datenbanksystem,
Datenfernverarbeitung, Informationssystem,
Datenorganisation, Datenuebertragung, Datenverwaltung,
Dokumentationssystem, Organisation, Relationen-modell,
Software-technologie",
remark = "Contents: Part I: Logical Organization 4. What Should
be the Objectives of a Data Base Organization 5.
Entities and Attributes 6. Schemas and Subschemas 7.
Data Base Management Systems 8. Tree Structures 9. Plex
Structures 10. Data Description Languages 11. The
Codasyl Data Description Language 12. IBM's Data
Language/I 13. Relational Data Bases 14. Third Normal
Form 15. Varieties of Data Independence 16. Operations
Systems Versus Information Systems Part II: Physical
Organization 17. Criteria Affecting Physical
Organization 18. Differences Between Physical and
Logical Organiation 19. Pointers 20. Chains and Ring
Structures 21. Addessing Techniques 22. Indexed
Sequential Organizations 23. Hashing 24. Physical
Representations of Tree Structures 25. Physical
Representations of Plex Structures 26. Multiple-key
Retrieval 27. Index Organization 28. A Comparison of
Multiple-key Organizations 29. Separating Data and
Relationships 30. Index Searching Techniques 31. Data
Compaction 32. Virtual Memory and Storage Hierarchies
33. Inverted File Systems 34. Volatile Files 35. Fast
Response Systems 36. Associative Memory App. A. The
Mean Number of Probes in a Binary Search App. B. Sample
Logical Data Descriptions Class Questions Index.",
}
@Article{Maurer:1975:HTM,
author = "W. D. Maurer and T. G. Lewis",
title = "Hash Table Methods",
journal = j-COMP-SURV,
volume = "7",
number = "1",
pages = "5--19",
month = mar,
year = "1975",
CODEN = "CMSVAN",
DOI = "http://doi.acm.org/10.1145/356643.356645",
ISSN = "0010-4892",
bibdate = "Thu Jun 19 09:18:53 MDT 2008",
bibsource = "Compendex database; compsurv.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/surveys/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This is a survey of hash table methods, chiefly
intended for programmers and students of programming
who are encountering the subject for the first time.
The better-known methods of calculating hash addresses
and of handling collisions and bucket overflow are
presented and compared. It is shown that under certain
conditions we can guarantee that no two items belonging
to a certain class will have the same hash code, thus
providing an improvement over the usual notion of a
hash code as a randomizing technique. Several
alternatives to hashing are discussed, and suggestions
are made for further research and further
development.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Comput Surv",
keywords = "computer programming",
remark = "Short review of key-to-address transformation,
collision handling, and other access techniques.",
}
@Book{Niemeyer:1975:DV,
author = "Gerhard Niemeyer",
title = "Dateiorganisation und -verarbeitung",
publisher = pub-VAHLEN,
address = pub-VAHLEN:adr,
pages = "258",
year = "1975",
ISBN = "3-8006-0528-7",
ISBN-13 = "978-3-8006-0528-6",
LCCN = "QA76 .N52",
bibdate = "Wed Jul 13 18:39:58 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
price = "DM24.80",
acknowledgement = ack-nhfb,
descriptor = "Baum, Binaer-baum, Dateiorganisation, Dateiverwaltung,
Datenverwaltung, Gestreut, Hashing, Indexsequentiell,
Liste, Mischen, Serielle Speicherung, Sortieren,
Speicherung, Suchen, Verkettet, Zugriff",
remark = "1. Einfuehrung und Grundlagen 2. Dateistrukturen,
Speicherkonzepte und Elementare Algorithmen 3.
Sortierverfahren 4. Suchverfahren.",
}
@InProceedings{Rosenberg:1975:HSE,
author = "A. L. Rosenberg and L. J. Stockmeyer",
title = "Hashing schemes for extendible arrays",
crossref = "ACM:1975:CRS",
pages = "159--166",
year = "1975",
bibdate = "Mon Jul 18 10:15:45 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sorenson:1975:DDH,
author = "P. G. Sorenson and R. F. Deutscher and J. P.
Tremblay",
booktitle = "19 ACM SIGMOD Conf. on the Management of Data,
King(ed)",
title = "Distribution-Dependent Hashing Functions and Their
Characteristics",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??",
month = may,
year = "1975",
bibdate = "Thu Jul 21 09:32:27 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Book{Wirth:1975:AD,
author = "Niklaus Wirth",
title = "Algorithmen und Datenstrukturen",
publisher = pub-TEUBNER,
address = pub-TEUBNER:adr,
pages = "376",
year = "1975",
ISBN = "3-519-02330-X",
ISBN-13 = "978-3-519-02330-2",
LCCN = "QA76.9.D35 W57",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
price = "DM26.80",
acknowledgement = ack-nhfb,
descriptor = "Algorithmus, Baum, Datenstruktur, Digitalrechner,
Grundstruktur, Hashing, Liste, Programmierung,
Referenz, Rekursion, Sortieralgorithmus, Sortieren,
Zeiger",
remark = "Inhalt: 1. Fundamentale Datenstrukturen 2. Sortieren
3. Rekursive Algorithmen 4. Dynamische
Informationsstrukturen Einfuehrung in Theorie und
Praxis Fundamentaler Algorithmen. Ausfuehrliche
Anleitung zur Wahl Geeigneter Datenstrukturen. Methodik
Rekursiver Programme, Suchen und Sortieren.
Beispielprogramme in Pascal-notation.",
}
@Article{Yuval:1975:FNN,
author = "G. Yuval",
title = "Finding near neighbours in {$K$}-dimensional space",
journal = j-INFO-PROC-LETT,
volume = "3",
number = "4",
pages = "113--114",
day = "??",
month = mar,
year = "1975",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "(Combinatorial mathematics); B0250 (Combinatorial
mathematics); C1160 calculations and limits of quantum
electrodynamics); C6130 (Data handling techniques)",
corpsource = "Hebrew Univ., Jerusalem, Israel",
keywords = "hashing; K dimensional space; near neighbours;
sorting",
treatment = "T Theoretical or Mathematical",
xxtitle = "Finding near neighbours on {$K$}-dimensional space",
}
@Article{Bayer:1976:EST,
author = "R. Bayer and J. K. Metzger",
title = "On the Encipherment of Search Trees and Random Access
Files",
journal = j-TODS,
volume = "1",
number = "1",
pages = "37--52",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jul 20 23:01:51 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in \cite[p.~508--510]{Kerr:1975:PIC}.",
acknowledgement = ack-nhfb,
remark = "Trees versus hashing as his 1974 IFIP paper?",
}
@InProceedings{Burkhard:1976:ART,
author = "Walter A. Burkhard",
title = "Associative retrieval trie hash-coding",
crossref = "ACM:1976:CRE",
pages = "211--219",
year = "1976",
bibdate = "Mon Jul 18 10:17:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Burkhard:1976:HTA,
author = "Walter A. Burkhard",
title = "Hashing and Trie Algorithms for Partial-Match
Retrieval",
journal = j-TODS,
volume = "1",
number = "2",
pages = "175--187",
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jul 13 21:41:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in/as: UCSD, Appl. Physics and Inf. Sc,
CS TR.2, Jun. 1975.",
acknowledgement = ack-nhfb,
}
@Article{Burkhard:1976:PMR,
author = "Walter A. Burkhard",
title = "Partial Match Retrieval",
journal = j-BIT,
volume = "16",
number = "1",
pages = "13--31",
year = "1976",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Nov 14 20:58:37 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "hashing; tries.",
}
@MastersThesis{Dittmer:1976:IEP,
author = "Ingo Dittmer",
title = "{Implementation eines Einschrittcompilers f{\"u}r die
Programmiersprache PASCAL auf der Rechenanlage
IBM\slash 360 der Universit{\"a}t M{\"u}nster}.
({English} title: Implementation of a One-Step Compiler
for the Programming Language {PASCAL} on the {IBM\slash
360} of the {University of Muenster})",
school = "Universit{\"a}t M{\"u}nster",
address = "M{\"u}nster, Germany",
pages = "??",
year = "1976",
bibdate = "Mon Oct 26 08:30:46 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Diplomearbeit M{\"u}nster 1976 und doert angegebene
Literatur (English: Muenster diploma work 1976 and the
literature cited therein). The hashing method was
rediscovered fourteen years later by Pearson
\cite{Pearson:1990:FHV}, and then commented on by
several authors
\cite{Dittmer:1991:NFH,Savoy:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}.",
acknowledgement = ack-nhfb,
}
@Article{Friedman:1976:GCH,
author = "Daniel P. Friedman and David S. Wise",
title = "Garbage Collecting a Heap Which Includes a Scatter
Table",
journal = j-INFO-PROC-LETT,
volume = "5",
number = "6",
pages = "161--164",
day = "??",
month = dec,
year = "1976",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See erratum \cite{Friedman:1977:EGC}.",
acknowledgement = ack-nhfb,
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Dept. of Computer Sci., Indiana Univ., Bloomington,
IN, USA",
journalabr = "Inf Process Lett",
keywords = "computer programming; garbage collection; hash table;
heap; scatter table; storage management",
treatment = "T Theoretical or Mathematical",
}
@InProceedings{Goto:1976:HLT,
author = "E. Goto and Y. Kanada",
title = "Hashing Lemmas on Time Complexities with Application
to Formula Manipulation",
crossref = "Jenks:1976:SPA",
pages = "??",
year = "1976",
bibdate = "Thu Jul 21 09:32:42 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "LISP",
}
@InProceedings{Guibas:1976:ADH,
author = "L. J. Guibas and E. Szemer{\'e}di",
key = "Guibas \& Szemeredi",
title = "The Analysis of Double Hashing",
crossref = "ACM:1976:CRE",
pages = "187--191",
year = "1976",
bibdate = "Mon Jul 18 10:18:09 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Extended abstract.",
acknowledgement = ack-nhfb,
}
@PhdThesis{Guibas:1976:AHAa,
author = "Leo J. Guibas",
title = "The Analysis of Hashing Algorithms",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "??",
month = aug,
year = "1976",
bibdate = "Fri Apr 30 11:09:23 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See \cite{Guibas:1976:AHAb}.",
acknowledgement = ack-nhfb,
remark = "Early hashing paper, used open addressing.",
}
@TechReport{Guibas:1976:AHAb,
author = "Leo J. Guibas",
title = "The Analysis of Hashing Algorithms",
number = "TR STAN-CS-76-556",
institution = inst-STANFORD,
address = inst-STANFORD:adr,
pages = "??",
month = aug,
year = "1976",
bibdate = "Thu Jul 21 09:32:57 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "This is the author's Ph.D. thesis,
\cite{Guibas:1976:AHAa}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Guibas:1976:AHAc,
author = "Leo J. Guibas",
title = "The analysis of hashing algorithms that exhibit k-ary
clustering",
crossref = "IEEE:1976:ASF",
pages = "183--196",
year = "1976",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Rivest:1976:OAK,
author = "Ronald L. Rivest",
title = "Optimal Arrangement of Keys in a Hash Table",
type = "Technical Report",
number = "MIT/LCS/TM-73",
institution = inst-MIT-CS,
address = inst-MIT:adr,
pages = "??",
month = jul,
year = "1976",
bibdate = "Thu Jul 21 09:33:03 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "Hashing, Collision Resolution, Searching, Assignment
Problem, Optimal Algorithms, Data Base Organization",
}
@Article{Santoro:1976:FTS,
author = "Nicola Santoro",
title = "Full Table Search by Polynomial Functions",
journal = j-INFO-PROC-LETT,
volume = "5",
number = "3",
pages = "72--74",
day = "??",
month = aug,
year = "1976",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
journalabr = "Inf Process Lett",
keywords = "computer systems programming; full table search; hash
coding; open addressing; polynomial functions; table
lookup",
treatment = "T Theoretical or Mathematical",
}
@Article{Sassa:1976:HMF,
author = "M. Sassa and E. Goto",
title = "A Hashing Method for Fast Set Operations",
journal = j-INFO-PROC-LETT,
volume = "5",
number = "2",
pages = "31--34",
year = "1976",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Mon Jan 22 17:12:21 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Book{Schauer:1976:PA,
author = "Helmut Schauer",
title = "{Pascal f{\"u}r Anf{\"a}nger}",
publisher = pub-OLDENBOURG,
address = pub-OLDENBOURG:adr,
pages = "175",
year = "1976",
ISBN = "3-7029-0091-8",
ISBN-13 = "978-3-7029-0091-5",
bibdate = "Thu Sep 28 17:31:06 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Algorithmus, Datentyp, Hash-verfahren, Pascal,
Programmiersprache, Sortierverfahren, Suchverfahren,
Syntax von Pascal, Textverarbeitung",
tableofcontents = "2. Grundelemente von Pascal \\
2.1. Programmaufbau \\
2.2. Repeat --- Anweisung \\
2.3. While --- Anweisung \\
2.4. For --- Anweisung \\
2.5. If --- Anweisung \\
3. Datentypen \\
3.1. der Typ Integer \\
3.2. der Typ Real \\
3.3. der Typ Boolean \\
3.4. der Typ Char \\
3.5. der Mengentyp \\
3.6. Felder \\
3.7. Typvereinbarung \\
4. Unterprogramme \\
4.1. Funktionen \\
4.2. Prozeduren \\
4.3. Rekursion \\
5. Anwendungsbeispiele \\
5.1. Numerische Methoden \\
5.2. Suchverfahren \\
5.3. Sortierverfahren \\
5.4. Textverarbeitung \\
5.5. Interaktive Anwendungen \\
6. die Syntax von Pascal Schlagwortregister.",
}
@Article{Severance:1976:PGA,
author = "D. G. Severance and R. A. Duhne",
title = "A Practitioner's Guide to Addressing Algorithms",
journal = j-CACM,
volume = "19",
number = "6",
pages = "314--326",
month = jun,
year = "1976",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Sep 20 22:46:44 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "This paper consolidates a number of popular rules of
thumb which have been suggested for the design of
record addressing algorithms, and discusses the
applicability of these rules to large commercial
databases.",
}
@Article{Shneiderman:1976:BSS,
author = "Ben Shneiderman and Victor Goodman",
title = "Batched Searching of Sequential and Tree Structured
Files",
journal = j-TODS,
volume = "1",
number = "3",
pages = "268--275",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See comments in \cite{Piwowarski:1985:CBS}. Also
published in/as: Indiana Un., CSD Tech. Ref. 0132.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p268-shneiderman/p268-shneiderman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p268-shneiderman/",
abstract = "The technique of batching searches has been ignored in
the context of disk based online data retrieval
systems. This paper suggests that batching be
reconsidered for such systems since the potential
reduction in processor demand may actually reduce
response time. An analysis with sample numerical
results and algorithms is presented.",
acknowledgement = ack-nhfb,
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval (H.3)",
}
@Book{Tremblay:1976:IDS,
author = "J. P. Tremblay and P. G. Sorenson",
title = "An Introduction to Data Structures With Applications",
publisher = pub-MH,
address = pub-MH:adr,
pages = "xvi + 704",
year = "1976",
ISBN = "0-07-065150-7",
ISBN-13 = "978-0-07-065150-0",
LCCN = "QA76.9.D35 .T73",
bibdate = "Thu Jul 14 16:38:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Array, Baum, Dateistruktur, Datenbanksystem,
Datenstruktur, Entscheidungstabelle, Externer Speicher,
Feld, Graph, Indexsequentielle Datei, Invertierte
Liste, Lineare Datenstruktur, Lineare Liste, Liste,
Markovalgorithmus, Rekursion, Sequentielle Datei,
Sortieren, Stack, Stapel, Stringmanipulation, Suchen,
Verkettete Liste, Virtueller Speicher, Zahldarstellung,
Zahlensystem, Zeichenkettenbearbeitung,
Zugriffstechnik",
remark = "1. Speicherdarstellung von Information (Einfache
Datenstrukturen, Zahlensystem, Konvertierung von
Zahlen, `integer'-zahlen und Ihre Darstellung,
`real'-zahlen und Ihre Darstellung. Zeichendarstellung,
Logische Werte und Operationen) 2. Darstellung und
Manipulation von Zeichenketten (`string'-verarbeitung,
Markov-algorithmus, Grammatik, Anwendungen)3. Linearen
Datenstrukturen MIT Sequentieller Speicherdarstellung
(Felder, Stacks, Schlangen) 4. Lineare Datenstrukturen
MIT Verketteter Speicherdarstellung (Zeiger, Verkettete
Listen) 5. Nicht-lineare Datenstrukturen (Baeume,
Mehrfach-verkettete Datenstrukturen, Graphen,
Dynamische Speicherverwaltung) 6. Sortieren und Suchen
(Selection Sort, Tree Sort, Bubble Sort, Merge Sorting,
Radix Sort, Sequential Searching, Binary Searching,
Search Trees, Hash-verfahren) 7. Dateistrukturen
(Externe Speicher, Organisation der Datensaetze,
Sequentielle Dateien, Index-sequentielle Dateien,
Dateien MIT Direktzugriff, Virtueller Speicher,
VSAM-datei, Zugriff ueber Mehrere Schluessel,
Invertierte Liste, Einfuehrung in Datenbanksysteme,
Hierarchische Datenbank, Netzwerkartige Datenbank,
Relationale Datenbank) das Buch Enthaelt Sehr Viele
Algorithmen und Beispiele.",
}
@Article{Wegbreit:1976:PPC,
author = "Ben Wegbreit and Jay M. Spitzen",
title = "Proving Properties of Complex Data Structures",
journal = j-J-ACM,
volume = "23",
number = "2",
pages = "389--396",
month = apr,
year = "1976",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This paper is concerned with proving properties of
programs which use data structures. The goal is to be
able to prove that all instances of a class (e.g., as
defined in Simula) satisfy some property. A method of
proof which achieves this goal, generator induction, is
studied and compared to other proof rules and methods;
inductive assertions, recursion induction, computation
induction, and, in some detail, structural induction.
The paper concludes by using generator induction to
prove a characteristic property of an implementation of
hashtables.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journalabr = "J Assoc Comput Mach",
keywords = "computer metatheory",
}
@Article{Bandypadhyay:1977:CWI,
author = "S. K. Bandypadhyay",
title = "Comment on Weighted Increment Linear Search for
Scatter Tables",
journal = j-CACM,
volume = "20",
number = "4",
pages = "262--263",
month = apr,
year = "1977",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:23:06 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#Bandypadhyay77;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
corpsource = "Aeronautical Dev. Establ., Bangalore, India",
keywords = "address; file organisation; hash; primary clustering;
scatter tables; weighted increment linear search",
oldlabel = "Bandypadhyay77",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bandypadhyay77",
xxauthor = "S. K. Bandyopadhyay",
}
@Article{Burkhard:1977:ART,
author = "Walter A. Burkhard",
title = "Associative Retrieval Trie Hash-Coding",
journal = j-J-COMP-SYS-SCI,
volume = "15",
number = "3",
pages = "280--299",
month = dec,
year = "1977",
CODEN = "JCSSBM",
ISSN = "0022-0000",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Data base designs for retrieval from a file of
k-letter records when queries may be only partially
specified are examined. A family of data base designs
referred to as the H// alpha // beta // kappa PMF-trie
designs which yield a data structure with good worst
case and average case performances and require an
amount of storage space essentially equal to that
required of the records themselves is introduced. The
analysis of the designs including bounds on the worst
case performance and an explicit expression for the
average performance is presented. Previously known
families of PMF-trie designs are seen to be special
cases within the H// alpha // beta // kappa family.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "J Comput Syst Sci",
keywords = "data base systems; information science",
}
@InProceedings{Carter:1977:UCHa,
author = "I. L. Carter and M. N. Wegman",
key = "Carter \& Wegman",
title = "Universal Classes of Hash Functions",
crossref = "ACM:1977:CRN",
pages = "106--112",
year = "1977",
bibdate = "Mon Jul 18 10:19:43 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Carter:1977:UCHb,
author = "J. L. Carter and M. N. Wegman",
title = "Universal Classes of Hash Functions",
institution = "????",
address = "Yorktown Heights, NY, USA",
pages = "??",
year = "1977",
bibdate = "Thu Jul 21 08:45:24 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datei, Datenbank, Gestreute Speicherung, Hashing,
Speicherung, Zugriff",
remark = "Grundlegender Bericht es wird Zum 1. Mal ein Verfahren
Vorgestellt, MIT dem Haschfunktionen aus einer Grossen
Klasse Ausgewaehlt Werden Koennen und die
Wahrscheinlichkeit, eine Schlechte Haschfunktion zu
Erwischen, Nachweisbar Sehr Klein Ist.",
}
@Article{Clapson:1977:IAT,
author = "Philip Clapson",
title = "Improving the Access Time for Random Access Files",
journal = j-CACM,
volume = "20",
number = "3",
pages = "127--135",
month = mar,
year = "1977",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:31:20 MST 2001",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#Clapson77;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Clustering in the key set is decreased by smoothing
the key-to-address transformation, and by adding shadow
buckets to an open chaining file. The keys are
pre-hashed before the address division, to remove the
effect of sequential properties in the key set. Shadow
buckets in the key search sequence reduce the effect of
nonuniformity in file loading, and decrease the number
of maximum probes needed to locate a record. The
combined effects of these techniques lead to improved
file performance for secondary storage devices, as
shown by empirical studies.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723; 901",
corpsource = "IBM United Kingdom Ltd., Feltham, UK",
journalabr = "Commun ACM",
keywords = "access time; chaining file; data processing --- File
Organization; data storage, digital; file loading; file
organisation; improved file; information retrieval
systems --- Design; key search sequence; maximum
probes; nonuniformity; open; performance; random access
files; secondary storage devices; sequential
properties; shadow buckets",
oldlabel = "Clapson77",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Clapson77",
}
@Book{Denert:1977:D,
author = "Ernst Denert and Reinhold Franxk",
title = "Datenstrukturen",
publisher = pub-BIBLIO-INST,
address = pub-BIBLIO-INST:adr,
pages = "362",
year = "1977",
ISBN = "3-411-01524-1",
ISBN-13 = "978-3-411-01524-5",
LCCN = "QA76.9.D35 D46",
bibdate = "Wed Jul 13 18:55:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "B-baum, Balancierter Baum, Baum, Best-fit,
Buddy-methode, Duenn Besetzte Matrix, Feld, First-fit,
Garbage Collection, Halde, Hashing, Keller, Lineare
Liste, Lisp, Matrix, Q-baum, Schlange, Stapel, Zeiger",
}
@Book{Flores:1977:DSM,
author = "Ivan Flores",
title = "Data Structure and Management",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Second",
pages = "ix + 390",
year = "1977",
ISBN = "0-13-197335-5",
ISBN-13 = "978-0-13-197335-0",
LCCN = "QA76.9.D35 F57 1977",
bibdate = "Thu Jul 14 16:44:37 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
price = "US\$17.50",
acknowledgement = ack-nhfb,
descriptor = "Baum, Binaer-baum, Binaersuchen, Dateiverwaltung,
Datenorganisation, Datenstruktur, Datenverwaltung,
Gekettete Liste, Geordnete Liste, Graph,
Hash-verfahren, Hashing, Liste, Mischen, Sortieren,
Suchen",
}
@Article{Friedman:1977:EGC,
author = "Daniel P. Friedman and David S. Wise",
title = "Erratum: {``Garbage Collecting a Heap Which Includes a
Scatter Table''}",
journal = j-INFO-PROC-LETT,
volume = "6",
number = "2",
pages = "72--72",
day = "??",
month = apr,
year = "1977",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See \cite{Friedman:1976:GCH}.",
acknowledgement = ack-nhfb,
}
@Book{Ghosh:1977:DBO,
author = "Sakti P. Ghosh",
title = "Data Base Organization For Data Management",
publisher = pub-AP,
address = pub-AP:adr,
pages = "xi + 376",
year = "1977",
ISBN = "0-12-281850-4",
ISBN-13 = "978-0-12-281850-9",
LCCN = "QA76.9.F5 G47",
bibdate = "Tue Jul 26 09:03:23 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Dateiorganisation, Datenbank, Speicherungstechnik,
Zugriffstechnik",
remark = "Das Buch Enthaelt eine Ausfuehrliche, zusammenfassende
Darstellung Sowohl Grundlegender Konzepte Bei
Datenbanken (kapitel 1--3) als Auch Spezieller
Techniken(insbesondere Zugriffstechniken)
Unkonventioneller Art (kapitel 5--8).
Hash-verfahrenwerden Ausfuehrlich in Kapitel 4
Behandelt. Hervorzuheben ist die Mathematisch Praezise
Art der Darstellung. Inhalt: 1. Datenstrukturen 2.
Anfragen und Anfragesprachen 3. Suche auf Einem Feld
(einschliesslich Indexstrukturen) 4. Abbildung von
Schluesseln auf Adressen 5. Algebraische Dateischemata
6. Die Konsekutive Retrieval-eigenschaft 7.
Organisation von Trommelspeichern 8.
Zugriffspfadgewinnung.",
}
@InProceedings{Gonnet:1977:AIH,
author = "G. Gonnet and I. Munro",
title = "The analysis of an improved hashing technique",
crossref = "ACM:1977:CRN",
pages = "113--121",
year = "1977",
bibdate = "Mon Jul 18 10:19:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gonnet:1977:ALB,
author = "Gaston H. Gonnet",
booktitle = "Proceedings of a Conference on Theoretical Computer
Science",
title = "Average Lower Bounds for Open-Addressing Hash Coding",
publisher = "????",
address = "????",
pages = "??",
year = "1977",
bibdate = "Thu Jul 21 08:45:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Is this \cite{Tzschach:1977:TCS}????",
acknowledgement = ack-nhfb,
}
@Article{Goto:1977:PHA,
author = "E. Goto and T. Ida",
key = "Goto \& Ida",
title = "Parallel Hashing Algorithms",
journal = j-INFO-PROC-LETT,
volume = "6",
number = "1",
pages = "8--13",
year = "1977",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Mon Jan 22 17:12:32 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Griss:1977:EEE,
author = "Martin L. Griss",
title = "Efficient Expression Evaluation in Sparse Minor
Expansion, Using Hashing and Deferred Evaluation",
crossref = "Sprague:1977:PTH",
pages = "169--172",
year = "1977",
bibdate = "Mon Oct 24 18:19:11 1994",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Efficient computation of the determinant of a matrix
with symbolic entries using minor expansion requires
careful control of expression evaluation. The use of
hashing and deferred evaluation to avoid excess
computation is explored.",
acknowledgement = ack-nhfb,
classification = "723; 921",
keywords = "computer metatheory; mathematical techniques; Reduce;
symbolic mathematics",
}
@Article{Hikita:1977:AFP,
author = "R. Hikita and E. Goto",
title = "An {$O(N)$} Algorithm for Finding Periodicity of a
Sequence Using Hash Coding",
journal = j-INFO-PROC-LETT,
volume = "6",
number = "2",
pages = "69--71",
year = "1977",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Mon Jan 22 17:12:35 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ida:1977:PPH,
author = "Tetsuo Ida and Eiichi Goto",
title = "Performance of a Parallel Hash Hardware with Key
Deletion",
crossref = "Gilchrist:1977:IPP",
pages = "643--647",
year = "1977",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Hash hardware is proposed which can handle key
deletion without key relocations. It makes use of
parallelism of memory access and can be realized by
conventional multi-bank memory with additional logic
circuitry. Three parallel hash algorithms to be
implemented in the hardware are described and their
efficiencies are compared. The amount of additional
logic varies, depending upon the algorithm to be used
and upon a scheme for handling inactive key positions.
The result of the analysis shows that basic hash
operations can be performed in the time comparable to
single indirect addressing.",
acknowledgement = ack-nhfb,
classification = "721; 722; 723",
keywords = "computer programming --- Subroutines; computers,
digital; data storage, digital --- Parallel Search;
logic circuits; parallel hash hardware",
}
@Article{Knuth:1977:DPR,
author = "Donald E. Knuth",
title = "Deletions that Preserve Randomness",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-3",
number = "5",
pages = "351--359",
month = sep,
year = "1977",
CODEN = "IESEDJ",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
bibdate = "Sat Jul 16 11:24:11 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Litwin:1977:ASD,
author = "W. Litwin",
title = "Auto-structuration Du Fichier: Methodologie,
Organisation {d}'Acces, Extension du Hash-codering",
institution = "????",
address = "Paris, France",
pages = "??",
year = "1977",
bibdate = "Thu Jul 21 09:33:09 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Daten, Datenbank, Datenverwaltung, Hashing,
Leistungsanalyse, Speicherung, Virtuell,
Zugriffsmethode",
remark = "1. Presentation et l'{\'e}tude 2. Origine du concept
de l'autostructuration 3. Criteres de performences de
l'organization autostructurante 4. Definition des
notions propos{\'e}es 5. Typologie des algorithms
d'autostructuration 6. Propri{\'e}t{\'e}s de la
ponchion d'appartenance 7. Propri{\'e}t{\'e}s de la
sonchion de selvation 8. Interdependence de fa. et de
fr. 9. Representation du graphe de structure 10.
Fichiers VHAM.",
}
@TechReport{Litwin:1977:MDP,
author = "Witold Litwin",
title = "{M}{\'e}thodes d'Acces par Hash-Coding Virtuel
({VHAM}): Modelisation, Application {\`a} la Gestion de
{M}{\'e}moires",
institution = "University of Pierre et Marie Curie (Paris, France)",
address = "Paris, France",
pages = "??",
month = nov,
year = "1977",
bibdate = "Thu Jul 21 09:33:13 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datenverwaltung, Hashing, Virtuell, Zugriffsmethode",
remark = "1. Introduction 2. Axiomes du model 3. Principes de la
decomposition en projections 4. Analyse d'une
projection 5. Analyse du pichier en cours de
remplissage 6. Etude du taux de remplissage.",
}
@Article{Mallach:1977:SST,
author = "E. G. Mallach",
title = "Scatter Storage Techniques: {A} Uniform Viewpoint and
a Method for Reducing Retrieval Times",
journal = j-COMP-J,
volume = "20",
number = "2",
pages = "137--140",
month = may,
year = "1977",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Jul 21 09:18:42 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Book{Martin:1977:CDB,
author = "James Martin",
title = "Computer Data-base Organization",
publisher = pub-PH,
address = pub-PH:adr,
edition = "2",
pages = "xviii + 713",
year = "1977",
ISBN = "0-13-165423-3",
ISBN-13 = "978-0-13-165423-5",
LCCN = "QA76.9.D3 M36 1977",
bibdate = "Thu Jul 14 16:44:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Computer, Datenbank, Datenbanksystem,
Datenfernverarbeitung, Datenorganisation,
Datenuebertragung, Datenverwaltung,
Dokumentationssystem, Organisation, Relationen-modell,
Software-technologie, Informationssystem",
remark = "Contents: Part I: Logical Organization 4. What Should
be the Objectives of a Data Base Organization 5.
Entities and Attributes 6. Schemas and Subschemas 7.
Data Base Management Systems 8. Tree Structures 9. Plex
Structures 10. Data Description Languages 11. The
Codasyl Data Description Language 12. IBM's Data
Language/I 13. Relational Data Bases 14. Third Normal
Form 15. Varieties of Data Independence 16. Operations
Systems Versus Information Systems Part II: Physical
Organization 17. Criteria Affecting Physical
Organization 18. Differences Between Physical and
Logical Organiation 19. Pointers 20. Chains and Ring
Structures 21. Addessing Techniques 22. Indexed
Sequential Organizations 23. Hashing 24. Physical
Representations of Tree Structures 25. Physical
Representations of Plex Structures 26. Multiple-key
Retrieval 27. Index Organization 28. A Comparison of
Multiple-key Organizations 29. Separating Data and
Relationships 30. Index Searching Techniques 31. Data
Compaction 32. Virtual Memory and Storage Hierarchies
33. Inverted File Systems 34. Volatile Files 35. Fast
Response Systems 36. Associative Memory App. A. The
Mean Number of Probes in a Binary Search App. B. Sample
Logical Data Descriptions Class Questions Index.",
}
@Article{McDonell:1977:III,
author = "K. J. McDonell",
title = "An inverted index implementation",
journal = j-COMP-J,
volume = "20",
number = "2",
pages = "116--123",
month = may,
year = "1977",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/116.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/117.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/118.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/119.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/120.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/121.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/122.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_02/tiff/123.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "Dept. of Information Sci., Monash Univ., Clayton,
Vic., Australia",
keywords = "access organization; data processing; file
organisation; hash addressed; implementation; inverted
index; random; simulation; variable length records",
treatment = "P Practical",
}
@Book{Mehlhorn:1977:EA,
author = "K. Mehlhorn",
title = "Effiziente Algorithmen",
publisher = pub-TEUBNER,
address = pub-TEUBNER:adr,
pages = "240",
year = "1977",
ISBN = "3-519-02343-1",
ISBN-13 = "978-3-519-02343-2",
LCCN = "QA76.6 .M43",
bibdate = "Thu Jul 14 16:44:56 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Hashing, Komplexitaet, Komplexitaetsuntersuchung,
Sortieren, Suchen, Wegeproblem",
}
@Article{Rosenberg:1977:HSE,
author = "Arnold L. Rosenberg and Larry J. Stockmeyer",
title = "Hashing Schemes for Extendible Arrays",
journal = j-J-ACM,
volume = "24",
number = "2",
pages = "199--221",
month = apr,
year = "1977",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Tue Nov 01 22:49:27 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Rosenberg:1977:SRA,
author = "A. L. Rosenberg",
title = "On Storing Ragged Arrays by Hashing",
journal = j-MATH-SYS-THEORY,
volume = "10",
number = "??",
pages = "??",
year = "1977",
CODEN = "MASTBA",
ISSN = "0025-5661",
bibdate = "Thu Jul 21 09:33:19 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Sprugnoli:1977:PHF,
author = "Renzo Sprugnoli",
title = "Perfect Hashing Functions: {A} Single Probe Retrieving
Method for Static Sets",
journal = j-CACM,
volume = "20",
number = "11",
pages = "841--850",
month = nov,
year = "1977",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
MRclass = "68A50",
MRnumber = "56 17255",
MRreviewer = "Eberhard Ludde",
bibdate = "Fri Apr 30 11:19:02 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "This is the first discussion on perfect hashing;
describes heuristics for constructing perfect hash
functions. See comments in \cite{Anderson:1979:CPH}.",
abstract = "A refinement of hashing which allows retrieval of an
item in a static table with a single probe is
considered. Given a set I of identifiers, two methods
are presented for building, in a mechanical way,
perfect hashing functions, i.e., functions transforming
the elements of I into unique addresses. The first
method, the ``quotient reduction'' method, is shown to
be complete in the sense that for every set I the
smallest table in which the elements of I can be stored
and from which they can be retrieved by using a perfect
hashing function constructed by this method can be
found. However, for nonuniformly distributed sets, this
method can give rather sparse tables. The second
method, the ``remainder reduction'' method, is not
complete in the above sense, but it seems to give
minimal (or almost minimal) tables for every kind of
set. The two techniques are applicable directly to
small sets. Some methods to extend these results to
larger sets are also presented. A rough comparison with
ordinary hashing is given which shows that this method
can be used conveniently in several practical
applications.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "Istituto di Elaborazione della Informazione, CNR,
Pisa, Italy",
journalabr = "Commun ACM",
keywords = "computer programming; file organisation; functions;
perfect hashing; retrieving; single probe; static
sets",
treatment = "T Theoretical or Mathematical",
}
@Article{Zobrist:1977:DCO,
author = "Albert L. Zobrist and Frederick R. {Carlson, Jr.}",
title = "Detection of Combined Occurrences",
journal = j-CACM,
volume = "20",
number = "1",
pages = "31--35",
month = jan,
year = "1977",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 07:31:46 MST 2001",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#ZobristC77;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "In this paper it is supposed that the variables
x//1,\ldots{},x//n each have finite range with the
variable x//i taking on p//i possible values and that
the values of the variables are changing with time. It
is supposed further that it is desired to detect
occurrences in which some subset of the variables
achieve particular values. Finally, it is supposed that
the problem involves the detection of a large number of
combined occurrences for a large number of changes of
values of variables. Two efficient solutions for this
problem are described. Both methods have the unusual
property of being faster for systems where the sum p//1
plus\ldots{} plus p//n is larger. A chess playing
application of the second solution algorithm is
provided.",
acknowledgement = ack-nhfb,
classcodes = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6130 (Data
handling techniques)",
classification = "461; 723; 912",
corpsource = "Jet Propulsion Lab., Pasadena, CA, USA",
journalabr = "Commun ACM",
keywords = "$n$ tuples; artificial; artificial intelligence;
chess; coding; combined occurrences; computer
programming; error analysis; hash coding; intelligence;
pattern recognition; pattern recognition systems;
programming; retrieval; secondary keys; sorting;
systems science and cybernetics --- Artificial
Intelligence; theory",
oldlabel = "ZobristC77",
treatment = "P Practical; T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ZobristC77",
}
@Article{Ajtai:1978:TNF,
author = "Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and Endre
Szemer{\'e}di",
title = "There is No Fast Single Hashing Algorithm",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "270--273",
month = oct,
year = "1978",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68H05 (68C25)",
MRnumber = "80a:68112",
MRreviewer = "Eberhard L{\"u}dde",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Burkhard:1978:PHC,
author = "W. A. Burkhard",
title = "Partial-Match Hash Coding Projection Functions",
journal = "Proceedings of the Hawaii International Conference on
System Science",
volume = "1",
number = "??",
pages = "99--105",
month = "????",
year = "1978",
CODEN = "PHISD7",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "File designs suitable for retrieval from a file of
k-letter words when queries may be partially specified
are examined. Modest storage redundancy is introduced
to obtain attractive improved worst case and average
case performance. The implementation of such designs is
discussed.",
acknowledgement = ack-nhfb,
classification = "723; 901",
conference = "Proc Hawaii Int Conf Syst Sci 11th",
keywords = "data base systems; information retrieval systems",
meetingaddress = "Honolulu, HI, USA",
meetingdate = "Jan 5--6 1978",
meetingdate2 = "01/05--06/78",
}
@Article{Doster:1978:AHG,
author = "Wolfgang Doster",
title = "{Auswahl eines Hashverfahrens bei grosser Anzahl von
speziellen Schluesselwoertern (Postortsnamen)}.
[{Selection} of a Hash-Coding Method for a Large Number
of Special Key Words (Postal Place Names)]",
journal = "{Wissenschaftliche Berichte AEG-Telefunken}",
volume = "51",
number = "2-3",
pages = "104--114",
month = "????",
year = "1978",
CODEN = "WBATB3",
ISSN = "0043-6801",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Different hash-coding methods, the selection of one of
these methods, the problems and experiences which
occurred using a special kind of key word are
described. The set of the key words consists of the
official postal place names in West Germany. The chosen
hash-coding method is used for compiling a dictionary
of these 15,789 place names and for looking up the
place names in this postal dictionary during operation
of an automatic postal address reading machine.",
acknowledgement = ack-nhfb,
classification = "691; 723; 902",
journalabr = "Wiss Ber AEG Telefunken",
keywords = "codes, symbolic; data processing; hash coding; mail
handling --- Computer Applications",
language = "German",
}
@Article{Doszkocs:1978:AAI,
author = "Tamas E. Doszkocs",
title = "{AID}, an Associative Interactive Dictionary for
Online Searching",
journal = "Online Review",
volume = "2",
number = "2",
pages = "163--165",
month = jun,
year = "1978",
CODEN = "OLREDR",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The paper describes the prototype Associative
Interactive Dictionary (AID) system for search strategy
formulation on a large operational free text on-line
bibliographic retrieval system. The primary design
objective of the Associative Interactive Dictionary is
the automatic generation and display of related terms,
synonyms, broader and narrower terms and other semantic
associations for given search concepts. The associative
analysis procedures rely on statistical frequency
distribution information about term occurrences in a
set of document texts retrieved in response to a
Boolean search query and the occurrence frequencies of
the same terms in the entire data base. The prototype
AID system overcomes the problems of scale by utilizing
a computationally efficient similarity measure and a
highly compressed in-core hash table of terms and term
frequencies. The hash table can accommodate tens of
thousands of free text search terms.",
acknowledgement = ack-nhfb,
classification = "723; 901; 922",
journalabr = "On Line Rev",
keywords = "computer systems programming --- Table Lookup; hash
table; information retrieval systems; online searching;
statistical methods",
}
@Article{Guibas:1978:ADH,
author = "L. J. Guibas and E. Szemer{\'e}di",
title = "The Analysis of Double Hashing",
journal = j-J-COMP-SYS-SCI,
volume = "16",
number = "2",
pages = "226--274",
month = apr,
year = "1978",
CODEN = "JCSSBM",
ISSN = "0022-0000",
bibdate = "Thu Jul 21 09:19:55 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Guibas:1978:AHT,
author = "Leo J. Guibas",
title = "The Analysis of Hashing Techniques that Exhibit
$k$-ary Clustering",
journal = j-J-ACM,
volume = "25",
number = "4",
pages = "544--555",
month = oct,
year = "1978",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The performance of hashing algorithms is related to
the notion of clustering, that is, the pile-up
phenomenon that occurs because many keys may probe the
table locations in the same sequence. A hashing
technique is said to exhibit k-ary clustering if the
search for a key begins with k independent random
probes and the subsequent sequence of probes is
completely determined by the location of the k initial
probes. Such techniques may be very bad; for instance,
the average number of probes necessary for insertion
may grow linearly with the table size. However, on the
average (that is if the permutations describing the
method are randomly chosen), k-ary clustering
techniques for k greater than 1 are very good. In fact
the average performance is asymptotically equivalent to
the performance of uniform probing, a method that
exhibits no clustering and is known to be optimal in a
certain sense.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming --- Subroutines; hashing
algorithms; information science",
}
@Article{Halatsis:1978:PHT,
author = "Constantine Halatsis and George Philokyprou",
title = "Pseudochaining in Hash Tables",
journal = j-CACM,
volume = "21",
number = "7",
pages = "554--557",
month = jul,
year = "1978",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Presentation of pseudochaining as a new
collision-resolution method. Pseudochaining is half way
between open addressing and chaining. It owes its name
to the fact that link fields are present in each cell
of the hash table which permits ``chaining'' of the
first overflow items in the table. The efficiency of
the method is derived and a tradeoff analysis is
given.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer programming",
}
@TechReport{Hill:1978:CSVa,
author = "Edward {Hill. Jr}",
title = "A Comparative Study of Very Large Data Bases",
institution = "????",
address = "Berlin, Germany",
pages = "??",
year = "1978",
bibdate = "Thu Jul 21 09:33:28 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Binaer-baum, Datei, Datenbank, Datenorganisation,
Datenstruktur, Datenverwaltung, Einfuegen,
Hash-verfahren, Hashing, Invertierte Datei, Loeschen,
Retrieval, Satz, Speicherverwaltung, Update",
remark = "This monograph presents a comparison of methods for
organizing very large data called a very large data
base to facilitate fast retrieval of desired
information on direct access storage devices. In a very
large data base involving retrieval and updating, the
major factor of immediate concern is the average number
of access storage device to complete a request. The
average number of accesses to store and retrieve items
on a direct access storage device for hashing methods
using chaining with separate lists and linear probing
is presented. A new algorithm and performance measures
for chaining with coalescing lists is presented. New
performance measures are presented for storing and
retrieving with a binary search tree and a trie stored
on a direct access storage device. Algorithms are
presented to perform retrieval, insertion, deletion and
the inverted file generation operations for an inverted
file. New performance measures are presented for an
inverted file. The methods are developed using a
component concept. A hybrid method involving components
is used for the linked files. All methods are analyzed,
along with their data structures, to show their effect
on the average number of accesses to the direct access
storage device while processing a request. Finally, a
comparison is developed and each method is compared.",
}
@Book{Hill:1978:CSVb,
author = "Edward {Hill, Jr.}",
title = "A Comparative Study of Very Large Data Bases",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 140",
year = "1978",
ISBN = "0-387-08653-6",
ISBN-13 = "978-0-387-08653-8",
LCCN = "QA76.9.D3 H54 1978",
bibdate = "Sun Jul 17 09:40:40 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "A revision of the author's thesis, George Washington
University, 1977.",
acknowledgement = ack-nhfb,
}
@Book{Horowitz:1978:FCA,
author = "Ellis Horowitz and Sartaj Sahni",
title = "Fundamentals of Computer Algorithms",
publisher = pub-CSP,
address = pub-CSP:adr,
pages = "xiv + 626",
year = "1978",
ISBN = "0-914894-22-6",
ISBN-13 = "978-0-914894-22-3",
LCCN = "QA76.6 .H67 1978",
bibdate = "Wed Dec 15 10:31:07 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "A standard textbook treatment of well-known hashing
algorithms appears on pp. 82--93.",
acknowledgement = ack-nhfb,
}
@Article{Larson:1978:DH,
author = "Per-{\AA}ke Larson",
title = "Dynamic Hashing",
journal = j-BIT,
volume = "18",
number = "2",
pages = "184--201",
year = "1978",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Nov 14 20:58:37 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also \cite{Regnier:1985:AGF}.",
abstract = "A new file organisation called dynamic hashing is
presented. The organisation is based on normal hashing,
but the allocated storage space can easily be increased
and decreased without reorganising the file, according
to the number of records actually stored in the file.
The expected storage utilisation is analysed and is
shown to be approximately 69\% all the time. Algorithms
for inserting and deleting a record are presented and
analysed. Retrieval of a record is fast, requiring only
one access to secondary storage. There are no overflow
records. The proposed scheme necessitates maintenance
of a relatively small index structured as a forest of
binary trees or slightly modified binary trees. The
expected size of the index is analysed and a compact
representation of the index is suggested.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "data processing",
}
@TechReport{Lipton:1978:EHS,
author = "R. J. Lipton and A. Rosenberg and A. C. Yao",
title = "External Hashing Schemes for Collections of Data
Structures",
number = "Dep. Report STA",
institution = "Stanford University",
pages = "??",
month = dec,
year = "1978",
bibdate = "Thu Jul 21 08:46:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Litwin:1978:VHD,
author = "W. Litwin",
key = "Litwin",
title = "Virtual Hashing: {A} Dynamically Changing Hashing",
crossref = "Yao:1978:VLD",
pages = "517--523",
year = "1978",
bibdate = "Mon Jul 18 09:23:08 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Louis-Gavet:1978:DAI,
author = "Guy Louis-Gavet",
title = "Diverses applications issues d'une fonction $f$ de
compactage bas{\'e}e sur une {\'e}tude math{\'e}matique
du langage naturel (compactage de donn{\'e}es,
comparaison de textes, hash-coding). [Various
Applications Issued from a Compression Function $f$
Based on a Mathematical Study of the Natural Language
(Data Compression, Comparison of Texts, Hash-Coding)]",
journal = "RAIRO Informatique/Computer Science (Revue
Fran{\c{c}}aise d'Automatique, d'Informatique et de
Recherche Operationnelle)",
volume = "12",
number = "1",
pages = "47--71",
month = "????",
year = "1978",
CODEN = "RSINDN",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various compression techniques are discussed, along
with numerous applications. A method of compression is
considered which is based on a mathematical study
concerned with the repartition of characters in a set
natural language. A high rate of compression without
risk of redundancies is obtained. It is about 1/30
(sometimes much higher) when operating in an
interrogational mode and about one quarter when we want
to find again the original data. The applications
described demonstrate the interest of this approach:
compression of keywords of a thesaurus, of names-first
names, of titles-authors of books; comparison of texts,
and applications in Hash-coding.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "RAIRO Inf Comput Sci",
keywords = "computer programming languages",
language = "French",
}
@Article{Lyon:1978:HLP,
author = "Gordon Lyon",
title = "Hashing with Linear Probing and Frequency Ordering",
journal = "Journal of Research of the National Bureau of
Standards (United States)",
volume = "83",
number = "5",
pages = "445--447",
month = sep # "--" # oct,
year = "1978",
CODEN = "JRNBAG",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A simple linear probing and exchanging method of
Burkhard locally rearranges hash tables to account for
reference frequencies. Examples demonstrate how
frequency-sensitive rearrangements that depend upon
linear probing can significantly enhance searches.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Res Natl Bur Stand (US)",
keywords = "computer programming",
}
@InProceedings{Markowsky:1978:AUC,
author = "G. Markowsky and J. L. Carter and M. N. Wegman",
title = "Analysis of a Universal Class of Hash Functions",
crossref = "Winkowski:1978:SMF",
pages = "345--354",
year = "1978",
bibdate = "Thu Oct 31 18:54:16 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Rivest:1978:OAK,
author = "Ronald L. Rivest",
title = "Optimal Arrangement of Keys in a Hash Table",
journal = j-J-ACM,
volume = "25",
number = "2",
pages = "200--209",
month = apr,
year = "1978",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See \cite{Yao:1985:OAK}.",
abstract = "when open addressing is used to resolve collisions in
a hash table, a given set of keys may be arranged in
many ways; typically this depends on the order in which
the keys are inserted. It is shown that arrangements
minimizing either the average or worst-cast number of
probes required to retrieve any key in the table can be
found using an algorithm for the assignment problem.
The worst-case retrieval time can be reduced to
O(log//2(M)) with probability 1 minus epsilon (M) when
storing M keys in a table of size M, where epsilon (M)
goes to 0 as M goes to infinity. Also examined are
insertion algorithms to see how to apply these ideas
for a dynamically changing set of keys.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming",
}
@Article{Samson:1978:STU,
author = "W. B. Samson and R. H. Davis",
title = "Search Times Using Hash Tables for Records with
Non-Unique Keys",
journal = j-COMP-J,
volume = "21",
number = "3",
pages = "210--214",
month = aug,
year = "1978",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Recent research in hash coding has concentrated on
unique keys, or uniform distributions of keys. This
paper is intended to clarify the effect of non-unique
keys with various distributions on search times in the
hash table thus enabling recommendations to be made to
those who must deal with hash tables of this type. It
is found that extreme rank-order frequency distribution
of keys, such as the Zipf distribution, result in much
higher access times than more uniform distributions,
but it is possible to reduce these to some extent by
loading records with common keys on to the hash table
first.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Comput J",
keywords = "computer programming; data processing --- Data
Structures",
}
@Article{Sheil:1978:MST,
author = "B. A. Sheil",
title = "Median Split Trees: {A} Fast Lookup Technique for
Frequently Occurring Keys",
journal = j-CACM,
volume = "21",
number = "11",
pages = "947--958",
month = nov,
year = "1978",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
MRclass = "68H05",
MRnumber = "80a:68116",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Early work on minimal perfect hash functions.",
acknowledgement = ack-nhfb,
}
@TechReport{Willard:1978:NDS,
author = "Dan E. Willard",
title = "New data structures for orthogonal queries",
number = "TR-22-78",
institution = inst-HARVARD-CRCT,
address = inst-HARVARD-CRCT:adr,
pages = "??",
year = "1978",
bibdate = "Fri Apr 30 11:20:48 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Published in \cite{Willard:1985:NDS}.",
acknowledgement = ack-nhfb,
}
@Article{Wipke:1978:HFR,
author = "W. T. Wipke and S. Krishnan and G. I. Ouchi",
title = "Hash Functions for Rapid Storage and Retrieval of
Chemical Structures",
journal = j-J-CHEM-INFO-COMP-SCI,
volume = "18",
number = "1",
pages = "32--37",
month = feb,
year = "1978",
CODEN = "JCISD8",
ISSN = "0095-2338",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A method is described for determining if a given
chemical structure or its enantiomer is contained
within a file in time essentially independent of file
size. The stereochemically extended Morgan algorithm
(SEMA) name is used as a key for directly computing the
address of the compound. Three separate files of
compounds are used to study the effectiveness of four
different hash functions. Various subsets of the SEMA
name were also used as keys to study effect of
information loss on hashing efficiency. A work function
is used to compare the amount of work required to
access a compound in the file.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "J Chem Inf Comput Sci",
keywords = "information retrieval systems",
}
@Article{Aho:1979:OPM,
author = "Alfred V. Aho and Jeffrey D. Ullman",
title = "Optimal Partial-Match Retrieval When Fields are
Independently Specified",
journal = j-TODS,
volume = "4",
number = "2",
pages = "168--179",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Graphics/siggraph/79.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p168-aho/p168-aho.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p168-aho/",
abstract = "This paper considers the design of a system to answer
partial-match queries from a file containing a
collection of records, each record consisting of a
sequence of fields. A partial-match query is a
specification of values for zero or more fields of a
record, and the answer to a query is a listing of all
records in the file whose fields match the specified
values.\par
A design is considered in which the file is stored in a
set of bins. A formula is derived for the optimal
number of bits in a bin address to assign to each
field, assuming the probability that a given field is
specified in a query is independent of what other
fields are specified. Implications of the optimality
criterion on the size of bins are also discussed.",
acknowledgement = ack-nhfb,
classification = "723; 901",
keywords = "associative searching; data processing --- file
organization; file organization; hashing; information
retrieval; information science; partial-match
retrieval; searching",
oldlabel = "geom-2",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Retrieval models}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Anderson:1979:CCP,
author = "M. R. Anderson and M. G. Anderson",
title = "Corrigendum: {``Comments on Perfect Hashing Functions:
A Single Probe Retrieving Method for Static Sets''}",
journal = j-CACM,
volume = "22",
number = "10",
pages = "553",
month = oct,
year = "1979",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Wed Dec 27 08:06:10 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Corrects \cite{Anderson:1979:CPH}.",
acknowledgement = ack-nhfb,
}
@Article{Anderson:1979:CPH,
author = "M. R. Anderson and M. G. Anderson",
title = "Comments on Perfect Hashing Functions: {A} Single
Probe Retrieving Method for Static Sets",
journal = j-CACM,
volume = "22",
number = "2",
pages = "104",
month = feb,
year = "1979",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Jul 19 11:16:03 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Corrects errors in \cite{Sprugnoli:1977:PHF}. See also
corrigendum: \cite{Anderson:1979:CCP}.",
acknowledgement = ack-nhfb,
}
@Article{Babb:1979:IRD,
author = "E. Babb",
title = "Implementing a Relational Database by Means of
Specialized Hardware",
journal = j-TODS,
volume = "4",
number = "1",
pages = "1--29",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p1-babb/p1-babb.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p1-babb/",
abstract = "New hardware is described which allows the rapid
execution of queries demanding the joining of
physically stored relations. The main feature of the
hardware is a special store which can rapidly remember
or recall data. This data might be pointers from one
file to another, in which case the memory helps with
queries on joins of files. Alternatively, the memory
can help remove redundant data during projection[s??],
giving a considerable speed advantage over conventional
hardware.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "bit array; CAFS; content addressing; database;
hardware support machine bit vector filter
probabilistic semi-join TODS, data base systems;
hashing; information retrieval; join; projection;
relational model; selection; special hardware",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Bolour:1979:OPM,
author = "Azad Bolour",
title = "Optimality Properties of Multiple-Key Hashing
Functions",
journal = j-J-ACM,
volume = "26",
number = "2",
pages = "196--210",
month = apr,
year = "1979",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "An analysis of the achievable efficiency of retrieval
algorithms based on hashing for answering partial-match
queries is presented. The remarkable power of hashing
in limiting the search of a given key value in a file
is well known. Similarly, it is possible to avoid
searching major portions of a file in answering
partial-match or multiattribute queries by hashing a
multiattribute file into a number of buckets.
Multiple-key hashing is a simple procedure for doing so
and works by combining the effects of a number of
hashing functions, one for each attribute in a record.
By using a measure of retrieval efficiency in which
queries specifying the same set of attributes are given
equal weight, it is shown that multiple-key hashing
often provides about the most efficient means of
partitioning a file for the purpose of answering
partial-match queries.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming",
}
@Article{Burkhard:1979:PHC,
author = "Walter A. Burkhard",
title = "Partial-Match Hash Coding: Benefits of Redundancy",
journal = j-TODS,
volume = "4",
number = "2",
pages = "228--239",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "File designs suitable for retrieval from a file of
k-field records when queries may be partially specified
are examined. Storage redundancy is introduced to
obtain improved worst-case and average-case
performances. The resulting storage schemes are
appropriate for replicated distributed database
environments; it is possible to improve the overall
average and worst-case behavior for query response as
well as provide an environment with very high
reliability. Within practical systems, it will be
possible to improve the query response time performance
as well as reliability over comparable systems without
replication.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "ACM Trans Database Syst",
keywords = "data base systems; data processing --- File
Organization",
}
@Article{Burkhard:1979:PMH,
author = "W. A. Burkhard",
title = "Partial-match hash coding: benefits and redundancy",
journal = j-TODS,
volume = "4",
number = "2",
pages = "228--239",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Carter:1979:UCH,
author = "J. Lawrence Carter and Mark N. Wegman",
title = "Universal Classes of Hash Functions",
journal = j-J-COMP-SYS-SCI,
volume = "18",
number = "2",
pages = "143--154",
month = apr,
year = "1979",
CODEN = "JCSSBM",
ISSN = "0022-0000",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "An input independent average linear time algorithm for
storage and retrieval on keys is given. The algorithm
makes a random choice of hash function from a suitable
class of hash functions. Given any sequence of inputs
the expected time (averaging over all functions in the
class) to store and retrieve elements is linear in the
length of the sequence. The number of references to the
data base required by the algorithm for any input is
extremely close to the theoretical minimum for any
possible hash function with randomly distributed
inputs. Three suitable classes of hash functions are
presented which also can be evaluated rapidly. The
ability to analyze the cost of storage and retrieval
without worrying about the distribution of the input
allows as corollaries improvements on the bounds of
several algorithms.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Comput Syst Sci",
keywords = "computer programming; skew",
}
@InProceedings{Cowan:1979:HKR,
author = "Richard M. Cowan and Martin L. Griss",
title = "Hashing -- The Key to Rapid Pattern Matching",
crossref = "Ng:1979:ESS",
volume = "72",
pages = "266--278",
year = "1979",
bibdate = "Sun Jul 17 10:04:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{DeRemer:1979:SCS,
author = "Frank DeRemer and Philip Levy and Steve Hanson and
Philip Jackson and Richard Jullig and Tom Pittman",
title = "Summary of the characteristics of several `modern'
programming languages",
journal = j-SIGPLAN,
volume = "14",
number = "5",
pages = "28--45",
month = may,
year = "1979",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/988090.988095",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 16:10:38 MDT 2008",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Some characteristics of nine recently developed or
historically significant languages are discussed.
Abstraction capabilities of the languages are noted in
particular. Some characteristics of the languages are
displayed in tabular form and others are presented in a
separate discussion for each language. A hash coded
string table program is written in each language. This
paper is the result of a class project of a graduate
seminar in programming linguistics at the University of
California, Santa Cruz, led by Frank DeRemer",
acknowledgement = ack-nhfb,
}
@Article{Devillers:1979:HTG,
author = "R. Devillers and G. Louchard",
title = "Hashing Techniques, a Global Approach",
journal = "BIT (Copenhagen)",
volume = "19",
number = "3",
pages = "302--311",
month = "????",
year = "1979",
CODEN = "NBITAB",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A new method for more equitable comparison of various
hash table techniques is presented. It is applied to
some popular techniques: open addressing, coalescent
chaining and separate chaining. Another method, indexed
sub-tables, is also examined with more details and
shown to present some interesting features.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "computer programming",
}
@Article{Fagin:1979:EHF,
author = "Ronald Fagin and Jurg Nievergelt and Nicholas
Pippenger and H. Raymond Strong",
key = "Fagin et al.",
title = "Extendible Hashing --- a Fast Access Method for
Dynamic Files",
journal = j-TODS,
volume = "4",
number = "3",
pages = "315--344",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in/as: IBM Research Report RJ2305, Jul.
1978. See also \cite{Regnier:1985:AGF}.",
abstract = "Extendible hashing is a new access technique, in which
the user is guaranteed no more than two page faults to
locate the data associated with a given unique
identifier, or key. Unlike conventional hashing,
extendible hashing has a dynamic structure that grows
and shrinks gracefully as the database grows and
shrinks. This approach simultaneously solves the
problem of making hash tables that are extendible and
of making radix search trees that are balanced. We
study, by analysis and simulation, the performance of
extendible hashing. The results indicate that
extendible hashing provides an attractive alternative
to other access methods, such as balanced trees.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "ACM Trans Database Syst",
keywords = "access method; B-tree; data processing; directory;
extendible hashing; external hashing; file
organization; Hashing; index; radix search; searching;
trie",
remark = "The user is guaranteed no more than two page faults to
locate the data associated with a given unique
identifier, or key. Extendible hashing has a dynamic
structure that grows and shrinks as the database grows
and shrinks.",
}
@Article{Fortune:1979:NRN,
author = "Steve Fortune and John Hopcroft",
title = "A note on {Rabin}'s nearest-neighbor algorithm",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "1",
pages = "20--23",
day = "2",
month = jan,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68C25 (68G10)",
MRnumber = "81i:68060",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; C1140Z (Other topics in statistics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
journalabr = "Inf Process Lett",
keywords = "algorithm; algorithm theory; computer; hashing;
nearest neighbour algorithm; probabilistic nature;
Rabin's algorithm; statistical analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Gonnet:1979:EOH,
author = "Gaston H. Gonnet and J. Ian Munro",
title = "Efficient ordering of hash tables",
journal = j-SIAM-J-COMPUT,
volume = "8",
number = "3",
pages = "463--478",
month = "????",
year = "1979",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
MRclass = "68H05",
MRnumber = "80e:68237",
bibdate = "Sat Jan 18 18:03:50 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Graham:1979:HST,
author = "Susan L. Graham and William N. Joy and O. Roubine",
title = "Hashed symbol tables for languages with explicit scope
control",
crossref = "ACM:1979:PSS",
pages = "50--57",
year = "1979",
bibdate = "Mon Feb 11 11:46:20 1985",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Newer programming languages such as Modula and Euclid
provide more control than traditional Algol-like
languages such as ALGOL-60 and Pascal over the
inheritance, in inner scopes, of named entities
available in outer scopes. They also provide mechanisms
whereby chosen entities from inner scopes may be made
available to outer scopes. In this paper we show how a
hashed symbol table can be organized to implement these
new scope rules in a time and space efficient way.",
acknowledgement = ack-nhfb,
}
@TechReport{Griss:1979:HKR,
author = "M. L. Griss",
title = "Hashing---the Key to Rapid Pattern Matching",
number = "UUCS-79-108",
institution = "Computer Science Department, University of Utah",
pages = "??",
year = "1979",
bibdate = "Thu Jul 21 09:35:11 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Kohonen:1979:VFA,
author = "Teuvo Kohonen and Erkki Reuhkala",
title = "Very Fast Associative Method for the Recognition and
Correction of Misspelt Words, Based on Redundant Hash
Addressing",
journal = "IEEE Technical Papers Presented at the Joint
ASME/IEEE/AAR Railroad Conference (Association of
American Railroads)",
volume = "??",
number = "??",
pages = "807--809",
month = "????",
year = "1979",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A new software method for the recognition and
correction of misspelt character strings (words) is
introduced in this paper. The proposed principle is
essentially a dictionary method in which features of
strings are compared. By application of redundant hash
addressing, the best candidates are found directly,
whereby the speed of this method becomes orders of
magnitude greater than that of any direct comparison
method in which the whole dictionary must be retrieved.
A practical implementation with a 1021-word dictionary
capable of correcting single and double errors of the
insertion, deletion, and replacement type is reported.
The program used in our test was able to recognize and
correct about 40 words per second on a minicomputer.",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Proc of the Int Jt Conf on Pattern Recognition, 4th",
keywords = "character recognition",
meetingaddress = "Kyoto, Jpn",
meetingdate = "Nov 7--10 1978",
meetingdate2 = "11/07--10/78",
}
@PhdThesis{Litwin:1979:HVN,
author = "W. Litwin",
title = "Hachage Virtuel: Une Nouvelle Technique {d}'Adressage
de {M}{\'e}moires",
school = "????",
address = "Paris, France",
pages = "??",
year = "1979",
bibdate = "Thu Jul 21 09:35:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Adressierung, Dateiverwaltung, Datenbank,
Datenverwaltung, Dynamisch, Hashing, Leistungsanalyse,
Leistungsbewertung, Speicherung, Virtuell,
Zugriffstechnik",
remark = "1. Introduction 2. Techniques d'Adressage de Lichiers
et de Tables 3. Hachage Virtuel 1 4. Hachage Virtuel 2
5. Hachage Virtuel 0 6. Hachage Virtuel Lineare 7.
Conclusions.",
}
@TechReport{Litwin:1979:LVH,
author = "W. Litwin",
title = "Linear Virtual Hashing: {A} New Tool For Files and
Tables Implementation",
institution = "????",
address = "Le Chesnay, France",
pages = "??",
year = "1979",
bibdate = "Thu Jul 21 09:35:24 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datenverwaltung, Hashing, Leistungsbewertung, Linear,
Virtuell, Zugriffsmethode",
remark = "1. Introduction 2. Principles of Linear Virtual
Hashing 3. Performance Analysis 4. Comparative Analysis
5. Conclusions.",
}
@Article{Lyon:1979:BSS,
author = "Gordon Lyon",
title = "Batch Scheduling from Short Lists",
journal = j-INFO-PROC-LETT,
volume = "8",
number = "2",
pages = "57--59",
day = "15",
month = feb,
year = "1979",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68C25 (68G10)",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; C1290 (Applications of systems theory); C6120
(File organisation)",
corpsource = "Inst. for Computer Sci. and Technol., Nat. Bur. of
Stand., Washington, DC, USA",
journalabr = "Inf Process Lett",
keywords = "assignments; computer systems programming; hashing;
scheduling; short lists; storage allocation",
treatment = "T Theoretical or Mathematical",
}
@Article{McCarney:1979:LLH,
author = "Gary McCarney",
title = "Learn the Lingo and Hash Your Way into Faster Data
Base Management",
journal = j-ELECTRONIC-DESIGN,
volume = "27",
number = "11",
pages = "146--149",
month = may,
year = "1979",
CODEN = "ELODAW",
ISSN = "0013-4872",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A data base is a collection of information stored in a
manner that permits easy access. The designer of a data
base must decide at the outset how the data should be
stored to ensure rapid and easy retrieval. To meet
these goals, some fundamental rules, written in data
base management system (DBMS) terminology must be
observed. This article explains the specialized
language of this specialized field.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Electron Des",
keywords = "data base systems",
}
@Article{Mendelson:1979:PMO,
author = "H. Mendelson and U. Yechiali",
title = "Performance Measures for Ordered Lists in
Random-Access Files",
journal = j-J-ACM,
volume = "26",
number = "4",
pages = "654--677",
month = oct,
year = "1979",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sun Jul 17 09:19:06 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@MastersThesis{Neeb:1979:ISO,
author = "V. Neeb",
title = "Implementierungstechniken fuer Satzuebergreifende
Operationen in Relationalen Datenbanken",
school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu
Braunschweig",
address = "Braunschweig, Germany",
pages = "??",
year = "1979",
bibdate = "Sat Dec 30 09:27:13 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datei, Datenbank, Datenbanksystem, Division,
Hash-verfahren, Implementierungstechnik, Projektion,
Relational, Relationen-modell, Satzuebergreifende
Operation, Sortierung, Suchrechner, Sure, Verband,
Virtuelle Datei, Zugriffsplace",
remark = "1. Operationen auf Relationen 2.
Implementierungstechniken fuer Satzuebergreifende
Operationen des Relationenmodells in
Universalrechenanlagen 2.1. Das Implementierungsproblem
2.2. Implementierungsstufen und Strategien 2.3.
Modifikationen der Datenbankanfrage 2.4. Die
Systemsprache Lsl 2.5. Elemente eines Zugriffssystems
2.6. Manipulation der Logischen Daten- und
Speicherstruktur 2.7. Zusammenfassung.",
}
@Article{Pippenger:1979:ACT,
author = "Nicholas Pippenger",
title = "On the Application of Coding Theory to Hashing",
journal = j-IBM-JRD,
volume = "23",
number = "2",
pages = "225--226",
month = mar,
year = "1979",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Quick proofs are given for the characterization (due
to Schay, Raver, Hanan, and Palermo) of the collision
distance of a linear hashing function and for a dual
notion (called the restriction distance), which relates
to the accessibility of addresses by sets of keys and
the uniform distribution of sets of keys over
addresses.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IBM J Res Dev",
keywords = "codes, symbolic; data processing --- File
Organization",
}
@Article{Reuhkala:1979:RHA,
author = "Erkki Reuhkala and Matti Jalanko and Teuvo Kohonen",
title = "Redundant Hash Addressing Method Adapted for the
Postprocessing and Error-Correction of
Computer-Recognized Speech",
journal = "Record --- IEEE International Conference on Acoustics,
Speech \& Signal Processing",
volume = "??",
number = "??",
pages = "591--594",
month = "????",
year = "1979",
CODEN = "RIIPDR",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "In the recognition of spoken words, a frequently
applied method is to first convert the acoustic
waveforms into phonemic strings which are then compared
with prototype strings stored in a dictionary, using
some metric. A standard method is to use dynamic
programming for comparison of strings with variable
length. This procedure, however, is rather slow. A
recently introduced principle of string comparison is
based on redundant hash addressing, and it is
computationally at least an order of magnitude lighter.
This method is here applied, using multiple prototypes
of phonemic strings for each word in the dictionary.
The matching criterion thereby applied in fact
corresponds to a distance-weighted k-nearest-neighbor
classifier which allows length variations in strings.",
acknowledgement = ack-nhfb,
classification = "751",
conference = "Rec IEEE Int Conf Acoust Speech Signal Process 4th
(ICASSP '79)",
keywords = "speech",
meetingaddress = "Washington, DC, USA",
meetingdate = "Apr 2--4 1979",
meetingdate2 = "04/02--04/79",
}
@Article{Scheuermann:1979:OHH,
author = "Peter Scheuermann",
title = "Overflow Handling in Hashing Tables: a Hybrid
Approach",
journal = j-INFO-SYS,
volume = "4",
number = "3",
pages = "183--194",
month = "????",
year = "1979",
CODEN = "INSYD6",
ISSN = "0306-4379",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The hybrid method of handling overflows in hashing
tables, which encapsulates both open addressing and
chaining, is presented. A simulation model which
accounts for the effect of the loading order is
developed in order to evaluate the average number of
accesses and the average number of overflows under the
hybrid method. Furthermore, two cost models are
considered to compare the performance of the hybrid
method with open addressing and chaining for hashing
tables kept in main core and on secondary storage
devices.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Inf Syst",
keywords = "computer programming; data base systems",
}
@TechReport{Scholl:1979:PAN,
author = "M. Scholl",
title = "Performance Analysis of New File Organizations Based
on Dynamic Hash-coding",
institution = "????",
address = "Le Chesnay, France",
pages = "??",
month = mar,
year = "1979",
bibdate = "Thu Jul 21 09:35:33 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Dateiorganisation, Dateiverwaltung, Dynamisch,
Hashing, Leistungsanalyse, Zugriffsmethode",
remark = "Iria-bericht Rapport De Recherche No. 347 1.
Introduction 2. Dynamic Hashing With Deferred Splitting
3. Linear Splitting.",
}
@Article{Tai:1979:IPT,
author = "Kuo-Chung Tai",
title = "On the implementation of parsing tables",
journal = j-SIGPLAN,
volume = "14",
number = "1",
pages = "100--101",
month = jan,
year = "1979",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Apr 25 11:46:37 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6120 (File organisation)",
corpsource = "Dept of Computer Sci., North Carolina State Univ.,
Raleigh, NC, USA",
keywords = "file organisation; grammars; hashing; implementation;
LL parsing; LR parsing; parsing tables; syntax
parsing",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Tarjan:1979:SST,
author = "Robert Endre Tarjan and Andrew Chi-Chih Yao",
title = "Storing a Sparse Table",
journal = j-CACM,
volume = "22",
number = "11",
pages = "606--611",
month = nov,
year = "1979",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Apr 30 11:19:24 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also \cite{Fredman:1984:SST}.",
acknowledgement = ack-nhfb,
}
@Article{Wegman:1979:NCA,
author = "Mark N. Wegman and J. Lawrence Carter",
title = "New Classes and Applications of Hash Functions",
journal = "Annual Symposium on Foundations of Computer Science
(Proceedings)",
volume = "??",
number = "??",
pages = "175--182",
month = "????",
year = "1979",
CODEN = "ASFPDV",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Several new classes of hash functions with certain
desirable properties are exhibited, and two novel
applications for hashing are introduced which make use
of these functions. One class of functions is small,
yet is almost universal//2. If the functions hash n-bit
long names into m-bit indices, then specifying a member
of the class requires only O((m plus log//2log//2(n))
log//2(n)) bits as compared to O(n) bits for earlier
techniques. For long names, this is about a factor of m
larger than the lower bound of m plus log//2n-log//2m
bits. An application of this class is a provably secure
authentication technique for sending messages over
insecure lines. A second class of functions satisfies a
much stronger property than universal//2. The
application of testing sets for equality is
presented.",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Annu Symp Found Comput Sci Proc 20th",
keywords = "computer metatheory",
meetingaddress = "San Juan Bautista, PR",
meetingdate = "Oct 29--31 1979",
meetingdate2 = "10/29--31/79",
}
@Article{Willett:1979:DRE,
author = "Peter Willett",
title = "Document Retrieval Experiments Using Indexing
Vocabularies of Varying Size --- 2. Hashing,
Truncation, Digram and Trigram Encoding of Index
Terms",
journal = j-J-DOC,
volume = "35",
number = "4",
pages = "296--305",
month = dec,
year = "1979",
CODEN = "JDOCAS",
ISSN = "0022-0418 (print), 1758-7379 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This paper describes the use of fixed-length character
strings for controlling the size of indexing
vocabularies in reference retrieval systems.
Experiments with the Cranfield test collection show
that trigram encoding of words performs noticeably
better than the use of digrams; however, use of the
least frequent digram in each term produces more
acceptable results. Hashing of terms gives a better
performance than that obtained from a vocabulary of
comparable size produced by right-hand truncation. The
application of small indexing vocabularies to the
sequential searching of large document files is
discussed.",
acknowledgement = ack-nhfb,
classification = "901",
journalabr = "J Doc",
keywords = "index-term length manipulation; information retrieval
systems; information science --- Vocabulary Control",
}
@Article{Astakhov:1980:OEA,
author = "A. D. Astakhov",
title = "Organization of Efficient Access by Hashing",
journal = "Programming and Computer Software (English Translation
of Programmirovanie)",
volume = "6",
number = "3",
pages = "141--144",
month = may # "--" # jun,
year = "1980",
CODEN = "PCSODA",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This paper deals with means of organizing efficient
access to data by means of hashing (randomization).",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Program Comput Software",
keywords = "data storage, digital",
}
@TechReport{Batory:1980:OFD,
author = "D. S. Batory",
title = "Optimal File Design and Reorganisation Points",
institution = "????",
address = "Toronto, ON, Canada",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 09:35:52 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datei, Dateientwurf, Reorganisation",
remark = "Eine Methodik zur Bestimmung des Kostenminimums Bei
Einrichtung und Reorganisation von Dateien MIT
Bekannter Lebensduer wird Vorgestellt.
Beispielrechnungen fuer Hash-und Indexsequentielle
Dateien Werden Angegeben. der Bericht Baut auf der
Doktorarbeit des Autors Auf.",
}
@TechReport{Batory:1980:UMP,
author = "D. S. Batory and C. C. Gotlieb",
title = "A Unifying Model of Physical Databases",
institution = "????",
address = "Toronto, ON, Canada",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 09:35:58 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Dateiorganisation, Datenbank, Leistungsfaehigkeit,
Analytische Modellierung",
remark = "A unifying model for the study of database performance
issues is proposed. Applications of the model are shown
to synthesize and extend important work concerning
batched searching, transposed files, index selection,
dynamic hash based files, generalized access path
structures, differential files, network databases, and
multifile query processing.",
}
@Article{Cichelli:1980:CMP,
author = "R. J. Cichelli",
title = "On {Cichelli}'s Minimal Perfect Hash Functions
Method",
journal = j-CACM,
volume = "23",
number = "12",
pages = "728--729",
month = dec,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Fri Apr 30 11:07:26 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "This is the author's response to the comments in
\cite{Jaeschke:1980:CMP} about
\cite{Cichelli:1980:MPH}. See also
\cite{Sager:1985:PTG}.",
acknowledgement = ack-nhfb,
}
@Article{Cichelli:1980:MPH,
author = "Richard J. Cichelli",
key = "Cichelli",
title = "Minimal Perfect Hash Functions Made Simple",
journal = j-CACM,
volume = "23",
number = "1",
pages = "17--19",
month = jan,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See remarks in \cite{Jaeschke:1980:CMP}, and the
author's response in \cite{Cichelli:1980:CMP}. A simple
improvement giving dramatic speedups is described in
\cite{Trono:1995:CTS}.",
abstract = "A method is presented for computing machine
independent, minimal perfect hash functions of the
form: hash value implied by key length plus the
associated value of the key's first character plus the
associated value of the key's last character. Such
functions allow single probe retrieval from minimally
sized tables of identifier lists. Application areas
include table lookup for reserved words in compilers
and filtering high frequency words in natural language
processing. Functions for Pascal's reserved words,
Pascal's predefined identifiers, frequently occurring
English words, and month abbreviations are presented as
examples.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer programming",
}
@Article{Du:1980:SGC,
author = "H. C. Du and R. C. T. Lee",
title = "Symbolic {Gray} Code as a Multikey Hashing Function",
journal = j-IEEE-TRANS-PATT-ANAL-MACH-INTEL,
volume = "PAMI-2",
number = "1",
pages = "83--90",
month = jan,
year = "1980",
CODEN = "ITPIDJ",
ISSN = "0162-8828",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The binary Gray code is extended to symbolic Gray
code. It is then shown that this symbolic Gray code can
be used as a multikey hashing function for storing
symbolic records. The record stored at location k and
the record stored at location k plus 1 will be nearest
neighbors if this hashing function is used. Thus, this
symbolic Gray code hashing function exhibits some kind
of clustering property which will group similar records
together. Other properties of this hashing function are
discussed.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IEEE Trans Pattern Anal Mach Intell",
keywords = "codes, symbolic",
}
@InProceedings{Du:1980:SNP,
author = "Min Wen Du and Kuen Fang Jea and Den Wey Shieh",
title = "Study of a New Perfect Hash Scheme",
crossref = "IEEE:1980:PCI",
pages = "341--347",
year = "1980",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A new approach is proposed for the design of perfect
hash functions. The algorithm developed can not
guarantee the success of finding a perfect hash
function. However, it is shown that the probability of
getting one is extremely high. The basic ideas employed
in the construction are rehash and segmentation.
Analytic results are given which are applicable when
problem sizes are small. Extensive experiments have
been performed to test the approach for problems of
larger size.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "computer programming --- Subroutines; data processing;
hash functions",
}
@TechReport{Ehrig:1980:AIA,
author = "Hartmut Ehrig and H.-j. Kreowski and B. Mahr and P.
Padawitz",
title = "Algebraic Implementation of Abstract Data Types",
institution = "????",
address = "Berlin, Germany",
pages = "??",
year = "1980",
bibdate = "Tue Jul 26 09:03:29 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Abstrakter Datentyp, Algebraische Implementierung,
Algebraische Spezifikation",
remark = "Bericht Nr. 80--32. A new theory for algebraic
implementations of abstract data types is presented.
The concept of algebraic implementations includes
implementations for algorithms in programming languages
and it meets the requirements for stepwise refinement
of structured programs and software systems. On the
syntactical level an algebraic implementation
corresponds to a system of recursive programs while the
semantic level is defined by algebraic constructions,
called synthesis, restriction and identification.
moreover the concept al lows composition of
implementations and a rigorous study of correctness.
the main results of the paper are different correctness
criteria which are applied to a number of examples
including the implementation of sets by hash-tables.",
}
@TechReport{Fahlman:1980:HIS,
author = "S. E. Fahlman",
title = "The Hashnet Interconnection Scheme",
number = "CMU-CS-80-125",
institution = "Department of Computer Science, Carnegie Mellon
University, Pittsburgh, PA",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 09:36:32 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Gall:1980:SIA,
author = "R. Gall and Manfred Nagl",
title = "Software-implementation Assoziativer Speicher",
institution = "????",
address = "Koblenz, Germany",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 09:36:36 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "B-baum, Hashing, Assoziativer Speicher",
remark = "2. Benutzerschnittstelle des Betrachteten Assoziativen
Speichers 3. Implementation Mittels Hashing 3.
Implementation Mittels B-baeumen 3. Implementation
Mittels Vertikalverarbeitung.",
}
@Article{Gonnet:1980:OAH,
author = "Gaston H. Gonnet",
title = "Open-Addressing Hashing with Unequal-Probability
Keys",
journal = j-J-COMP-SYS-SCI,
volume = "21",
number = "??",
pages = "??",
year = "1980",
CODEN = "JCSSBM",
ISSN = "0022-0000",
bibdate = "Thu Jul 21 09:36:44 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Goto:1980:SHM,
author = "Eiichi Goto and Motoaki Terashima",
title = "Studies on Hashing --- 3. Mtac-Mathematical Tabulative
Automatic Computing",
journal = j-J-INF-PROCESS,
volume = "3",
number = "1",
pages = "23--30",
month = "????",
year = "1980",
CODEN = "JIPRDE",
ISSN = "0387-6101",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Tabulation vs. recomputation of mathematical function
is a typical space vs. time tradeoff problem in
computing. Two principles, (P1) on demand tabulation
and (P2) reclaimable tabulation, are proposed to widen
the range of applicability of tabulation. For some
cases these principles are shown to be similar in
effect to recursion elimination. The results of
software implementation of these principles are given.
Another MTAC (Mathematical Tabulative Architecture for
Computers) that relates to Babbage's difference engine,
to hardware hashing, and to a modified buffer (cache)
register is also discussed.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Inf Process",
keywords = "computer programming; computer systems programming ---
Table Lookup",
}
@Article{Gunji:1980:SHC,
author = "Takao Gunji and Eiichi Goto",
title = "Studies on Hashing --- 1. a Comparison of Hashing
Algorithms with Key Deletion",
journal = j-J-INF-PROCESS,
volume = "3",
number = "1",
pages = "1--12",
month = "????",
year = "1980",
CODEN = "JIPRDE",
ISSN = "0387-6101",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Four concepts sigma (storage utility factor), U
(average number of probes for unsuccessful searching),
I (that for insertion), and S (that for successful
searching) are introduced to compare speed and memory
tradeoffs of various hashing algorithms. An open
addressing hashing scheme suited for frequency deletion
of nonrelocatable keys is proposed and analyzed in
terms of the four concepts.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Inf Process",
keywords = "data processing --- Data Structures; data storage,
digital",
}
@Article{Jaeschke:1980:CMP,
author = "G. Jaeschke and G. Osterburg",
title = "On {Cichelli}'s Minimal Perfect Hash Functions
Method",
journal = j-CACM,
volume = "23",
number = "12",
pages = "728--729",
month = dec,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Jul 19 22:51:08 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "This letter to the editor contains comments on
\cite{Cichelli:1980:MPH}, together with a response from
R. J. Cichelli \cite{Cichelli:1980:CMP}.",
acknowledgement = ack-nhfb,
}
@PhdThesis{Kim:1980:QOR,
author = "W. Kim",
title = "Query Optimization for Relational Database Systems",
number = "TR. UTUDCDS-??",
school = "University of Illinois, Urbana",
pages = "??",
month = oct,
year = "1980",
bibdate = "Thu Jul 21 09:36:50 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Notes on block method for join and product, sorting
and hashing, block structured queries, multiple query
processing, and relational database machines. [Shel].",
}
@Book{Kohonen:1980:CAM,
author = "Teuvo Kohonen",
title = "Content-addressable memories",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 368",
year = "1980",
ISBN = "0-387-09823-2 (New York), 3-540-09823-2 (Berlin)",
ISBN-13 = "978-0-387-09823-4 (New York), 978-3-540-09823-2
(Berlin)",
LCCN = "TK7895.M4 K63",
bibdate = "Mon Jul 18 20:44:15 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Hashing is covered in the discussion of software-based
content-addressable memories in Chapter 2.",
price = "US\$39.00",
acknowledgement = ack-nhfb,
}
@Article{Kohonen:1980:TRS,
author = "T. Kohonen and H. Riittinen and M. Jalanko and E.
Reuhkala and S. Haltsonen",
title = "Thousand-Word Recognition System Based on the Learning
Subspace Method and Redundant Hash Addressing",
journal = "NATO Conference Series, (Series) 4: Marine Sciences",
volume = "1",
number = "??",
pages = "158--165",
month = "????",
year = "1980",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A description is given of a series of isolated-word
recognition experiments on a thousand-word dictionary.
In order to facilitate direct comparison of a number of
spectral and string classification methods, the
experimental system was organized in two stages: 1.
Segmentation and labelling of the speech waveform with
respect to 19 phonemic classes. 2. Identification of
phonemic transcriptions (word recognition). A
preliminary comparison of five spectral classification
methods indicate that a new method introduced by the
authors, the Learning Subspace Method (LSM) was
superior by a clear margin for the first stage.",
acknowledgement = ack-nhfb,
classification = "751",
journalabr = "Proc Int Conf Pattern Recognition",
keywords = "speech",
meetingaddress = "Miami Beach, FL, USA",
meetingdate = "Dec 1--4 1980",
meetingdate2 = "12/01--04/80",
}
@Article{Larson:1980:ARH,
author = "Per Ake Larson",
title = "Analysis of Repeated Hashing",
journal = "BIT (Copenhagen)",
volume = "20",
number = "1",
pages = "25--32",
month = "????",
year = "1980",
CODEN = "NBITAB",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A performance analysis of an overflow handling method
for hash files, here called repeated hashing, is
reported. The basic idea of repeated hashing is to
rehash the overflow records into a smaller separate
storage area; the overflow records from this area are
in turn hashed into a still smaller separate storage
area, etc. The expected retrieval performance and the
storage requirements are analyzed, both for initial
loading and steady state. The problem of optimally
partitioning the total storage area is considered and
the optimal solution is given. It is concluded,
however, that the usefulness of repeated hashing is in
doubt because there are methods having the same
performance but requiring less maintenance.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "computer programming; data processing --- File
Organization",
}
@InProceedings{Larson:1980:LHP,
author = "Per-{\AA}ke Larson",
title = "Linear Hashing with Partial Expansions",
crossref = "Lochovsky:1980:SIC",
pages = "224--232",
year = "1980",
bibdate = "Mon Jul 18 08:52:17 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Algorithmenanalyse, Dateiorganisation, Dynamische
Speicherverwaltung, Dynamisches Hashing, Hashing,
Lineares Hashing, Suchen, Virtuelles Hashing",
keywords = "VLDB",
remark = "Es wird Erweitertes Lineares Hashen Vorgestellt und
Analysiert.",
}
@TechReport{Larson:1980:PAL,
author = "Per-{\AA}ke Larson",
title = "Performance Analysis of Linear Hashing With Partial
Expansions",
institution = "????",
address = "Abo, Finland",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 08:46:13 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Dateiorganisation, Dynamische Speicherverwaltung,
Dynamisches Hashing, Hashing, Lineares Hashing,
Virtuelles Hashing, Zugriffstechnik",
remark = "Ein Neues Verfahren zur Dateiorganisation ---
Erweitertes Lineares Hashen --- wird Vorgestellt und
Analysiert. Diese Organisation ist Gedacht fuer
Dateien, Deren Groesse Stark Variiert. Als
Bewertungskriterien fuer die Leistungsfaehigkeit Werden
die Laenge von Erfolgreicher und Erfolgloser Suche, die
Zahl der Seitenzugriffe Zum Loeschen und Einfuegen
eines Satzes und die Groesse des Ueberlaufbereichs
Betrachtet.",
}
@Article{Lipton:1980:EHS,
author = "Richard J. Lipton and Arnold L. Rosenberg and Andrew
C. Yao",
title = "External Hashing Schemes for Collections of Data
Structures",
journal = j-J-ACM,
volume = "27",
number = "1",
pages = "81--95",
month = jan,
year = "1980",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The use of external hashing schemes for storing broad
classes of data structures is studied. The general
framework of the paper considers a class of data
structures partitioned into smaller classes by the
number of positions in the structure. For instance, one
could start with the class of all binary trees and
partition that class into subclasses comprising all
n-node binary trees. The main results establish
nonconstructively the existence of an external hashing
scheme h//n with O(n) storage demand and O(1) expected
access time. Classes of data structures subsumed by
these results include ragged arrays, binary trees,
string-indexed arrays, and refinable arrays.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Assoc Comput Mach",
keywords = "data processing",
}
@Article{Litvinov:1980:GHF,
author = "V. A. Litvinov and V. I. Ivanenko",
title = "Generalized Hashing Function and Hashed File
Organization",
journal = "Programming and Computer Software (English Translation
of Programmirovanie)",
volume = "6",
number = "5",
pages = "247--249",
month = sep # "--" # oct,
year = "1980",
CODEN = "PCSODA",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The problem of selecting an appropriate hashing
function always arises in connection with hashed
organization of files. A method is described for the
creation of a generalized hashing function in terms of
redundancy check theory.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Program Comput Software",
keywords = "data processing",
}
@InProceedings{Litwin:1980:LHN,
author = "W. Litwin",
title = "Linear Hashing: {A} New Tool for File and Table
Addressing",
crossref = "Lochovsky:1980:SIC",
pages = "212--223 (or 260--276??)",
year = "1980",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Reprinted in
\cite[p.~570--581]{Stonebraker:1988:RDS}.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "access performance; address space; algorithm; data
processing; file addressing; linear hashing; memory
load performance; performance analysis; table
addressing",
remark = "On excess collisions create new bucket and modify
hash. Leads to constant performance.",
xxtitle = "Linear Hashing: a New Algorithm for Files and Tables
Addressing",
}
@Article{Maddison:1980:FLH,
author = "J. A. T. Maddison",
title = "Fast lookup in hash tables with direct rehashing",
journal = j-COMP-J,
volume = "23",
number = "2",
pages = "188--189",
month = may,
year = "1980",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
corpsource = "School of Math., Statistics and Computing, Thames
Polytech., London, UK",
keywords = "average access paths; Brent's algorithm; direct
rehashing; hash tables; key; Mallach's algorithm; table
lookup",
treatment = "P Practical",
}
@Article{Mendelson:1980:NAA,
author = "Haim Mendelson and Uri Yechiali",
title = "A New Approach to the Analysis of Linear Probing
Schemes",
journal = j-J-ACM,
volume = "27",
number = "3",
pages = "474--483",
month = jul,
year = "1980",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Wed Oct 26 22:27:19 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A new approach to the analysis of hash table
performance is presented. This approach is based on a
direct probabilistic analysis, where the underlying
probabilities are derived by using the ballot theorem
and its ramifications. The method is first applied to
analyze the performance of the classical (cyclic)
linear probing scheme, and the results are used to
solve an optimal storage allocation problem. A scheme
frequently used in practice where the table is linear
rather than cyclic is then analyzed using the same
methodology.",
acknowledgement = ack-nhfb,
}
@TechReport{Oberschelp:1980:IID,
author = "W. Oberschelp and H. Klocke",
title = "Informatik {III} (datenstrukturen)",
institution = "????",
address = "Aachen, Germany",
pages = "??",
year = "1980",
bibdate = "Thu Jul 21 09:36:56 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Baum, Datei, Datenstruktur, Hash-speicherung, Reihung,
Satz, Schluessel",
remark = "Vorlesungsausarbeitung (ws 80/81) 1. Einfuehrung Teil
I: Statische Datenstrukturen 2. Felder (arrays) und
Ihre Manipulationen 3. Realisierung von Feldern 4.
Saetze (records) 5. Realisierung Vieler Records (mit
Schluesselfeld) Bei Kleinem Speicher durch (offene)
Hash-speicherung 6. Frage Nach Weiteren Statischen
Datenstrukturen Teil II: Dynamische Datenstrukturen 7.
Dateien (files) 8. Einige Spezielle Probleme Bei
Dateien MIT Sequentiellem Zugriff 9. Pointer-strukturen
10. Baum-strukturen.",
}
@Article{Papadimitriou:1980:PBH,
author = "Christos H. Papadimitriou and Philip A. Bernstein",
title = "On the Performance of Balanced Hashing Functions When
the Keys Are Not Equiprobable",
journal = j-TOPLAS,
volume = "2",
number = "1",
pages = "77--89",
month = jan,
year = "1980",
CODEN = "ATPSDT",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
bibsource = "Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
Misc/hash.bib",
acknowledgement = ack-pb,
}
@Article{Sarwate:1980:NUC,
author = "Dilip V. Sarwate",
title = "A note on: {``Universal classes of hash functions''
[J. Comput. System Sci. {\bf 18} (1979), no. 2,
143--154; MR 80f:68110a ] by J. L. Carter and M. N.
Wegman}",
journal = j-INFO-PROC-LETT,
volume = "10",
number = "1",
pages = "41--45",
month = feb,
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68H05",
MRnumber = "80f:68110b",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Schmidt:1980:IPC,
author = "Jeanette P. Schmidt and Eli Shamir",
title = "An Improved Program for Constructing Open Hash
Tables",
crossref = "Bakker:1980:ALP",
pages = "569--581",
year = "1980",
bibdate = "Thu Oct 31 18:55:25 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@PhdThesis{Vitter:1980:ACHa,
author = "Jeffrey Scott Vitter",
title = "Analysis of Coalescing Hashing",
school = inst-STANFORD,
address = inst-STANFORD:adr,
pages = "??",
month = oct,
year = "1980",
bibdate = "Fri Apr 30 11:20:14 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See also technical report \cite{Vitter:1980:ACHb}.",
acknowledgement = ack-nhfb,
}
@TechReport{Vitter:1980:ACHb,
author = "Jeffrey Scott Vitter",
title = "Analysis of Coalescing Hashing",
number = "STAN-CS-80-817",
institution = inst-STANFORD,
pages = "??",
month = oct,
year = "1980",
bibdate = "Thu Jul 21 09:37:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "This is the author's Ph.D. thesis,
\cite{Vitter:1980:ACHa}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Vitter:1980:TCH,
author = "J. S. Vitter",
title = "Tuning the coalesced hashing method to obtain optimum
performance",
crossref = "IEEE:1980:ASF",
pages = "238--247",
year = "1980",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Yao:1980:NAE,
author = "Andrew C. Yao",
title = "A Note on the Analysis of Extendible Hashing",
journal = j-INFO-PROC-LETT,
volume = "11",
number = "2",
pages = "84--86",
year = "1980",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68H05",
MRnumber = "82a:68180",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Zamora:1980:ADC,
author = "Antonio Zamora",
title = "Automatic Detection and Correction of Spelling Errors
in a Large Data Base",
journal = j-J-AM-SOC-INF-SCI,
volume = "31",
number = "1",
pages = "51--57",
month = jan,
year = "1980",
CODEN = "AISJB6",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
bibdate = "Wed Jan 15 12:19:41 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "This article describes the techniques used to detect
and correct spelling errors in the data base of
Chemical Abstracts Service. A computer program for
spelling error detection achieves a high level of
performance using hashing techniques for dictionary
look-up and compression. Heuristic procedures extend
the dictionary and increase the proportion of
misspelled words in the words flagged. Automatic
correction procedures are applied only to words which
are known to be misspelled; other corrections are
performed manually during the normal editorial cycle.
The constraints imposed on the selection of a spelling
error detection technique by a complex data base, human
factors, and high-volume production are discussed.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "J Am Soc Inf Sci",
keywords = "data base systems --- Control; information science;
spelling-error correction; spelling-error detection",
}
@TechReport{Batory:1981:AMP,
author = "D. S. Batory",
title = "An Analytical Model of Physical Databases",
institution = "????",
address = "Toronto, ON, Canada",
pages = "??",
year = "1981",
bibdate = "Thu Jul 21 09:37:07 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Baum, Datei, Datenbank, Datenstruktur, Hashing,
Modell, Physikalische Bewertung, Speicherung,
Transaktion, Zugriff",
remark = "Ph. D.-thesis Technical Report Csrg-124 1.
Introduction 2. A Model of Simple Files 3. A Model of
File Evolution 4. A Model of Linksets 5. A Model of
Transactions 6. Applications 7. Summary and
Conclusions.",
}
@Article{Burkowski:1981:PHH,
author = "F. J. Burkowski",
title = "Parallel Hashing Hardware for Text Scanning
Applications",
journal = j-PROC-INT-CONF-PAR-PROC,
pages = "282--286",
year = "1981",
CODEN = "PCPADL",
ISSN = "0190-3918",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "722; 723",
conference = "Proceedings of the 1981 International Conference on
Parallel Processing.",
journalabr = "Proceedings of the International Conference on
Parallel Processing 1981.",
keywords = "computer systems, digital; hashing hardware;
random-access memories; term detection hardware; text
scanning",
meetingaddress = "Columbus, OH, USA",
sponsor = "Ohio State Univ, Dept of Comput and Inf Sci, Columbus,
USA; IEEE Comput Soc, Los Alamitos, Calif, USA; ACM,
New York, NY, USA",
}
@InProceedings{Cercone:1981:LDU,
author = "Nick Cercone and Max Krause and John Boates",
title = "Lexicon design using perfect hash functions",
crossref = "Borman:1981:PSP",
pages = "69--78",
year = "1981",
bibdate = "Wed Nov 06 18:21:40 2002",
bibsource = "ACM Computing Archive CD ROM;
http://ai.uwaterloo.ca/~ncercone/publications.html;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The research reported in this paper derives from the
recent algorithm of Cichelli (1980) for computing
machine-independent, minimal perfect hash functions of
the form: hash value = hash key length + associated
value of the key's first letter + associated value of
the key's last letter hash value = hash key length +
associated value of the key's first letter + associated
value of the key's last letter",
acknowledgement = ack-nhfb,
oldbibdate = "Mon Jul 18 21:54:33 1994",
remark = "This article was listed in the 1991 ACM Computing
Archive CD-ROM under the incorrect title ``Perfect hash
function search with application to natural language
systems'', under which it resided in hash.bib from
18-Jul-1994 to 6-Nov-2002. It was attributed to a
conference with the cryptic identifier HIU81 that was
not otherwise catalogued on the CD-ROM. The CD-ROM
listed 45 papers with that identifier, and a search for
their titles in a Web search engine ultimately led to
the ACM Portal archives with titles and abstracts (but
without full text) of the conference proceedings shown
in the cross reference. The name HIU81 is derived from
the proceedings subtitle, but was not itself part of
the title, and so never showed up in library catalog or
Web searches, sigh...",
}
@TechReport{Cercone:1981:PHFa,
author = "N. Cercone",
title = "Perfect Hash Function Search with Application to
Natural Language Systems",
type = "Technical report",
number = "TR81-6",
institution = "Simon Fraser University",
address = "Burnaby, BC, Canada",
year = "1981",
bibdate = "Tue Nov 05 09:21:37 2002",
bibsource = "http://ai.uwaterloo.ca/~ncercone/publications.html;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
xxnote = "Check authors??",
}
@Book{Davie:1981:RDC,
author = "A. J. T. Davie and R. Morrison",
title = "Recursive Descent Compiling",
publisher = pub-ELLIS-HORWOOD,
address = pub-ELLIS-HORWOOD:adr,
pages = "195",
year = "1981",
ISBN = "0-470-27270-8 (Halstead Press), 0-85312-386-1 (Ellis
Horwood)",
ISBN-13 = "978-0-470-27270-1 (Halstead Press), 978-0-85312-386-6
(Ellis Horwood)",
LCCN = "QA76.6 .D373",
bibdate = "Tue Jul 19 01:12:12 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Discusses handling of clustering in hash tables.",
price = "US\$34.95",
series = "Ellis Horwood Series in Computers and their
Applications, Editor: Brian Meek",
acknowledgement = ack-nhfb,
}
@Article{Deen:1981:DCD,
author = "S. M. Deen and D. Nikodem and A. Vashishta",
title = "Design of a Canonical Database System ({PRECI})",
journal = j-COMP-J,
volume = "24",
number = "3",
pages = "200--209",
month = aug,
year = "1981",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Dec 13 09:35:36 MST 1996",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "PRECI is based on a canonical data model potentially
capable of supporting user views of other models ---
notably CODASYL and relational ones --- through local
schemas and appropriate data manipulation languages.
The canonical global schema consists of normalized
relations and is backed up by a storage schema and a
data dictionary. The model is being implemented at
Aberdeen University, Scotland, as a generalized
database system, to be used primarily as a tool for
research in databases, with a modular design approach
so that future changes can be incorporated easily. The
CODASYL and relational subschema facilities are
currently being developed; a relational algebra to be
used for DM commands from FORTRAN programs has been
provided. The storage and access strategy in PRECI is
based on internal record identifiers (or surrogates)
created largely in entity-identifier order. Entity
records can be accessed very quickly --- both randomly
and sequentially --- by surrogates or entity
identifiers, partly with the help of a novel indexing
technique, called hash tree, which is based on data
compression and hashing.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "data base systems",
}
@Article{Dorng:1981:CHC,
author = "J. C. Dorng and S. K. Chang",
title = "Concatenated Hash Code Selection",
journal = "Proceedings - IEEE Computer Society's International
Computer Software \& Applications Conference 5th.",
publisher = "IEEE Comput Soc Press (n 379)",
address = "Los Alamitos, Calif, USA",
pages = "245--256",
year = "1981",
CODEN = "PSICD2",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Serv Cent. Piscataway, NJ, USA.",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Proceedings --- IEEE Computer Society's 5th
International Computer Software \& Applications
Conference, COMPSAC 81.",
journalabr = "Proceedings - IEEE Computer Society's International
Computer Software \& Applications Conference 5th.",
keywords = "concatenated hash code selection; data processing;
dynamic hashing; extendable hashing; multiple-attribute
retrieval; partial-match retrieval",
meetingaddress = "Chicago, IL, USA",
sponsor = "IEEE Comput Soc, Los Alamitos, Calif, USA",
}
@TechReport{Flajolet:1981:PEE,
author = "P. Flajolet",
title = "On the Performance Evaluation of Extendible Hashing
and Trie Searching",
institution = "International Business Machines (IBM), San Jose,
Research Laboratory (CA)",
pages = "??",
month = oct,
year = "1981",
bibdate = "Thu Jul 21 08:46:21 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Frost:1981:ADI,
author = "R. A. Frost",
title = "Algorithm 112: Dumping the index of a dynamic hash
table",
journal = j-COMP-J,
volume = "24",
number = "4",
pages = "383--384",
month = nov,
year = "1981",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 06 17:16:15 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_04/tiff/383.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_04/tiff/384.tif",
acknowledgement = ack-nhfb,
}
@Article{Gonnet:1981:ELL,
author = "Gaston H. Gonnet",
title = "Expected Length of the Longest Probe Sequence in Hash
Code Searching",
journal = j-J-ACM,
volume = "28",
number = "2",
pages = "289--304",
month = apr,
year = "1981",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "An investigation is made of the expected value of the
maximum number of accesses needed to locate any element
in a hashing file under various collision resolution
schemes. This differs from usual worst-case
considerations which, for hashing, would be the largest
sequence of accesses for the worst possible file.
Asymptotic expressions of these expected values are
found for full and partly full tables. Results are
given for the open addressing scheme with a
clustering-free model and the open addressing scheme
which reorders the insertions to minimize the worst
case. The results show that for these schemes, the
actual behavior of the worst case in hash tables is
quite good on the average.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Assoc Comput Mach",
keywords = "data processing",
}
@Book{Greene:1981:MAA,
author = "Daniel H. Greene and Donald E. Knuth",
title = "Mathematics For the Analysis of Algorithms",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "107",
year = "1981",
ISBN = "3-7643-3046-5",
ISBN-13 = "978-3-7643-3046-0",
LCCN = "QA76.6 .G7423 1981",
bibdate = "Fri Sep 16 11:51:38 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
price = "US\$10.00",
acknowledgement = ack-nhfb,
}
@Article{Ince:1981:IFS,
author = "D. C. Ince",
title = "The implementation of file structures in some high
level languages",
journal = j-SIGPLAN,
volume = "16",
number = "11",
pages = "49--55",
month = nov,
year = "1981",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Apr 25 11:46:37 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6140D (High level
languages)",
corpsource = "Faculty of Math., Open Univ., Milton Keynes, UK",
keywords = "Ada; ALGOL 68; Algol 68; file organisation; file
structures; hashed files; high level languages; indexed
sequential files; Pascal; PASCAL; Pascal",
treatment = "P Practical",
}
@Article{Jaeschke:1981:RHM,
author = "G. Jaeschke",
title = "Reciprocal Hashing: {A} Method for Generating Minimal
Perfect Hashing Functions",
journal = j-CACM,
volume = "24",
number = "12",
pages = "829--833",
month = dec,
year = "1981",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
MRclass = "68B15",
MRnumber = "83f:68013",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Hash functions, for a key $x$ in a set $S$ of positive
integers, of the form $h(x) = (C/(Dx + E)) \bmod N$ are
considered. Though the existence of $h$ is guaranteed,
the scheme suffers from many practical problems because
of exhaustive nature of the search for $h$.",
abstract = "A method is presented for building minimal perfect
hash functions, i. e., functions which allow single
probe retrieval from minimally sized tables of
identifier sets. A proof of existence for minimal
perfect hash functions of a special type (reciprocal
type) is given. Two algorithms for determining hash
functions of reciprocal type are presented and their
practical limitations are discussed. Further, some
application results are given and compared with those
of earlier approaches for perfect hashing.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer programming; reciprocal hashing",
}
@TechReport{Karp:1981:ERP,
author = "R. M. Karp and M. O. Rabin",
title = "Efficient Randomized Pattern-Matching Algorithms",
number = "TR-31-81",
institution = "Harvard University",
address = "Cambridge, MA, USA",
pages = "??",
year = "1981",
bibdate = "Thu Jul 21 08:46:29 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "An incremental hash function is described for
application to the string search problem.",
acknowledgement = ack-nhfb,
}
@Article{Kilov:1981:DMA,
author = "Kh. I. Kilov and I. A. Popova",
title = "Data Metabase Architecture for Relational {DBMS}",
journal = j-PROG-COMP-SOFT,
volume = "7",
number = "1",
pages = "??",
month = feb,
year = "1981",
CODEN = "PCSODA",
ISSN = "0361-7688 (print), 1608-3261 (electronic)",
bibdate = "Thu Jul 21 09:37:09 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Text is stored in a B-tree space, accessed by long
hashcodes which are to be kept in the database
records.",
}
@TechReport{Krause:1981:PHF,
author = "Max Krause and Nick Cercone and John Boates",
title = "Perfect Hash Function Search with Application to
Natural Language Systems",
number = "CMPT TR 81-6",
institution = "Simon Fraser University",
pages = "??",
year = "1981",
bibdate = "Thu Jul 21 09:37:10 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "(email \path=library@cs.sfu.ca=).",
acknowledgement = ack-nhfb,
}
@TechReport{Larson:1981:EWC,
author = "Per-{\AA}ke Larson",
title = "Expected Worst-case Performance of Hash Files",
institution = "????",
address = "Abo, Finland",
pages = "??",
year = "1981",
bibdate = "Thu Jul 21 09:37:12 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Dateiorganisation, Hashing, Leistungsanalyse, Suchen",
remark = "Es wird fuer Verschiedene Arten der
Ueberlaufbehandlung Untersucht, Wie Lang der
Zugriffsweg in einer Hash-organisierten Datei Maximal
Werden Kann.",
}
@InProceedings{Litwin:1981:TH,
author = "W. Litwin",
title = "Trie Hashing",
crossref = "Lien:1981:AIC",
pages = "19--29",
year = "1981",
bibdate = "Mon Jul 18 08:39:46 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "A new algorithm for hashing. Stores the records in
order. The file may be highly dynamic, even may be
constituted entirely with insertions. The load factor
is typically about 70\%.",
}
@TechReport{Lloyd:1981:ICI,
author = "J. W. Lloyd",
key = "Lloyd",
title = "Implementing Clause Indexing in Deductive Database
Systems",
type = "Technical Report",
number = "81/4",
institution = "Dept. of Computer Science, University of Melbourne,
Australia",
pages = "??",
year = "1981",
bibdate = "Thu Jul 21 09:37:14 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "clause indexing; extensible hashing.; Implementation;
partial match retrieval",
}
@InProceedings{Matsumoto:1981:NCM,
author = "K. Matsumoto and M. Naka and H. Yamamoto",
booktitle = "7th International Symposium --- Machine Processing of
Remotely Sensed Data with Special Emphasis on Range,
Forest, and Wetlands Assessment.",
title = "New Clustering Method for {Landsat} Images Using Local
Maximums of a Multi-Dimensional Histogram",
publisher = "Purdue Res Found",
address = "West Lafayette, Indiana, USA",
pages = "321--326",
year = "1981",
bibdate = "Sun Oct 25 10:32:09 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE. Piscataway, NJ, USA.",
acknowledgement = ack-nhfb,
classification = "405; 723",
keywords = "histogram clustering scheme; LANDSAT images; local
maximum; multidimensional histogram; multilayered
hashing scheme; pattern recognition systems; remote
sensing",
meetingaddress = "W Lafayette, IN, USA",
sponsor = "Am Soc of Agron, Madison, Wis, USA; Crop Sci Soc of
Am, Madison, Wis, USA; IEEE Comput Soc, Los Alamitos,
Calif, USA; IEEE Geosci and Remote Sens Soc, New York,
NY, USA; Soc of Am For, Work Group on Remote Sens and
Photogramm; Soil Sci Soc of Am, Madison, Wis, USA",
}
@Article{Mullin:1981:TCL,
author = "James K. Mullin",
title = "Tightly Controlled Linear Hashing without Separate
Overflow Storage",
journal = j-BIT,
volume = "21",
number = "4",
pages = "390--400",
year = "1981",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A hashing method is presented in which the amount of
storage required for a file can expand and shrink by
very large factors. The performance of this method as
measured by lookup time, insertion time and deletion
time is very good even when the total storage
utilization is as high as 90 percent. The User can
completely control the storage utilization between two
chosen bounds so that the storage requirement varies
linearly with the number of records currently in the
file. Unlike previous methods, no separate overflow
storage pool is involved and one need not be concerned
with expected and worst case requirements for overflow
space. The choice of hashing functions is discussed.
Simulation results show great danger in blindly using
the popular remainder method.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "computer programming; linear hashing",
}
@Article{Raghavan:1981:ELS,
author = "R. Raghavan and W. B. Thompson",
title = "Efficient Local Searching in Sparse Images",
journal = "Proceedings --- IEEE Computer Society Conference on
Pattern Recognition and Image Processing",
pages = "548--553",
year = "1981",
CODEN = "PIRPDG",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Proceedings --- IEEE Computer Society Conference on
Pattern Recognition and Image Processing.",
journalabr = "Proceedings - IEEE Computer Society Conference on
Pattern Recognition and Image Processing",
keywords = "K-D trees; local searching; matching; pattern
recognition systems; perfect hash functions; quad
trees; sorted linked lists; sparse images; window
searching",
meetingaddress = "Dallas, TX, USA",
sponsor = "IEEE Comput Soc, Los Alamitos, Calif, USA; IEEE, New
York, NY, USA",
}
@Article{Regnier:1981:AHT,
author = "Mireille Regnier",
title = "On the Average Height of Trees in Digital Search and
Dynamic Hashing",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "64--66",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68E05",
MRnumber = "83a:68078",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Keys over a binary alphabet can be organized in
digital search trees, also called tries, permitting
fast retrieval and updating of information. A result is
proved relative to digital search trees in which
profiles of size at most b are stored sequentially in a
single leaf.",
acknowledgement = ack-nhfb,
journalabr = "Inf Process Lett",
keywords = "computer programming; digital search; dynamic
hashing",
}
@Article{Samson:1981:HTC,
author = "W. B. Samson",
title = "Hash Table Collision Handling on Storage Devices with
Latency",
journal = j-COMP-J,
volume = "24",
number = "2",
pages = "130--131",
month = may,
year = "1981",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A comparison of linear overflow with more
sophisticated collision handling schemes shows that
although the more sophisticated schemes require fewer
probes, the search times may be greatly influenced by
latency. The break-even point between linear overflow
and other methods is derived for a variety of
circumstances.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Comput J",
keywords = "computer programming",
}
@Article{Scholl:1981:NFO,
author = "Michel Scholl",
title = "New File Organizations Based on Dynamic Hashing",
journal = j-TODS,
volume = "6",
number = "1",
pages = "194--211",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "New file organizations based on hashing and suitable
for data whose volume may vary rapidly recently
appeared in the literature. In the three schemes which
have been independently proposed, rehashing is avoided,
storage space is dynamically adjusted to the number of
records actually stored, and there are no overflow
records. Two of these techniques employ an index to the
data file. Retrieval is fast and storage utilization is
low. In order to increase storage utilization, two
schemes are introduced based on a similar idea, and the
performance of the second scheme is analyzed. Both
techniques use an index of much smaller size. In both
schemes, overflow records are accepted. The price which
has to be paid for the improvement in storage
utilization is a slight access cost degradation.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "ACM Trans Database Syst",
keywords = "data processing",
remark = "In the three schemes which proposed, rehashing is
avoided, storage space is dynamically adjusted to the
number of records actually stored, and there are no
overflow records. Two of these techniques employ an
index to the data file.",
}
@Article{Tai:1981:CCH,
author = "K.-C Tai and A. L. Tharp",
title = "Computed chaining: a hybrid of direct chaining and
open addressing",
journal = j-INFO-SYS,
volume = "6",
number = "2",
pages = "111--116",
year = "1981",
CODEN = "INSYD6",
ISSN = "0306-4379",
bibdate = "Mon Jul 18 19:41:40 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Tamminen:1981:OPE,
author = "Markku Tamminen",
title = "Order Preserving Extendible Hashing and Bucket Tries",
journal = j-BIT,
volume = "21",
number = "4",
pages = "419--435",
year = "1981",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
MRclass = "68B15 (68H05)",
MRnumber = "83a:68026",
bibdate = "Thu Nov 12 18:12:56 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A data model for the analysis of worst and expected
case performance of order preserving address
calculation type data structures is presented. This
model is used to derive results on the storage costs of
m-ary trie structures. The binary trie structure
(EXHASH) is shown to be optimal in many ways. Under
quite general conditions the expected performance of
bucket tries for generalized priority queue access
operations is shown to be asymptotically optimal, i. e.
O(1).",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "BIT",
keywords = "data processing",
}
@Book{Tenenbaum:1981:DSP,
author = "Aaron M. Tenenbaum and Moshe J. Augenstein",
title = "Data Structures Using Pascal",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xiv + 545",
year = "1981",
ISBN = "0-13-196501-8",
ISBN-13 = "978-0-13-196501-0",
LCCN = "QA76.9.D35 T46",
bibdate = "Wed Apr 15 09:03:31 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
series = "Pren{\-}tice-Hall Software Series, Editor: Brian W.
Kernighan",
acknowledgement = ack-nhfb,
}
@Article{Vitter:1981:DAH,
author = "Jeffrey Scott Vitter",
title = "Deletion Algorithms for Hashing that Preserve
Randomness",
journal = "Annual Symposium on Foundations of Computer Science
(Proceedings)",
pages = "127--132",
year = "1981",
CODEN = "ASFPDV",
ISSN = "0272-5428",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
conference = "22nd Annual Symposium on Foundations of Computer
Science.",
journalabr = "Annual Symposium on Foundations of Computer Science
(Proceedings) 22nd",
keywords = "coalesced hashing method; computer programming;
homotopic hash tables; search time considerations;
standard coalesced hashing",
meetingaddress = "Nashville, TN, USA",
sponsor = "IEEE Comput Soc, Los Alamitos, Calif, USA",
}
@Article{Vitter:1981:SMS,
author = "J. S. Vitter",
title = "A Shared-Memory Scheme for Coalesced Hashing",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "2",
pages = "77--79",
month = nov,
year = "1981",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
bibdate = "Mon Jan 22 17:13:14 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Wegman:1981:NHF,
author = "Mark N. Wegman and J. Lawrence Carter",
title = "New Hash Functions and Their Use in Authentication and
Set Equality",
journal = j-J-COMP-SYS-SCI,
volume = "22",
number = "3",
pages = "265--279",
month = jun,
year = "1981",
CODEN = "JCSSBM",
ISSN = "0022-0000",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "In this paper we exhibit several new classes of hash
functions with certain desirable properties, and
introduce two novel applications for hashing which make
use of these functions. One class contains a small
number of functions, yet is almost universal2. If the
functions hash n-bit long names into m-bit indices,
then specifying a member of the class requires only
O((m + log2 log2(n)) g log2(n)) bits as compared to
O(n) bits for earlier techniques. For long names, this
is about a factor of m larger than the lower bound of m
+ log2n log2m bits. An application of this class is a
provably secure authentication technique for sending
messages over insecure lines. A second class of
functions satisfies a much stronger property than
universal2. We present the application of testing sets
for equality. The authentication technique allows the
receiver to be certain that a message is genuine. An
``enemy'' even one with infinite computer resources
cannot forge or modify a message without detection. The
set equality technique allows operations including
``add member to set,'' ``delete member from set,'' and
``test two sets for equality'' to be performed in
expected constant time and with less than a specified
probability of error.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "J Comput Syst Sci",
keywords = "computer metatheory; cryptography; hash functions",
}
@Article{Yao:1981:STS,
author = "Andrew Chi-Chih Yao",
title = "Should Tables Be Sorted?",
journal = j-J-ACM,
volume = "28",
number = "3",
pages = "615--628",
month = jul,
year = "1981",
CODEN = "JACOAH",
ISSN = "0004-5411",
bibdate = "Tue Oct 25 22:47:10 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Aghili:1982:PGD,
author = "Houtan Aghili and Dennis G. Severance",
title = "Practical Guide to the Design of Differential Files
for Recovery of On-Line Databases",
journal = j-TODS,
volume = "7",
number = "4",
pages = "540--565",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p540-aghili/p540-aghili.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p540-aghili/",
abstract = "The concept of a differential file has previously been
proposed as an efficient means of collecting database
updates for on-line systems. This paper studies the
problem of database backup and recovery for such
systems, and presents an analytic model of their
operation. Five key design decisions are identified and
an optimization procedure for each is developed. A
design algorithm that quickly provides parameters for a
near-optimal differential file architecture is
provided.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "backup and recovery; data processing; database
maintenance; database systems; differential files;
hashing functions; numerical methods; optimization;
reorganization",
subject = "Data --- Data Storage Representations (E.2);
Mathematics of Computing --- Numerical Analysis (G.1);
Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Database Management --- Database Administration
(H.2.7)",
}
@Article{Batory:1982:OFD,
author = "D. S. Batory",
title = "Optimal File Designs and Reorganization Points",
journal = j-TODS,
volume = "7",
number = "1",
pages = "??",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 21 08:46:46 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Also published in/as: University of Toronto,
TR-CSRG-110, 1980.",
acknowledgement = ack-nhfb,
remark = "Applications of the model to hash-based and
indexed-sequential files reveal important relationships
between initial loading factors and reorganization
frequency.",
}
@Article{Batory:1982:UMP,
author = "D. S. Batory and C. C. Gotlieb",
title = "A Unifying Model of Physical Databases",
journal = j-TODS,
volume = "7",
number = "4",
pages = "509--539",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
Misc/is.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p509-batory/p509-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p509-batory/",
abstract = "A unifying model for the study of database performance
is proposed. Applications of the model are shown to
relate and extend important work concerning batched
searching, transposed files, index selection, dynamic
hash-based files, generalized access path structures,
differential files, network databases, and multifile
query processing.",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "database systems, TODS decomposition; decomposition;
linksets; simple files; unifying model",
remark = "See also \cite{Piwowarski:1985:CBS}.",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2)",
}
@Article{Bell:1982:KSC,
author = "D. A. Bell and S. M. Deen",
title = "Key space compression and hashing in {PRECI}",
journal = j-COMP-J,
volume = "25",
number = "4",
pages = "486--492",
month = nov,
year = "1982",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The hash trees method is classified as an external
hashing scheme and its features are compared with those
of other members of this class. Attention is focused on
the key space compression algorithms which are an
essential component of hash trees. Results of
experiments to assess the performance of the algorithms
on three relations needed in actual applications are
given. The performance is found to depend upon the
distribution of the keys. The storage utilization and
sequential and direct access performance obtained make
this technique a useful addition to the database
designer's tool-kit.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques); C6160 (Database management systems
(DBMS))",
classification = "723",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtonabbey, UK",
journalabr = "Comput J",
keywords = "data handling; data processing; database designer's;
database management systems; DBMS; direct access
performance; hash trees; hashing; key; PRECI;
sequential access; space compression; storage; table
lookup; tool-kit; utilization",
treatment = "P Practical",
}
@TechReport{Berman:1982:CFP,
author = "Francine Berman and Mary Ellen Bock and Eric Dittert
and Michael J. O'Donnell and Darrell Plank",
title = "Collections of Functions for Perfect Hashing",
number = "CSD-TR-408",
institution = inst-PURDUE-CS,
address = inst-PURDUE-CS:adr,
pages = "??",
year = "1982",
bibdate = "Thu Jul 21 09:37:16 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Buckhart:1982:AII,
author = "Walter A. Buckhart",
booktitle = "Proceedings of the 1982 Conference on Information
Sciences and Systems.",
title = "Advances in Interpolation-Based Index Maintenance",
publisher = pub-PRINCETON,
address = pub-PRINCETON:adr,
pages = "488--491",
year = "1982",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A new interpolation-based order preserving hashing
algorithm suitable for on-line maintenance of large
dynamic external files under sequences of four kinds of
transactions insertion, update, deletion, and
orthogonal range query is proposed. The scheme, an
adaptation of linear hashing, requires no index or
address directory structure and utilizes O(n) space for
files containing n records; all of the benefits of
linear hashing are inherited by this new scheme. File
implementations yielding average successful search
lengths much less than 2 and average unsuccessful
search lengths much less than 4 individual records are
achievable; the actual storage required is controllable
by the implementor.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, San Diego, Dep of Electrical
Engineering \& Computer Sciences, La Jolla, CA, USA",
affiliationaddress = "Univ of California, San Diego, Dep of Electrical
Engineering \& Computer Sciences, La Jolla, CA, USA",
classification = "723",
keywords = "data processing; database systems --- Maintenance;
File Organization; hashing algorithms; index
maintenance; large dynamic external files; linear
hashing; on-line maintenance; search lengths",
meetingaddress = "Princeton, NJ, USA",
sponsor = "Princeton Univ, Dep of Electrical Engineering \&
Computer Science, Princeton, NJ, USA",
}
@Article{Burkowski:1982:HHS,
author = "Forbes J. Burkowski",
title = "A hardware hashing scheme in the design of a multiterm
string comparator",
journal = j-IEEE-TRANS-COMPUT,
volume = "C-31",
number = "9",
pages = "825--834",
month = sep,
year = "1982",
CODEN = "ITCOB4",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A discussion is provided of the off-the-shelf'' design
of a term detection unit which may be used in the
scanning of text emanating from a serial source such as
disk or bubble memory. The main objective of this
design is the implementation of a high performance unit
which can detect any one of many terms (e. g., 1024
terms) while accepting source text at disk transfer
rates. The unit incorporates off-the-shelf''
off-the-shelf'' currently available chips. The design
involves a hardware-based hashing scheme that allows
incoming text to be compared to selected terms in a RAM
which contains all of the strings to be detected. The
organization of data in the RAM of the term detector is
dependent on a graph-theoretic algorithm which computes
maximal matchings on bipartite graphs. The capability
of the unit depends on various parameters in the
design, and this dependence is demonstrated by means of
various tables that report on the results of various
simulation studies.",
acknowledgement = ack-nhfb,
classification = "722; 723; 901",
journalabr = "IEEE Trans Comput",
keywords = "information retrieval systems",
}
@Article{Cercone:1982:MAM,
author = "Nick Cercone and Max Krause and John Boates",
title = "Minimal and Almost Minimal Perfect Hash Functions
Search",
journal = j-COMP-MATH-APPL,
volume = "9",
number = "1",
pages = "215--231",
year = "1982",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Jul 20 23:05:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Chang:1982:SGC,
author = "C. C. Chang and R. C. T. Lee and M. W. Du",
title = "Symbolic Gray Code as a Perfect Multiattribute Hashing
Scheme for Partial Match Queries",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-8",
number = "3",
pages = "235--249",
month = may,
year = "1982",
CODEN = "IESEDJ",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The authors show that the symbolic Gray code hashing
mechanism is only good for best matching, but also good
for partial match queries. Essentially, the authors
shall propose a new hashing scheme, called
bucket-oriented symbolic Gray code, which can be used
to produce any arbitrary Cartesian product file, which
has been shown to be good for partial match queries.
Many interesting properties of this new multiattribute
hashing scheme, including the property that it is a
perfect hashing scheme, have been discussed and
proved.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IEEE Trans Software Eng",
keywords = "data base systems",
remark = "Good for partial match queries. A new hashing scheme
called bucket-oriented symbolic Gray code which can be
used to produce any arbitrary Cartesian product file.",
}
@Article{Comer:1982:GPA,
author = "Douglas Comer and Michael J. O'Donnell",
title = "Geometric problems with application to hashing",
journal = j-SIAM-J-COMPUT,
volume = "11",
number = "2",
pages = "217--226",
month = "????",
year = "1982",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
MRclass = "68E99 (52-04)",
MRnumber = "83f:68079",
bibdate = "Sat Jan 18 18:03:50 MST 1997",
bibsource = "Graphics/siggraph/82.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
oldlabel = "geom-134",
}
@Article{Comer:1982:HBS,
author = "Douglas Comer and Vincent Yun Shen",
title = "Hash-Bucket Search --- a Fast Technique for Searching
an {English} Spelling Dictionary",
journal = j-SPE,
volume = "12",
number = "7",
pages = "669--682",
month = jul,
year = "1982",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "When a document is prepared using a computer system,
it can be checked for spelling errors automatically and
efficiently. This study reviews and compares several
methods for searching an English spelling dictionary.
It also presents a new technique, hash-bucket search,
for searching a static table in general, and a
dictionary in particular. Analysis shows that with only
a small amount of space beyond that required to store
the keys, the hash-bucket search method has many
advantages over existing methods. Experimental results
with a sample dictionary using double hashing and the
hash-bucket techniques are presented.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Software Pract Exper",
keywords = "computer programming",
}
@Article{Cook:1982:LOM,
author = "Curtis R. Cook and R. R. Oldehoeft",
title = "A Letter Oriented Minimal Perfect Hashing Function",
journal = j-SIGPLAN,
volume = "17",
number = "9",
pages = "18--27",
month = sep,
year = "1982",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Mon Apr 24 10:00:08 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "A simple improvement giving dramatic speedups is
described in \cite{Trono:1995:CTS}.",
acknowledgement = ack-nhfb,
}
@Article{Deen:1982:IIS,
author = "S. M. Deen",
title = "Implementation of Impure Surrogates",
journal = "Very Large Data Bases, International Conference on
Very Large Data Bases",
pages = "245--256",
year = "1982",
CODEN = "VLDBDP",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; 901",
conference = "Proceedings --- Very Large Data Bases, 8th
International Conference.",
journalabr = "Very Large Data Bases, International Conference on
Very Large Data Bases 8th.",
keywords = "data pages in primary key sequence; database systems;
hashing algorithm; internal identifiers; key
compression; random and sequential search; tuples of
relation access",
meetingaddress = "Mexico City, Mex",
sponsor = "VLDB Endowment, Saratoga, Calif, USA; IFIP, Geneva,
Switz; Inst Natl de Recherche en Informatique et en
Automatique Le Chesnay, Fr; Colegio de Postgraduados,
Chapingo, Mex; IBM de Mexico, Mex",
}
@Article{Dodds:1982:PRD,
author = "D. J. Dodds",
title = "Pracniques: Reducing Dictionary Size by Using a
Hashing Technique",
journal = j-CACM,
volume = "25",
number = "6",
pages = "368--370",
month = jun,
year = "1982",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jan 22 06:36:21 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Dodds82;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
oldlabel = "Dodds82",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dodds82",
}
@Book{Ellzey:1982:DSC,
author = "Roy S. Ellzey",
title = "Data Structures for Computer Information Systems",
publisher = pub-SRA,
address = pub-SRA:adr,
pages = "xii + 270",
year = "1982",
ISBN = "0-574-21400-3",
ISBN-13 = "978-0-574-21400-3",
LCCN = "QA 76.9 D35 E44 1982",
bibdate = "Mon Jul 18 20:57:26 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Undergraduate textbook treatment of hashing.",
price = "US\$22.95",
acknowledgement = ack-nhfb,
}
@InProceedings{Flajolet:1982:BPA,
author = "P. Flajolet and J.-M. Steyaert",
title = "A Branching Process Arising in Dynamic Hashing, Trie
Searching and Polynomial Factorization",
crossref = "Nielsen:1982:ALP",
pages = "239--251",
year = "1982",
bibdate = "Mon Jul 18 20:11:34 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Frost:1982:BSS,
author = "R. A. Frost",
title = "Binary-Relational Storage Structures",
journal = j-COMP-J,
volume = "25",
number = "3",
pages = "358--367",
month = aug,
year = "1982",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/",
note = "Discusses the dynamic hashing scheme used by ASDAS,
under development at Strathclyde University.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/358.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/359.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/360.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/361.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/362.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/363.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/364.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/365.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/366.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/367.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6160D (Relational
databases)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Strathclyde, Glasgow,
UK",
keywords = "binary-relationships; data structures; database
management system; database management systems;
database systems; storage structures",
treatment = "P Practical",
}
@Article{Frost:1982:FGN,
author = "R. A. Frost and M. M. Peterson",
title = "A function for generating nearly balanced binary
search trees from sets of non-random keys",
journal = j-SPE,
volume = "12",
number = "2",
pages = "163--168",
month = feb,
year = "1982",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
bibdate = "Wed Aug 24 12:18:38 MDT 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ E.1 Data, DATA STRUCTURES, Trees \\
G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Generating functions",
}
@Article{Gait:1982:AEC,
author = "J. Gait",
title = "An algorithm for an efficient command interpreter",
journal = j-SPE,
volume = "12",
number = "10",
pages = "981--982",
month = oct,
year = "1982",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
bibdate = "Wed Aug 24 12:18:38 MDT 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ D.4 Software, OPERATING SYSTEMS,
General \\ C.3 Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time systems \\ J.7 Computer Applications,
COMPUTERS IN OTHER SYSTEMS, Process control",
}
@InProceedings{Gonnet:1982:EHL,
author = "G. H. Gonnet and P.-A. Larson",
title = "External Hashing with Limited Internal Storage",
crossref = "ACM:1982:SPD",
pages = "256--261",
year = "1982",
bibdate = "Sat Nov 12 21:07:01 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "A small amount of internal storage is used to help
direct the search, thereby reducing the number of
external accesses.",
}
@InProceedings{Goto:1982:DLM,
author = "E. Goto and T. Soma and N. Inada and M. Idesawa and K.
Hiraki and M. Suzuki and K. Shimizu and B. Philipov",
title = "Design of a {Lisp} Machine -- {FLATS}",
crossref = "ACM:1982:CRA",
pages = "208--215",
year = "1982",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Design of a 10 MIPS Lisp machine used for symbolic
algebra is presented. Besides incorporating the
hardware mechanisms which greatly speed up primitive
Lisp operations, the machine is equipped with parallel
hashing hardware for content addressed associative
tabulation and a very fast multiplier for speeding up
both arithmetic operations and fast hash address
generation.",
acknowledgement = ack-nhfb,
}
@Book{Greene:1982:MAA,
author = "D. Greene and D. E. Knuth",
title = "Mathematics For the Analysis of Algorithms",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
edition = "Second",
pages = "123",
year = "1982",
ISBN = "3-7643-3102-X",
ISBN-13 = "978-3-7643-3102-3",
LCCN = "QA76.6 .G7423 1982",
bibdate = "Wed Jul 13 18:26:29 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Algorithmus, Asymptotische Analyse, Erzeugende
Funktion, Identitaet, Komplexitaetsanalyse, Mathematik,
Operationsmethode, Rekursionsformel",
remark = "{Mathematische Methoden zur Aufwandsabschaetzung von
Algorithmen. Allgemein Dargestellt, Aber Haeufig durch
Beispiele Motiviert (z.b. Zeitaufwand von
Hash-verfahren). Zum Teil Vertiefende Darstellung der
"optionalen" Kapitel aus "the Art of Computer
Programming, Band 3". Themengebiete: Rechnen MIT
Binomialkoeffizienten, Geschlossene Darstellungen fuer
Rekurrente Relationen, Operatormethoden, Herleitung
Asymptotischer Abschaetzungen}.",
}
@Article{Headrick:1982:HRS,
author = "R. Wayne Headrick",
title = "Hashing Routine Selection: a Quantitative
Methodology",
journal = "Proceedings --- Annual Meeting of the American
Institute for Decision Sciences",
volume = "2",
pages = "401--??",
year = "1982",
CODEN = "PAMSED",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723; 901",
conference = "Proceedings --- 14th Annual Meeting of the American
Institute for Decision Sciences.",
journalabr = "Proceedings - Annual Meeting of the American Institute
for Decision Sciences 14th",
keywords = "abstract only; analysis of relative effectiveness;
basic hashing technique; direct access file; hashing
for record access; implementation of specific
algorithm; information retrieval systems",
meetingaddress = "San Francisco, CA, USA",
sponsor = "American Inst for Decision Sciences, Atlanta, Ga,
USA",
}
@MastersThesis{Hildebrandt:1982:VBD,
author = "F. Hildebrandt",
title = "Vergleichende Bewertung Dynamischer Hash-verfahren
durch Simulation",
school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu
Braunschweig",
address = "Braunschweig, Germany",
pages = "??",
year = "1982",
bibdate = "Sat Dec 30 09:27:53 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Bewertung, Dateiverwaltung, Datenbanksystem,
Dynamisches Hashing, Hashing, Simulation,
Speichertechnik, Zugriffstechnik",
remark = "Es Werden 3 Dynamische Hashverfahren, die fuer die
Speicherungvon Daten auf Peripheren Speichern von
Bedeutung Sind, Einheitlich Beschrieben, durch
Simulation Untersucht und Vergleichend Bewertet. die
Verfahren Sind: 1. Dynamic Hashing MIT den Varianten:
Normalversion, Larsons `deferred Splitting', Scholls
`deferred Splitting' und `linear Splitting' 2.
Extendible Hashing 3. Linear Virtual Hashing.",
}
@Book{Hua:1982:INT,
author = "Lo-Keng Hua",
title = "Introduction to number theory",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 572",
year = "1982",
ISBN = "0-387-10818-1",
ISBN-13 = "978-0-387-10818-6",
LCCN = "QA241 .H7513 1982",
bibdate = "Tue Jul 19 22:28:51 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Translated from the 1975 Chinese edition {\em Shu lun
tao yin\/} by Peter Shiu. This is the English edition
of Ref.~6 of \cite{Chang:1984:SOM}, the book that
contains the fundamental prime number functions needed
for Chang's ordered minimal perfect hash functions.",
acknowledgement = ack-nhfb,
}
@PhdThesis{Karlsson:1982:ACR,
author = "K. Karlsson",
title = "Les Arbres Couvrants Reduits: Une Methode {D}'acces
Compacte Pour Donnees Dynamiques",
school = "????",
address = "Paris, France",
pages = "??",
year = "1982",
bibdate = "Thu Jul 21 08:47:04 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "B-baum, Datenstruktur, Reduced Cover-trees,
Zugriffspfad",
remark = "Beim Entwurf der Zugriffspfade fuer eine
Datenbankmaschine wird --- Nach Kritik Am Hashing und
An B-baeumen --- ein Reducedcover-tree Vorgeschlagen.
Er Zeichnet sich Dadurch Aus, Dass sich Saemtliche
Indices Damit Darstellen Lassen, Dass Er Sehr Kompakt
ist und Bei Dynamischen Daten Stabil. Diese
Datenstruktur wird MIT Anderen Verglichen und es wird
ein Zugriffsmodell Vorgeschlagen, Bei dem Sie die
Hauptrolle Bei der Implementierung der Zugriffspfade
Spielt.",
}
@MastersThesis{Krause:1982:PHF,
author = "M. Krause",
title = "Perfect Hash Function Search",
type = "M.Sc. Thesis",
school = "Computing Science Department, Simon Fraser
University",
address = "Burnaby, BC, Canada",
pages = "168",
year = "1982",
ISBN = "0-315-14402-5",
ISBN-13 = "978-0-315-14402-6",
bibdate = "Sat Dec 30 09:38:08 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Available from National Library of Canada, Canadian
theses on microfiche, 62311 0227-3845",
acknowledgement = ack-nhfb,
}
@TechReport{Kuespert:1982:MLHa,
author = "K. Kuespert",
title = "{Modelle f{\"u}r die Leistungsanalyse von Hashtabellen
mit `separate Chaining'}",
institution = "????",
address = "Kaiserslautern, Germany",
pages = "??",
year = "1982",
bibdate = "Thu Jul 21 09:37:24 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Hash-verfahren, Hausadresse, Iteratives Modell,
Modellbildung, Naeherungsberechnung, Ueberlaufbereich",
remark = "Es wird ein Hashverfahren Untersucht, das zur
Behandlung von Kollisionen die Ueberlauefer der
Primaerbuckets im Ueberlaufbereich Seitenweise Separat
Verkettet. Primaerbereich und Ueberlaufbereich Sind in
Buckets Gleicher Groesse Aufgeteilt. unter der Annahme
einer Zufaelligen Verteilung der Transformierten
Schluesselwerte Werden Iterative Sowie Nicht-iterative
Modelle Aufgestellt, die zur Berechnung der Mittleren
Anzahl von Bucketzugriffen im Fall der Erfolgreichen
Bzw. Erfolglosen Suche Dienen. durch Vereinfachung des
Nicht-iterativen Modellansatzes Lassen sich Formeln
Herleiten, die eine Zeit-effiziente Berechnung von
Naeherungswerten fuer die Charakteristischen Kennzahlen
des Hashverfahrens Ermoeglichen. An Hand einer
Hashtabelle Realistischen Umfangs wird die Qualitaet
der Naeherungsloesung Demonstriert.",
}
@Article{Kuespert:1982:MLHb,
author = "Klaus Kuespert",
title = "{Modelle f{\"u}r die Leistungsanalyse von Hashtabellen
mit `Separate Chaining'} [Models for Analyzing the
Performance of Hash Tables with Separate Chaining]",
journal = "Angew. Inf. Appl. Inf.",
volume = "V 24",
number = "N 9",
pages = "456--462",
month = sep,
year = "1982",
bibdate = "Mon Oct 26 07:01:27 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A hash table algorithm that keeps overflow records of
the primary buckets in separate chains within an
overflow storage area is analyzed. Primary area and
overflow area are divided into multiple-record buckets
of the same (arbitrary) capacity. Assuming random
(Poisson) distribution of calculated bucket addresses
iterative and noniterative models are presented for the
average number of bucket accesses in case of retrieval
to existing and nonexisting key values. The
computational complexity of these models is
considerably reduced by simplifying assumptions. A hash
table of realistic size demonstrates the accuracy of
the approach. In German.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "ANGEW INF APPL INF",
keywords = "data processing; hash tables; separate chaining",
}
@Article{Larson:1982:EWC,
author = "Per-{\AA}ke Larson",
title = "Expected Worst-Case Performance of Hash Files",
journal = j-COMP-J,
volume = "25",
number = "3",
pages = "347--352",
month = aug,
year = "1982",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The following problem is studied: consider a hash file
and the longest probe sequence that occurs when
retrieving a record. How long is this probe sequence
expected to be? The approach taken differs from
traditional worst-case considerations, which consider
only the longest probe sequence of the worst possible
file instance. Three overflow handling schemes are
analysed: uniform hashing (random probing), linear
probing and separate chaining. The numerical results
show that the worst-case performance is expected to be
quite reasonable. Provided that the hashing functions
used are well-behaved, extremely long probe sequences
are very unlikely to occur.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "Dept. of Information Processing, Abo Akad., Abo,
Finland",
journalabr = "Comput J",
keywords = "computer programming; hash files; linear probing;
longest; overflow handling schemes; probe sequence;
separate chaining; table lookup; worst-case
performance",
remark = "Given a suitable hash function, performance is never
disastrous.",
review = "ACM CR 40,399",
treatment = "P Practical",
}
@Article{Larson:1982:PAL,
author = "Per-{\AA}ke Larson",
title = "Performance Analysis of Linear Hashing with Partial
Expansions",
journal = j-TODS,
volume = "7",
number = "4",
pages = "566--587",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Linear hashing with partial expansions is a new file
organization primarily intended for files which grow
and shrink dynamically. This paper presents a
mathematical analysis of the expected performance of
the new scheme. The following performance measures are
considered: length of successful and unsuccessful
searches, accesses required to insert or delete a
record, and the size of the overflow area. The
performance is cyclical. For all performance measures,
the necessary formulas are derived for computing the
expected performance at any point of a cycle and the
average over a cycle. Furthermore, the expected worst
case in connection with searching is analyzed. The
overall performance depends on several file parameters.
The numerical results show that for many realistic
parameter combinations the performance is expected to
be extremely good. Even the longest search is expected
to be of quite reasonable length.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "ACM Trans Database Syst",
keywords = "data processing; linear hashing; TODS dynamic hashing,
extendible hashing",
}
@InProceedings{Larson:1982:SFV,
author = "Per-{\AA}ke Larson",
title = "A Single-File Version of Linear Hashing with Partial
Expansions",
crossref = "Anonymous:1982:VLD",
pages = "300",
year = "1982",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "VLDB",
}
@Article{Larson:1982:SVL,
author = "Per-Ake Larson",
title = "Single-File Version of Linear Hashing with Partial
Expansions",
journal = "Very Large Data Bases, International Conference on
Very Large Data Bases",
pages = "300--309",
year = "1982",
CODEN = "VLDBDP",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
conference = "Proceedings --- Very Large Data Bases, 8th
International Conference.",
journalabr = "Very Large Data Bases, International Conference on
Very Large Data Bases 8th.",
keywords = "data processing; file organization intended for
dynamic files; linear virtual hashing; retrieval
performance; storage area for overflow records",
meetingaddress = "Mexico City, Mex",
sponsor = "VLDB Endowment, Saratoga, Calif, USA; IFIP, Geneva,
Switz; Inst Natl de Recherche en Informatique et en
Automatique Le Chesnay, Fr; Colegio de Postgraduados,
Chapingo, Mex; IBM de Mexico, Mex",
}
@Book{Lewis:1982:SEA,
author = "T. G. Lewis",
title = "Software Engineering: Analysis and Verification",
publisher = pub-RESTON,
address = pub-RESTON:adr,
pages = "x + 470",
year = "1982",
ISBN = "0-8359-7023-X",
ISBN-13 = "978-0-8359-7023-5",
LCCN = "QA76.6 .L477 1982",
bibdate = "Mon Jul 18 20:46:54 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Hashing is covered in Chapters 4--7.",
price = "US\$21.95",
acknowledgement = ack-nhfb,
}
@Article{McIlroy:1982:DSL,
author = "M. Douglas McIlroy",
title = "Development of a Spelling List",
journal = j-IEEE-TRANS-COMM,
volume = "COM-30",
number = "1 pt 1",
pages = "91--99",
month = jan,
year = "1982",
CODEN = "IECMBT",
DOI = "http://dx.doi.org/10.1109/TCOM.1982.1095395",
ISSN = "0096-1965",
ISSN-L = "0090-6778",
bibdate = "Wed Jan 15 12:19:41 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The work list used by the UNIX spelling checker,
SPELL, was developed from many sources over several
years. As the spelling checker may be used on
minicomputers, it is important to make the list as
compact as possible. Stripping prefixes and suffixes
reduces the list below one third of its original size,
hashing discards 60 percent of the bits that remain,
and data compression halves it once again. This paper
tells how the spelling checker works, how the words
were chosen, how the spelling checker was used to
improve itself, and how the (reduced) list of 30,000
English words was squeezed into 26,000 16-bit machine
words.",
acknowledgement = ack-nhfb,
classification = "721; 723; 901",
journalabr = "IEEE Trans Commun",
keywords = "automata theory; data processing --- Word Processing;
information science --- Vocabulary Control; UNIX
spelling checker, spell",
}
@InProceedings{Mehlhorn:1982:PSP,
author = "Kurt Mehlhorn",
title = "On the Program Size of Perfect and Universal Hash
Functions",
crossref = "IEEE:1982:SFC",
pages = "170--175",
year = "1982",
CODEN = "ASFPDV",
ISSN = "0272-5428",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Serv Cent. Piscataway, NJ, USA.",
acknowledgement = ack-nhfb,
classification = "723",
conference = "23rd Annual Symposium on Foundations of Computer
Science.",
journalabr = "Annual Symposium on Foundations of Computer Science
(Proceedings) 23rd.",
keywords = "complexity; computer programming; lower bounds;
minimum-size programs; program size; universal hash
functions; upper bounds",
meetingaddress = "Chicago, IL, USA",
sponsor = "IEEE Comput Soc, Tech Comm on Math Found of Comput,
Los Angeles, Calif, USA",
}
@Article{Mendelson:1982:AEH,
author = "Haim Mendelson",
key = "Mendelson",
title = "Analysis of Extendible Hashing",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-8",
number = "6",
pages = "611--619",
month = nov,
year = "1982",
CODEN = "IESEDJ",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Extendible hashing is an attractive direct-access
technique which has been introduced recently. It is
characterized by a combination of database-size
flexibility and fast direct access. This work derives
performance measures for extendible hashing, and
considers their implications on the physical database
design. A complete characterization of the probability
distribution of the directory size and depth is
derived, and its implications on the design of the
directory are studied. The expected input\slash output
costs of various operations are derived, and the
effects of varying physical design parameters on the
expected average operating cost and on the expected
volume are studied.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "IEEE Trans Software Eng",
keywords = "database systems",
xxtitle = "Analysis of Extensible Hashing",
}
@Article{Mor:1982:HCM,
author = "M. Mor and A. S. Fraenkel",
title = "A hash code method for detecting and correcting
spelling errors",
journal = j-CACM,
volume = "25",
number = "12",
pages = "935--940 (or 935--938??)",
month = dec,
year = "1982",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The most common spelling errors are one extra letter,
one missing letter, one wrong letter, or the
transposition of two letters. Deletion, exchange, and
rotation operators are defined which detect and
``mend'' such spelling errors and thus permit retrieval
despite the errors. These three operators essentially
delete a letter of a word, exchange two adjacent
letters, and rotate a word cyclically. Moreover, the
operators can be used in conjunction with hashing, thus
permitting very fast retrieval. Results of experiments
run on large databases in Hebrew and in English are
briefly indicated.",
acknowledgement = ack-nhfb,
classification = "723; 901",
journalabr = "Commun ACM",
keywords = "algorithms; information science; performance",
review = "ACM CR 40850",
subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ H.3.1 Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
Indexing, Dictionaries \\ H.3.3 Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval, Search process \\ I.7.1 Computing
Methodologies, TEXT PROCESSING, Text Editing,
Spelling",
}
@Book{Noltemeier:1982:I,
author = "Hartmut Noltemeier",
title = "Informatik",
publisher = pub-HANSER,
address = pub-HANSER:adr,
pages = "??",
year = "1982",
ISBN = "3-446-13570-7",
ISBN-13 = "978-3-446-13570-3",
bibdate = "Thu Jul 21 08:47:10 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datenstruktur, Datentyp, Hash-verfahren",
remark = "Die Einfuehrung in Datenstrukturen ist der
Abschliessende Teil eines Vierteiligen Grundkurses
ueber Informatik, der Zudem die Vorlesungen Informatik
I (algorithmen und Berechenbarkeit) Sowie IIa
(programmierung) und IIb (rechenanlagen
Undrechnerstrukturen) Enthaelt.",
}
@Book{Noltemeier:1982:IIE,
author = "Hartmut Noltemeier",
title = "Informatik {III}: Einfuehrung in Datenstrukturen",
publisher = pub-HANSER,
address = pub-HANSER:adr,
pages = "??",
year = "1982",
ISBN = "3-446-13570-7",
ISBN-13 = "978-3-446-13570-3",
bibdate = "Thu Jul 21 08:47:15 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Array, Baum, Datenstruktur, Datentyp, Feld, Graph,
Hashing, Liste, Sortieren, Suchbaum, Suchen",
remark = "Lehrbuch.",
}
@MastersThesis{Peiler:1982:ZRV,
author = "M. Peiler",
title = "Zugriffsoperationen auf Rdbm-verwaltungsdaten --- 1.
teil",
school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu
Braunschweig",
address = "Braunschweig, Germany",
pages = "??",
year = "1982",
bibdate = "Sat Dec 30 09:28:06 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Best-fit, Buddy-system, Dateipuffer, Fifo, First-fit,
Gclock, Hash-verfahren, Lru, Mehrbenutzersystem,
Pufferkonzept, Pufferverwaltung, Rdbm, Satzpuffer,
Seitenwechsel, Virtuelles Betriebssystem,
Zugriffsoperation",
remark = "1. Rdbm-sofwarekonzept 2. Pufferverwaltungen 3.
Dateipufferverwaltungen 4. Satzpufferverwaltungen 5.
Zugriffsoperationen auf Interne Schluessel Mittels
Externer Bezeichner.",
}
@Article{Ramamohanarao:1982:DHS,
author = "K. Ramamohanarao and John W. Lloyd",
key = "Ramamohanarao \& Lloyd",
title = "Dynamic Hashing Schemes",
journal = j-COMP-J,
volume = "25",
number = "4",
pages = "479--485",
month = nov,
year = "1982",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database; Database/database.bib;
Database/Wiederhold.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Two new dynamic hashing schemes for primary key
retrieval are studied. The first scheme is simple and
elegant and has certain performance advantages over
earlier schemes. A detailed mathematical analysis of
this scheme is given, and simulation results are
presented. The second scheme is essentially that of P.
Larson. However, a number of changes which simplify his
scheme have been made.",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
journalabr = "Comput J",
keywords = "data processing; dynamic hashing schemes; mathematical
analysis; primary key; retrieval; table lookup",
treatment = "P Practical",
}
@InProceedings{Regnier:1982:LHG,
author = "Mireille Regnier",
title = "Linear Hashing with Groups of Reorganization: an
Algorithm for Files without History",
crossref = "Scheuermann:1982:PSI",
pages = "257--272",
year = "1982",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "723",
keywords = "access performance; computer programming; files
without history; linear hashing with groups of
reorganization; load factor; overflow records",
}
@Article{Schmitt:1982:CPF,
author = "Alfred Schmitt",
title = "On the computational power of the floor function",
journal = j-INFO-PROC-LETT,
volume = "14",
number = "1",
pages = "1--3",
day = "27",
month = mar,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68C01 (68E05)",
MRnumber = "83c:68032",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Fakultat f{\"u}r Informatik, Univ. Karlsruhe,
Karlsruhe, West Germany",
keywords = "computational power; file organisation; floor
function; hashing techniques; relational operations;
running time",
treatment = "P Practical",
}
@Article{Stewart:1982:DSV,
author = "Neil Stewart",
title = "Data Structures for Virtual-Circuit Implementation",
journal = j-COMP-COMM,
volume = "5",
number = "4",
pages = "196--201",
month = aug,
year = "1982",
CODEN = "COCOD7",
ISSN = "0140-3664",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Implementation of virtual-circuit services, based on
fixed routing and strict sequencing of packets,
includes procedures for circuit setup, message
switching and clearing of circuits. Four approaches to
table management in these procedures are considered,
all requiring the same minimal amount of header
information in the packet. The methods are compared
with respect to nodal processing time and memory
requirements. In the case of large networks handling
large numbers of virtual circuits, two of the methods
provide almost optimal processing times and low memory
requirements. One of these, based on a hash table, has
been implemented.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Comput Commun",
keywords = "communication networks; computers --- Data
Communication Systems; data processing; hash table;
packet switching; virtual circuits implementation",
}
@MastersThesis{Stumm:1982:UMZ,
author = "Gisela Stumm",
title = "Untersuchung zu Mehrfachattribut-zugriffsverfahren
fuer Datenbanken",
school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu
Braunschweig",
address = "Braunschweig, Germany",
pages = "??",
year = "1982",
bibdate = "Sat Dec 30 09:28:03 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Datenbank, Partial-match-hash, Zugriffstechnik",
remark = "Ausfuehrliche Uebersicht der Literatur zu Verfahren
des Datenzugriffs MIT Kombinierten Attributen
(partial-match Verfahren). im Ersten Teil Vergleich
eines von Aho/Ullman Beschriebenen Verfahrens MIT
Konventioneller Invertierung (mittelsb-stern-baeumen).
der Vergleich Erfolgt MIT Einem Simulationsprogramm.
Ausfuehrliche Diskussion der Ergebnisse.",
}
@InProceedings{Szymanski:1982:HTR,
author = "Thomas G. Szymanski",
booktitle = "Proceedings of the 1982 Conference on Information
Sciences and Systems.",
title = "Hash Table Reorganization",
publisher = pub-PRINCETON,
address = pub-PRINCETON:adr,
pages = "480--484",
year = "1982",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "We consider the operation of permuting in place the
records of an open address hash table in order to
correspond to a different hashing function. Our
emphasis is primarily on minimizing the amount of work
space used Lower and upper bounds are derived on the
unrestricted problem, that is, without making any
assumptions about the probing discipline used. For the
special case of linear probing, we give an algorithm
which requires no work space outside the table which
runs in line at time with respect to the table size.",
acknowledgement = ack-nhfb,
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723",
keywords = "database systems; different hashing functions; hash
table reorganization; lower and upper bounds; open
address hash tables; probing disciplines",
meetingaddress = "Princeton, NJ, USA",
sponsor = "Princeton Univ, Dep of Electrical Engineering \&
Computer Science, Princeton, NJ, USA",
}
@Article{Tamminen:1982:EHO,
author = "Markku Tamminen",
title = "Extendible Hashing with Overflow",
journal = j-INFO-PROC-LETT,
volume = "15",
number = "5",
pages = "227--232",
month = dec,
year = "1982",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
MRclass = "68B15",
MRnumber = "83m:68047",
bibdate = "Sat Apr 11 12:24:20 MDT 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "A strategy of including an overflow capability into
extendable hashing (EXHASH) is defined. It is shown
that both an O(1) expected access cost and an O(N)
expected storage cost are achieved by using this
mechanism.",
acknowledgement = ack-nhfb,
journalabr = "Inf Process Lett",
keywords = "computer programming; hashing",
}
@Article{Tharp:1982:PTS,
author = "Alan L. Tharp and Kuo-Chung Tai",
title = "The Practicality of Text Signatures for Accelerating
String Searching",
journal = j-SPE,
volume = "12",
number = "1",
pages = "35--44",
month = jan,
year = "1982",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Expands Harrison's work \cite{Harrison:1971:IST}.",
acknowledgement = ack-nhfb,
keywords = "design; experimentation",
review = "ACM CR 39738",
subject = "D.1 Software, PROGRAMMING TECHNIQUES, Miscellaneous
\\
E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ F.2.2 Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Pattern matching
\\ I.7 Computing Methodologies, TEXT PROCESSING, Text
Editing",
}
@Book{Ullman:1982:PDS,
author = "Jeffrey D. Ullman",
title = "Principles of Database Systems",
publisher = pub-CSP,
address = pub-CSP:adr,
edition = "Second",
pages = "vii + 484",
year = "1982",
ISBN = "0-7167-8069-0",
ISBN-13 = "978-0-7167-8069-4",
LCCN = "QA76.9.D3 U44 1983",
bibdate = "Thu Jul 14 16:45:35 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Hashing, Quel, Sequel",
}
@Article{Vitter:1982:DAH,
author = "J. S. Vitter",
title = "Deletion algorithms for hashing that preserve
randomness",
journal = j-J-ALG,
volume = "3",
number = "3",
pages = "261--275",
month = sep,
year = "1982",
CODEN = "JOALDV",
ISSN = "0196-6774",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
remark = "Chaining and open addressing.",
}
@Article{Vitter:1982:ICH,
author = "Jeffrey Scott Vitter",
key = "Vitter",
title = "Implementations for Coalesced Hashing",
journal = j-CACM,
volume = "25",
number = "12",
pages = "911--926",
month = dec,
year = "1982",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "The coalesced hashing method is one of the faster
searching methods known today. This paper is a
practical study of coalesced hashing for use by those
who intend to implement or further study the algorithm.
Techniques are developed for tuning an important
parameter that related the sizes of the address region
and the cellar in order to optimize the average running
times of different implementations. A value for the
parameter is reported that works well in most cases.
Detailed graphs explain how the parameter can be tuned
further to meet specific needs. The resulting tuned
algorithm outperforms several well-known methods
including standard coalesced hashing, separate (or
direct) chaining, linear probing, and double hashing. A
variety of related methods are also analyzed including
deletion algorithms, a new and improved insertion
strategy called varied-insertion, and applications to
external searching on secondary storage devices.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Commun ACM",
keywords = "computer programming",
}
@Article{Yuba:1982:SOP,
author = "Toshitsugu Yuba",
title = "Studies on Optimization Problems of Key Searching",
journal = "Denshi Gijutsu Sogo Kenkyusho Kenkyu Hokoku/Researches
of the Electrotechnical Laboratory",
volume = "??",
number = "823",
pages = "??--??",
month = mar,
year = "1982",
CODEN = "DGSKBS",
ISSN = "0366-9106",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Optimization problems of key searching in a computer
are considered. Prior to discussing the problems in
detail, an abstract model of key searching on a tree
structure is proposed, and existing tree searching
methods are located in the model. Through the
abstraction, the interrelationship among them is made
clear, and search, insertion and deletion algorithms of
each method are overviewed. As for key searching on a
table by hashing, the state of the art concerned with
hashing functions and conflict resolution methods is
outlined. Optimization problems of these searching
methods and their solutions are briefly discussed.
Unsolved research problems are also mentioned. Refs.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Denshi Gijutsu Sogo Kenkyujo Kenkyu Hokoku",
keywords = "computer programming; hashing; tree searching",
language = "Japanese",
pagecount = "100",
}
@Book{Aho:1983:DSA,
author = "Alfred V. Aho and John E. Hopcroft and J. D. Ullman",
title = "Data Structures and Algorithms",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xi + 427",
year = "1983",
ISBN = "0-201-00023-7",
ISBN-13 = "978-0-201-00023-8",
LCCN = "QA76.9.D35 A38 1983",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
descriptor = "Algorithmus, Analyse, Baum, Binaer-baum,
Buddy-methode, Datei, Datenstruktur, Datentyp, Digraph,
Dynamische Programmierung, Effizienz, Entwurf,
Gerichteter Graph, Graph, Hashing, Menge, Prioritaet,
Sortieren, Speicherverwaltung, Suchen, Warteschlange,
Woerterbuch",
remark = "1. Design and Analysis of Algorithms 2. Basic Data
Types 3. Trees 4. Basic Operations on Sets 5. Advanced
Set Representation Methods 6. Directed Graphs 7.
Undirected Graphs 8. Sorting 9. Algorithm Analysis
Techniques 10. Algorithm Design Techniques 11. Data
Structures For External Storage 12. Memory
Management.",
}
@Article{Ajtai:1983:HFP,
author = "M. Ajtai and M. Fredman and J. Komlos",
title = "Hash Functions for Priority Queues",
journal = "Annual Symposium on Foundations of Computer Science
(Proceedings)",
pages = "299--303",
year = "1983",
CODEN = "ASFPDV",
ISBN = "0-8186-0508-1",
ISBN-13 = "978-0-8186-0508-6",
ISSN = "0272-5428",
LCCN = "QA76.6 .S95 1983",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Service Cent. Piscataway, NJ, USA.",
acknowledgement = ack-nhfb,
classification = "922",
conference = "24th Annual Symposium on Foundations of Computer
Science.",
journalabr = "Annual Symposium on Foundations of Computer Science
(Proceedings) 24th.",
keywords = "cell probe computational model; constant worst-case
time; hash functions; priority queues; probability;
rank function; size constraint",
meetingaddress = "Tucson, AZ, USA",
sponsor = "IEEE Computer Soc, Technical Committee on Mathematical
Foundations of Computing, Los Alamitos, Calif, USA",
}
@Article{Beeton:TB4-1-36,
author = "Barbara Beeton",
title = "Determining hashtable size and other quantities",
journal = j-TUGboat,
volume = "4",
number = "1",
pages = "36--37",
month = apr,
year = "1983",
ISSN = "0896-3207",
bibdate = "Fri Jul 13 10:24:20 MDT 2007",
bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/tugboat.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://www.math.utah.edu/pub/tex/bib/index-table-t.html#tugboat",
acknowledgement = ack-bnb # " and " # ack-nhfb,
}
@Article{Bell:1983:MCS,
author = "R. Charles Bell and Bryan Floyd",
title = "{Monte Carlo} Study of {Cichelli} Hash-Function
Solvability",
journal = j-CACM,
volume = "26",
number = "11",
pages = "924--925",
month = nov,
year = "1983",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Cichelli hash functions were investigated
statistically by a Monte Carlo procedure to examine the
likelihood of their existence with token sets of
various sizes, chosen with natural-language
probabilities. It was found that the solvability of the
Cichelli scheme became increasingly unlikely as the
token set increased in size, even when the minimality
condition was relaxed. With 30 tokens, the probability
of a quick solution was about 50 percent. This is a
severe limitation when applied to dynamic systems of
tokens. However, it is anticipated that some similar
technique may be developed, based on perfect but
nonminimal hashing, which will effectively allow
perfect minimal hashing (through a contraction table)
in most cases of practical value.",
acknowledgement = ack-nhfb,
classification = "723; 922",
journalabr = "Commun ACM",
keywords = "computer programming; mathematical statistics ---
Monte Carlo Methods",
}
@Article{Bell:1983:QQM,
author = "J. R. Bell",
title = "The Quadratic Quotient Method: {A} Hash Code
Eliminating Secondary Clustering",
journal = j-CACM,
volume = "26",
number = "1",
pages = "62--63",
month = jan,
year = "1983",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Mon Jul 18 20:33:03 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Burkhard:1983:IBI,
author = "Walter A. Burkhard",
title = "Interpolation-based index maintenance",
journal = j-BIT,
volume = "23",
number = "3",
pages = "274--294",
year = "1983",
CODEN = "BITTEL, NBITAB",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
MRclass = "68E05 (68B15 68H05)",
MRnumber = "84f:68047",
bibdate = "Thu Nov 12 18:12:56 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Discusses construction of order-preserving hash
functions for use in range queries.",
acknowledgement = ack-nhfb,
}
@InProceedings{Burkhard:1983:IIM