%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.68", %%% date = "11 April 2012", %%% time = "09:52:21 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 = "20300 55360 257753 2492932", %%% 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.68, the year coverage looks %%% like this: %%% %%% 1939 ( 2) 1964 ( 1) 1989 ( 118) %%% 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 ( 45) %%% 1948 ( 0) 1973 ( 20) 1998 ( 37) %%% 1949 ( 0) 1974 ( 22) 1999 ( 29) %%% 1950 ( 1) 1975 ( 23) 2000 ( 22) %%% 1951 ( 0) 1976 ( 22) 2001 ( 35) %%% 1952 ( 0) 1977 ( 31) 2002 ( 35) %%% 1953 ( 3) 1978 ( 23) 2003 ( 17) %%% 1954 ( 0) 1979 ( 33) 2004 ( 18) %%% 1955 ( 0) 1980 ( 38) 2005 ( 36) %%% 1956 ( 1) 1981 ( 36) 2006 ( 27) %%% 1957 ( 1) 1982 ( 59) 2007 ( 33) %%% 1958 ( 1) 1983 ( 78) 2008 ( 40) %%% 1959 ( 1) 1984 ( 70) 2009 ( 35) %%% 1960 ( 0) 1985 ( 83) 2010 ( 34) %%% 1961 ( 1) 1986 ( 72) 2011 ( 29) %%% 1962 ( 1) 1987 ( 59) 2012 ( 9) %%% 1963 ( 8) 1988 ( 87) %%% 19xx ( 7) %%% %%% Article: 1175 %%% Book: 103 %%% InCollection: 7 %%% InProceedings: 374 %%% Manual: 12 %%% MastersThesis: 11 %%% Misc: 9 %%% PhdThesis: 18 %%% Proceedings: 241 %%% TechReport: 129 %%% Unpublished: 4 %%% %%% Total entries: 2083 %%% %%% 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 %%% 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-COMPUT-PHYS = "Journal of Computational Physics"} @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-DISCR-MATH-SCI-CRYPTO = "Journal of Discrete Mathematical Sciences and Cryptography"} @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-SIGACT = "ACM SIGACT News"} @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-SIGSAC-REVIEW = "SIGSAC Review"} @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, author = "Walter A. Burkhard", title = "Interpolation-Based Index Maintenance", crossref = "ACM:1983:PSA", pages = "76--89", year = "1983", bibdate = "Tue May 12 09:40:01 1998", 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 operations, insertion, update, deletion, and orthogonal range query, is proposed. The scheme, an adaptation of linear hashing, requires no index or address directory structure and utilized 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 for individual records are obtainable; the actual storage required is controllable by the implementor.", acknowledgement = ack-nhfb, affiliation = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Sciences, San Diego, CA, USA", affiliationaddress = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Sciences, San Diego, CA, USA", classification = "722; 723", conference = "Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.", keywords = "address directory structure; computer metatheory --- Algorithmic Languages; computer operating systems --- Storage Allocation; computer systems, digital --- On Line Operation; data processing; data storage, digital --- Design; database systems --- Design; File Organization; interpolation-based index; linear hashing; shuffle order; storage utilization", meetingaddress = "Atlanta, GA, USA", sponsor = "ACM, Special Interest Group for Automata \& Computability Theory, New York, NY, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA", } @InProceedings{Burkhard:1983:PRI, author = "Walter A. Burkhard", booktitle = "Proceedings of the 17th Annual Conference on Information Sciences and Systems.", title = "Performance Results for Interpolation-Based Index Maintenance", publisher = "Johns Hopkins Univ", address = "Baltimore, Md, USA", pages = "484--489", year = "1983", 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; 921", keywords = "chain length fixed bounds; computer programming; data retrieval innovations; hashing algorithm performance; interpolation based order preserving hashing; orthogonal range query operations; runtime measurements", meetingaddress = "Baltimore, Md, USA", sponsor = "Johns Hopkins Univ, Dep of Electrical Engineering \& Computer Science, Baltimore, Md, USA", } @Article{Carter:1983:CEI, author = "J. L. Carter and G. Markowsky and M. N. Wegman", title = "Class of Easily Implemented Hash Functions", journal = j-IBM-TDB, volume = "26", number = "2", pages = "515--516", month = jul, year = "1983", 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 universal class of hash functions which utilize multiplication over a finite field is described. These functions are easy to implement in hardware and have good `randomizing' properties.", acknowledgement = ack-nhfb, classification = "723", journalabr = "IBM Tech Discl Bull", keywords = "computer metatheory; data processing", } @InCollection{Cercone:1983:MAMa, author = "N. Cercone and M. Krause and J. Boates", title = "Minimal and almost minimal perfect hash function search with application to natural language lexicon design", crossref = "Cercone:1983:CL", pages = "215--232", year = "1983", bibdate = "Mon Jul 18 20:24:08 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Cercone:1983:MAMb, author = "Nick Cercone and Max Krause and John Boates", title = "Minimal and Almost Minimal Perfect Hash Function Search with Application to Natural Language Lexicon Design", journal = j-COMP-MATH-APPL, volume = "9", number = "1", pages = "215--231", month = "????", year = "1983", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "New methods for computing perfect hash functions and applications of such functions to the problems of lexicon design are reported. After stating the problem and briefly discussing previous solutions, Cichelli's algorithm, which introduced the form of the solutions pursued in this research is presented. An informal analysis of the problem is given, followed by a presentation of three algorithms which refine and generalize Cichelli's method in different ways. Next the results of applying programmed versions of these algorithms to problem sets drawn from natural and artificial languages are reported. A discussion of conceptual designs for the application of perfect hash functions to small and large computer lexicons is followed by a summary of the present research and suggestions for further work.", acknowledgement = ack-nhfb, classification = "723; 901", journalabr = "Comput Math Appl", keywords = "information science", } @TechReport{Cercone:1983:SIS, author = "Nick Cercone and John Boates and Max Krause", title = "A Semi-Interactive System for Finding Perfect Hash Functions", type = "Technical report", number = "CMPT TR 83-4", institution = "Simon Fraser University", address = "Burnaby, BC, Canada", pages = "??", year = "1983", 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", note = "(email \path=library@cs.sfu.ca=).", acknowledgement = ack-nhfb, } @Unpublished{Chang:1983:DOM, author = "C. C. Chang and J. C. Shieh", title = "On the Design of Ordered Minimal Perfect Hashing Functions and Join Dependencies", pages = "??", year = "1983", bibdate = "Mon Jan 22 17:45:56 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Was to appear in J. ACM, but did not. Where was it finally published?", acknowledgement = ack-nhfb, } @Article{Chang:1983:PMF, author = "C. C. Chang and D. H. Su", title = "Properties of Multi-Attribute File Systems Based Upon Multiple Key Hashing Functions", journal = "Proceedings --- Annual Allerton Conference on Communication, Control, and Computing", pages = "675--682", year = "1983", CODEN = "PCCCDU", ISSN = "0732-6181", 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; 921", conference = "Proceedings --- 21st Annual Allerton Conference on Communication, Control, and Computing.", journalabr = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing 21st.", keywords = "data processing; data structures; files; mkh; multi attribute file systems; multiple key hashing; record clustering", meetingaddress = "Monticello, IL, USA", sponsor = "Univ of Illinois at Urbana-Champaign, Dep of Electrical Engineering, Urbana, Ill, USA; Univ of Illinois at Urbana-Champaign, Coordinated Science Lab, Urbana, Ill, USA", } @Article{Chen:1983:AEI, author = "Wen Chin Chen and Jeffrey Scott Vitter", title = "Analysis of early-insertion standard coalesced hashing", journal = j-SIAM-J-COMPUT, volume = "12", number = "4", pages = "667--676", month = nov, year = "1983", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P10", MRnumber = "85g:68012", bibdate = "Sat Jan 18 18:03:50 MST 1997", bibsource = "Database/Wiederhold.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "chaining and open addressing", } @Article{Chen:1983:NVC, author = "Wen-Chin Chen and Jeffrey Scott Vitter", title = "New Variants of Coalesced Hashing", journal = "Proceedings --- Annual Allerton Conference on Communication, Control, and Computing", pages = "683--692", year = "1983", CODEN = "PCCCDU", ISSN = "0732-6181", 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 --- 21st Annual Allerton Conference on Communication, Control, and Computing.", journalabr = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing 21st.", keywords = "address region; coalesced hashing; data structures; dynamic information storage; early insertion; information retrieval; information science", meetingaddress = "Monticello, IL, USA", sponsor = "Univ of Illinois at Urbana-Champaign, Dep of Electrical Engineering, Urbana, Ill, USA; Univ of Illinois at Urbana-Champaign, Coordinated Science Lab, Urbana, Ill, USA", } @Article{Chung:1983:PSR, author = "F. R. K. Chung and A. L. Rosenberg and Lawrence Snyder", title = "Perfect storage representations for families of data structures", journal = j-SIAM-J-ALG-DISC-METH, volume = "4", number = "4", pages = "548--565", month = dec, year = "1983", CODEN = "SJAMDU", ISSN = "0196-5212", MRclass = "68P05", MRnumber = "85c:68005", MRreviewer = "Ernst-Erich Doberkat", bibdate = "Sat Apr 11 10:02:33 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "SIAM Journal on Algebraic and Discrete Methods", keywords = "data structures; distinct memory location; families of data structures; hash function; minimizing the number of memory locations needed; rectangular arrays; storage allocation; two-dimensional chaotic arrays; two-dimensional ragged arrays; universal storage representations", treatment = "T Theoretical or Mathematical", } @Article{Cook:1983:STA, author = "R. P. Cook and T. J. LeBlanc", title = "A Symbol Table Abstraction to Implement Languages with Explicit Scope Control", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-9", number = "1", pages = "8--12", month = jan, year = "1983", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Mon Jul 18 20:54:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{daSilva:1983:PSH, author = "J. G. D. {da Silva} and I. Watson", title = "Pseudo-Associative Store with Hardware Hashing", journal = "IEE Proceedings, Part E: Computers and Digital Techniques", volume = "130", number = "1", pages = "19--24", month = jan, year = "1983", CODEN = "IPETD3", ISSN = "0143-7062", 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 data-flow model of computation instruction, execution is determined by the availability of data rather than by an explicit or implicit sequential flow of control. One of the major problems in the architectural design of a data-flow computer is the detection of the availability of data. This problem is compounded if the data carry context information as well as pointers to the instructions that will use them; an instruction is then executable when all data directed to within the same context are presented. The solution adopted in the Manchester design is to limit the maximum number of operands of an instruction to two, and to use associative storage techniques to detect the presence of data. The use of true content-addressable memory is precluded by its small density and high cost, and therefore a pseudo-associative store using hardware hashing techniques and implemented with conventional random-access memory is employed. The concept of sequence in the data-flow model of computation is unimportant; as a result search operations do not have to be resolved in the same sequence that the store is interrogated. This suggests a design which uses a main parallel hash table and a separate overflow mechanism operating in parallel. In this manner, an overflow search need not halt the progress of further main hash table searches. A pseudo-associative store results whose average access time is close to the cycle time of the original random-access memory.", acknowledgement = ack-nhfb, classification = "721; 722; 723", journalabr = "IEE Proc Part E", keywords = "data storage, digital", } @Article{Du:1983:SNP, author = "M. W. Du and T. M. Hsieh and K. F. Jea and D. W. Shieh", title = "The Study of a New Perfect Hash Scheme", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-9", number = "3", pages = "305--313", month = may, year = "1983", 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 = "A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size. 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", journalabr = "IEEE Trans Software Eng", keywords = "computer programming; hashing", remark = "Analytic results, problems sizes are small, experiments for problems of larger size.", } @InProceedings{Ellis:1983:EHC, author = "Carla Schlatter Ellis", title = "Extendible Hashing for Concurrent Operations and Distributed Data", crossref = "ACM:1983:PSA", publisher = pub-ACM, address = pub-ACM:adr, pages = "106--116", year = "1983", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "ACM (order n 475830). Baltimore, MD, USA.", abstract = "The extendible hash file is a dynamic data structure that is an alternative to B-trees for use as a database index. While there have been many algorithms proposed to allow concurrent access to B-trees, similar solutions for extendible hash files have not appeared. This paper presents solutions to allow for concurrency that are based on locking protocols and minor modifications in the data structure. Another question that deserves consideration is whether these indexing structures can be adapted for use in a distributed database. Among the motivations for distributing data are increased availability and ease of growth; however, unless data structures in the access path are designed to support those goals, they may not be realized. Some first attempts at adapting extendible hash files for distributed data are described.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, Computer Science Dep, Rochester, NY, USA", classification = "722; 723", keywords = "computer operating systems --- Storage Allocation; computer programming --- Algorithms; computer systems, digital --- Distributed; computers --- Data Communication Systems; concurrent access; data processing --- Distribution Applications; database index; database systems; directory; Distributed; extendible hash file; secondary storage; set of buckets", } @Article{Flajolet:1983:PC, author = "Philippe Flajolet", title = "Probabilistic Counting", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "76--82", year = "1983", CODEN = "ASFPDV", ISBN = "0-8186-0508-1", ISBN-13 = "978-0-8186-0508-6", ISSN = "0272-5428", LCCN = "????", 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 = "723", conference = "24th Annual Symposium on Foundations of Computer Science.", journalabr = "Annual Symposium on Foundations of Computer Science (Proceedings) 24th.", keywords = "computer programming; databases; distributed processing; multiple hashing functions; number of elements in A file; probabilistic algorithms; probabilistic counting", meetingaddress = "Tucson, AZ, USA", sponsor = "IEEE Computer Soc, Technical Committee on Mathematical Foundations of Computing, Los Alamitos, Calif, USA", } @Article{Flajolet:1983:PEE, author = "Philippe Flajolet", title = "On the Performance Evaluation of Extendible Hashing and Trie Searching", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "345--369", month = "????", year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", ISSN-L = "0001-5903", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A class of trees occurs both in digital searching and in schemes for maintaining dynamic has tables. The author studies the distribution of height in these trees using the saddle point method of complex analysis. As a result, a precise evaluation is derived of the memory requirements of extendible hashing --- a dynamic hashing scheme --- and some related implementation issues is discussed.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Acta Inf", keywords = "computer programming; extendible hashing; trie searching", } @InProceedings{Gonnet:1983:UDB, author = "Gaston H. Gonnet", title = "Unstructured Data Bases or Very Efficient Text Searching", crossref = "ACM:1983:PSA", pages = "117--124", year = "1983", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Several algorithms are presented for searching data bases that consist of text. The algorithms apply mostly to very large data bases that are difficult to structure. Algorithms are described which search the original data base without transformation and hence could be used as general text searching algorithms. Also described are algorithms requiring pre-processing, the best of them achieving a logarithmic behaviour. These efficient algorithms solve the `plagiarism' problem among n papers. The problem of misspellings, ambiguous spellings, simple errors, endings, positional information, etc. is treated using signature functions.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", classification = "722; 723; 901", conference = "Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.", keywords = "computer programming --- Algorithms; computer systems, digital --- On Line Operation; data processing --- Data Handling; database systems; Design; full text search; hashing; information retrieval systems --- Online Searching; pattern matching; string searching; text searching algorithms; unstructured data bases", meetingaddress = "Atlanta, GA, USA", sponsor = "ACM, Special Interest Group for Automata \& Computability Theory, New York, NY, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA", } @Article{Hopcroft:1983:HCG, author = "J. E. Hopcroft and M. S. Krishnamoorthy", title = "On the harmonious coloring of graphs", journal = j-SIAM-J-ALG-DISC-METH, volume = "4", number = "3", pages = "306--311", month = sep, year = "1983", CODEN = "SJAMDU", ISSN = "0196-5212", bibdate = "Mon Jul 18 22:33:00 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Work related to minimal perfect hash functions.", acknowledgement = ack-nhfb, } @TechReport{Ichikawa:1983:ARD, author = "T. Ichikawa and M. Hirakawa", title = "{ARES}: a Relational Database, Responsible for Data Semantics", number = "TR.CSG 8", institution = "Hiroshima University", address = "Hiroshima, Japan", pages = "??", month = aug, year = "1983", bibdate = "Sat Apr 20 19:35:47 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "An algorithm and architecture which gives n times speedup, excluding O(N) communication cost. (N is the max relation size, n is the number of slave processors) There are two types of relations in the relational database system ARES, namely, conventional and semantic relations. The semantic relation is attached to a conventional relation in terms of a join operation every time a flexible interpretation of queries is required. The slave processors are configured in a ring and communication among neighbor processors is unidirectional. Communication between master processor and a number of slave processors is via a star-shaped network. The join algorithm uses hashing to segment relation into N buckets and each bucket is assigned to a slave processor. The segmented source relation is first transmitted to the slave processors. Then the segmented target relation is transmitted one tuple at a time. All N slave processors execute the equi-join operation in parallel upon receiving the target tuple till all tuple of the target relation are transmitted. The result relation is transmitted back to the master processor. For general join the target relation buckets are passed to the next neighbor in the ring. The assignment of buckets to the slave processors ensures the ordering based on the join. ---full review of this and related reports with Ichikawa in student file: Mien Shih.", } @Article{Kak:1983:EMP, author = "Subhash C. Kak", title = "Exponentiation modulo a polynomial for data security", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "337--346", month = oct, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P25 (94A60)", MRnumber = "85f:68023", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Electrical and Computer Engng., Louisiana State Univ., Baton Rouge, LA, USA", keywords = "cryptography; data security; encryption; exponential modulo; public-key cryptosystem; RSA algorithm; security of data", treatment = "P Practical", } @Article{Kitsuregawa:1983:AHD, author = "M. Kitsuregawa and H. Tanaka and T. Moto-oka", key = "Kitsuregawa et al.", title = "Application of Hash to Database Machine and Its Architecture", journal = j-NEW-GEN-COMP, volume = "1", number = "1", pages = "63--74", year = "1983", ISSN = "0288-3635", bibdate = "Mon Jul 18 23:07:03 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "GRACE overflow avoidance join database machine", remark = "Relational Algebra Machine: GRACE backend processor. 5th gen.", } @Article{Kitsuregawa:1983:GRA, author = "Masaru Kitsuregawa and Hidehiko Tanaka and Tohru Moto-Oka", title = "{GRACE}: Relational Algebra Machine Based on Hash and Sort --- its Design Concepts", journal = j-J-INF-PROCESS, volume = "6", number = "3 (or 6??)", pages = "148--155", month = "????", year = "1983", 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 = "Design considerations of a relational algebra machine GRACE are described. GRACE adopts a novel relational algebra processing algorithm based on hash and sort and can execute heavy load operations such as join, projection (duplicate elimination), and set operations etc. much more efficiently. The abstract architecture is presented, which consists of three major components, Data Stream Processor (DSP), Data Stream Generator (DSG), and Secondary Data Manager (SDM). Data stream is manipulated during the data transfer from the source DSG to the destination DSG. The operator level pipeline effect is explained by which hashing phase is overlapped with the relational algebra processing and GRACE can execute a complex query including many heavy load operations efficiently without time overhead of hashing.", acknowledgement = ack-nhfb, classification = "723", journalabr = "J Inf Process", keywords = "computer architecture; computer systems programming; database systems; relational algebra machine", } @InProceedings{Kitsuregawa:1983:RAM, author = "Masaru Kitsuregawa and Hidehiko Tanaka and Tohru Moto-oka", title = "Relational Algebra Machine: {GRACE}", crossref = "Goto:1983:RSS", pages = "191--214", year = "1983", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Most of the data base machines proposed so far which adopts a filter processor as their basic unit show poor performance for the heavy load operation such as join and projection etc., while they can process the light load operations such as selection and update for which a full scan of a file suffices. GRACE adopts a novel relational algebra processing algorithm based on hash and sort, and can join in O((N plus m)/n) time. GRACE exhibits high performance even in join dominant environment. In this paper, hash based relational algebra processing technique, its implementation on parallel machine and architecture of GRACE are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tokyo, Dep of Information Engineering, Tokyo, Jpn", classification = "722; 723", keywords = "bucket converging method; bucket spreading method; database systems; grace database machine; hash-based relational algebra", remark = "Hash-based backend processor. 5th gen.?", } @TechReport{Kuespert:1983:VZO, author = "K. Kuespert", title = "{Vorschlaege zur Zeiteffizienten Online-fehlererkennung in Speicherungsstrukturen von Datenbanksystemen}", institution = "????", address = "Kaiserslautern, Germany", pages = "??", year = "1983", bibdate = "Mon Oct 26 08:34:06 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "B*-baum, Datenbanksystem, Effizienz, Fehlererkennung, Fehlertoleranz, Hash-verfahren, Redundanz", remark = "Im Vorliegenden Aufsatz wird fuer Hashtabellen MIT `separate Chaining' Sowie fuer B*-baeume Untersucht, Welche Moeglichkeiten zu einer Zeiteffizienten Fehlererkennung im Laufenden Betrieb Existieren. Dabei wird fuer die Betrachteten Ansaetze zur Fehlererkennung Stets von der Praemisse Ausgegangen, Dass die Verfahren Nur einen Minimalen Cpu-mehraufwand Undkeine Zusaetzlichen E/a-operationen Gegenueber der Normalen Db-verarbeitung Bedingen Duerfen.", } @Article{Larson:1983:AUH, author = "Per-{\AA}ke Larson", key = "Larson", title = "Analysis of Uniform Hashing", journal = j-J-ACM, volume = "30", number = "4", pages = "805--819", month = oct, year = "1983", 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 = "Uniform hashing or random probing is often used as a theoretical model of certain types of hashing schemes based on open addressing, and, in particular, of double hashing. Earlier analyses of uniform hashing are extended here to multirecord buckets. Three different situations are analysed: initial loading assuming uniform access frequencies, frequency loading assuming nonuniform access frequencies, and the dynamic behavior when insertions and deletions occur. Simple `closed' formulas cannot be found, but numerical results are readily computed. For larger bucket sizes the retrieval performance is significantly better than that of linear probing and separate chaining. Hence double hashing and similar techniques are competitive alternatives also for organizing externally stored files.", acknowledgement = ack-nhfb, classification = "723", journalabr = "J Assoc Comput Mach", keywords = "data processing; JACM performance modelling", } @Article{Lomet:1983:BIE, author = "David B. Lomet", key = "Lomet", title = "Bounded Index Exponential Hashing", journal = j-TODS, volume = "8", number = "1", pages = "136--165", month = mar, year = "1983", 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 = "Bounded index exponential hashing, a new form of extendible hashing, is described. It has the important advantages over most of the other extendible hashing variants of both (i) providing random access to any record of a file in close to one disk access and (ii) having performance which does not vary with file size. It is straightforward to implement and demands only a fixed and specifiable amount of main storage to achieve this performance. Its underlying physical disk storage is readily managed and record overflow is handled so as to insure that unsuccessful searches never take more than two accesses. The method's ability to access data in close to a single disk access makes it possible to organize a database, in which files have a primary key and multiple secondary keys, such that the result is a significant performance advantage over existing organizations.", acknowledgement = ack-nhfb, classification = "722", journalabr = "ACM Trans Database Syst", keywords = "data processing; TODS extendible hashing", } @InProceedings{Lyon:1983:PCC, author = "Gordon Lyon", booktitle = "Proceedings of the 17th Annual Conference on Information Sciences and Systems.", title = "Performance and Cost Characterization of {A}-Tree (Real-Time) Hashing", publisher = "Johns Hopkins Univ", address = "Baltimore, Md, USA", pages = "477--??", year = "1983", 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 = "A tree hashing; alternation tree hashing; computer programming; content addressable memory; open addressing tables restriction; real time hashing; software realizations", meetingaddress = "Baltimore, Md, USA", sponsor = "Johns Hopkins Univ, Dep of Electrical Engineering \& Computer Science, Baltimore, Md, USA", } @Article{Mairson:1983:PCS, author = "Harry G. Mairson", title = "Program Complexity of Searching a Table", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "40--47", year = "1983", CODEN = "ASFPDV", ISBN = "0-8186-0508-1", ISBN-13 = "978-0-8186-0508-6", ISSN = "0272-5428", LCCN = "????", 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 = "723", conference = "24th Annual Symposium on Foundations of Computer Science.", journalabr = "Annual Symposium on Foundations of Computer Science (Proceedings) 24th.", keywords = "data processing; perfect hashing; pointers; program complexity; search methods; table searching; worst-case performance", meetingaddress = "Tucson, AZ, USA", sponsor = "IEEE Computer Soc, Technical Committee on Mathematical Foundations of Computing, Los Alamitos, Calif, USA", } @Article{Maurer:1983:IHC, author = "W. D. Maurer", title = "An Improved Hash Code for Scatter Storage", journal = j-CACM, volume = "26", number = "1", pages = "36--38", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Tue Jul 19 01:13:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Mekouar:1983:EPD, author = "Faical Mekouar", title = "Etude des Performances du Hachage Digital", institution = "Institut National de Recherche en Informatique et Automatique", pages = "??", month = jun, year = "1983", bibdate = "Thu Jul 21 09:37:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Detailed evaluation of linear hashing. Confirms Litwin '81.", } @Article{Moran:1983:CDO, author = "Shlamo Moran", title = "On the Complexity of Designing Optimal Partial Match Retrieval Systems", journal = j-TODS, volume = "8", number = "4", pages = "543--551", month = dec, year = "1983", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Mon Jul 18 22:43:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "TODS hashing, searching", remark = "Optimal variable bit lengths of hashstrings, it is NP-hard.", review = "ACM CR 8411-0954", } @Article{Morris:1983:SST, author = "Morris", title = "Scatter Storage Techniques", journal = j-CACM, volume = "26", number = "??", pages = "??--??", month = "????", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1983.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Nishihara:1983:RRT, author = "Seiichi Nishihara and Katsuo Ikeda", title = "Reducing the Retrieval Time of Hashing Method by Using Predictors", journal = j-CACM, volume = "26", number = "12", pages = "1082--1088", month = dec, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", MRclass = "68P10", MRnumber = "783 509", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Existing hashing methods are classified into two main categories: open addressing and chaining. Other methods are presented that are intermediate between the two categories. The methods use one or more predictors reserved per cell instead of link field as in the chaining method. The predictors are used to maintain loose synonym chains. The efficiencies of the methods are estimated theoretically and verified experimentally. In comparison with the chaining methods are estimated theoretically and verified experimentally. In comparison with the chaining method, it is proved that the methods significantly reduce the average number of probes necessary to retrieve a key without expending extra space.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Commun ACM", keywords = "computer programming", } @InProceedings{Orenstein:1983:DHF, author = "Jack A. Orenstein", title = "A Dynamic Hash File for Random and Sequential Accessing", crossref = "Schkolnick:1983:ICV", journal = "Very Large Data Bases, International Conference on Very Large Data Bases", pages = "132--141", year = "1983", 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 = "9th International Conference on Very Large Data Bases.", journalabr = "Very Large Data Bases, International Conference on Very Large Data Bases 9th.", keywords = "data processing; data structure; dynamic file organization; order preserving linear hashing (OPLH); prefix; random accessing; sparsely filled buckets; VLDB", meetingaddress = "Florence, Italy", sponsor = "Very Large Data Bases Endowment, Saratoga, Calif, USA; IFIP, Geneva, Switz; Assoc Fran{\c{c}}aise pour la Cybernetique Economique et Technique, Paris, Fr; Assoc Italiana per il Calcolo Automatico, Italy; CNR, Rome, Italy; et al", } @PhdThesis{Ouksel:1983:OPD, author = "M. Ouksel", title = "Order-preserving Dynamic Hashing Schemes for Associative Searching in Database Systems", school = "Northwestern University", address = "Evanston, IL, USA", pages = "212", year = "1983", bibdate = "Mon Jul 18 22:02:28 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ouksel:1983:SMM, author = "Mohamed Ouksel and Peter Scheuermann", key = "Ouksel \& Scheuermann", title = "Storage Mappings For Multidimensional Linear Dynamic Hashing", crossref = "ACM:1983:PSA", pages = "90--105", year = "1983", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Simulation experiments which we carried out confirm the high performance of the Multidimensional Linear Dynamic Hashing (MLDH) method. For example, for uncontrolled splits, with b equals 5 and b prime equals 1, an average of 1.09 accesses is necessary, irrespective of d (the dimension of the space), while maintaining an average load factor of 0.67. On the other hand, for controlled splits, even with a threshold load factor of 0.9 for b equals 10, b prime equals 2, we obtained an average number of accesses of 1.74. Storage mappings for these splitting strategies were also developed, and as a byproduct we obtained a quite general class of extendible array storage mappings. We further intend to experiment with different distributions of attribute values in real files to see which splitting strategies are suitable.", acknowledgement = ack-nhfb, affiliation = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", affiliationaddress = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", classification = "722; 723", conference = "Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.", keywords = "computer operating systems --- Storage Allocation; computer systems programming --- Multiprocessing Programs; computer systems, digital --- Multiprocessing; data processing --- Data Handling; database systems; Design; direct access organizations; multidimensional linear dynamic hashing; physical database organizations; single-attribute access; storage mappings; tree-structured organizations", meetingaddress = "Atlanta, GA, USA", sponsor = "ACM, Special Interest Group for Automata \& Computability Theory, New York, NY, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA", } @InProceedings{Ouskel:1983:SMM, author = "M. Ouskel and P. Scheuermann", title = "Storage Mappings for Multidimensional Linear Dynamic Hashing", crossref = "ACM:1983:PSA", pages = "90", year = "1983", bibdate = "Mon Jul 18 09:44:57 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "PODS", } @Misc{Petersen:1983:AVV, author = "D. Petersen", title = "Auswahl eines Verfahrens zur Verwaltung des Sekundaerspeichers der Relationalen Datenbankmaschine (rdbm)", howpublished = "Studienarbeit", school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu Braunschweig", address = "Braunschweig, Germany", pages = "??", year = "1983", bibdate = "Sat Dec 30 09:28:23 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "B-baum, Hash-verfahren, Rdbm, Speicherverwaltung", remark = "Der Datenbestand --- Lineare Listen --- Binaerbaum --- Bayer-baum (b-baum) --- Gestreute Speicherung (hash-verfahren) --- Auswahldes Verwaltungsalgorithmus.", } @Article{Quittner:1983:ECI, author = "P{\'a}e Quittner", title = "Efficient Combination of Index Tables and Hashing", journal = j-SPE, volume = "13", number = "6", pages = "471--478", month = jun, year = "1983", 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 = "It is shown that for data stored on direct access devices, access time can be reduced without increasing storage demands, through a single level index table which itself is accessible by hashing. If the complete index table can be stored in main memory this method is always superior to direct hashing and to sequentially organized index tables. If the index table is stored on disk it always yields smaller access time than multi-level index tables and --- depending on the size of the index table and on the number of records per track --- it is comparable or better than hashing the data directly. Expressions are given to determine in this case which method is more efficient.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Software Pract Exper", keywords = "data processing; measurement; performance; theory", review = "ACM CR 8403-0179", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ E.5 Data, FILES, Optimization \\ E.5 Data, FILES, Organization/structure", } @Article{Radue:1983:DIS, author = "Jon Radue", title = "On the Design of an Interactive Spelling Dictionary for Personal Computers", journal = "SIGPC Notes (ACM Special Interest Group on Personal Computing)", volume = "6", number = "2", pages = "197--199", year = "1983", CODEN = "SPCNDH", ISBN = "0-89791-123-7", ISBN-13 = "978-0-89791-123-8", LCCN = "QA 76.5 S53 v.6 no.2", bibdate = "Tue May 12 09:44:46 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "ACM (Order n 609830). Baltimore, MD, USA.", abstract = "The major spelling error detection techniques are briefly reviewed. The virtual hashing technique is described, and results indicate that it could be an efficient way of storing and searching an interactive dictionary on a personal computer.", acknowledgement = ack-nhfb, affiliation = "Brock Univ, Dep of Computer Science \& Information Processing, St. Catharines, Ont, Can", affiliationaddress = "Brock Univ, Dep of Computer Science \& Information Processing, St. Catharines, Ont, Can", classification = "722; 723; 901", conference = "1983 ACM Conference on Personal and Small Computers.", journalabr = "SIGPC Notes (ACM Special Interest Group on Personal Computing)", keywords = "computer systems, digital; data processing --- Word Processing; dictionary lookup; error correction facilities; information retrieval field; Interactive Operation; text string valid work determination; virtual hashing technique", meetingaddress = "San Diego, CA, USA", sponsor = "ACM, Special Interest Group on Personal Computing, New York, NY, USA; ACM, Special Interest Group on Small Computing Systems \& Applications, New York, NY, USA", } @Article{Ramamohanarao:1983:PMR, author = "K. Ramamohanarao and John W. Lloyd and James A. Thom", title = "Partial-Match Retrieval Using Hashing and Descriptors", journal = j-TODS, volume = "8", number = "4", pages = "552--576", month = dec, year = "1983", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", MRclass = "68P10", MRnumber = "794 538", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; Database/Graefe.bib; Database/Wiederhold.bib; Graphics/siggraph/83.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/1983-8-4/p552-ramamohanarao/p552-ramamohanarao.pdf; http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p552-ramamohanarao/", abstract = "This paper studies a partial-match retrieval scheme based on hash functions and descriptors. The emphasis is placed on showing how the use of a descriptor file can improve the performance of the scheme. Records in the file are given addresses according to hash functions for each field in the record. Furthermore, each page of the file has associated with it a descriptor, which is a fixed-length bit string, determined by the records actually present in the page. Before a page is accessed to see if it contains records in the answer to a query, the descriptor for the page is checked. This check may show that no relevant records are on the page and, hence, that the page does not have to be accessed. The method is shown to have a very substantial performance advantage over pure hashing schemes, when some fields in the records have large key spaces. A mathematical model of the scheme, plus an algorithm for optimizing performance, is given.", acknowledgement = ack-nhfb, classification = "723; 901; 921", fjournal = "ACM Transactions on Database Systems", journalabr = "ACM Trans Database Syst", keywords = "computer programming --- Algorithms; DATA PROCESSING --- File Organization; descriptors; dynamic file; hashing; information science; MATHEMATICAL MODELS; OPTIMIZATION; optimization; partial-match retrieval", oldlabel = "geom-948", subject = "Information Systems --- Database Management --- Physical Design (H.2.2): {\bf Access methods}; Information Systems --- Information Storage and Retrieval --- Information Storage (H.3.2): {\bf File organization}", } @InProceedings{Sacks-Davis:1983:ILH, author = "R. Sacks-Davis and K. Ramamohanarao", title = "Implementation of Linear Hashing Schemes", crossref = "Barter:1983:ACS", pages = "27:1--27:10", year = "1983", bibdate = "Tue Nov 05 09:28:31 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Sacks-Davis:1983:TLS, author = "R. Sacks-Davis and K. Ramamohanarao", title = "A two level superimposed coding scheme for partial match retrieval", journal = j-INFO-SYS, volume = "8", number = "4", pages = "273--280", year = "1983", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Fri Apr 30 11:16:59 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See \cite{Sacks-Davis:1985:PMK}.", acknowledgement = ack-nhfb, } @Book{Sedgewick:1983:A, author = "Robert Sedgewick", title = "Algorithms", publisher = pub-AW, address = pub-AW:adr, pages = "viii + 551", year = "1983", ISBN = "0-201-06672-6", ISBN-13 = "978-0-201-06672-2", LCCN = "QA76.6 .S435 1983", bibdate = "Wed Dec 15 18:23:21 1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InCollection{Sedgewick:1983:MAC, author = "R. Sedgewick", title = "Part {III}. Mathematical analysis of combinatorial algorithms", crossref = "Louchard:1983:PTC", pages = "Part III. Mathematical analysis of combinatorial algorithm", year = "1983", bibdate = "Mon Jul 18 20:29:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Analysis of hashing with linear probing.", acknowledgement = ack-nhfb, } @Article{Shen:1983:OSU, author = "John Paul Shen and Michael A. Schuette", title = "On-Line Self-Monitoring Using Signatured Instruction Streams", journal = "Digest of Papers --- International Test Conference", pages = "275--282", year = "1983", CODEN = "DITCDP", ISBN = "0-8186-0502-2", ISBN-13 = "978-0-8186-0502-4", LCCN = "TK 7874 I593 1983", bibdate = "Tue May 12 09:44:54 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", acknowledgement = ack-nhfb, classification = "714; 723", conference = "Proceedings --- International Test Conference 1983: Testing's Changing Role.", journalabr = "Dig Pap Int Test Conf", keywords = "branch address hashing; error detection; mc68000 processor; on-line systems; semiconductor device manufacture; signatured instruction streams; unit-under-test", meetingaddress = "Philadelphia, PA, USA", sponsor = "IEEE Computer Soc, Test Technology Committee, Los Alamitos, Calif, US; IEEE Philadelphia Section, Philadelphia, Pa, USA", } @Article{Silva:1983:PAS, author = "J. Da Silva and I. Watson", key = "Da Silva \& Watson", title = "Pseudo-Associative Store with Hardware Hashing", journal = j-IEEE-PROC, volume = "Pt. E", number = "1", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "19--24", year = "1983", bibdate = "Thu Jul 14 16:39:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InCollection{Tanaka:1983:DSD, author = "Y. Tanaka", title = "A Data-stream Database Machine with Large Capacity", crossref = "Hsiao:1983:ADM", pages = "168--202", year = "1983", bibdate = "Mon Jul 18 22:39:20 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Torenvliet:1983:ROT, author = "Leen Torenvliet and P. {van Emde Boas}", title = "The Reconstruction and Optimization of Trie Hashing Functions", crossref = "Schkolnick:1983:ICV", journal = "Very Large Data Bases, International Conference on Very Large Data Bases", pages = "142--156", year = "1983", 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; 921", conference = "9th International Conference on Very Large Data Bases.", journalabr = "Very Large Data Bases, International Conference on Very Large Data Bases 9th.", keywords = "adaptation; database systems; mathematical analysis; reconstruction; storage of information; trie hashing algorithms; VLDB", meetingaddress = "Florence, Italy", sponsor = "Very Large Data Bases Endowment, Saratoga, Calif, USA; IFIP, Geneva, Switz; Assoc Fran{\c{c}}aise pour la Cybernetique Economique et Technique, Paris, Fr; Assoc Italiana per il Calcolo Automatico, Italy; CNR, Rome, Italy; et al", } @Article{Tsichritzis:1983:MF, author = "D. Tsichritzis and S. Christodoulakis", title = "Message files", journal = j-TOOIS, volume = "1", number = "1", pages = "88--98", month = jan, year = "1983", CODEN = "ATOSDO", ISSN = "0734-2047", bibdate = "Mon Jul 18 20:49:49 1994", bibsource = "http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses application of hashing to signatures for text searching.", URL = "http://www.acm.org:80", acknowledgement = ack-nhfb, } @Article{Vitter:1983:ASP, author = "Jeffrey Scott Vitter", title = "Analysis of the Search Performance of Coalesced Hashing", journal = j-J-ACM, volume = "30", number = "2", pages = "231--258", month = apr, year = "1983", 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 is presented of the coalesced hashing method, in which a portion of memory (called the address region) serves as the range of the hash function while the rest of memory (called the cellar) is devoted solely to storing records that collide when inserted. If the cellar should get full, subsequent colliders must be stored in empty slots in the address region and thus may cause later collisions. Varying the relative size of the cellar affects search performance. The main result of this paper expresses the average search times as a function of the number of records and the cellar size, solving a long-standing open problem. These formulas are used to pick the cellar size that leads to optimum search performance, and it is shown that this ``tuned'' method outperforms several well-known hashing schemes. A discussion of past work on coalesced hashing and a generalization of the method of nonuniform hash functions is included.", acknowledgement = ack-nhfb, classification = "723", journalabr = "J Assoc Comput Mach", keywords = "data processing; JACM database indexing", remark = "Chaining and open addressing; by appropriate tuning outperforms other schemes.", review = "ACM CR 40,398", } @Book{Weide:1983:MCE, author = "Bruce W. Weide and David J. Hogan", title = "Mapping to Cells: Extension of a Data Structure for Fast Storage and Retrieval", publisher = pub-SV, address = pub-SV:adr, pages = "37--41", year = "1983", ISBN = "0-387-90835-8", ISBN-13 = "978-0-387-90835-9", LCCN = "QA276.4 .C58 1982", bibdate = "Tue May 12 09:45:32 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "723; 901", conference = "Computer Science and Statistics: Proceedings of the 14th Symposium on the Interface.", keywords = "data compression and compaction; data structure; dynamic programming; fast storage and retrieval; hashing; information retrieval systems; mapping to cells", meetingaddress = "Troy, NY, USA", } @Book{Wiederhold:1983:FOD, author = "Gio Wiederhold", title = "File Organization for Database Design", publisher = pub-MH, address = pub-MH:adr, pages = "??", year = "1983", ISBN = "", ISBN-13 = "", LCCN = "", bibdate = "Thu Jul 21 08:47:33 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", series = "McGraw-Hill Computer Science Series, Editor: Richard W. Hamming and Edward A. Feigenbaum", acknowledgement = ack-nhfb, descriptor = "Datenorganisation, Hashing, Index, Kryptographie, Speicherstruktur, Datei", } @InProceedings{Winternitz:1983:POW, author = "Robert S. Winternitz", title = "Producing a One-Way Hash Function from {DES}", crossref = "Chaum:1983:ACP", pages = "203--207", year = "1983", bibdate = "Thu Oct 31 18:48:13 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Wirth:1983:AD, author = "N. Wirth", title = "Algorithmen und Datenstrukturen", publisher = pub-TEUBNER, address = pub-TEUBNER:adr, edition = "Third", pages = "320", year = "1983", ISBN = "3-519-02250-8", ISBN-13 = "978-3-519-02250-3", bibdate = "Fri Sep 16 11:55:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Back Tracking, Baum, Datenstruktur, Datentyp, File, Hashing, Liste, Rekursion, Sortieren, Suchbaum, Suchen, Zeiger", remark = "Lehrbuch.", } @Article{Wright:1983:SFS, author = "William E. Wright", title = "Some File Structure Considerations Pertaining to Magnetic Bubble Memory", journal = j-COMP-J, volume = "26", number = "1", pages = "43--51", month = feb, year = "1983", 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_26/Issue_01/; Misc/is.bib", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/43.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/44.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/49.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/50.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_01/tiff/51.tif", acknowledgement = ack-nhfb, classcodes = "C5320E (Storage on stationary magnetic media); C6120 (File organisation)", classification = "723", corpsource = "Dept. of Computer Sci., Southern Illinois Univ., Carbondale, IL, USA", keywords = "architecture; blocking; data processing; data storage, magnetic --- Bubbles; file organisation; file structures; hashed files; indexed sequential files; magnetic bubble memories; magnetic bubble memory; parallel systems; record sizes; serial systems; tree structured files; wrap-around", treatment = "P Practical", } @InProceedings{Yang:1983:SPH, author = "W. P. Yang and M. W. Du and J. C. Tsay", booktitle = "Proceedings of the 17th Annual Conference on Information Sciences and Systems.", title = "Single-Pass Perfect Hashing for Data Storage and Retrieval", publisher = "Johns Hopkins Univ", address = "Baltimore, Md, USA", pages = "470--476", year = "1983", 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; 921", keywords = "collision problem avoidance; computer programming; dynamic key sets; dynamic perfect hash schemes; extendible hash tables; single pass perfect hashing; spp hashing", meetingaddress = "Baltimore, Md, USA", sponsor = "Johns Hopkins Univ, Dep of Electrical Engineering \& Computer Science, Baltimore, Md, USA", } @Article{Yao:1983:LBP, author = "Andrew C. Yao", title = "Lower Bounds by Probabilistic Arguments", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "420--428", year = "1983", CODEN = "ASFPDV", ISBN = "0-8186-0508-1", ISBN-13 = "978-0-8186-0508-6", ISSN = "0272-5428", LCCN = "????", 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 = "723", conference = "24th Annual Symposium on Foundations of Computer Science.", journalabr = "Annual Symposium on Foundations of Computer Science (Proceedings) 24th.", keywords = "boolean circuits; communication complexity; computer metatheory; hashing functions; lower bounds; probabilistic arguments", meetingaddress = "Tucson, AZ, USA", sponsor = "IEEE Computer Soc, Technical Committee on Mathematical Foundations of Computing, Los Alamitos, Calif, USA", } @InProceedings{Yao:1983:SSG, author = "Tien-Shun Yao and Bao-ku Wang and Jing-Sheng Yu", title = "Simulation System of Graph Composed {Chinese} Character Processing", crossref = "Anonymous:1983:MPM", pages = "367--378", year = "1983", bibdate = "Tue May 12 09:46:32 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "722; 741", keywords = "block dividing; character recognition equipment; compression; hashing functions; repeat checking; sequencing; simulation systems", sponsor = "China Instrument Soc, Beijing, China; ISA, Research Triangle Park, NC, USA; Soc of Instrument \& Control Engineers (Japan), Tokyo, Jpn", } @Article{Zhao:1983:PMC, author = "Hejun Zhao and Yuefang Zhang", title = "Practical Micro-Computer Management System of an Automated Stereo-Warehouse", journal = "Chi Hsieh Kung Ch'eng Hsueh Pao/Chinese Journal of Mechanical Engineering", volume = "19", number = "3", pages = "22--31", month = sep, year = "1983", CODEN = "CHHKA2", ISSN = "0577-6686", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The software for the micro-computer is explained in detail for the management of an automated stereo-warehouse. The data structure of the main files is given. The design principle is described by using the `input' module block as an example. Finally, a flow chart of the input module block is given.", acknowledgement = ack-nhfb, classification = "402; 662; 694; 722; 723", journalabr = "Chi Hsieh Kung Ch'eng Hsueh Pao", keywords = "automobile plants; computer software; computers, microprocessor; hashing functions; linked queues; warehouses", language = "Chinese", } @Article{Ajtai:1984:HFP, author = "M. Ajtai and M. Fredman and J. Koml{\`o}s", title = "Hash Functions for Priority Queues", journal = j-INF-CONTROL, volume = "63", number = "3", pages = "217--225", month = dec, year = "1984", 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 = "The complexity of priority queue operations is analyzed with respect to the cell probe computational model of A. C. Yao. A method utilizing families of hash functions is developed which permits priority queue operations to be implemented in constant worst-case time provided that a size constraint is satisfied. The minimum necessary size of a family of hash functions for computing the rank function is estimated and contrasted with the minimum size required for perfect hashing.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California San Diego, La Jolla, CA, USA", classification = "723; 922", journalabr = "Inf Control", keywords = "data processing; Data Structures; hash functions; priority queues; probability --- Queueing Theory", } @Article{Bechtold:1984:UEH, author = "Ulrich Bechtold and Klaus K{\"u}spert", title = "On the Use of Extendible Hashing without Hashing", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "21--26", month = jul, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The authors report on the use of decimal numbers coded in EBCDIC which are stored in the EXHASH table without prior randomization. Thus, they do not distinguish between keys and pseudokeys. This allows for the sequential processing of records in key order which is commonly needed in database applications. The performance of the method is compared to that of perfect randomization by means of simulation series. The results indicate that packed decimal keys can be used in EXHASH without randomization, whereas the use of unpacked decimal keys necessitates randomization to avoid an intolerable growth of the EXHASH directory. The storage utilization in the leaves (hash buckets), however, is shown to be fairly high both in the case of packed and of unpacked decimal pseudokeys.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Inf Process Lett", keywords = "data processing; hashing", } @Article{Bell:1984:HTV, author = "D. A. Bell and S. M. Deen", title = "Hash Trees Versus {B-Trees}", journal = j-COMP-J, volume = "27", number = "3", pages = "218--224", month = aug, year = "1984", 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 of external hashing is known to have advantages for certain types of primary key distribution. In this paper the value of the method as a general indexing technique --- for secondary keys as well as primary keys --- is assessed, and a comparison with the B-trees method is presented.", acknowledgement = ack-nhfb, classcodes = "C6120 (File organisation)", classification = "723", corpsource = "School of Computer Sci., Ulster Polytech., Newtownabbey, UK", journalabr = "Comput J", keywords = "B-trees method; data processing; DBMS; distribution; external hashing; file organisation; hash trees; hash trees method; indexing technique; primary key; trees (mathematics); {B}-trees", treatment = "P Practical", } @InProceedings{Borgwardt:1984:PPU, author = "P. Borgwardt", title = "Parallel {Prolog} Using Stack Segments on Shared-memory Multiprocessors", crossref = "IEEE:1984:ISL", pages = "??", year = "1984", bibdate = "Thu Jul 21 09:37:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "CH2007-3/84/0002\$01.00.", abstract = "A method of parallel evaluation for standard PROLOG for shared-memory multiprocessors is presented that is a natural extension of the current methods of compiling PROLOG for sequential execution. In particular, the method exploits stack-based evaluation with stack segments spread across several processors to reduce the amount of runtime storage needed and hence to reduce the occurrence of garbage collection in the distributed computation. And parallelism and stream parallelism are the most important sources of concurrent execution in this method; these are implemented using local process lists; idle processors may scan these and execute any process which is ready to execute. Or parallelism is less important, but the method does not implement it with hash table windows into a binary tree of or contexts when it is requested in the source program.", acknowledgement = ack-nhfb, keywords = "High Level Languages; Parallel Processing; Program Compilers; Programming; Software Engineering", } @TechReport{Bradley:1984:UMD, author = "James Bradley", title = "Use of Mean Distance Between Overflow Records to Compute Average Search Lengths in Hash Files with Open Addressing", number = "84/154/12", institution = "University of Calgary", pages = "??", month = may, year = "1984", bibdate = "Thu Jul 21 09:37:45 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "(email parin@cpsc.ucalgary.ca).", acknowledgement = ack-nhfb, } @InProceedings{Bratbergsengen:1984:HMR, author = "Kjell Bratbergsengen", key = "Bratbergsengen", booktitle = "Proceedings of the 10th Conference on Very Large Databases, Singapore", title = "Hashing Methods and Relational Algebra Operations", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adr, pages = "323--333", month = aug, year = "1984", 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 presents algorithms for relational algebra and set operations based on hashing. Execution times are computed and performance is compared to standard methods based on nested loop and sort-merge. The algorithms are intended for use on a monoprocessor computer with standard disks for data base storage. It is indicated however that hashing methods are well suited to multi processor or especially multi machine database machines. The relational algebra operations described in this paper are under implementation in TECHRA, a database system especially designed to meet the needs of technical applications, like CAD systems, utility maps, oil field exploration, etc.", acknowledgement = ack-nhfb, affiliationaddress = "Norwegian Inst of Technology, Trondheim, Norw", classification = "722; 723; 921", conference = "Proceedings --- Very Large Data Bases, Tenth International Conference.", keywords = "computer programming --- Algorithms; computer systems, digital --- Multiprocessing; data processing --- File Organization; database systems; execution times; hashing methods; mathematical techniques --- Algebra; Relational; relational algebra; set operations; techra database system; Techra hash join intersection duality cluster size sizes VLDB", meetingaddress = "Singapore", sponsor = "VLDB Endowment, Saratoga, CA, USA; Inst of Systems Science; Singapore Computer Soc, Singapore; IFIP, Geneva, Switz", } @Article{Bryant:1984:EHL, author = "R. M. Bryant", title = "Extendible Hashing for Line-Oriented Paging Stores", journal = j-IBM-TDB, volume = "26", number = "11", pages = "6046--6049", month = apr, year = "1984", 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 = "The extendible hashing algorithm for hash tables stored in page-formatted main memory allows most hash-table probes to be resolved. Use is made of only two memory references, each memory reference bringing a multibyte line into the processor cache.", acknowledgement = ack-nhfb, classification = "721; 722", journalabr = "IBM Tech Discl Bull", keywords = "data storage, digital; extendible hashing", } @Article{Burkowski:1984:CHH, author = "F. J. Burkowski", title = "Correction to {``A Hardware Hashing Scheme in the Design of a Multiterm String Comparator''}", journal = j-IEEE-TRANS-COMPUT, volume = "C-33", number = "4", pages = "375--375", month = apr, year = "1984", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/TC.1984.1676447", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 10 09:22:51 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib", note = "See \cite{Burkowski:1982:HHS}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676447", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", } @Article{Cain:1984:MAD, author = "Peter Cain", title = "Mixing Analogue and Digital Circuitry in a Signal Generator", journal = "IEE Colloquium (Digest)", volume = "1984/1", pages = "4.1--4.4", year = "1984", CODEN = "DCILDN", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "By looking at a specific piece of modern test equipment, namely a signal generator, many examples of both the advantages and unwanted side-effects of mixed circuit design can be seen. A signal generator will often be used to test receivers, be they spectrum analysers or narrow band hand-held radios. To make useful measurements on these it is imperative that only the wanted signal should be present at the output. Maintaining this purity of signal is one of the major tasks for the mixed circuit designer.", acknowledgement = ack-nhfb, affiliationaddress = "Marconi Instruments", classification = "713; 715", conference = "Colloquium on Mixed Analogue and Digital Circuit Design and Layout.", journalabr = "IEE Colloquium (Digest)", keywords = "baseband hash; decoupling; Design; electronic circuits, digital --- Synthesis; electronic circuits, switching; logic circuits; mixed digital and analog circuit design; sidebands; signal generators; signal levels; signal paths; signal processing --- Digital Techniques", meetingaddress = "London, Engl", sponsor = "IEE, Electronics Div, London, Engl", } @Article{Chang:1984:CHC, author = "S. K. Chang and J. C. Dorng", title = "Concatenated hash code selection", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "5", pages = "395--412", month = oct, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P10", MRnumber = "86d:68017", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Electr. and Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA", keywords = "concatenated hash code; file multiple-attribute retrieval; file organisation; hash code selection; hashing scheme; magnetic --- Bubbles; optimal code length; partial match retrieval; storage allocation", treatment = "P Practical", } @Article{Chang:1984:OIR, author = "C. C. Chang", title = "Optimal Information Retrieval when Queries are not Random", journal = j-INFO-SCI, volume = "34", number = "3", pages = "199--223", year = "1984", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Mon Jul 18 23:44:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses the Multiple Key Hashing method of Rothnie and Lozano \cite{Rothnie:1974:ABF}.", acknowledgement = ack-nhfb, } @Article{Chang:1984:OMP, author = "C. C. Chang", title = "An Ordered Minimal Perfect Hashing Scheme Based Upon {Euler's} Theorem", journal = j-INFO-SCI, volume = "32", number = "3", pages = "165--172", month = jun, year = "1984", CODEN = "ISIJBC", ISSN = "0020-0255", 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 scheme for hashing is proposed. Contrary to the usual hashing, the author stores the records in order. Furthermore, these hashing functions allow single probe retrieval from minimal sized memory space. The scheme is based upon the Fermat number and Euler's theorem. Many theorems concerning numbers are also discussed.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Inf Sci", keywords = "computer programming", } @Article{Chang:1984:SOM, author = "C. C. Chang", title = "The Study of an Ordered Minimal Perfect Hashing Scheme", journal = j-CACM, volume = "27", number = "4", pages = "384--387", month = apr, year = "1984", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", MRclass = "68P10", MRnumber = "86d:68016", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "The English translation of Ref.~6 of this paper appears in \cite{Hua:1982:INT}; that book contains the fundamental prime number functions needed for the ordered minimal perfect hash functions described here.", acknowledgement = ack-nhfb, remark = "Chang uses hash functions of the form $h(x)=(C\bmod{}p(x))$ where $C$ is an integer constant and $p(x)$ generates a different prime for each integer $x$. No general method for finding $p(x)$ is given.", } @Article{Chen:1984:ANV, author = "Wen-Chin Chen and Jeffrey Scott Vitter", key = "Chen \& Vitter", title = "Analysis of New Variants of Coalesced Hashing", journal = j-TODS, volume = "9", number = "4", pages = "616--645", month = dec, year = "1984", 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 = "The coalesced hashing method has been shown to be very fast for dynamic information storage and retrieval. This study analyzes in a uniform way the performance of coalesced hashing and its variants, thus settling some open questions in the literature. In all the variants, the range of the hash function is called the address region, and extra space reserved for storing colliders is called the cellar. The authors refer to the unmodified method, which was analyzed previously, as late-insertion coalesced hashing. In this work they analyze late insertion and two new variations call early insertion and varied insertion. When there is no cellar, the early-insertion method is better than late insertion; however, past experience has indicated that it might be worse when there is a cellar. The analysis confirms that it is worse. The varied-insertion method was introduced as a means of combining the advantages of late insertion and early insertion. This study shows that varied insertion requires fewer probes per search, on the average, than do the other variants.", acknowledgement = ack-nhfb, affiliationaddress = "Brown Univ, Dep of Computer Science, Providence, RI, USA", classification = "723", journalabr = "ACM Trans Database Syst", keywords = "address region; cellar; coalesced hashing; computer programming --- Algorithms; data processing; early insertion; information retrieval systems; late insertion", remark = "Chaining and open addressing. Internal memory is assumed!", } @PhdThesis{Chen:1984:DACa, author = "Wen-Chin Chen", title = "The Design and Analysis of Coalesced Hashing", school = inst-BROWN-CS, address = inst-BROWN-CS:adr, pages = "??", month = nov, year = "1984", bibdate = "Thu Jul 21 09:37:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See also \cite{Chen:1984:DACb}.", acknowledgement = ack-nhfb, } @TechReport{Chen:1984:DACb, author = "Wen-Chin Chen", title = "The Design and Analysis of Coalesced Hashing", number = "CS-84-22", institution = inst-BROWN-CS, address = inst-BROWN-CS:adr, pages = "??", month = nov, year = "1984", bibdate = "Thu Jul 21 09:37:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "This is the author's Ph.D. thesis, \cite{Chen:1984:DACa}.", acknowledgement = ack-nhfb, } @Article{Christodoulakis:1984:ICA, author = "S. Christodoulakis", title = "Implications of Certain Assumptions in Data Base Performance Evaluation", journal = j-TODS, volume = "9", number = "2", pages = "??", month = jun, year = "1984", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jul 21 09:37:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: rcvd 1983.", acknowledgement = ack-nhfb, remark = "After a somewhat cursory reading of the paper--A few comments: A. Uniform distributions, particularly for parallel machines, may imply uniform distribution of work over the machines--thus giving an upper bound for speedup--thus a uniform distribution is an optimistic assumption. B. For uniprocessor systems -- the assumption of a uniform dist. is optimistic when: 1. hashing--fewer collisions, shorter lists at collisions should be expected from a uniform distribution. 2. trees--more balancing costs may be incurred for non-uniform distributions. 3. searching--for example, a binary search on a non-uniform could cost significantly more. 4. sorting--I suspect that uniform distributions are optimal for some sorting methods, although I haven't looked at this in any detail.", } @Article{Cleary:1984:CHT, author = "John G. Cleary", title = "Compact Hash Tables Using Bidirectional Linear Probing", journal = j-IEEE-TRANS-COMPUT, volume = "C-33", number = "9", pages = "828--834", month = sep, year = "1984", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/TC.1984.1676499", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 10 09:22:54 MDT 2011", bibsource = "Compendex database; http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676499", abstract = "An algorithm is developed which reduces the memory requirements of hash tables. This is achieved by storing only a part of each key along with a few extra bits needed to ensure that all keys are stored unambiguously. The fraction of each key stored decreases as the size of the hash table increases. Significant reductions in total memory usage can be achieved especially when the key size is not much larger than the size of a memory index and when only a small amount of data is stored with each key. The algorithm is based on simulation linear probing. Search and insertion times are shown by simulation to be similar to those for ordinary bidirectional linear probing.", acknowledgement = ack-nhfb, classification = "723", fjournal = "IEEE Transactions on Computers", journalabr = "IEEE Trans Comput", keywords = "address calculation; bidirectional linear probing; computer programming --- algorithms; data processing; hash storage; hash tables; information retrieval; memory compaction; open addressing; performance analysis; scatter storage; search methods; searching", } @TechReport{Cleary:1984:FCR, author = "John G. Cleary and John J. Darragh", title = "A Fast Compact Representation of Trees Using Hash Tables", number = "84/162/20", institution = "University of Calgary", pages = "??", month = sep, year = "1984", bibdate = "Thu Jul 21 09:37:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "(email parin@cpsc.ucalgary.ca).", acknowledgement = ack-nhfb, } @Book{Cohen:1984:MSP, author = "Shimon Cohen", title = "Multi-Version Structures in {Prolog}", publisher = pub-OHMSHA, address = pub-OHMSHA:adr, pages = "229--234", year = "1984", ISBN = "4-274-07221-5", ISBN-13 = "978-4-274-07221-5", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We discuss the problem of implementing MVS (Multi-Version Structures) like arrays, hash-tables, and sets in logic programming languages (i. e. Prolog). One can define pure Prolog predicates which behave like arrays etc., but the question is how efficient these predicates are compared to the equivalent operations in PASCAL, C or LISP. We discuss: (1) What kind of MVS we want to have in Prolog. (2) The problems in implementing them. (3) The alternative solutions. We show how to implement arrays efficiently by introducing multi-version arrays. Arrays which differ slightly from each other are implemented using one physical array, thus the cost of updating an array while retaining the old array will be small. It is also possible to `go back' to older versions and start modifying them (without any damage to other versions). We show how to execute parallel operations with such arrays and how to use multi-version arrays to implement sets as hash tables.", acknowledgement = ack-nhfb, affiliationaddress = "Fairchild AI Lab, Palo Alto, CA, USA", classification = "723", conference = "Fifth Generation Computer Systems 1984, Proceedings of the International Conference.", keywords = "computer programming languages; data processing; Data Structures; hash tables; logic programming languages; multiversion array; multiversion structures; Prolog", meetingaddress = "Tokyo, Jpn", sponsor = "Inst for New Generation Computer Technology, Tokyo, Jpn", } @Misc{Dertmann:1984:SBI, author = "M. Dertmann and G. Saake", title = "{Simulation von Bounded Index Exponential Hashing im Vergleich mit Anderen Dynamischen Speicherverfahren}", howpublished = "Studienarbeit", school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu Braunschweig", address = "Braunschweig, Germany", pages = "??", year = "1984", bibdate = "Mon Oct 26 08:32:57 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Bounded-index-exponential-hashing, Datenorganisation, Dynamisches Hashing, Hashing, Zugriffsverfahren", } @Article{Devine:1984:DFO, author = "K. Devine and F. J. Smith", title = "Direct File Organization for Lemmatized Text Retrieval", journal = j-INF-TECH-RES-DEV-APPL, volume = "3", number = "1", pages = "25--32", month = jan, year = "1984", CODEN = "ITRDDE", ISSN = "0144-817X", bibdate = "Mon Jul 18 22:44:57 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Hashing is used. Equivalent words are lemmata.", review = "ACM CR 8411-0955", } @InProceedings{DeWitt:1984:ITMa, author = "D. J. DeWitt and R. Katz and F. Olken and L. Shapiro and M. Stonebraker and D. Wood", booktitle = "Proc. ACM SIGMOD Conf", title = "Implementation Techniques for Main Memory Database Systems", publisher = pub-ACM, address = pub-ACM:adr, pages = "1", month = jun, year = "1984", bibdate = "Mon Oct 24 17:41:28 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "hybrid hash join build probe phase", } @TechReport{DeWitt:1984:ITMb, author = "D. J. DeWitt and R. H. Katz and F. Olken and L. D. Shapiro and M. R. Stonebraker and D. Wood", key = "DeWitt et al.", title = "Implementation Techniques for Main Memory Database Systems", number = "UCB/ERL 84/5", institution = "Electronics Research Laboratory, University of California", address = "Berkeley, CA, USA", pages = "1--23", month = jan, year = "1984", bibdate = "Tue Jul 26 09:03:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "With the availability of very large, relatively inexpensive main memories, it is becoming possible to keep large databases resident in main memory. In this paper we consider the changes necessary to permit a relational database system to take advantage of large amounts of main memory. We evaluate AVL vs. B+-tree access methods for main memory databases, hash-based query processing strategies vs. sort-merge, and study recovery issues when most or all of the database fits in main memory. As expected, B+-trees are the preferred storage mechanism unless more than 80--90\% of the database fits in main memory. A somewhat surprising result is that hash based query processing strategies are advantageous for large memory situations.", acknowledgement = ack-nhfb, keywords = "Main Memory Databases, Access Methods, Join Algorithms, Access Planning, Recovery Mechanisms", } @TechReport{DeWitt:1984:ITMc, author = "D. J. DeWitt and H. R. Katz and F. Olken", title = "Implementation Techniques For Main Memory Database Systems", institution = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", year = "1984", bibdate = "Tue Jul 26 09:03:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Datenbankmaschine, Datenbanksystem, Hauptspeicherdatenbank, Recovery, Verbundalgorithmus, Zugriffstechnik", remark = "Durch die Verfuegbarkeit von Sehr Grossen Relativ Billigen Hauptspeichern wird es Moeglich, Grosse Datenbanken im Hauptspeicher Resident zu Halten. es Werden die Aenderungen Betrachtet, die Notwendig Sind, Damit ein Relationales Datenbanksystem vom Grossen Hauptspeicher Profitiert. Dazu Werden Avl- und B+-baeume als Hauptspeicherzugriffstechniken Gegenuebergestellt, Algorithmen Basierend auf Hash-verfahren und Solche auf Sort/merge-technik Miteinander Verglichen und Recovery-fragen Betrachtet. Wie Erwartet, Schnitten B+-baeume, Wenn Weniger als 80--90\% der Datenbank in den Hauptspeicher Passten, Besser Ab. Ueberraschendes Ergebnis War, Dass Algorithmen auf Hash-basis Bei Grossem Hauptspeicher Besser Abschnitten.", } @Article{DeWitt:1984:ITMd, author = "David J. DeWitt and Randy H. Katz and Frank Olken and Leonard D. Shapiro and Michael R. Stonebraker and David Wood", title = "Implementation techniques for main memory database systems", journal = j-SIGMOD, volume = "14", number = "2", pages = "1--8", year = "1984", CODEN = "SRECD8", ISBN = "0-89791-128-8", ISBN-13 = "978-0-89791-128-3", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Dec 9 07:58:51 MST 1996", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "With the availability of very large, relatively inexpensive main memories, it is becoming possible to keep large databases resident in main memory. This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory. Authors evaluate AVL vs. B plus -tree access methods for main memory databases, multiple-attribute retrieval; hashing scheme; optimal hash-based query processing strategies vs. sort-merge, and study recovery issues when most or all of the database fits in main memory. As expected, B plus -trees are the preferred storage mechanism unless more than 80-90\% of the database fits in main memory. A somewhat surprising result is that hash based query processing strategies are advantageous for large memory situations.", acknowledgement = ack-nhfb, affiliation = "Univ of Wisconsin, Computer Sciences Dep, WI, USA", affiliationaddress = "Univ of Wisconsin, Computer Sciences Dep, WI, USA", classification = "722; 723", conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special Interest Group on Management of Data).", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", keywords = "ACCESS METHODS; DATABASE SYSTEMS; JOINT ALGORITHMS; MAIN MEMORY DATABASES; Management; RECOVERY MECHANISMS", meetingaddress = "Boston, MA, USA", sponsor = "ACM, Special Interest Group on Management of Data, New York, NY, USA", } @Article{Donaldson:1984:CMV, author = "Val Donaldson and Lois W. Hawkes", title = "Cyclic multiple-valued filing schemes for higher-order queries", journal = j-INFO-SCI, volume = "32", number = "1", pages = "47--74", month = feb, year = "1984", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Mon Jul 18 23:32:34 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Combinatorial filing schemes are a class of file organizations for formatted records which are based on multiattribute hashing.", acknowledgement = ack-nhfb, } @Book{Elder:1984:CDP, author = "John Elder", title = "Construction of Data Processing Software", publisher = pub-PH, address = pub-PH:adr, pages = "xiv + 432", year = "1984", ISBN = "0-13-168675-5", ISBN-13 = "978-0-13-168675-5", LCCN = "QA76.6 .E434 1984", bibdate = "Mon Jul 18 23:23:09 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Presents code in Pascal Plus and COBOL for a wide variety of algorithms, including hashing.", price = "US\$22.95", acknowledgement = ack-nhfb, } @Article{Figini:1984:ACH, author = "E. Figini and C. A. Folda and M. Panti and S. Valenti", title = "An Algorithm for Constructing Hash Tables (in Italian)", journal = j-RIV-INFO-MILANO, volume = "14", number = "2", pages = "185--196", month = apr # "--" # jun, year = "1984", ISSN = "0390-668X", bibdate = "Mon Jul 18 21:07:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Fredman:1984:SSS, author = "M. L. Fredman and J. Koml{\`o}s", title = "On the Size of Separating Systems and Families of Perfect Hash Functions", journal = j-SIAM-J-ALG-DISC-METH, volume = "5", number = "1", pages = "61--68", month = mar, year = "1984", CODEN = "SJAMDU", ISSN = "0196-5212", bibdate = "Mon Jul 18 21:09:08 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Fredman:1984:SST, author = "Michael L. Fredman and J{\'{a}}nos Koml{\'o}s and Endre Szemer{\'e}di", title = "Storing a Sparse Table with ${O(1)}$ Worst Case Access Time", journal = j-J-ACM, volume = "31", number = "3", pages = "538--544", month = jul, year = "1984", 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", note = "Extends the work of Tarjan and Yao \cite{Tarjan:1979:SST}, using a two-level data structure, the first containing pointers to the second, and the second containing blocks accessible by a perfect hashing function.", abstract = "A data structure for representing a set of n items from a universe of m items, which uses space n plus o(n) and accommodates membership queries in constant time, is described. Both the data structure and the query algorithm are easy to implement.", acknowledgement = ack-nhfb, affiliation = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Science, La Jolla, CA, USA", affiliationaddress = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Science, La Jolla, CA, USA", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "access time; computer programming --- Algorithms; data processing; Data Structures; hashing; query algorithms; sparse tables", } @Book{Gonnet:1984:HAD, author = "Gaston H. Gonnet", title = "Handbook of Algorithms and Data Structures", publisher = pub-AW, address = pub-AW:adr, pages = "xi + 286", year = "1984", ISBN = "0-201-14218-X", ISBN-13 = "978-0-201-14218-1", LCCN = "QA76.6 .G636 1984", bibdate = "Thu Jul 14 01:45:28 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$12.95", series = "International Computer Science Series. Editors: A. D. McGettrick and J. van Leeuwen", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Arithmetik, Bubble Sort, Datenstruktur, Hashing, Komplexitaet, Quick Sort, Selektion, Sortieralgorithmus, Sortieren, Suchen, Suchverfahren", remark = "Der Autor Befasst sich MIT den Techniken des Suchens, Sortierens, MIT Hashverfahren und MIT Arithmetischen Ausdruecken. `Handbuch' MIT Kurzbeschreibungen Vieler Wichtiger Algorithmen: Jeweils MIT Knapper Erklaerung, Pascal- Oder C-programm, ergebnissen zur Komplexitaet (theoretisch, Z. T. Auch Messungen), Empfehlungen Zum Einsatz, Referenzen Gliederung: Suchen --- Sortieren --- Selektion --- Arithmetik Anhang: U. A. 683 Referenzen, Ausfuehrlicher Index.", } @Article{Hiraki:1984:EAM, author = "Kei Hiraki and Kenji Nishida and Toshio Shimada", title = "Evaluation of Associative Memory Using Parallel Chained Hashing", journal = j-IEEE-TRANS-COMPUT, volume = "C-33", number = "9", pages = "851--855", month = sep, year = "1984", 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 = "Two parallel hashing algorithms based on open and chained hashing are discussed. The parallel chained hashing algorithms is efficient even in the environment where deletion and insertion frequently occur. The chained hashing memory with fewer memory banks has a performance equivalent to that of the open hashing memory.", acknowledgement = ack-nhfb, classification = "722; 723", journalabr = "IEEE Trans Comput", keywords = "associative memory; computer programming --- Algorithms; data storage units; parallel hashing", } @Book{Horowitz:1984:FDS, author = "Ellis Horowitz and Sartaj Sahni", title = "Fundamentals of Data Structures in Pascal", publisher = pub-CSP, address = pub-CSP:adr, pages = "xiv + 542", year = "1984", ISBN = "0-914894-94-3", ISBN-13 = "978-0-914894-94-0", LCCN = "QA76.9.D35 H67 1984", bibdate = "Mon Jul 18 23:28:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Textbook treatment of hashing algorithms.", price = "US\$29.95", acknowledgement = ack-nhfb, } @TechReport{Karplus:1984:FMP, author = "K. Karplus and G. Haggard", title = "Finding Minimal Perfect Hash Functions", number = "84-637", institution = "Cornell University", pages = "??", month = sep, year = "1984", bibdate = "Thu Jul 21 08:47:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "(email \path=lmc@cs.cornell.edu=).", acknowledgement = ack-nhfb, } @Article{Kirk:1984:CMI, author = "M. Kirk and R. J. Chignell and J. Finnie", title = "Computer Model to Indentify Incompatibilities Between the {FM} Sound Broadcasting and Aeronautical Bands", journal = "IERE Conference Proceedings", volume = "60", year = "1984", CODEN = "IERCB6", ISBN = "0-903748-56-8", ISBN-13 = "978-0-903748-56-8", ISSN = "0538-0006", LCCN = "TK6553.I57 1984", bibdate = "Sun Oct 25 10:31:39 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A computer based method for identifying potential sources of interference and checking for compatibility with the existing and proposed aeronautical frequency allocations, as an aid to frequency in the VHF broadcast band, is presented. The procedures adopted are those identified by the Regional Administrative Conference but in view of the large volume of data that has to be assessed, emphasis is placed upon rapid identification of potential problems. The number of combinations of VHF broadcast stations seen from an aircraft approaching many UK airfields implies that there are many possible interactions that have to be evaluated.", acknowledgement = ack-nhfb, affiliationaddress = "ERA Technology Ltd", classification = "652; 716; 723", conference = "International Conference on Electromagnetic Compatibility.", journalabr = "IERE Conference Proceedings", keywords = "aircraft communication --- Radiation Effects; B1 type interference; computer aided analysis --- Applications; computer programs --- Applications; Frequency Allocation; intermodulation --- Analysis; multiple entry hash table; radio; third order unwanted signals", meetingaddress = "Guildford, Engl", pagecount = "3", sponsor = "IERE, London, Engl", } @InProceedings{Kjellberg:1984:CH, author = "Peter Kjellberg and Torben U. Zahle", key = "Kjellberg \& Zahle", booktitle = "VLDB", title = "Cascade Hashing", publisher = "VLDB Endowment", address = "Saratoga, CA, USA", pages = "481--492", month = aug, year = "1984", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Cascade Hashing is a new dynamic hashing scheme which is based on Spiral Storage. The purpose of this paper is first to give a unified exposition of Linear Hashing, Spiral Storage and other dynamic hashing schemes, and second to describe a new method for storing overflow records. The method stores the overflow records in the main file itself and clusters overflow records from each primary bucket in one or very few overflow buckets. Calculations on the load of the file promises search lengths very close to one even for a storage utilization above 90\%, which makes the method appear better than any present dynamic hashing scheme.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Copenhagen, Copenhagen, Den", classification = "723", conference = "Proceedings --- Very Large Data Bases, Tenth International Conference.", keywords = "cascade hashing; computer programming --- Algorithms; data processing; database systems; dynamic hashing; File Organization; linear hashing; overflow storage; spiral storage", meetingaddress = "Singapore", sponsor = "VLDB Endowment, Saratoga, CA, USA; Inst of Systems Science; Singapore Computer Soc, Singapore; IFIP, Geneva, Switz", } @Article{Knott:1984:DCC, author = "G. D. Knott", title = "Direct Chaining with Coalesced Lists", journal = j-J-ALG, volume = "5", number = "1", pages = "7--21", month = mar, year = "1984", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Sat Jul 16 11:22:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kohonen:1984:ORS, author = "T. Kohonen and H. Riittinen and E. Reuhkala and S. Haltsonen", title = "On-line Recognition of Spoken Words from a Large Vocabulary", journal = j-INFO-SCI, volume = "33", number = "1/2", pages = "3--30", month = jul # "--" # aug, year = "1984", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Mon Jul 18 23:48:13 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Application of hash tables to recognition of spoken words.", acknowledgement = ack-nhfb, } @Article{Krichevsky:1984:OH, author = "R. E. Krichevsky", title = "Optimal Hashing", journal = j-INF-CONTROL, volume = "62", number = "1", pages = "64--92 (or 64--84??)", month = jul, year = "1984", 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 = "A concept of complexity of hashing is introduced and studied with special attention to the lower bounds of complexity. A new class of rather simple hash-functions is developed. These functions are shown to be near optimal within this concept of complexity.", acknowledgement = ack-nhfb, affiliationaddress = "Acad of Sciences of the USSR, Mathematical Inst, Novosibirsk, USSR", classification = "723", journalabr = "Inf Control", keywords = "complexity of hashing; computer metatheory; computer programming; hash functions; optimal hashing", } @Book{Kruse:1984:DSP, author = "Robert L. Kruse", title = "Data Structures and Program Design", publisher = pub-PH, address = pub-PH:adr, pages = "xxi + 486", year = "1984", ISBN = "0-13-196253-1", ISBN-13 = "978-0-13-196253-8", LCCN = "QA76.6 .K77 1984", bibdate = "Wed Apr 15 09:19:35 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "A standard textbook treatment of well-known hashing algorithms appears on pp. 112--128.", price = "US\$28.95", series = "Pren{\-}tice-Hall Software Series, Editor: Brian W. Kernighan", acknowledgement = ack-nhfb, } @Article{Kuespert:1984:EED, author = "Klaus Kuespert", title = "Efficient Error Detection Techniques for Hash Tables in Database Systems", journal = "Digest of Papers --- FTCS (Fault-Tolerant Computing Symposium)", pages = "198--203", year = "1984", CODEN = "DPFTDL", ISBN = "0-8186-0540-5", ISBN-13 = "978-0-8186-0540-6", ISSN = "0731-3071", LCCN = "QA 76.9 F38 I57 1984", bibdate = "Tue May 12 09:46:20 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", acknowledgement = ack-nhfb, classification = "721; 722; 723; 912", conference = "Digest of Papers --- 14th International Conference on Fault-Tolerant Computing, FTCS-14.", journalabr = "Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) 14th.", keywords = "consistency checking; database systems; error detection techniques; hash tables with separate chaining; large data quantities; paged system environment; structural inconsistencies", meetingaddress = "Kissimmee, FL, USA", sponsor = "IEEE Computer Soc, Technical Committee on Fault-Tolerant Computing, Los Alamitos, Calif, USA", } @TechReport{Kuespert:1984:USO, author = "K. Kuespert", title = "{{\"U}berlegungen zur Schnellen Online-fehlerbehandlung in Speicherstrukturen von Datenbanksystemen}", institution = "????", address = "Kaiserslautern, Germany", pages = "??", year = "1984", bibdate = "Mon Oct 26 08:34:24 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "B*-baum, Datenbanksystem, Datenbankverwaltungssystem, Hash-tabelle, Konsistenzpruefung, Physische Integritaet, Separate Chaining, Simulation, Uds-speicherungsstruktur", } @Article{Kulkarni:1984:CHF, author = "Vidyadhar G. Kulkarni", title = "Compact Hash Function for Paths in {Pert} Networks", journal = j-OPER-RES-LETT, volume = "3", number = "3", pages = "137--140", month = aug, year = "1984", CODEN = "ORLED5", ISSN = "0167-6377", 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 presented for identifying all directed paths from the source to the sink (called `paths' in this paper) in a directed acyclic network with one source and one sink. Let L be the set of all the paths in this network and N equals vertical L vertical. A hash function is constructed having the following properties: it is one-to-one and onto, the algorithms to compute H and its inverse are linear in the number of arcs in the network, it has the smallest possible range and produces no collisions. All these properties makes make it a very useful hash function in writing computer programs which involve storing information about all paths in the network. The techniques described in this work can be used to construct has functions for walks in cyclic graphs. An application to simulation of stochastic networks is described and an illustrative example is included.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Oper Res Lett", keywords = "data processing; hash function", } @Article{Larson:1984:AHC, author = "Per-{\AA}ke Larson", title = "Analysis of hashing with chaining in the prime area", journal = j-J-ALG, volume = "5", number = "1", pages = "36--47", month = mar, year = "1984", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Mon Jul 18 19:45:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Larson:1984:FOI, author = "Per-{\AA}ke Larson and Aja Kajla", title = "File Organization: Implementation of a Method Guaranteeing Retrieval in One Access", journal = j-CACM, volume = "27", number = "7", pages = "670--677", month = jul, year = "1984", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Jul 21 09:21:04 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Litwin:1984:DAM, author = "Witold Litwin", title = "Data Access Methods and Structures to Enhance Performance", journal = "InfoTech State-of-the-Art Report, Database Performance", volume = "??", number = "??", pages = "??", year = "1984", bibdate = "Thu Jul 21 09:37:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "B-trees versus dynamic, extended, virtual, trie hashing. Bibliography.", } @TechReport{Machii:1984:HMF, author = "M. Machii and Y. Igarashi", title = "A hashing method of finding the maxima of a set of vectors", number = "CS-84-2", institution = "Department of Computer Science, Gunma University", address = "Gunma, Japan", pages = "??", year = "1984", bibdate = "Thu Jul 21 09:37:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Mehlhorn:1984:SS, author = "Kurt Mehlhorn", title = "Sorting and Searching", publisher = pub-SV, address = pub-SV:adr, pages = "xiv + 336", year = "1984", ISBN = "0-387-13302-X", ISBN-13 = "978-0-387-13302-7", LCCN = "QA76.9 .D35 M43", bibdate = "Mon Oct 24 18:44:57 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Baumstruktur, Hashing, Rekursion", } @Article{Motoyoshi:1984:HAC, author = "Fumio Motoyoshi", title = "Hash Addressing Chip", journal = "Denshi Gijutsu Sogo Kenkyusho Iho/Bulletin of the Electrotechnical Laboratory", volume = "48", number = "8", pages = "736--738", month = "????", year = "1984", CODEN = "DGSKAR", ISSN = "0366-9092", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A hash addressing chip (HAC) has been made in the form of an LSI to achieve high speed hashing as in a computer employed in symbol manipulation, where information is often to be retrieved associatively by a hashing technique. The HAC generates 10 bit addresses from 16 bit key data. The first address appears immediately after the key is given, and subsequent addresses are successively synchronized with a given clock.", acknowledgement = ack-nhfb, classification = "714; 721; 722", journalabr = "Denshi Gijutsu Sogo Kenkyusho Iho", keywords = "data storage, digital; data storage, semiconductor; hash addressing chip", } @InProceedings{Mullen:1984:UDH, author = "J. Mullen", key = "Mullen", title = "Unified Dynamic Hashing", crossref = "Dayal:1984:VLD", pages = "473--480", year = "1984", bibdate = "Mon Jul 18 10:03:14 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Mullin:1984:UDH, author = "James K. Mullin", booktitle = "Proceedings --- Very Large Data Bases, Tenth International Conference.", title = "Unified Dynamic Hashing", publisher = "VLDB Endowment", address = "Saratoga, CA, USA", pages = "473--480", year = "1984", 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 attempts to unify a variety of dynamic hashing methods. Spiral storage, linear hashing and, to a certain extent, linear hashing with partial expansions can be seen as particular cases of a more general technique. The approach is closest to spiral storage in concept. A new instantiation of the general method is offered which permits an adjustment to the dynamic growth rate during expansion. In addition, `optimal' performance results if a sufficiently accurate estimate of the file size is possible.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Ontario, Ont, Can", classification = "723", keywords = "data processing; database systems; File Organization; linear hashing; linear hashing with partial expansions; spiral storage; unified dynamic hashing", meetingaddress = "Singapore", sponsor = "VLDB Endowment, Saratoga, CA, USA; Inst of Systems Science; Singapore Computer Soc, Singapore; IFIP, Geneva, Switz", } @Article{Nievergelt:1984:GFA, author = "J. Nievergelt and H. Hinterberger and K. C. Sevcik", title = "The Grid File: An Adaptable Symmetric Multikey File Structure", journal = j-TODS, volume = "9", number = "1", pages = "38--71", month = mar, year = "1984", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Wed Jul 20 23:06:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "multidimensional hashing", remark = "Grid files use a vector of hash-keys, partition the result into clusters, and store the custers into blocks. Two accesses are used for retrieval. Update may be more costly. Access structures fit in core?", review = "ACM CR 8411-0931", } @InProceedings{Otoo:1984:MFD, author = "Ekow J. Otoo", title = "A Mapping Function for the Directory of a Multidimensional Extendible Hashing", crossref = "Dayal:1984:VLD", publisher = "VLDB Endowment", address = "Saratoga, CA, USA", pages = "493--506", year = "1984", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A generalization of the Extendible Hashing scheme of R. Fagin and others is presented for structuring files of records with d-attribute fields. This generalization reduces to the problem of defining a storage mapping for an extendible array with exponential varying order. We define such a function with element address computation in time O(d), and we show how the result applies to the design of a multidimensional extendible hashing. Algorithms for searching, inserting and processing partial-match queries are presented and we discuss some peculiar characteristics of the scheme derived primarily by simulation studies done with both uniform and nonuniform distributed data.", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "723", conference = "Proceedings --- Very Large Data Bases, Tenth International Conference.", keywords = "computer programming --- Algorithms; computer simulation; data processing; Data Structures; database systems; insertion; mapping function; multidimensional extendible hashing; partial-match queries; query processing; searching; VLDB", meetingaddress = "Singapore", sponsor = "VLDB Endowment, Saratoga, CA, USA; Inst of Systems Science; Singapore Computer Soc, Singapore; IFIP, Geneva, Switz", } @Article{Ramamohanarao:1984:RLH, author = "K. Ramamohanarao and R. Sacks-Davis", title = "Recursive Linear Hashing", journal = j-TODS, volume = "9", number = "3", pages = "369--391", month = sep, year = "1984", 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 = "A modification of linear hashing is proposed for which the conventional use of overflow records is avoided. Furthermore, an implementation of linear hashing is presented for which the amount of physical storage claimed is only fractionally more than the minimum required. This implementation uses a fixed amount of in-core space. Simulation results are given which indicate that even for storage utilizations approaching 95 percent, the average successful search cost for this method is close to one disk access.", acknowledgement = ack-nhfb, classification = "723", journalabr = "ACM Trans Database Syst", keywords = "computer simulation; data processing; dynamic files; linear hashing", } @TechReport{Sager:1984:NMG, author = "Thomas J. Sager", title = "A New Method for Generating Minimal Perfect Hashing Functions", number = "TR CSc-84-15", institution = "University of Missouri--Rolla", address = "Rolla, MO, USA", pages = "??", month = nov, year = "1984", bibdate = "Thu Jul 21 09:37:57 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Slot:1984:TVC, author = "C. Slot and P. van Emde Boas", title = "On Tape versus Core: An Application of Space Efficient Perfect Hash Functions to the Invariance of Space", crossref = "ACM:1984:PSA", pages = "391--400", year = "1984", bibdate = "Mon Jul 18 23:07:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Torn:1984:HOI, author = "Aimo A. Torn", title = "Hashing With Overflow Indexing", journal = j-BIT, volume = "24", number = "3", pages = "317--332", year = "1984", 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; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A hash structure, Overflow Indexing (OVI), using an index for the overflows, is presented. The index contains one entry (key, bucket number) for each overflow. Formulas for computing the expected number of entries in the index and the standard deviation are derived and the numerical results obtained using these formulae are presented in a graph. It is concluded that storing the index in the main memory when operating on the file is feasible for small to medium-sized, and sometimes even large files. The number of probes for both a successful and unsuccessful search is one. Deletion requires two probes and insertion two or three probes. Details of OVI are presented and illustrated by simulation experiments. The structure of the index is discussed and one possible structure, hashing with dynamic buckets, is presented.", acknowledgement = ack-nhfb, affiliationaddress = "Abo Akad, Dep of Information Processing, Abo, Finl", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "data processing --- File Organization; database systems; hash-table representations; indexing methods; overflow indexing", } @Book{Tremblay:1984:IDS, author = "J. P. Tremblay and P. G. Sorenson", title = "An Introduction to Data Structures With Applications", publisher = pub-MH, address = pub-MH:adr, edition = "Second", pages = "xviii + 861", year = "1984", ISBN = "0-07-065157-4", ISBN-13 = "978-0-07-065157-9", LCCN = "QA76.9.D35 T73 1984", bibdate = "Tue Jul 26 09:04:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Hashing is covered in section 6--2.4.", acknowledgement = ack-nhfb, } @InProceedings{Valduriez:1984:MHS, author = "Patrick Valduriez and Yann Viemont", title = "A Multikey Hashing Scheme Using Predicate Trees", crossref = "ACM:1984:SPA", journal = j-SIGMOD, volume = "14", number = "2", pages = "107--114", month = jun, year = "1984", CODEN = "SRECD8", ISBN = "0-89791-128-8", ISBN-13 = "978-0-89791-128-3", ISSN = "0163-5808 (print), 1943-5835 (electronic)", LCCN = "QA76.9.D3 A15 1984", bibdate = "Tue May 12 09:46:48 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address. This method is based on a new structure, called predicate tree, that represents the function applied to several keys. A predicate tree permits to specify in a unified way various hashing schemes by allowing for different definitions of predicates. A logical address qualifies a space partition of a file according to its predicate tree. This address is seen as a single key by a digital hashing method which transforms it into a physical address. This method is used to address records in a file and to transform a retrieval qualification on a file into a set of partitions to access. Finally, a qualitative analysis of the behavior of the method is given which exhibits its value.", acknowledgement = ack-nhfb, affiliation = "Inst Natl de Recherche en Informatique et en Automatique, SABRE Project, Le Chesnay, Fr", affiliationaddress = "Inst Natl de Recherche en Informatique et en Automatique, SABRE Project, Le Chesnay, Fr", classification = "723; 901", conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special Interest Group on Management of Data).", journalabr = "SIGMOD Record (ACM Special Interest Group on Management of Data)", keywords = "Computer Applications; database systems; dynamic files; multikey hashing scheme; predicate trees; signature profiles", meetingaddress = "Boston, MA, USA", sponsor = "ACM, Special Interest Group on Management of Data, New York, NY, USA", } @Book{Ventae:1984:FTR, author = "Olli Ventae", title = "Fast Text Reconstruction Method for the Correction of Imperfect Text", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "446--452", year = "1984", ISBN = "0-8186-0624-X", ISBN-13 = "978-0-8186-0624-3", LCCN = "Q 334 C66 1984", bibdate = "Tue May 12 09:46:54 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The text reconstruction method described here finds in a large character-trigram network near-optimal paths that match well with the erroneous input string of continuous text to be corrected. The paths in the network and the input string are compared by a redundant hash-coding method which makes the search very selective and especially fast, although the trigram network is held in a disk file during processing. The method has been tested both in simulated error-correction experiments and in true online continuous-speech-recognition experiments.", acknowledgement = ack-nhfb, affiliationaddress = "Helsinki Univ of Technology, Espoo, Finl", classification = "723; 751", conference = "First Conference on Artificial Intelligence Applications.", keywords = "codes, symbolic --- Encoding; continuous speech recognition; data processing; hash coding; speech --- Recognition; text correction; text reconstruction; trigram network; Word Processing", meetingaddress = "Denver, CO, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA; American Assoc for Artificial Intelligence, USA", } @Book{Wang:1984:NOT, author = "Patrick Shen-Pei Wang", title = "New Ocr Technique with Learning Capability", publisher = pub-ACM, address = pub-ACM:adr, pages = "182--??", year = "1984", ISBN = "0-89791-127-X", ISBN-13 = "978-0-89791-127-6", LCCN = "????", 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 technique for optical character recognition (OCR) with local learning capability is introduced. This technique incorporates hash-coding, which is the fastest searching algorithm in the literature. It can handle multiple-font input in an on-line, real time and interactive environment. This technique provides a solution to the expensive labor task, text-entry bottleneck problem of office automation. Its advantages, significance and future research topics are also discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Northeastern Univ", classification = "723; 741", conference = "1984 ACM Twelfth Annual Computer Science Conference: The Future of Computing, CSC '84 and SIGCSE Symposium.", keywords = "abstract only; character recognition, optical; complexity of searching algorithms; computer programming; method of hash-coding; systems science and cybernetics --- Learning Systems", meetingaddress = "Philadelphia, PA, USA", sponsor = "ACM, New York, NY, USA", } @Article{Winternitz:1984:SOH, author = "Robert S. Winternitz", title = "Secure One-Way Hash Function Built from {DES}", journal = "Proceedings of the Symposium on Security and Privacy", pages = "88--90", year = "1984", CODEN = "PSSPEO", ISBN = "0-8186-0532-4", ISBN-13 = "978-0-8186-0532-1", LCCN = "QA76.9.A25 S95 1984", bibdate = "Tue May 12 09:47:14 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", acknowledgement = ack-nhfb, classification = "723; 902", conference = "Proceedings of the 1984 Symposium on Security and Privacy.", journalabr = "Proc Symp Secur Privacy", keywords = "authentication of information; data encryption standard (des); data processing; digital message signing for security and efficiency; encryption algorithms; randomly chosen block cipher; secure one-way hash function", meetingaddress = "Oakland, CA, USA", sponsor = "IEEE Computer Soc, Technical Committee on Security \& Privacy, Los Alamitos, Calif, USA; IEEE, New York, NY, USA", } @Article{Wolverton:1984:PHF, author = "David Alan Wolverton", title = "A Perfect Hash Function for {Ada} Reserved Words", journal = j-SIGADA-LETTERS, volume = "4", number = "1", pages = "40--44", month = jul # "\slash " # aug, year = "1984", CODEN = "AALEE5", ISSN = "0736-721X", bibdate = "Thu Sep 28 07:33:23 MDT 2000", bibsource = "ftp://ftp.uu.net/library/bibliography; http://www.adahome.com/Resources/Bibliography/articles.ref; http://www.math.utah.edu/pub/tex/bib/hash.bib", } @InProceedings{Wu:1984:IHD, author = "C. T. Wu", booktitle = "Proceedings of the 1984 Conference on Information Sciences and Systems.", title = "Interpolation Hashing with Descriptors", publisher = "Princeton Univ, Dep of Electrical Engineering \& Computer Science", address = "Princeton, NJ, USA", pages = "653--657", year = "1984", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Interpolation hashing, one of the directory-free dynamic hash files, processes multi-attribute exact-match, partial-match, and range queries with a good run time performance. However, it has a drawback common to all hashing methods. It maintains no directory and uses a chaining method for an overflowed condition where a bucket consists of a chain of a primary page and zero or more overflow pages. In processing a partial-match or a range query, it has to search a certain number of buckets, reading every page of these buckets, though some of the buckets may not contain a record satisfying the query. In order to report `not found' in response to an exact-match query, it must read every page of the bucket that has no record satisfying the query. We show that the use of descriptors will reduce such accesses to buckets containing no record that satisfies the given query.", acknowledgement = ack-nhfb, affiliationaddress = "Northwestern Univ, Evanston, IL, USA", classification = "723", keywords = "chaining methods; computer metatheory; data processing --- File Organization; dynamic hash files; exact-match query; interpolation hashing; range query; run time performance", meetingaddress = "Princeton, NJ, USA", sponsor = "Princeton Univ, Dep of Electrical Engineering \& Computer Science, Princeton, NJ, USA", } @InProceedings{Yang:1984:DPH, author = "W. P. Yang and M. W. Du", title = "A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table", crossref = "Dayal:1984:VLD", publisher = "VLDB Endowment", address = "Saratoga, CA, USA", pages = "245--254", year = "1984", 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 presents a new dynamic file organization scheme based on hashing. The hash functions used here, being defined by extended hash indicator tables (EHITs), are both dynamic and perfect. The allocated storage space can be enlarged and shrunk without reorganizaing the data file. Simulation results show that the storage utilization is approximately equal to 70\% in an experiment where the number of rehash functions $s$ equals 7, the size of a segment $r$ equals 10, and the size of the key set $n$ varies from 1 to 1000. Since the hash functions are perfect, the retrieval operation needs only one disk access.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chiao Tung Univ, Hsinchu, Taiwan", classification = "723", conference = "Proceedings --- Very Large Data Bases, Tenth International Conference.", keywords = "computer operating systems --- Storage Allocation; computer simulation; data processing; dynamic file organization; dynamic perfect hash functions; extended hash indicator tables; File Organization; retrieval operations; storage utilization; VLDB", meetingaddress = "Singapore", sponsor = "VLDB Endowment, Saratoga, CA, USA; Inst of Systems Science; Singapore Computer Soc, Singapore; IFIP, Geneva, Switz", } @Article{Ahrens:1985:SRS, author = "J. H. Ahrens and U. Dieter", title = "Sequential Random Sampling", journal = j-TOMS, volume = "11", number = "2", pages = "157--169", month = jun, year = "1985", CODEN = "ACMSCU", ISSN = "0098-3500 (print), 1557-7295 (electronic)", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Fast algorithms for selecting a random set of exactly k records from a file of n records are constructed. Selection is sequential: the sample records are chosen in the same order in which they occur in the file. All procedures run in O(k) time. The `geometric' method has two versions: with or without O(k) auxiliary memory space. A further procedure uses hashing techniques and requires O(k) space.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Kiel, Kiel, West Ger", classification = "723; 913; 922", journalabr = "ACM Trans Math Software", keywords = "Algorithms; computer programming; hash techniques; probability --- Random Processes; sampling; sequential random sampling", } @InProceedings{Anonymous:1985:PFD, author = "Anonymous", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Proceedings --- Foundations of Data Organization", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", year = "1985", bibdate = "Tue Nov 10 07:51:47 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "The proceedings contains 50 papers. The papers are grouped under the following session headings; databases for advanced applications; basking; consecutive retrieval property; file allocation and distributed databases; mathematical file organization and computational geometry; database theory; database machines; database models; structure and performance of physical database models; symmetric dynamic index maintenance scheme; CAD\slash VLSI databases; and query processing and physical structures for relational databases.", acknowledgement = ack-nhfb, classification = "721; 723; 903; 921; 922", keywords = "computational geometry; data processing --- File Organization; database systems; file allocation; hashing; information retrieval systems; integrated circuits, VLSI; mathematical techniques; metadata; statistical methods", meetingaddress = "Kyoto, Jpn", pagecount = "424", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Article{Anonymous:1985:SS, author = "Anonymous", key = "Anonymous:1985:SS", title = "Software and Services", journal = j-COMPUTERWORLD, volume = "19", number = "38", pages = "50", month = sep # " 23", year = "1985", CODEN = "CMPWAB", ISSN = "0010-4841", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "a new release of Franz Lisp, Opus 42, is out which supports Lisp flavors, functions returning multiple values, multiple name spaces in the Lisp environment, hash table objects, history mechanism. It is available for Apollo, Sun, Cadmus, Masscomp, Tektronix, Harris and Digital equipment Corp. \$5,000 first copy, \$1,000 subsequent copies", acknowledgement = ack-nhfb, keywords = "Franz Common Lisp flavors", } @Article{Arnaurov:1985:ODF, author = "D. D. Arnaurov and N. V. Naidenov and A. G. Tasev", title = "Organization of Data Files for Document Retrieval Systems", journal = j-PROG-COMP-SOFT, volume = "11", number = "3", pages = "??", month = jun, year = "1985", CODEN = "PCSODA", ISSN = "0361-7688 (print), 1608-3261 (electronic)", bibdate = "Thu Jul 21 09:21:27 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Construction of a hierarchy for hash access to documents.", } @Article{Barth:1985:SSS, author = "Wilhelm Barth and Heinrich Nirschl", title = "{Sichere Sinnentsprechende Silbentrennung f{\"u}r die Deutsche Sprache}", journal = "Angewandte Informatik, Applied Informatics", volume = "27", number = "4", pages = "152--159", month = apr, year = "1985", 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 = "This paper describes a simple method for hyphenation in German agreeing with the natural linguistic instinct. The principles are: simple words are hyphenated according to rules about sequences of vowels and consonants; compound words and words with prefixes are split into their components. The algorithm distinguishes main hyphenation points between independent parts of the compound and minor points within these components. Some words may be split in more than one way; every such ambiguity is discovered. By refusing these `unsafe' words, the algorithm becomes resistant against wrong hyphenation. The method uses a table of all roots of words.", acknowledgement = ack-nhfb, affiliationaddress = "Technische Univ Wien, Inst fuer Praktische Informatik, Vienna, Austria", classification = "723; 901", journalabr = "Angew Inf Appl Inf", keywords = "data processing --- Word Processing; German language; hashing; hyphenation algorithm; information science; Language Translation and Linguistics; spelling error", language = "German", } @Book{Berkovich:1985:MSP, author = "Simon Y. Berkovich and Abd El Fatah A. Hegazy", title = "Matching String Patterns in Large Textual Files", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "122--127", year = "1985", ISBN = "0-8186-0639-8", ISBN-13 = "978-0-8186-0639-7", LCCN = "QA75.5 .I6351 1985", bibdate = "Tue May 12 09:47:27 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The authors present a general approach that could be efficient when searching large textual files for near-matching of a set of patterns. The approach is based on a mapping of string segments into key-number values. To apply the terms of query against text strings in a single pass simultaneously, the input set of patterns is arranged in a hash table. The tolerance property of hash collisions and pattern representation by segment extraction can be used to detect different classes of string variations.", acknowledgement = ack-nhfb, affiliationaddress = "George Washington Univ, Washington, DC, USA", classification = "723", conference = "International Symposium on New Directions in Computing.", keywords = "data processing --- File Organization; database searching; database systems; hash tables; large textual files; string pattern matching", meetingaddress = "Trondheim, Norw", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA; Norwegian Inst of Technology, Trondheim, Norw; Kongsberg Vaepenfabrikk, Norw", } @Article{Bradley:1985:UMD, author = "James Bradley", title = "Use of Mean Distance between Overflow Records to Compute Average Search Lengths in Hash files with Open Adressing", journal = j-COMP-J # " (to appear)", volume = "??", number = "??", pages = "??", month = aug, year = "1985", bibdate = "Thu Jul 21 09:21:46 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Celis:1985:RHH, author = "Pedro Celis and Per-{\AA}ke Larson and J. Ian Munro", title = "{Robin Hood} Hashing", crossref = "IEEE:1985:FOC", pages = "281--288", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hash tables in which conflicts are resolved by open addressing are considered. The initial contribution is a very simple insertion procedure which, in comparison to the standard approach, dramatically reduces the variance of the number of probes required for a search. This leads to a new search procedure that requires only a constant number of probes, on average, even for full tables. Finally, an extension to these methods yields a new, simple way of performing deletions and subsequent insertions. Experimental results strongly indicate little degeneration in search time. In particular, deletions and successful searches appear to require constant time (greater than 2.57 probes) and insertions and unsuccessful searches, $O(\log n)$ time.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Ont, Can", classification = "723", keywords = "computer programming --- Algorithms; data processing; Data Structures; hash tables; robin hood hashing; search methods", } @TechReport{Cercone:1985:AAA, author = "N. Cercone", title = "The {Automated Academic Advisor}, {LCCR} Working Paper \#2. An Interactive System for Finding Perfect Hash Functions", type = "Technical report", number = "LCCR TR85-3", institution = "Simon Fraser University", address = "Burnaby, BC, Canada", year = "1985", 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??", } @InProceedings{Cercone:1985:ESL, author = "N. Cercone and M. Krause and J. Boates", booktitle = "1983 International Conference on Data Bases in the Humanities Social Sciences, New Brunswick, NJ", title = "Efficient Search of Large Lexicons Using Perfect Hash Functions", publisher = "Paradigm Press", address = "????", pages = "359--373", year = "1985", bibdate = "Tue Nov 05 09:18:41 2002", bibsource = "http://ai.uwaterloo.ca/~ncercone/publications.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Cercone:1985:ISF, author = "Nick Cercone and John Boates and Max Krause", title = "An Interactive System for Finding Perfect Hash Functions", journal = j-IEEE-SOFTWARE, volume = "2", number = "6", pages = "38--53", month = nov, year = "1985", CODEN = "IESOEG", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; Database/Wiederhold.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; Misc/hash.bib", abstract = "In a previous study (1983), the authors developed and implemented three algorithms for finding perfect hash functions in Pascal and APL and evaluated them for performance results. Here, they describe the perfect hash function search using R. Cichelli's (1980) original algorithm and briefly discuss the minor heuristics devised to improve Cichelli's algorithm; these, it is noted, resulted in two of the three algorithms. A description is also given of the third algorithm, and its performance is compared with that of other algorithms. Experimental results are tabulated to illustrate how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted. The significance attached to the third algorithm derives from its implementation and its practical extension of the data set size.", acknowledgement = ack-nhfb, affiliationaddress = "Simon Fraser Univ, Burnaby, BC, Can", classification = "723", journalabr = "IEEE Software", keywords = "apl hash functions; computer programming --- Algorithms; data processing; execution efficiency; File Organization; minimality criterion; Pascal hash functions; perfect hash functions", } @Article{Chang:1985:DLM, author = "Chin-Chen Chang and Jiann-Cherng Shieh", title = "On the Design of Letter-Oriented Minimal Perfect Hashing Functions", journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers", volume = "8", number = "3", pages = "285--297", month = jul, year = "1985", CODEN = "CKCKDZ", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The progress made in the area of designing minimal perfect hashing functions is reviewed. This paper points out that all minimal perfect hashing functions have one common disadvantage: They are only suitable for small key sets. Moreover, a new hashing scheme is proposed. An algorithm can be used to produce hashing functions for an arbitrary set of letter-oriented keywords. By applying our method, the finding of minimal perfect hashing functions is guaranteed.", acknowledgement = ack-nhfb, affiliation = "Natl Chung Hsing Univ, Graduate Sch of Applied Mathematics, Taichung, Taiwan", affiliationaddress = "Natl Chung Hsing Univ, Graduate Sch of Applied Mathematics, Taichung, Taiwan", classification = "723; 901", journalabr = "Chung kuo Kung Ch'eng Hsueh K'an", keywords = "Chinese remainder theorem; computer programming --- Algorithms; dataflow language val; hashing functions; information retrieval systems; rank method; reciprocal hashing", language = "Chinese", } @Article{Chang:1985:DLO, author = "C.-C. Chang and J.-C. Shieh", title = "On the Design of Letter Oriented Minimal Perfect Hashing Functions (in Chinese)", journal = j-J-CHINESE-INST-ENG, volume = "8", number = "3", pages = "285--297", month = jul, year = "1985", CODEN = "CKCKDZ", ISSN = "0368-7058", bibdate = "Mon Jul 18 23:05:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Chang:1985:FAC, author = "C. C. Chang and J. C. Shieh", title = "Fast Algorithm for Constructing Reciprocal Hashing Functions", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "232--236", year = "1985", ISBN = "0-8186-0639-8", ISBN-13 = "978-0-8186-0639-7", LCCN = "????", 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.", abstract = "G. Jaeschke (1981) presented a method for generating minimal perfect hashing functions for small static key sets. For a finite key set of positive integers, the hashing function value involves three integer constants: C, D, and E. Jaeschke gave two exhaustive algorithms, called algorithm C and algorithm DE, to such C, D, and E. Since the time to compute C is an exponential order and the user must prescribe a limit for the C values to be examined such that the algorithm can be terminated in reasonable time, Jaeschke's method is not practical, especially when the number of keys is large. The authors propose a new algorithm to determine such a C. Furthermore, they show that the number of computations to find C is O(n**2).", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taiwan", classification = "723", conference = "International Symposium on New Directions in Computing.", keywords = "complexity; computer programming --- Algorithms; data processing; Data Structures; minimal perfect hashing functions; reciprocal hashing functions", meetingaddress = "Trondheim, Norw", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA; Norwegian Inst of Technology, Trondheim, Norw; Kongsberg Vaepenfabrikk, Norw", } @Article{Chang:1985:PAK, author = "Chin-Chen Chang and Jenn Liang", title = "Performance Analysis of a $k$-Nearest Neighbor Searching Technique", journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers", volume = "8", number = "2", pages = "157--169", month = apr, year = "1985", CODEN = "CKCKDZ", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "C. W. Shen and R. C. T. Lee suggested the use of multiple key hashing functions in searching the k nearest neighbors of a query record. In this paper, we apply the concept of geometric probability to analyze the performance of the method suggested by Shen and Lee. Besides, we explore the expected number of buckets which should be examined for a k-nearest-neighbor search query. We use the theory of minimal N-tuple proposed by C. C. Chang, R. C. T. Lee and H. C. Du to help us design two attribute file systems based upon multiple key hashing functions which are suitable for the k-nearest-neighbor searching technique.", acknowledgement = ack-nhfb, affiliation = "Natl Chung-Hsing Univ, Graduate Sch of Applied Mathematics, Taichung, Taiwan", affiliationaddress = "Natl Chung-Hsing Univ, Graduate Sch of Applied Mathematics, Taichung, Taiwan", classification = "723; 901; 922", journalabr = "Chung kuo Kung Ch'eng Hsueh K'an", keywords = "bucket size; data processing; Data Reduction and Analysis; information retrieval systems; k-nearest neighbors query; multiple key hashing; probability", language = "Chinese", } @InProceedings{Chang:1985:SLO, author = "C. C. Chang", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Study of a Letter Oriented Minimal Perfect Hashing Scheme", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Japan", pages = "61--65", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "In this paper, a simple method shall be presented to construct minimal perfect hashing functions suitable for letter oriented keys. We applied this minimal perfect hashing method successfully to four non-trivial key sets: (1) the set of twelve months in English, (2) the set of thirty four non-printable ASCII identifiers, (3) the set of thirty one most frequently used English words, (4) the set of thirty six PASCAL reserved words.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723; 903", keywords = "computer programming --- Algorithms; database systems; information retrieval systems; minimal perfect hashing scheme", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Article{Chen:1985:AAS, author = "W.-C. Chen and J. S. Vitter", title = "Addendum to {\em Analysis of Some New Variants of Coalesced Hashing}", journal = j-TODS, volume = "10", number = "1", pages = "127", month = mar, year = "1985", 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{Cormack:1985:PPH, author = "G. V. Cormack and R. N. S. Horspool and M. Kaiserwerth", title = "Practical Perfect Hashing", journal = j-COMP-J, volume = "28", number = "1", pages = "54--58", month = feb, year = "1985", 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 practical method is presented that permits retrieval from a table in constant time. The method is suitable for large tables and consumes, in practice, O(n) space for n table elements. In addition, the table and the hashing function can be constructed in O(n) expected time. Variations of the method that offer different compromises between storage usage and update time are presented.", acknowledgement = ack-nhfb, affiliation = "McGill Univ, Sch of Computer Science, Montreal, Que, Can", affiliationaddress = "McGill Univ, Sch of Computer Science, Montreal, Que, Can", classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", classification = "723", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", journalabr = "Comput J", keywords = "computer programming; data processing --- Data Structures; file organisation; hashing function; information retrieval; perfect hashing; retrieval; storage usage; table elements; update time", treatment = "P Practical", xxauthor = "G. V. Cormack and R. N. S. Horspool and M. Kaiserswerth", } @Article{Crammond:1985:CSU, author = "Jim Crammond", title = "A Comparative Study of Unification algorithms for {OR}-parallel Execution of Logic Languages", journal = j-IEEE-TRANS-COMPUT, volume = "C-34", number = "1", pages = "911--917", month = oct, year = "1985", CODEN = "ITCOB4", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jul 21 10:10:31 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Compares directory trees, hash windows, and variable importation.", acknowledgement = ack-nhfb, } @TechReport{DeWitt:1985:MHBa, author = "D. J. DeWitt and R. Gerber", title = "Multiprocessor Hash-based Join Algorithms", institution = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", year = "1985", bibdate = "Thu Jul 21 09:37:59 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Datenbank, Datenbankmaschine, Hashen, Multiprozessor, Verbund", remark = "Es Werden die Algorithmen Sort-merge, Grace und Hybrid Join Jeweils MIT und Ohne Bit-vector-filtering Betrachtet.", } @InProceedings{DeWitt:1985:MHBb, author = "D. J. DeWitt and R. H. Gerber", title = "Multiprocessor Hash-Based Join Algorithms", crossref = "Pirotte:1985:VLD", pages = "151", year = "1985", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Parallel Query Simple Hybrid Hash Joins GAMMA VLDB", } @InProceedings{Ellis:1985:CLH, author = "C. Ellis", title = "Concurrency and Linear Hashing", crossref = "ACM:1985:PFA", pages = "1", year = "1985", bibdate = "Mon Jul 18 09:48:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ellis:1985:DDS, author = "Carla Schlatter Ellis", title = "Distributed Data Structures: a Case Study", journal = j-IEEE-TRANS-COMPUT, volume = "C-34", number = "12", pages = "1178--1185", month = dec, year = "1985", 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 = "In spite of the amount of work recently devoted to distributed systems, distributed applications are relatively rare. One hypothesis to explain this scarcity of different examples is a lack of experience with algorithm design techniques tailored to an environment in which out-of-date and incomplete information is the rule. Since the design of data structures is an important aspect of traditional algorithm design, the author feels that it is important to consider the problem of distributing data structures. She investigates these issues by developing a distributed version of an extendable hash file, which is a dynamic indexing structure that could be useful in a distributed database.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, NY, USA", classification = "722; 723", journalabr = "IEEE Trans Comput", keywords = "computer systems, digital --- Fault Tolerant Capability; data processing; Data Structures; database systems --- Distributed; distributed algorithms; dynamic indexing structure; extendable hashing; replication", } @Article{Faloutsos:1985:AMT, author = "Christos Faloutsos", title = "Access Methods for Text", journal = j-COMP-SURV, volume = "17", number = "1", pages = "49--74", month = mar, year = "1985", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Tue Sep 06 19:45:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: ``{Multiattribute} Hashing Using Gray Codes'', ACM SIGMOD, 1986.", acknowledgement = ack-nhfb, remark = "Signature files.", review = "ACM CR 8601-0058", } @Article{Faloutsos:1985:MHU, author = "C. Faloutsos", title = "Multiattribute Hashing Using Gray Codes", journal = j-COMP-SURV, volume = "17", number = "1", pages = "??", month = mar, year = "1985", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Tue Sep 06 21:57:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: ACM SIGMOD, 1986.", acknowledgement = ack-nhfb, remark = "Signature files.", review = "ACM CR 8601-0058", } @Article{Flajolet:1985:PCA, author = "Philippe Flajolet and G. N. Martin", title = "Probabilistic Counting Algorithms for Data Base Applications", journal = j-J-COMP-SYS-SCI, volume = "31", number = "2", pages = "182--209", month = sep, year = "1985", CODEN = "JCSSBM", ISSN = "0022-0000", bibdate = "Tue Jul 19 08:44:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Frieder:1985:LSP, author = "Gideon Frieder and Gabor T. Herman and Craig Meyer and Jayaram Udupa", title = "Large Software Problems for Small Computers: an Example from Medical Imaging", journal = j-IEEE-SOFTWARE, volume = "2", number = "5", pages = "37--47", month = sep, year = "1985", CODEN = "IESOEG", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", 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 investigate software techniques that enable one to solve massive problems on scant equipment. The sample problem presented is taken from the area of medical imaging. Here, commercial considerations force the use of certain types of minicomputers, while medical considerations force the production of massive amounts of data. In order to accommodate those data, the program discussed draws from techniques of operating systems (dynamic memory allocation), data structures (dynamically allocated and compacted linked lists, hashing methods, circular buffers, and graph descriptions of three-dimensional structures), algorithm development (traversal of graphs), and data compaction (storage economy, speedup of search processes).", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pennsylvania Hospital, Dep of Radiology, Philadelphia, PA, USA", classification = "461; 723; 741", journalabr = "IEEE Software", keywords = "3-D graph description; circular buffers; computer operating systems --- Storage Allocation; computer programming --- Algorithms; computer software; data processing --- Data Structures; dynamic memory allocation; hashing methods; imaging techniques --- Medical Applications; information theory --- Data Compression; Medical Applications; medical imaging", } @Book{Harris:1985:INL, author = "Mary Dee Harris", title = "Introduction to Natural Language Processing", publisher = pub-RESTON, address = pub-RESTON:adr, pages = "xv + 368", year = "1985", ISBN = "0-8359-3254-0", ISBN-13 = "978-0-8359-3254-7", LCCN = "QA76.9.I58 H37 1985", bibdate = "Mon Jul 18 22:45:38 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Hashing is discussed in Part II.", price = "US\$27.95", acknowledgement = ack-nhfb, } @Article{Hester:1985:SOL, author = "J. H. Hester and D. S. Hirschberg", title = "Self-Organizing Linear Search", journal = j-COMP-SURV, volume = "17", number = "3", pages = "295", month = sep, year = "1985", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Tue Sep 6 21:57:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "hash", } @Article{Huang:1985:MEH, author = "S.-H. S. Huang", title = "Multidimensional extendible hashing for partial-match queries", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "2", pages = "73--82", month = apr, year = "1985", 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)", corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA", keywords = "buckets; data structures; direct access files; extendible hashing; file organisation; multi-attribute keys; multidimensional hashing; one-dimensional hashing; partial-match queries; storage utilization; tree files", treatment = "P Practical", } @InProceedings{Hughes:1985:LMF, author = "John Hughes", title = "Lazy memo-functions", crossref = "Jouannaud:1985:FPL", pages = "129--146", year = "1985", bibdate = "Tue Jul 19 08:43:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Uses hashing in the implementation of memo functions, which keep track of all their past arguments and corresponding results.", acknowledgement = ack-nhfb, } @Article{Jakobsson:1985:SRL, author = "Matti Jakobsson", title = "Sampling without Replacement in Linear Time", journal = j-COMP-J, volume = "28", number = "4", pages = "412--413", month = aug, year = "1985", 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 = "One method for selecting a sample of m different elements from a file of n records is to repeatedly select a random element until we have m different ones. We show that the number of selections is on average smaller than 2 ln (2) m and that the algorithm has a linear running time if we use a hash table for the elements already selected in the sample.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Vaasa, Vaasa, Finl", classification = "723; 913; 922", journalabr = "Comput J", keywords = "Algorithms; computer files; computer programming; hash tables; sampling; sampling without replacement", } @InProceedings{Kawagoe:1985:MDH, author = "Kyoji Kawagoe", key = "Kawagoe", title = "Modified Dynamic Hashing", crossref = "Navathe:1985:PAI", publisher = pub-ACM, address = pub-ACM:adr, pages = "201--213", year = "1985", 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 a modification for the unified dynamic hashing method presented by J. K. Mullin. The main advantage of this modified dynamic hashing method is that it provides a single file access to a record, while the unified dynamic hashing method may require several accesses for records in buckets that overflowed. This method is spatially efficient because it does not use indexes or tables commonly used by other dynamic hashing methods.", acknowledgement = ack-nhfb, affiliationaddress = "NEC, Kawasaki, Jpn", classification = "723; 903", conference = "Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data.", keywords = "computer programming --- Algorithms; data processing; dynamic hashing methods; File Organization; hashing functions; hashing techniques; information retrieval systems", meetingaddress = "Austin, TX, USA", sponsor = "ACM, New York, NY, USA", } @TechReport{Kiessling:1985:DFU, author = "W. Kiessling", title = "Dynamic Filters: {A} Uniform Concept for Query Optimization in Set-Oriented Database Architectures", institution = "Technical University ofMunchen", pages = "??", year = "1985", bibdate = "Thu Jul 21 08:48:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Hash and Index filters to restrict relations in software and hardware (CAFS) Bloom (Severance 1976) are analyzed.", } @InProceedings{Kojima:1985:HFO, author = "Isao Kojima and Yahiko Kambayashi", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Hash-Based File Organization Utilizing Large Capacity Main Memory", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", pages = "41--50", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "In this paper we first summarize characteristics of main memory compared with disks and problems to be solved in order to develop file organization suitable for main memory. B-trees and dynamic hashing schemes are well-known file organizations for database applications. Problems of direct implementations of these files under this environment are shown. A new file organization called structured variable length hashing scheme is introduced. In this method space utilization factor is improved and access cost is reduced by using compact directory structure. Performance evaluations compared with conventional file organizations are presented. This comparison also shows that B-tree (and AVL tree) is preferable to B plus tree in main memory environment.", acknowledgement = ack-nhfb, affiliationaddress = "Kyushu Univ, Jpn", classification = "723; 903", keywords = "b-trees; data processing; File Organization; hashing schemes; information retrieval systems; memory technology", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Book{Lange:1985:DS, author = "O. Lange and G. Stegemann", title = "Datenstrukturen und Speichertechniken", publisher = pub-VIEWEG, address = pub-VIEWEG:adr, pages = "??", year = "1985", ISBN = "3-528-04314-8", ISBN-13 = "978-3-528-04314-8", bibdate = "Thu Jul 21 08:48:29 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Baum, Datei, Datenstruktur, Datentyp, Graph, Hashing, Liste, Speicherorganisation, Speicherverwaltung", } @InProceedings{Larson:1985:EPH, author = "Per-{\AA}ke Larson and M. V. Ramakrishna", key = "Larson \& Ramakrishna", title = "External Perfect Hashing", crossref = "Navathe:1985:PAI", publisher = pub-ACM, address = pub-ACM:adr, pages = "190--200", year = "1985", 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 function is perfect if it does not create any overflow records. The use of perfect hashing functions has previously been studied only for small static sets stored in main memory. In this paper we describe a perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in a single disk access. This is achieved at the cost of a small in-core table and increased cost of insertions. We also suggest a policy for limiting the cost of insertions and we study the tradeoff between expected storage utilization, size of the internal table and cost of insertions under this policy. The results obtained so far are very promising. They indicate that it may indeed be possible to design practical perfect hashing schemes for external files based on the suggested approach.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "723; 903", conference = "Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data.", keywords = "computer programming --- Algorithms; data processing; File Organization; hashing functions; hashing techniques; information retrieval systems", meetingaddress = "Austin, TX, USA", sponsor = "ACM, New York, NY, USA", } @Book{Larson:1985:HFS, author = "Per-{\AA}ke Larson", title = "Hash Files: Some Recent Developments", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "671--679", year = "1985", ISBN = "0-8186-0654-1", ISBN-13 = "978-0-8186-0654-0", LCCN = "QA76.5 .I5481 1985", bibdate = "Tue May 12 09:47:42 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "Hashing is a very efficient technique for organizing large external files when very fast retrieval is required. During the past few years several new file structures based on hashing have been developed, in essence rendering traditional hash files obsolete. They are of two types, commonly known as dynamic hashing schemes and one-probe hashing schemes. Those of the first type can handle, without degradation of performance and without periodic reorganization, files that grow and shrink dynamically. Those of the second type guarantee that any record in the file can be retrieved in exactly one disk access. A review is presented of the most efficient methods, known so far, of each type.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Ont, Can", classification = "723; 903", conference = "Proceedings --- SCS 85: First International Conference on Supercomputing Systems.", keywords = "data processing; dynamic hashing; File Organization; hash files; information science --- Information Retrieval; one-probe hashing", meetingaddress = "St. Petersburg, FL, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Larson:1985:LHO, author = "Per-{\AA}ke Larson", title = "Linear Hashing with Overflow-Handling by Linear Probing", journal = j-TODS, volume = "10", number = "1", pages = "75--89", month = mar, year = "1985", 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 is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in connection with linear hashing is proposed. The method is based on linear probing and does not rely on chaining. No dedicated overflow area is required. The expansion sequence of linear hashing is modified to improve the performance, which requires changes in the address computation. A new address computation algorithm and an expansion algorithm are given. The performance of the method is studied by simulation. The algorithms for the basic file operations are very simple, and the overall performance is competitive with that of other variants of linear hashing.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", classification = "723", journalabr = "ACM Trans Database Syst", keywords = "computer programming --- Algorithms; data processing; database systems; dynamic hashing; File Organization; linear hashing; open addressing", remark = "New algorithm for files that grow and shrink dynamically; the overflow records of a full page are directed to the next page of a group; the introduction of five groups and the backwards split order makes this algorithm better than previous ones.", review = "ACM CR 8512-1134", } @Article{Larson:1985:PAS, author = "Per-Ake Larson", title = "Performance Analysis of a Single-File Version of Linear Hashing", journal = j-COMP-J, volume = "28", number = "3", pages = "319--329", month = jul, year = "1985", 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 performance analysis of a new variant of linear hashing with partial expansions is presented. In the new variant the overflow area is combined with the prime storage area in the same file. The performance measures considered are: expected length of successful and unsuccessful searches and cost of insertions. The new method uses several overflow chains per page. Increasing the number of chains significantly improves the retrieval performance.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", classification = "723", journalabr = "Comput J", keywords = "data processing; File Organization; linear hashing with partial expansions; overflows", } @InProceedings{Litwin:1985:THF, author = "Witold Litwin", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Trie Hashing: Further Properties and Performance", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", pages = "51--60", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Koyto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "Trie hashing is one of the fastest access methods to dynamic and ordered files. We show some properties of the method that appeared recently. In particular, we discuss performance shown by simulations. The results confirm most of the earlier expectations. They also show that for sorted insertions, the method performs almost as well as for the random ones. Furthermore, some subtle aspects of the algorithm behavior appear. In particular, some refinements that looked promising reveal finally not that worthy.", acknowledgement = ack-nhfb, affiliationaddress = "INRIA, Le Chesnay, Fr", classification = "723; 903", keywords = "computer programming --- Algorithms; computer simulation; data processing; File Organization; information retrieval systems; trie hashing", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE, Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Article{Lodi:1985:SSH, author = "E. Lodi and F. Luccio", title = "Split Sequence Hash Search", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "131--136", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In all hash methods, the search for a key K starts with the comparison between K and the key L stored in the table position corresponding to the hash address of K. If K does not equal L, the search proceeds through a sequence of cells. It is proposed here to split this sequence in two parts, to be traced for K greater than L, or K less than L. The advantage of sequence splitting is studied for the hash techniques of chaining, and open addressing. The average numbers of probes for successful and unsuccessful searches are strongly reduced over standard methods, in particular for chaining and linear probing, at the cost of a very modest algorithm complication.", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Dipartimento di Informatica, Pisa, Italy", classification = "723", journalabr = "Inf Process Lett", keywords = "computer programming; data processing --- Data Structures; hashing; searching; split sequence hash search", } @Article{Lyon:1985:AHT, author = "Gordon Lyon", title = "Achieving Hash Table Searches in One or Two Bucket Probes", journal = j-COMP-J, volume = "28", number = "3", pages = "313--318", month = jul, year = "1985", 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 = "Alternation-tree hashing is a new, effective and inexpensive method of improving lookups from open-addressing hash tables. No extra information assists searching, although to ensure table serviceability, buckets must hold at least two items. All lookups, successful or failed, involve at most two buckets.", acknowledgement = ack-nhfb, affiliationaddress = "NBS, Inst for Computer Sciences \& Technology, Gaithersburg, MD, USA", classification = "723", journalabr = "Comput J", keywords = "alternation-tree hashing; bucket probes; computer programming --- Algorithms; data processing; File Organization; hash table searches", } @InProceedings{Miller:1985:PHF, author = "L. L. Miller", title = "Performance of Hash Files in a Microcomputer Based Parallel File System", crossref = "ACM:1985:RCM", pages = "29--34", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The design of a microcomputer-based file system designed to bring a degree of parallelism to the data space of the general computer user is examined. An overview of the design of the file system is given, and the use of hashing in this parallel environment is investigated.", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", classification = "723", journalabr = "Proceedings of the Annual Conference of the Association for Computing Machinery 1985.", keywords = "computer systems, digital --- Parallel Processing; computers, microcomputer; data processing; File Organization; hash files; parallel file system; secondary storage", } @Article{Mullin:1985:SSE, author = "James K. Mullin", title = "Spiral Storage: Efficient Dynamic Hashing with Constant Performance", journal = j-COMP-J, volume = "28", number = "3", pages = "330--334", month = jul, year = "1985", 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 author describes and analyzes a dynamic hashing method called `Spiral Storage'. Dynamic hashing methods extend the power of conventional hashing methods by avoiding the need to have good initial estimates of the storage demand. The file storage space will grow or shrink with demand. `Spiral storage' is the only known dynamic hashing method which provides constant average performance while the storage space changes in proportion to the storage demand. The performance of the method with link chained overflow is investigated. Results of analysis and of simulations confirm the utility of the method.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Ontario, London, Ont, Can", classification = "723", journalabr = "Comput J", keywords = "data processing; dynamic hashing; File Organization; logical address mapping; physical address mapping; spiral storage", } @Article{Norton:1985:PMO, author = "R. M. Norton and D. P. Yeager", title = "A Probability Model for Overflow Sufficiency in Small Hash Tables", journal = j-CACM, volume = "28", number = "10", pages = "1068--1075", month = oct, year = "1985", 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 = "For hash tables in which a strict physical separation exists between primary storage and storage for overflow records, with bucket capacity at least three, a complete probability model is described. A measure of hash table efficiency is introduced, called the table sufficiency index (TSI), and defined as the probability that the overflow space is sufficient assuming that the set of hashed keys has a uniform distribution. The constructed probability model may be used to compute the TSI for hash tables with parameters chosen from a restricted domain. The TSI is advocated as a tool for making decisions about the parameters of small hash tables.", acknowledgement = ack-nhfb, affiliationaddress = "Coll of Charleston, Dep of Mathematics, Charleston, SC, USA", classification = "723; 922", journalabr = "Commun ACM", keywords = "data processing; Data Structures; overflow sufficiency; probability; probability model; small hash tables", } @InProceedings{Otoo:1985:MDH, author = "Ekow J. Otoo", key = "Otoo", title = "A Multidimensional Digital Hashing Scheme for Files With Composite Keys", crossref = "Navathe:1985:PAI", publisher = pub-ACM, address = pub-ACM:adr, pages = "214--229", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A dynamic hashing method is presented for structuring files with multiple attribute keys. The method is essentially the multidimensional analogue of linear hashing developed by Litwin and Larson. Given a record of d attribute keys, the scheme called multidimensional digital hashing, applies the linear hashing technique independently to each of the attributes to derive d integer values. These values form a d-tuple coordinate address of the home page of the record. A function, equivalent to the element allocation function of a d-dimensional extendible array of linear varying order and computable in time O(d), is used to map the d-tuple page address into a linear address space. Algorithms for insertions, deletions and the processing of partial-match and range queries are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "723; 903", conference = "Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data.", keywords = "computer programming --- Algorithms; data processing; dynamic hashing methods; File Organization; hashing functions; hashing techniques; information retrieval systems", meetingaddress = "Austin, TX, USA", sponsor = "ACM, New York, NY, USA", } @InProceedings{Otoo:1985:SDI, author = "Ekow J. Otoo", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Symmetric Dynamic Index Maintenance Scheme", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", pages = "283--296", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "We present a method for maintaining multidimensional indexes for large dynamic multiple attribute files. The index which is organized essentially as a multidimensional linear hashing, maintains pointers to the data pages holding the records. The method requires the specification of the ratio of the index size to the number of pages instead of an explicit load control. Storage utilization of the data pages is guaranteed to be at least 50\% for any distribution of keys in the key space. The scheme further has the property that an exact-match search is achieved in O(1) page accesses when the key values are not highly correlated.", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "721; 723; 921", keywords = "automata theory --- Theorem Proving; data processing --- File Organization; database systems; dynamic index maintenance scheme; information science --- Indexing; multidimensional linear hashing; Query Languages", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Article{Pagli:1985:SAH, author = "Linda Pagli", title = "Self-Adjusting Hash Tables", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "23--25", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The idea of self organizing data is applied to hash tables. Two different heuristics are proposed here, both based on the idea of moving the keys more frequently requested as close as possible to their own hash address.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Dep of Computer Science, Pisa, Italy", classification = "723", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; computer programming --- Algorithms; data processing; Data Structures; search algorithms; self-adjusting hash tables", } @Article{Piwowarski:1985:CBS, author = "Marek Piwowarski", title = "Comments on Batched Searching of Sequential and Tree-Structured Files", journal = j-TODS, volume = "10", number = "2", pages = "285--287", month = jun, year = "1985", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See \cite{Shneiderman:1976:BSS,Batory:1982:UMP}.", URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p285-piwowarski/p285-piwowarski.pdf; http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p285-piwowarski/; http://www.acm.org/pubs/toc/Abstracts/tods/214294.html", abstract = "Exact formulas for the expected cost savings from batching requests against two types of j-ary trees are given. Approximate expressions are also presented.", acknowledgement = ack-nhfb, generalterms = "Performance", keywords = "performance", subject = "{\bf H.3.2}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Misc{Pramanik:1985:DH, author = "S. Pramanik and F. Fotouhi", title = "Distributed Hashing", pages = "??", month = mar, year = "1985", bibdate = "Thu Jul 21 09:38:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "First you do something very poorly (creating long access chains) and then you fix it with parallelism.", } @Book{Purdom:1985:AA, author = "Paul Walton {Purdom, Jr.} and Cynthia A. Brown", title = "The Analysis of Algorithms", publisher = pub-HRW, address = pub-HRW:adr, pages = "xv + 540", year = "1985", ISBN = "0-03-072044-3", ISBN-13 = "978-0-03-072044-4", LCCN = "QA76.6 .P86 1985", bibdate = "Mon Jul 18 23:41:15 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Chapter 4 discusses random hashing.", price = "US\$33.95", acknowledgement = ack-nhfb, } @Article{Ramamohanarao:1985:PMR, author = "K. Ramamohanarao and R. Sacks-Davis", title = "Partial Match Retrieval Using Recursive Linear Hashing", journal = j-BIT, volume = "25", number = "3", pages = "477--484", year = "1985", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10", MRnumber = "797 097", bibdate = "Thu Nov 12 18:12:56 MST 1998", bibsource = "Compendex database; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Recursive linear hashing is a hashing technique proposed for files which can grow and shrink dynamically. The scheme is an extension of linear hashing, a method originally proposed by W. Litwin, but unlike Litwin's scheme, it does not require conventional overflow pages. In this paper, we investigate the application of recursive linear hashing to partial match retrieval problems. Consistent with the results for primary key retrieval, recursive linear hashing performs better than the conventional scheme on these problems, especially at high load factors.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Melbourne, Dep of Computer Science, Parkville, Aust", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "computer programming; data processing; File Organization; partial match retrieval; recursive linear hashing", } @Article{Regnier:1985:AGF, author = "Mireille Regnier", title = "Analysis of Grid File Algorithms", journal = j-BIT, volume = "25", number = "2", pages = "335--357", year = "1985", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10", MRnumber = "86m:68019", bibdate = "Fri Nov 13 11:52:16 1998", bibsource = "Compendex database; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Grid File is a generic name for geometric algorithms used to map multiple-key indices onto primary files or databases. Two existing methods by other authors \cite{Fagin:1979:EHF,Larson:1978:DH} are generalized to the multidimensional environment. The presence of a hashing function is the primary difference between the two algorithms; it is recommended to provide uniformity when presented with biased key distributions.", acknowledgement = ack-nhfb, affiliationaddress = "Inst Natl de Recherche en Informatique et en Automatique, Chesnay, Fr", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "computer programming --- Algorithms; data processing; database systems; dynamic data structures; File Organization; grid file algorithms; hashing; multi-key access", } @Article{Sacks-Davis:1985:PMK, author = "Ron Sacks-Davis", title = "Performance of a Multi-key Access Method Based on Descriptors and Superimposed Coding Techniques", journal = j-INFO-SYS, volume = "10", number = "4", pages = "391--403", year = "1985", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Tue Jul 19 08:55:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Hashing algorithm used to create descriptors for file indexing; this extends the author's earlier work \cite{Sacks-Davis:1983:TLS}.", acknowledgement = ack-nhfb, } @Article{Sager:1985:PTG, author = "Thomas J. Sager", title = "A Polynomial Time Generator for Minimal Perfect Hash Functions", journal = j-CACM, volume = "28", number = "5", pages = "523--532", month = may, year = "1985", 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 perfect hash function (PHF) is an injection F from a set W of M objects into the set consisting of the first N nonnegative integers where N greater than equivalent to M. If N equals M, then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language. The mincycle algorithm for finding PHFs executes with an expected time complexity that is polynomial in M and has been used successfully on sets of cardinality up to 512.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Missouri-Rolla, Dep of Computer Science, Rolla, MO, USA", classification = "723", journalabr = "Commun ACM", keywords = "Algorithms; computer programming; mincycle algorithm; minimal perfect hash functions", remark = "Expected cost n**b if n=m. Tested up to n=256. Includes algorithms and measurements. Extends work of Cichelli \cite{Cichelli:1980:CMP}.", } @Article{Sager:1985:TCS, author = "Thomas J. Sager", title = "A technique for creating small fast compiler frontends", journal = j-SIGPLAN, volume = "20", number = "10", pages = "87--94", month = oct, year = "1985", 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); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Missouri Univ., Rolla, MO, USA", keywords = "file organisation; minimal perfect hash functions; parser; PASCAL language; PASCAL language functions; program compilers; small fast compiler frontends; table driven frontends", pubcountry = "USA A10", treatment = "P Practical", } @Article{Sebesta:1985:MPH, author = "Robert W. Sebesta and Mark A. Taylor", title = "Minimal perfect hash functions for reserved word lists", journal = j-SIGPLAN, volume = "20", number = "12", pages = "47--53", month = dec, year = "1985", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:53 MST 2003", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA", keywords = "algorithms; compliers; file organisation; languages; lexical analysis; lexical directed editors; minimal perfect hash function; pretty-printers; programming languages; relatively short static lists; reserved word lists; syntax-directed editors", pubcountry = "USA A07 A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Ada \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-2", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Sturc:1985:MHU, author = "Jan Sturc", title = "Multidimensional Hashing Used for Conjunctive Queries Evaluation", journal = j-COMP-ART-INTELL, volume = "4", number = "2", pages = "143--151", year = "1985", CODEN = "CARIDY", ISSN = "0232-0274", 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 deals with the efficient access path implementation for a database of the relational type. We restrict the class of relational queries to conjunctive ones only. We start with a slight generalization of the class of partial match queries, then we present an iterative decomposition algorithm for reduction of an arbitrary conjunctive query to a sequence of generalized partial match queries. For an efficient evaluation of partial match queries we use multidimensional hashed files. We give a method to extend ideas of dynamization of the hashing schemes to multidimensional ones too. Finally, an analysis of the computational complexity of hashed files for the expected case is given.", acknowledgement = ack-nhfb, affiliation = "Inst of Socio-Economic Information \& Automation in Management, Bratislava, Czech", affiliationaddress = "Inst of Socio-Economic Information \& Automation in Management, Bratislava, Czech", classification = "723; 901", journalabr = "Comput Artif Intell", keywords = "conjunctive queries evaluation; data base systems; efficient access path implementation; Evaluation; information retrieval systems; multidimensional hashed files; partial match queries; relational databases", } @Article{Szymanski:1985:HTR, author = "T. G. Szymanski", title = "Hash Table Reorganization", journal = j-J-ALG, volume = "6", number = "3", pages = "322--325", month = sep, year = "1985", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Mon Jul 18 23:04:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tamminen:1985:SAC, author = "Markku Tamminen", title = "On Search by Address Computation", journal = j-BIT, volume = "25", number = "1", pages = "135--147", year = "1985", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10 (68P20)", MRnumber = "86i:68019", bibdate = "Thu Nov 12 18:12:56 MST 1998", bibsource = "Compendex database; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses hashing applications to file searching.", abstract = "The author studies the effect of data distribution on address computation data structures for searching, as typified by the priority queue problem. He compares several techniques showing that, in contrast to sorting, neither one nor multilevel bucket methods are uniformly efficient for this task. However, an enhancement of order preserving extendible hashing is shown to behave asymptotically independently of the amount of data and its distribution. Also conclusions regarding multiattribute file structures are presented.", acknowledgement = ack-nhfb, affiliation = "Helsinki Univ of Technology, Lab of Information Processing Science, Espoo, Finl", affiliationaddress = "Helsinki Univ of Technology, Lab of Information Processing Science, Espoo, Finl", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "address computation; computer systems programming; data processing --- Data Structures; hashing; multiattribute file structures; search structures", } @Book{Thakkar:1985:VAT, author = "Shreekant S. Thakkar and Alan E. Knowles", title = "Virtual Address Translation Using Parallel Hashing Hardware", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "697--705", year = "1985", ISBN = "0-8186-0654-1", ISBN-13 = "978-0-8186-0654-0", LCCN = "????", 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.", abstract = "In modern multiuser computers using paged virtual memory, much real memory can be consumed by the necessary page tables. A new address translation scheme which uses parallel hashing hardware to implement the Page Address Registers (PARs) is presented. This scheme provides full coverage of the real store using PARs, and eliminates the need for an address-translation cache and virtual-address-based page tables. Address translation is performed at cache speed for all the PARs. The new scheme can support very large address spaces which are becoming a real possibility with the rapid increase in density of random-access memories.", acknowledgement = ack-nhfb, affiliationaddress = "Oregon State Univ, Oregon Graduate Cent, Beaverton, OR, USA", classification = "722; 723", conference = "Proceedings --- SCS 85: First International Conference on Supercomputing Systems.", keywords = "computer architecture; computer systems, digital; memory management; page address registers; parallel hashing hardware; Parallel Processing; virtual address translation", meetingaddress = "St. Petersburg, FL, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{TilChin:1985:EDS, author = "O. T. Til'chin and O. L. Shor", title = "Efficient Data Storage and Retrieval Organization Using the Frequency Properties of the Query Stream", journal = j-PROG-COMP-SOFT, volume = "11", number = "6", pages = "364--368", month = nov # "--" # dec, year = "1985", CODEN = "PCSODA", ISSN = "0361-7688 (print), 1608-3261 (electronic)", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An efficient strategy is proposed for allocation and retrieval of data, combining the index method with single address calculation access based on the probabilistic properties of the query stream.", acknowledgement = ack-nhfb, classification = "723; 903; 922", journalabr = "Program Comput Software", keywords = "data storage, digital; database systems --- Relational; hashing; index method; information retrieval systems; probability; query stream; single address calculation", remark = "To save space use indexes for records otherwise to be hashed.", } @MastersThesis{Vakhshoori:1985:UHD, author = "Koorosh Vakhshoori", title = "The use of hashing in a database machine", school = "University of California, Davis", address = "Davis, CA, USA", pages = "183", year = "1985", bibdate = "Sat Jul 16 01:11:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Veklerov:1985:ADH, author = "Eugene Veklerov", key = "Veklerov", title = "Analysis of Dynamic Hashing with Deferred Splitting", journal = j-TODS, volume = "10", number = "1", pages = "90--96", month = mar, year = "1985", 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 = "Dynamic hashing with deferred splitting is a file organization scheme which increases storage utilization, as compared to `standard' dynamic hashing. In this scheme, splitting of a bucket is deferred if the bucket is full but its brother can accommodate new records. The performance of the scheme is analyzed. In a typical case the expected storage utilization increases from 69 to 76 percent.", acknowledgement = ack-nhfb, affiliationaddress = "Lawrence Berkeley Lab, Real Time Systems Group, Berkeley, CA, USA", classification = "723", journalabr = "ACM Trans Database Syst", keywords = "data processing; database systems; deferred splitting; dynamic hashing; File Organization; storage utilization", } @Article{Vitter:1985:EIO, author = "Jeffrey Scott Vitter", title = "An Efficient {I/O} Interface for Optical Disks", journal = j-TODS, volume = "10", number = "2", pages = "129--162", month = jun, year = "1985", 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/1985-10-2/p129-vitter/p129-vitter.pdf; http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p129-vitter/; http://www.acm.org/pubs/toc/Abstracts/tods/3862.html", abstract = "We introduce the notion of an I/O interface for optical digital (write-once) disks, which is quite different from earlier research. The purpose of an I/O interface is to allow existing operating systems and application programs that use magnetic disks to use optical disks instead, with minimal change. We define what it means for an I/O interface to be disk-efficient. We demonstrate a practical disk- efficient I/O interface and show that its I/O performance in many cases is optimum, up to a constant factor, among all disk-efficient interfaces. The interface is most effective for applications that are not update-intensive. An additional capability is a built-in history mechanism that provides software support for accessing previous versions of records. Even if not implemented, the I/O interface can be used as a programming tool to develop efficient special purpose applications for use with optical disks.", acknowledgement = ack-nhfb, affiliation = "Brown Univ, Dep of Computer Science, Providence, RI, USA", affiliationaddress = "Brown Univ, Dep of Computer Science, Providence, RI, USA", annote = "An I/O interface supports basic update operations such as insert write and delete on the block is proposed. Index techniques for erasable media (Btree is assumed in this paper) can be implemented on this interface. Versions of a block is stored as an allocation tree on an optical disk, which is an efficient implementation of the pointer fill-in method. Contents of a version of a block is represented by an offset tree. Theoretical lower bound of these operations is evaluated. This paper assumes that appending into existing block is possible on optical disk.", classification = "722; 741", fjournal = "ACM Transactions on Database Systems", generalterms = "Algorithms; Design; Performance; Theory", keywords = "computer interfaces; data storage, optical; design; I/O interface; optical disks, algorithms; performance; theory", subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Secondary storage. {\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems Management, Access methods. {\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems Management, File organization. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Linked representations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @Article{Vitter:1985:OAM, author = "Jeffrey Scott Vitter and Wen-Chin Chen", title = "Optimum Algorithms for a Model of Direct Chaining", journal = j-SIAM-J-COMPUT, volume = "14", number = "2", pages = "490--499", month = may, year = "1985", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (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 study optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after they are inserted, that for each chain the relative ordering of the records in the chain does not change after more insertions, and that only one link field is used per table slot. The varied-insertion coalesced hashing method (VICH) is conjectured to be optimum among all direct chaining algorithms in this class. The authors give strong evidence in favor of the conjecture by showing that VICH is optimum under fairly general conditions.", acknowledgement = ack-nhfb, affiliationaddress = "Brown Univ, Dep of Computer Science, Providence, RI , USA", classification = "723", journalabr = "SIAM J Comput", keywords = "coalesced hashing; computer programming --- Algorithms; data processing; Data Structures; direct chaining; optimum algorithms", } @Article{Willard:1985:NDS, author = "Dan E. Willard", title = "New data structures for orthogonal range queries", journal = j-SIAM-J-COMPUT, volume = "14", number = "1", pages = "232--253", month = feb, year = "1985", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", bibdate = "Tue Jul 19 08:49:33 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "This paper, together with an earlier report \cite{Willard:1978:NDS}, present seven data structures for orthogonal range queries which are more efficient than earlier data structures used for this purpose, such as box array hashing.", acknowledgement = ack-nhfb, } @Book{Williamson:1985:CCS, author = "Stanley Gill Williamson", title = "Combinatorics for Computer Science", publisher = pub-CSP, address = pub-CSP:adr, pages = "xliii + 479", year = "1985", ISBN = "0-88175-020-4", ISBN-13 = "978-0-88175-020-1", LCCN = "QA164 .W55 1985", bibdate = "Mon Jul 18 22:47:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$39.95", acknowledgement = ack-nhfb, } @InProceedings{Wu:1985:DOM, author = "C. Thomas Wu", booktitle = "Proceedings --- Foundations of Data Organization.", title = "Data Organization Method for the Parallel Execution of Relational Operations", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", pages = "399--405", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "We propose the use of indexing technique called M-cycle hash file as a data organization method for storing relations in the database machine. The advantage of using the M-cycle hash file is the effective parallel execution of selection, projection, and join operations without requiring any specialized hardware. With no specialized hardware, our database machine has a much simpler design than other database machines. Moreover, the use of M-cycle hash file reduces the complexity of software, because there is no directory for maintaining the indices. In this paper, we review the M-cycle hash file, present the architecture of our database machine, and describe the high level algorithms for the parallel execution of relational operations.", acknowledgement = ack-nhfb, affiliationaddress = "Northwestern Univ, Evanston, IL, USA", classification = "723; 903", keywords = "computer programming --- Algorithms; computer systems, digital --- Parallel Processing; database machines; database systems; information science --- Indexing; m-cycle hash file; Relational", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @InProceedings{Yamane:1985:HJT, author = "Yasuo Yamane", title = "A Hash Join Technique for Relational Database Systems", crossref = "IEEE:1985:PFD", publisher = "Organizing Committee of the Int Conference on Foundations of Data Organization", address = "Jpn", pages = "388--398", year = "1985", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Kyoto Sangyo Univ. Computer Science Inst, Kyoto, Jpn.", abstract = "In this paper, we will formulate and discuss an efficient method of equijoin in relational database systems. In this method, if either of two relations can be loaded into internal memory, the equijoin can be processed quickly using a hashing technique. Otherwise, the relations are recursively partitioned into subrelations to be loaded. Hashing functions are used within the partition, too. We also analyze the method in terms of CPU time and I/O accesses and evaluate the results of our experiments. We will concentrate on how we should partition relations in this method.", acknowledgement = ack-nhfb, affiliationaddress = "Fujitsu Lab Ltd, Kawasaki, Jpn", classification = "723; 903", conference = "Proceedings --- Foundations of Data Organization.", keywords = "computer programming --- Algorithms; database systems; hash join technique; information retrieval systems; partition relations; Relational", meetingaddress = "Kyoto, Jpn", sponsor = "Japan Soc for the Promotion of Science, Jpn; IEEE Computer Soc, Los Alamitos, CA, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA; Information Processing Soc of Japan, Jpn", } @Article{Yang:1985:BMC, author = "W. P. Yang and M. W. Du", title = "A Backtracking Method for Constructing Perfect Hash Functions from a Set of Mapping Functions", journal = j-BIT, volume = "25", number = "1", pages = "148--164", year = "1985", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10", MRnumber = "86h:68023", bibdate = "Thu Nov 12 18:12:56 MST 1998", bibsource = "Compendex database; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper presents a backtracking method for constructing perfect hash functions from a given set of mapping functions. A hash indicator table is employed in the composition. By the nature of backtracking, the method can always find a perfect hash function when such a function does exist according to the composing scheme. Simulation results show that the probability of getting a perfect hash function by the backtracking method is much higher than by the single-pass and multipass methods previously proposed.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chiao Tung Univ, Inst of Computer Engineering, Hsinchu, Taiwan", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "backtracking method; computer programming --- Algorithms; computer simulation; data processing; File Organization; hash functions; mapping functions", } @Article{Yao:1985:OAK, author = "Andrew C. Yao", title = "On Optimal Arrangements of Keys with Double Hashing", journal = j-J-ALG, volume = "6", number = "2", pages = "253--264", month = jun, year = "1985", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Mon Jul 18 23:02:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Given a set of n keys, the keys are arranged in a hash table of size n such that the worst-case retrieval time is minimized. It is shown that, when double hashing is used, one can, with probability 1-o(1), arrange the keys to achieve a worst-case retrieval time O(log n). This gives a solution to an open problem in \cite{Rivest:1978:OAK}.", acknowledgement = ack-nhfb, } @Article{Yao:1985:UHO, author = "Andrew C. Yao", title = "Uniform Hashing is Optimal", journal = j-J-ACM, volume = "32", number = "3", pages = "687--693", month = jul, year = "1985", CODEN = "JACOAH", ISSN = "0004-5411", bibdate = "Sat Feb 14 10:47:04 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: Stanford Un., CSD, TR-CS-85-1038, Jan. 1985.", abstract = "It was conjectured by J. Ullman that uniform hashing is optimal in its expected retrieval cost among all open-address hashing schemes. In this paper, it is shown that, for any open-address hashing scheme, the expected cost of retrieving a record from a large table that is alpha -fraction full is at least (1/ alpha )log(1/1 minus alpha ) plus o(1). This proves Ullman's conjecture to be true in the asymptotic sense.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Computer Science Dep, Stanford, CA, USA", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; data processing; Data Structures; open-address hashing; retrieval cost; uniform hashing", remark = "The key of a record maps to a sequence that is a random permutation of all the locations of a hash table.", review = "ACM CR 8512-1135", } @Article{Zou:1985:MMC, author = "Youwen Zou", title = "{MPHF} Method for {Chinesizing Cobol} Reserved Words", journal = "Hunan Keji Daxue Xuebao/Journal of Hunan Science and Technology University", volume = "1", number = "1-2", pages = "97--104", month = sep, year = "1985", CODEN = "HKDXEX", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The MPHF is a method of the minimal perfect HASH function, which is independent of the computing machine. In the literature, the ideal results are shown only for small sizes n equals 12 and n equals 35. When the size n is increased gradually, it will take a long time to find its MPHT because its complexity is O (n**m) where m is the number of the different first of last characters of the keys. In this paper, the third king of sorting of keys, the various backtracking methods for processing colliding, controlling valved values and bound values have been studied. The practicable results for sizes 90, 138 and 228 have been provided to Chinesize COBOL reserved words.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Hunan Keji Daxue Xuebao", keywords = "Chinesizing method; COBOL; computer programming languages; minimal perfect hash function (MPHF); reserved words", language = "Chinese", } @TechReport{Ahn:1986:AH, author = "Ilsoo Ahn", key = "Ahn", title = "Adaptive Hashing", institution = "AT \& T Bell Laboratories", address = "Columbus, OH, USA", pages = "1--21", month = dec, year = "1986", bibdate = "Tue Mar 24 17:13:01 1987", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A new hashing scheme, termed adaptive hashing, is proposed to handle dynamic growth or shrinkage of files. Until there occurs an overflow, adaptive hashing is the same as conventional fixed-size hashing. When an overflow or an underflow occurs, a bucket is split into two or merged with another by maintaining a list of overflow addresses. The overflow list, storing only the addresses of buckets that experienced overflows, is usually small enough to reside in the main memory, thus the cost to retrieve a record is just one bucket access. When the overflow list grows too big, the list itself can be organized for rapid access using the same hashing scheme recursively. It is also possible to reduce the overflow list by reorganizing the file with a bigger address space.", acknowledgement = ack-nhfb, } @Article{Aho:1986:SDS, author = "Alfred V. Aho and David Lee", title = "Storing a Dynamic Sparse Table", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "55--60", year = "1986", CODEN = "ASFPDV", ISBN = "0-8186-0740-8", ISBN-13 = "978-0-8186-0740-0", ISSN = "0272-5428", LCCN = "QA 76 S979 1986", bibdate = "Tue May 12 09:47:54 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "A family of data structures is presented that can process a sequence of insert, delete, and lookup instructions so that each lookup and deletion is done in constant worst-case time and each insertion is done in constant expected time. The amount of space used by each data structure is proportional to the maximal number of elements that need to be stored at any moment in time.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723", conference = "27th Annual Symposium on Foundations of Computer Science.", journalabr = "Annual Symposium on Foundations of Computer Science (Proceedings) 27th.", keywords = "computer systems programming --- Table Lookup; data processing; data storage, digital; Data Structures; dynamic dictionary; dynamic sparse table storage; insert/delete/lookup instructions; suitable perfect hash tables", meetingaddress = "Toronto, Ont, Can", sponsor = "IEEE Computer Soc, Technical Committee on Mathematical Foundations of Computing, Los Alamitos, CA, USA", } @Article{Anon:1986:IRN, author = "Anon", title = "Integer Random Number Generator", journal = j-IBM-TDB, volume = "28", number = "11", pages = "4869--??", month = apr, year = "1986", 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 = "The generation of random numbers without using floating-point arithmetic reduces program size by using logical arithmetic for hashing the random number seed. A random number seed hashed according to a given algorithm produces results that have been shown to be `sufficiently random'.", acknowledgement = ack-nhfb, classification = "723; 922", journalabr = "IBM Tech Discl Bull", keywords = "computer metatheory; floating-point arithmetic; hashing; logical arithmetic; mathematical statistics; program size; Random Number Generation; random number seed", } @Article{Berman:1986: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", journal = j-SIAM-J-COMPUT, volume = "15", number = "2", pages = "604--618", month = may, year = "1986", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P10", MRnumber = "87e:68013", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance. Such a technique has been called `perfect hashing' by R. Sprugnoli and others. In this paper, we address the question of whether perfect hashing is feasible in principle as a general technique, or whether it must rely on special qualities of the table contents. We approach the question by counting the number of functions which must be searched to be sure of finding a perfect hashing function. We present upper and lower bounds on the size of this search space, with attention to the tradeoff between the size of the search space and the size of the hash table.", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723", journalabr = "SIAM J Comput", keywords = "computer metatheory; data processing; File Organization; perfect hashing", } @Article{Bradley:1986:UMD, author = "J. Bradley", title = "Use of Mean Distance Between Overflow Records to Compute Average Search Lengths in Hash Files with Open Addressing", journal = j-COMP-J, volume = "29", number = "2", pages = "167--170", month = apr, year = "1986", 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 = "Average search lengths for hash files with open addressing have been computed using the well-known Poisson distribution for the number of addresses assigned x records, and a new expression for the mean distance between overflow records overflowing from a common home address. The method involves computing first the number of disk accesses required to randomly retrieve the y records overflowing from any home address, using a knowledge of the mean distance between overflow records on the disk. The Poisson distribution is then used to obtain the total disk accesses required to retrieve all records in the file, from which the average search length, as total accesses divided by total records, may be deduced. The average search length values obtained agree closely with experimental results. Because it also dispenses with the complex mathematics of existing methods, this new method can be recommended for use in practical design situations. A by-product is that values for the mean distances between overflow records for different loading factors and address capacities are also predicted.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Calgary, Calgary, Alberta, Can", classification = "723; 922", journalabr = "Comput J", keywords = "average search lengths; data processing; Data Structures; hash files with open addressing; statistical methods", } @Article{Bruckner:1986:MPH, author = "Jared A. Bruckner and James Harp", title = "Minimal Perfect Hashing Functions for {Modula-2} Word Lists", journal = j-J-PAS-ADA-MOD, volume = "5", number = "6", pages = "39--40", month = nov # "--" # dec, year = "1986", CODEN = "JPAME8", ISSN = "0747-1351, 0735-1232", 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 function is a mapping from a set of objects called `keys' to a set of objects called `addresses. ' The `keys' considered here are English words, and the `addresses' will be integers from sets of consecutive integers. A hashing function is said to be `perfect' or `collision-free' if it is injective (1-1). If, in addition, the function is surjective (onto), then it is said to be `minimal. ' Two minimal perfect hashing functions are presented. The first maps the 40 Modula-2 reserved words to the integers from 2 to 41, and the second maps the 30 Modula-2 standard identifiers to the integers from 3 to 32.", acknowledgement = ack-nhfb, affiliationaddress = "Atlantic Union Coll, South Lancaster, MA, USA", classification = "723", journalabr = "J Pascal Ada Modula", keywords = "computer programming --- Algorithms; computer programming languages; minimal perfect hashing functions; Modula-2 word lists; Modular Construction; reserved words; standard identifiers", } @Article{Buttner:1986:UDM, author = "Wolfram Buttner", title = "Unification in Data Structure Multisets", journal = j-J-AUTO-REASON, volume = "2", number = "1", pages = "75--88", year = "1986", CODEN = "JAREEW", ISSN = "0168-7433 (print), 1573-0670 (electronic)", bibdate = "Mon Jul 18 23:58:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses generalization of extendible hashing to handle partial match retrieval efficiently", acknowledgement = ack-nhfb, } @PhdThesis{Celis:1986:RHHa, author = "Pedro Celis", title = "{Robin Hood} Hashing", school = inst-WATERLOO-CS, address = inst-WATERLOO-CS:adr, pages = "??", year = "1986", bibdate = "Thu Jul 21 09:38:02 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See also \cite{Celis:1986:RHHb}.", acknowledgement = ack-nhfb, } @TechReport{Celis:1986:RHHb, author = "P. Celis and P. {\AA}. Larson and J. I. Munro", title = "{Robin Hood} Hashing", number = "CS-86-14", institution = inst-WATERLOO-CS, address = inst-WATERLOO-CS:adr, pages = "??", month = apr, year = "1986", bibdate = "Thu Jul 21 09:38:04 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See also \cite{Celis:1986:RHHa}.", acknowledgement = ack-nhfb, } @InProceedings{Chang:1986:DOM, author = "C. C. Chang and J. C. Shieh", title = "On the Design of Ordered Minimal Perfect Hashing Functions", crossref = "IEEE:1986:ICD", pages = "112--115", year = "1986", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An ordered minimal perfect hashing scheme for letter oriented keys is presented. Here, the keys in the key set are stored in ascending order. The method was applied successfully to four practical key sets: the set of animal identifiers in English, the set of C's keywords, the set of frequently occurring English words, and the set of Pascal's reserved words.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723", keywords = "C programming language; computer programming languages --- Pascal; data processing; File Organization; key sets; letter-oriented keys; ordered minimal perfect hashing", } @Article{Chang:1986:LOM, author = "C. C. Chang and R. C. T. Lee", title = "A Letter-oriented Minimal Perfect Hashing Scheme", journal = j-COMP-J, volume = "29", number = "3", pages = "277--281", month = jun, year = "1986", 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 = "In this paper, we shall describe a minimal perfect hashing scheme suitable for letter-oriented keys. We successfully applied this minimal perfect hashing function to four non-trivial sets of keys: 12 months in English, 34 non-printable ASCII identifiers, 31 most frequently used English words and 36 Pascal reserved words.", acknowledgement = ack-nhfb, affiliation = "Natl Chung Hsing Univ, Taichung, Taiwan", affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classcodes = "C6120 (File organisation)", classification = "723; 903", corpsource = "Inst. of Appl. Math., Nat. Chung Hsing Univ., Taichung, Taiwan", journalabr = "Comput J", keywords = "ASCII; Chinese remainder theorem; data processing; file organisation; File Organization; identifiers; information science --- Information Retrieval; key-collision problem; letter-oriented keys; minimal perfect hashing scheme; Pascal reserved words", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chang:1986:LOR, author = "C. C. Chang", title = "Letter-Oriented Reciprocal Hashing Scheme", journal = j-INFO-SCI, volume = "38", number = "3", pages = "243--255", month = jun, year = "1986", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Tue Jul 19 00:08:45 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Chang:1986:SCO, author = "C. C. Chang", title = "A Scheme for Constructing Ordered Minimal Perfect Hashing Functions", journal = j-INFO-SCI, volume = "39", number = "2", pages = "187--195", month = sep, year = "1986", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Tue Jul 19 00:05:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Chen:1986:DAC, author = "W. C. Chen and J. S. Vitter", title = "Deletion Algorithms for Coalesced Hashing", journal = j-COMP-J, volume = "29", number = "5", pages = "436--450", month = oct, year = "1986", 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 = "We present efficient deletion algorithms for three variants of coalesced chaining --- late insertion (LICH), early insertion (EICH), and varied insertion (VICH). Our approach is uniform in the sense that each deletion algorithm works simultaneously for all three variants, though the implementation details are of course different. First we present and analyse a deletion algorithm that preserves randomness, in that deleting a record is in some sense like never having inserted it. In particular, the formulas for the average search times after N random insertions intermixed with d random deletions are the same as the formulas for the average search times after N-d random insertions. This answers an open question in the literature. We then present two deletion algorithms that require fewer pointer fields per table slot.", acknowledgement = ack-nhfb, affiliation = "Brown Univ, Providence, RI, USA", affiliationaddress = "Brown Univ, Providence, RI, USA", classcodes = "C6120 (File organisation)", classification = "723", corpsource = "Dept. of Comput. Sci., Brown Univ., Providence, RI, USA", journalabr = "Comput J", keywords = "Algorithms; coalesced chaining; coalesced hashing; computer programming; data processing --- Data Structures; deletion algorithms; early insertion; EICH; file organisation; insertion; late insertion; LICH; random deletions; random insertions; search; times; varied; VICH", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Colomb:1986:CIS, author = "R. M. Colomb and Jayasooriah", title = "A Clause Indexing System for {PROLOG} based on Superimposed Coding", journal = j-AUSTRALIAN-COMP-J, volume = "18", number = "1", pages = "18--25", year = "1986", CODEN = "ACMJB2", ISSN = "0004-8917", bibdate = "Mon Jul 18 23:53:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Compares clause indexing with hashing.", acknowledgement = ack-nhfb, } @Book{Devroye:1986:LNB, author = "Luc Devroye", title = "Lecture Notes on Bucket Algorithms", publisher = pub-BIRKHAUSER, address = pub-BIRKHAUSER:adr, pages = "148", year = "1986", ISBN = "0-8176-3328-6", ISBN-13 = "978-0-8176-3328-8", LCCN = "QA76.9.D35 D48 1986", bibdate = "Wed Jul 13 18:29:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Bucket, Geometrie, Hashverfahren, Sortieren, Suchen, Unternehmensforschung, Auswahlfunktion", remark = "Hashing algorithms scramble data and create pseudo-uniform data distributions. Bucket algorithms operate on raw untransformed data which are partitioned into groups according to membership in equi-sized d-dimensional hyperrectangles, called cells or buckets. The bucket data structure is sensitive to the distribution of the data. these lecture notes discuss the connection between the expected time of various bucket algorithms and the distribution of data. the results are illustrated on standard searching, sorting and selection problems, as well as on a variety of problems in computational geometry and operations research.", } @InProceedings{DeWitt:1986:GHP, author = "D. J. DeWitt and R. H. Gerber and G. Graefe and M. L. Heytens and K. B. Kumar and M. Muralikrishna", title = "{GAMMA} --- {A} High Performance Dataflow Database Machine", crossref = "Chu:1986:VLD", pages = "228", year = "1986", bibdate = "Mon Jul 18 09:08:27 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Reprinted in M. Stonebraker, Readings in Database Sys., Morgan Kaufmann, San Mateo, CA, 1988.", acknowledgement = ack-nhfb, keywords = "Simple Hybrid Hash Join VLDB", } @Article{Du:1986:DAM, author = "H. C. Du", title = "Disk Allocation Mehods for Binary {Cartesian} Product Files", journal = "BIT (Copenhagen)", volume = "26", number = "2", pages = "138--147", year = "1986", 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 = "We discuss the problem of allocating buckets in a file among disks such that the maximum disk accessing concurrency can be achieved. We are particularly concerned with the disk allocation problem for binary Cartesian product files. A new allocation method is first proposed for the cases when the number (m) of available disks is a power of 2. Then it is extended to fit the cases where m is not a power of 2. The proposed algorithm has a `near' strict optimal performance for a partial match query in which the number of unspecified attributes is greater than a small number (5 or 6).", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA", classification = "722; 723; 903", journalabr = "BIT (Copenhagen)", keywords = "binary Cartesian products files; computer operating systems; computer programming --- Algorithms; data processing --- File Organization; disk allocation methods; information science --- Information Retrieval; multikey hashing; partial match retrieval; Storage Allocation", } @TechReport{Ege:1986:DIG, author = "A. Ege and C. A. Ellis", key = "Ege \& Ellis", title = "Design and Implementation of {GORDION}, An Object Base Management System", number = "STP-172-86", institution = "Software Technology Program, MCC", address = "Austin, TX, USA", pages = "1--22", month = may, year = "1986", bibdate = "Mon Jul 25 11:37:37 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An experimental object base management system called Gordion is presented. Gordion is a server which provides permanence and sharing of objects for workstations within an object-oriented environment. Among the unique aspects of Gordion are: its ability to communicate with multiple languages, introduction of new concurrency control primitives, ability to manipulate objects of arbitrary size, and object sharing acorss the languages through a base set of classes. The system is currently interfaced to two languages, BiggerTalk and Zetalisp Flavors. Beside its language interface, Gordin has an interface for the system administrator, and an interface for debugging. Major functional components of the system are: concurrency control, storage, history and inquiry, and maintenance. Concurrent access to objects is regulated by four types of locks, and transactions encapsulate units of work for the system. The storage systems uses a hashing scheme and UNIX files to store objects. A discussion of the future prospects for Gordion concludes the paper.", acknowledgement = ack-nhfb, } @Article{Er:1986:UTI, author = "M. C. Er", title = "The use of termination indicators in computer programming", journal = j-COMP-J, volume = "29", number = "5", pages = "430--433", month = oct, year = "1986", 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_29/Issue_05/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_05/tiff/430.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_05/tiff/431.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_05/tiff/432.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_05/tiff/433.tif", acknowledgement = ack-nhfb, affiliation = "Univ of Western Australia, Nedlands, Aust", affiliationaddress = "Univ of Western Australia, Nedlands, Aust", classcodes = "C6110 (Systems analysis and programming); C6130 (Data handling techniques)", classification = "723", corpsource = "Dept. of Comput. Sci., Western Australia Univ., Nedlands, WA, Australia", keywords = "computer programming; hash table searching; loops; multi-exit; multi-exit loops; programming; sorting; table lookup; termination indicators", treatment = "P Practical", } @Article{Faloutsos:1986:MHU, author = "Christos Faloutsos", title = "Multiattribute hashing using {Gray} codes", journal = j-SIGMOD, volume = "15", number = "2", pages = "227--238", month = jun, year = "1986", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:25 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Fondrat:1986:PCQ, author = "C. Fondrat and P. Dessen and P. {Le Beux}", title = "Principle of codification for quick comparisons with the entire biomolecule databanks and associated programs in {FORTRAN} 77", journal = j-NUCLEIC-ACIDS-RES, volume = "14", number = "1", pages = "197--204", day = "10", month = jan, year = "1986", CODEN = "NARHAD", ISSN = "0305-1048", bibdate = "Thu Apr 11 18:10:15 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We propose a new method for homology search of nucleic acids or proteins in databanks. All the possible subsequences of a specific length in a sequence are converted into a code and stored in an indexed file (hash-coding). This preliminary work of codifying an entire bank is rather long but it enables an immediate access to all the sequence fragments of a given type. With our method a strict homology pattern of twenty nucleotides can be found for example in the Los Alamos bank (GENBANK) in less than 2 seconds. We can also use this data storage to considerably speed up the non-strict homology search programs and to write a program to help in the selection of nucleic acid hybridization probes.", acknowledgement = ack-nhfb, announcement = "8605", chemicalsubs = "0 (Nucleic Acids)", countrypub = "ENGLAND", datesentered = "Entered 860307", meshheadings = "*Computers; *Information Systems; Nucleic Acids --- analysis (*AN); Proteins --- analysis (*AN); *Software; Amino Acid Sequence; Base Sequence; Mathematics; Nucleic Acid Hybridization; Support, Non-U.S. Gov't", recordno = "86120297", } @Misc{Friemel:1986:DM, author = "Andrea Friemel", title = "Dateistrukturen fuer Mehrschluesselzugriff", howpublished = "Studienarbeit", school = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu Braunschweig", address = "Braunschweig, Germany", pages = "??", year = "1986", bibdate = "Sat Dec 30 09:28:52 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Baum, Datenverwaltung, Gitterdatei, Hashing, Invertierte Datei, Mehrattribut-zugriffstechniken, Mehrschluessel-zugriffstechniken, Segmentierung, Speicherungsstruktur, Textretrieval, Zugriffstechnik", remark = "1. Einleitung 2. Unterschiedliche Systemumgebungen 3. Mehrattribut-zugriffsmethoden fuer Formatierte Daten 4. Mehrattribut-zugriffsmethoden fuer Textretrieval 5. Vergleich der Vorgestellten Verfahren.", } @Article{Garg:1986:OPK, author = "Anil K. Garg and C. C. Gotlieb", title = "Order-Preserving Key Transformations", journal = j-TODS, volume = "11", number = "2", pages = "213--234", month = jun, year = "1986", 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/1986-11-2/p213-garg/p213-garg.pdf; http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p213-garg/; http://www.acm.org/pubs/toc/Abstracts/tods/5923.html", abstract = "File organizations based on conventional hash functions provide faster access to the stored records in comparison with tree-like file structures. Tree structures such as B** plus -trees and ISAM do provide for sequential processing, but require considerable storage for the indices. When sequential processing is needed a table that performs an order-preserving transformation on keys can be used. H is an order-preserving key transform if H(K//1) greater than equivalent to H(K//2), for all keys K//1 greater than K//2. We present methodologies for constructing such key transforms, and illustrate them for some real-life key sets. Storage requirements for the table needed to carry out the transformation are less than those needed for the indices.", acknowledgement = ack-nhfb, affiliation = "Univ of Toronto, Toronto, Ont, Can", affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", classification = "723", generalterms = "Algorithms; Design; Management; Measurement; Performance; Theory", keywords = "access methods, algorithms; data processing; database systems; design; dynamic files; file organization; key transformations; management; measurement; order-preserving hashing; performance; theory", subject = "{\bf E.5}: Data, FILES, Organization/structure. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @PhdThesis{Gerber:1986:DQPa, author = "R. H. Gerber", title = "Dataflow Query Processing using Multiprocessor Hash-Partitioned Algorithms", type = "Ph.D. thesis", school = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", month = oct, year = "1986", bibdate = "Thu Jul 21 09:38:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "GAMMA simple hybrid hash join partitioning linear speedup engine verified simulation", } @TechReport{Gerber:1986:DQPb, author = "Robert H. Gerber", title = "Dataflow Query Processing Using Multiprocessor Hash-partitioned Algorithms", institution = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", year = "1986", bibdate = "Thu Jul 21 09:38:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Datenbankmaschine, Hash, Leistungsanalyse, Parallelverarbeitung", remark = "Dissertation ueber Hash-basierte Join-verfahren. Implementierung auf Multiprozessor-datenbankmaschine Gamma.", } @Book{Ghosh:1986:DBO, author = "Sakti P. Ghosh", title = "Data Base Organization For Data Management", publisher = pub-AP, address = pub-AP:adr, edition = "Second", pages = "xiii + 487", year = "1986", ISBN = "0-12-281852-0", ISBN-13 = "978-0-12-281852-3", LCCN = "QA76.9.F5 G47 1986", bibdate = "Wed Jul 13 18:33:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Gray:1986:IJH, author = "P. M. D. Gray", title = "Implementing Joins by Hashing on {Codasyl} {DBMS}", crossref = "Oxborrow:1986:PFB", pages = "187--199", year = "1986", bibdate = "Tue Jul 19 00:10:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Griswold:1986:IIP, author = "Ralph E. Griswold and Madge T. Griswold", title = "The Implementation of the {Icon} Programming Language", publisher = pub-PRINCETON, address = pub-PRINCETON:adr, pages = "x + 336", year = "1986", ISBN = "0-691-08431-9", ISBN-13 = "978-0-691-08431-2", LCCN = "QA76.73.I19 G76 1986", bibdate = "Sun Jul 10 01:07:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "The hashing algorithms used in the Icon compiler are described on pp. 97--107.", price = "US\$39.50", acknowledgement = ack-nhfb, } @Book{Grosshans:1986:FSD, author = "Daniel Grosshans", title = "File Systems: Design and Implementation", publisher = pub-PH, address = pub-PH:adr, pages = "xiv + 482", year = "1986", ISBN = "0-13-314568-9", ISBN-13 = "978-0-13-314568-7", LCCN = "QA76.9.F5 G76 1986", bibdate = "Tue Jul 19 01:26:59 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$38.95", acknowledgement = ack-nhfb, remark = "1. Introduction: why study I/O? Functionality vs. Resources vs. Performances, File activity ratio, File volatility ratio; 2. Device I/O: channels, programming; 3. Tape; 4. Random Access Devices; 5. Basic File Systems with program commands; 6. Basic I/O supervisor, interrupts; 7. Logical I/O concepts, buffering, blocking; 8. Access method I/O: create, read, read-next, write, update, Delete; 9. Sequential files; 10. Relative files(direct); 11. Direct (hashing); 12. Indexed Sequential; 13. Indexed (B-tree); 14. VSAM; 15. Multikey indexed; 16. File System issues. Much on programming and IBM's control blocks. Little performance and conceptual material.", review = "ACM CR 8703-0150", } @InProceedings{Haggard:1986:FMP, author = "Gary Haggard and Kevin Karplus", title = "Finding minimal perfect hash functions", crossref = "Little:1986:PSS", pages = "191--193", month = feb, year = "1986", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this function relies on a backtracking algorithm for numbering the vertices of the graph. Careful selection of the graph model limits the time spent searching. Good results have been obtained for dictionaries of up to 181 words. Using the same techniques, non-minimal perfect hash functions have been found for sets of up to 667 words.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maine at Orono, Orono, ME, USA", classification = "723", keywords = "Algorithms; backtracking; computer programming; hash functions; mathematical techniques --- Graph Theory", } @Article{Hill:1986:ESD, author = "L. Owen Hill and David A. Zein", title = "Extracting Statistical Data from Free-Form Text", journal = "IEEE Circuits and Devices Magazine", volume = "2", number = "3", pages = "18--24", month = may, year = "1986", CODEN = "ICDMEN", ISSN = "8755-3996", ISSN-L = "1558-1888", 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 described a method for processing free-form text files. The method consists of segregating and separating four physically and logically identifiable regions. The four regions are postprocessed to update three history files that contain information about manufactured products over a period of time. The technique used in processing such files falls under the general category of data segregation and character recognition. It involves the use of logical and mathematical operations in recognizing region boundaries and types of data fields and establishing uniqueness in name recognition. Hashing methods are used, combined with logical matrix multiplication in updating the history files. Sparse formats are used to store multiple large arrays on disks, reducing storage requirements by more than a factor of two. The techniques are implemented using multiprogramming environments in an automated system.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Hopewell Junction, NY, USA", classification = "721; 722; 723; 913", journalabr = "IEEE Circuits Devices Mag", keywords = "automata theory --- Computational Linguistics; character recognition; Data Handling; data processing; data segregation; free-form text files; hashing methods; history files; manufactured products; production engineering", } @InProceedings{Hsu:1986:COE, author = "Meichun Hsu and Wei-Pang Yang", booktitle = "Proceedings Very Large Data Bases (Aug 25--28 1986: Kyoto, Jpn)", title = "Concurrent Operations in Extendible Hashing", crossref = "Chu:1986:VLD", pages = "241--247", year = "1986", ISBN = "0-934613-18-4", ISBN-13 = "978-0-934613-18-7", LCCN = "QA 76.9 D3 I61 1986", bibdate = "Tue May 12 09:48:07 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An algorithm for synchronizing concurrent operations on extendible hash files is presented. The algorithm is deadlock free and allows the search operations to proceed concurrently with insertion operations without having to acquire locks on the directory entries or the data pages. It also allows concurrent insertion\slash deletion operations to proceed without having to acquire locks on the directory entries. The algorithm is also unique in that it combines the notion of verification, fundamental to the optimistic concurrency control algorithm, and the special and known semantics of the operations in extendible hash files. A proof of correctness for the proposed algorithm is also presented.", acknowledgement = ack-nhfb, affiliation = "Harvard Univ", affiliationaddress = "Cambridge, MA, USA", classification = "723", conference = "Twelfth International Conference on Very Large Data Bases, Proceedings (VLDB '86)", conferenceyear = "1986", keywords = "Computer Programming--Algorithms; Computer Systems Programming--Multiprocessing Programs; Concurrent Programming; Database Systems; Relational; VLDB", meetingabr = "Twelfth Int Conf Very Large Data Bases Proc VLDB 86", meetingaddress = "Kyoto, Jpn", meetingdate = "Aug 25--28 1986", meetingdate2 = "08/25--28/86", sponsor = "VLDB Endowment, Jpn; IFIP; INRIA; Information Processing Soc of Japan; DARPA; et al", } @Article{Jacobs:1986:TRT, author = "Christiaan T. M. Jacobs and Peter {van Emde Boas}", title = "Two Results on Tables", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "43--48", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68Q25 (68P10)", MRnumber = "87g:68024", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A. C. Yao has determined the maximal size of a finite universe U such that it is possible to store all subsets A of U with k elements in a table of k slots in such a way that membership in A can be determined in a single probe. In his model it is assumed that all elements of A are physically stored in the table. If this assumption is relaxed and arbitrary elements in U can be stored in order to encode subsets A, then Yao's upper bound is no longer valid. It fails for trivial reasons only: a single probe lookup strategy only exists when it is possible to encode arbitrary subsets of U by a bitmap. Our second results is an improvement of the optimal program size for perfect hash functions, solving an open problem from Slot and Van Emde Boas.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Amsterdam, Dep of Mathematics \& Computer Science, Amsterdam, Neth", classification = "723", journalabr = "Inf Process Lett", keywords = "computer metatheory; data processing; Data Structures; perfect hashing; single-probe table lookup; theory; verification", subject = "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, Sorting and searching", xxauthor = "T. M. Christiaan Jacobs and Peter {Van Emde Boas}", } @Article{Kalvin:1986:TMB, author = "Alan Kalvin and Edith Schonberg and Jacob T. Schwartz and Micha Sharir", title = "Two-Dimensional, Model-Based, Boundary Matching Using Footprints", journal = j-INT-J-ROBOTICS-RES, volume = "5", number = "4", pages = "38--55", month = "Winter", year = "1986", CODEN = "IJRREL", ISSN = "0278-3649", 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 describe a technique for geometrically hashing two-dimensional model objects. Used in conjunction with other methods for recognizing partially obscured and over-lapping objects, this technique enables us to recognize overlapping, two-dimensional objects selected from large databases of model objects without significant performance degradation when the database is enlarged. This technique is based on use of a synthetic attribute of an object, which we will call footprint. Experimental results from databases of up to 100 objects are presented.", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, New York, NY, USA", classification = "723", journalabr = "Int J Rob Res", keywords = "footprints; matching objects; object hashing; pattern recognition; robotics; robots, industrial --- Vision Systems; Vision Systems", } @InProceedings{Karlin:1986:PHE, author = "A. R. Karlin and E. Upfal", title = "Parallel hashing --- An efficient implementation of shared memory", crossref = "ACM:1986:PEA", pages = "160--168", year = "1986", bibdate = "Mon Jul 18 10:23:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Kelley:1986:IME, author = "Keith L. Kelley and Marek Rusinkiewicz", title = "Implementation of Multi-Key Extendible Hashing as an Access Method for a Relational Dbms", crossref = "IEEE:1986:ICD", pages = "124--131", year = "1986", 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.", abstract = "Extendible hashing addressing schemes have been introduced to resolve collisions and improve storage utilization by dynamically adjusting the address space and modifying the hash function. Recently, generalizations of extendible hashing have been proposed which allow multiattribute keys to be used for improved partial-match query performance. In this paper, the design and implementation of a multikey extendible hashing access method for a relational DMBS are presented. The results of an experimental performance evaluation of multikey extendible hashing in a testbed relational DBMS suggest that for a wide class of queries it constitutes a viable alternative to ISAM-like files. The limitations of multikey extendible hashing files and research problems which have to be solved before a practical access method for a relational DBMS can be developed are discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Houston, TX, USA", classification = "723; 903", keywords = "data processing --- File Organization; database access; database systems; information science --- Information Retrieval; multikey extendible hashing; partial-match retrieval; Relational", } @InProceedings{Kelley:1986:IMK, author = "K. L. Kelley and M. Rusinkiewicz", title = "Implementation of Multi-Key Extendible Hashing as an Access Method for a Relational {DBMS}", crossref = "IEEE:1986:ICD", pages = "??", year = "1986", bibdate = "Thu Jul 21 08:49:12 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Koerner:1986:IFB, author = "J. Koerner and K. Marton", booktitle = "1986 IEEE International Symposium on Information Theory (ISIT).", title = "Improved {Fredman-Komlos} Bounds for Perfect Hashing via Information Theory", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "118--??", year = "1986", 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.", abstract = "Summary form only given. A set of sequences of length t which form a b-element alphabet is called k-separated if for every k-tuple of the sequences there exists a coordinate in which they all differ. The problem of finding, for fixed t, b and k, the largest size N(t,b,k) of a k-separated set of sequences is equivalent to finding the minimum size of a (b,k)-family of perfect hash functions for a set of a given size. The authors have established a new nonexistence bound on N(t,b,k) by an extension of graph entropy to hypergraphs.", acknowledgement = ack-nhfb, affiliationaddress = "Hungarian Acad of Sciences, Budapest, Hung", classification = "716; 718; 723; 731; 921; 922", keywords = "abstract only; codes, symbolic; Digital Signals; entropy; hashing; information theory; mathematical models; probability", meetingaddress = "Ann Arbor, MI, USA", sponsor = "IEEE, Information Theory Group, New York, NY, USA", } @InProceedings{Kriegel:1986:EMD, author = "H-P. Kriegel and Bernhard Seeger", title = "Efficient Multidimensional Dynamic Hashing for Uniform and Non-Uniform Record Distributions", crossref = "Ausiello:1986:IIC", pages = "??", year = "1986", bibdate = "Thu Jul 21 09:38:08 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Lehman:1986:SIS, author = "T. J. Lehman and M. J. Carey", title = "A Study of Index Structures for Main Memory Database Management Systems", crossref = "Chu:1986:VLD", pages = "??", year = "1986", bibdate = "Thu Jul 21 09:38:09 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "T-trees combine AVL-trees and B-trees with experiments versus linear hashing.", } @InProceedings{Litwin:1986:BDA, author = "Witold Litwin and David B. Lomet", key = "Litwin \& Lomet", booktitle = "Proceedings of the International Conference on Data Engineering,", title = "The Bounded Disorder Access Method", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "38--48 (or 38--47??)", month = feb, year = "1986", ISBN = "0-8186-0655-X", ISBN-13 = "978-0-8186-0655-7", LCCN = "QA 76.9 D3 I5582 1986", bibdate = "Tue May 12 09:48:16 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Computer Society Order Number 655.", abstract = "A new key associative access method, called the bounded disorder method, is described. The method uses a combination of hashing and tree indexing. The method has good random access performance and is comparable to the best hashing methods if its small index is stored entirely in the main memory. The method's advantage compared with hashing is that range searches are possible while searching only a portion of the file proportional to the size of the range. It is possible to control index size by controlling node size. Node size can be increased without increasing the amount of data transferred during a random probe. Further, increasing node size has only a minor effect on key sequential access performance. Even quite large nodes, so long as they can be read into memory in their entirety, have good key sequential performance. The bounded disorder method is the only method using large nodes that can cope with arbitrary key distributions. These properties make the bounded disorder method a good choice as the only access method of a database system.", acknowledgement = ack-nhfb, affiliationaddress = "INRIA, Le Chesnay, Fr", classification = "723", conference = "International Conference on Data Engineering.", keywords = "associative access method; bounded disorder access method; data storage, digital --- Random Access; database systems; hashing; tree indexing", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Mackert:1986:ROV, author = "L. F. Mackert and G. M. Lohman", key = "Mackert \& Lohman", title = "{R}* Optimizer Validation and Performance Evaluation for Distributed Queries", crossref = "Chu:1986:VLD", pages = "149--159", year = "1986", bibdate = "Mon Jul 18 09:13:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Few database query optimizer models have been validated against actual performance. This paper extends an earlier optimizer valiation and performance evaluation of R* to distributed queries, i.e., single SQL statements having tables at multiple sites. Actual R* message, I/O and CPU resources consumed --- and the corresponding costs estimated by the optimizer --- were written to database tables using new SQL commands, permitting automated control from application programs for collecting, reducing, and comparing test data. A number of tests were run over a wide variety of dynamically-created test databases, SQL queries, and system parameters. Both high-speed networks --- comparable to a local area network --- and medium-speed long-haul networks --- for linking geographically dispersed hosts --- were evaluated. The tests confirmed the accuracy of R*'s message cost model and the significant contribution of local --- CPU and I/O --- costs, even for a medium-speed network. Although distributed queries consume more resources overall, the response time for some execution strategies improves disproportionately by exploiting both concurrency and reduced contention for buffers. For distributed joins in which a copy of the inner table must be transferred to the join site, shipping the whole inner table dominated the strategy of fetching only those inner tuples that matched each outer-table value, even though the former strategy may require additional I/O. Bloom joins -hashed semijoins- consistently performed better than semijoins and the best R* strategies.", acknowledgement = ack-nhfb, } @Book{Mehlhorn:1986:DEA, author = "K. Mehlhorn", title = "Datenstrukturen und Effiziente Algorithmen Band 1: Suchen und Sortieren", publisher = pub-TEUBNER, address = pub-TEUBNER:adr, pages = "??", year = "1986", ISBN = "3-519-02255-9", ISBN-13 = "978-3-519-02255-8", bibdate = "Thu Jul 21 08:49:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Baum, Datenstruktur, Effizienz, Hashing, Komplexitaetstheorie, Menge, Rasp, Sortieren, Suchbaum, Suchen", remark = "Der Entwurf und die Analyse von Datenstrukturen und Effizienten Algorithmen Hat in den Letzten Jahren Grosse Bedeutung Erlangt: Algorithmus ist der Zentrale Begriff der Informatk und Effizienz Bedeutet Geld. Dieser Band des Dreibaendigen Gesamtwerks Beschaeftigt sich MIT Suchen und Sortieren.", } @Book{Munro:1986:TCR, author = "J. Ian Munro and Pedro Celis", title = "Techniques for Collision Resolution in Hash Tables with Open Addressing", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "601--610", year = "1986", ISBN = "0-8186-0743-2", ISBN-13 = "978-0-8186-0743-1", LCCN = "QA75.5 .F35 1986", bibdate = "Tue May 12 09:48:22 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The authors focus on the problem of resolving collision in hash tables through open addressing. A number of techniques, both old and new, are surveyed, including reordering schemes, Brent's method, binary tree hashing, optional hashing, and Robin Hood hashing. The results of analyses and extensive simulations found in literature are discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Ont, Can", classification = "723", conference = "1986 Proceedings --- Fall Joint Computer Conference.", keywords = "binary tree hashing; collision resolution; computer systems programming; data processing; Data Structures; hash tables with open addressing; optional hashing; robin hood hashing", meetingaddress = "Dallas, TX, USA", sponsor = "ACM, New York, NY, USA; IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Namba:1986:SIU, author = "K. Namba", title = "Some improvements on {Utah} standard {LISP}", journal = j-SIGSAM, volume = "20", number = "1/2", pages = "29--36", month = feb # "\slash " # may, year = "1986", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", bibdate = "Fri Feb 8 18:26:58 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classcodes = "C6140D (High level languages)", corpsource = "Audio Technol. Center, Sony Corp., Tokyo, Japan", issue = "76", keywords = "bit/byte strings; bug-fixings; compiler interface; datatypes; execution-time inefficiency; hash tables; languages; LISP; process flows; stack operation; standard LISP; vectors", subject = "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and Maintenance \\ D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management, File organization", treatment = "P Practical", } @InProceedings{Otoo:1986:BME, author = "E. J. Otoo", title = "Balanced Multidimensional Extendible Hash Tree", crossref = "ACM:1986:PFA", pages = "100--113", year = "1986", bibdate = "Tue Jul 19 01:26:14 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "PODS", } @Article{Poblete:1986:AFT, author = "Patricio V. Poblete", title = "Approximating functions by their {Poisson} transform", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "127--130", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "When analyzing the performance of hashing algorithms, it is usually assumed that the hash function distributes the n keys randomly over the m table positions. In this exact filling model, all the m**n possible arrangements are equally likely. In some cases, the analysis under this model becomes too difficult, and a Poisson filling model is used instead. It has been shown that a Poisson result can be interpreted as a transform of the exact one, and this transform can be inverted to recover the exact result, and that the intuitive notion of using a Poisson result to approximate the corresponding exact result can be formalized, by means of an asymptotic expansion. A stronger version of the approximation theorem, together with a detailed proof, is presented. An explicit form is found for all the terms of the asymptotic expansion, and it is proved that they satisfy a recurrence relation.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Chile, Santiago, Chile", classification = "723; 921", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; data processing; File Organization; hashing; mathematical techniques --- Approximation Theory; Poisson transform; theory", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", } @InProceedings{Robinson:1986:OPL, author = "T. J. Robinson", title = "Order Preserving Linear Hashing Using Dynamic Key Statistics", crossref = "ACM:1986:PFA", pages = "91--99", year = "1986", bibdate = "Tue Jul 19 01:25:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "28K of memory do a credible job of distributing 100,000 records chosen randomly from telephone book. At this file size, there are already signs of the algorithm breaking down.", review = "ACM CR 8705-0403", } @Article{Sacco:1986:FTE, author = "G. M. Sacco", title = "Fragmentation: {A} technique for Efficient Query Processing", journal = j-TODS, volume = "11", number = "2", pages = "113--133", month = jun, year = "1986", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: University of Torino, TR., Aug. 1983.", acknowledgement = ack-nhfb, keywords = "join hash partitioning overflow avoidance recursion parallelism TODS", remark = "Join by hashing: Create fragments by hashing, as many fragments as buffers can be allocated in memory. Then repeat that for the other relation. Then do a nested unsorted join, as Kim, W. 1980, on the fragment pairs.", } @Article{Samples:1986:SSB, author = "A. D. Samples and D. Ungar and P. Hilfinger", title = "{SOAR}: {Smalltalk} without bytecodes", journal = j-SIGPLAN, volume = "21", number = "11", pages = "107--107", month = nov, year = "1986", 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 = "C6140 (Programming languages); C6150 (Systems software)", conflocation = "Portland, OR, USA; 29 Sept.-2 Oct. 1986", conftitle = "OOPSLA '86. Object-Orientated Programming Systems, Languages and Applications. Conference Proceedings", corpsource = "Dept. of Electr. Eng. and Comput. Sci., California Univ., Berkeley, CA, USA", keywords = "activation records; bytecodes; Generation Scavenging; hashing objects; instruction level simulator; invoking blocks; microcomputers; often-used objects; programming languages; reference counting; RISC microcomputer; SOAR; SOAR machine code; virtual machine images; virtual machine images invoking blocks; virtual machines", pubcountry = "USA A11", sponsororg = "ACM", treatment = "P Practical", } @Article{Sebesta:1986:FIA, author = "Robert W. Sebesta and Mark A. Taylor", title = "Fast Identification of {Ada} and {Modula-2} Reserved Words", journal = j-J-PAS-ADA-MOD, volume = "5", number = "2", pages = "36--39", month = mar # "\slash " # apr, year = "1986", CODEN = "JPAME8, JOPAD5", ISSN = "0747-1351, 0735-1232", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Identifying the reserved words of a programming language is most often by comparing candidate strings with the entries of a table of the reserved words. The speed of a table search process depends on the chosen method, which in turn depends on the attributes of the table elements. Important list attributes include whether the list is ordered or unordered, static or dynamic, or long or short. Typically, a short list is searched linearly. Long lists are often constructed and searched using hashing functions. Ordered long lists can be searched quickly by binary search methods, which are slower than hash functions but require less space. A binary search is also more universal than a hash function, because hash functions usually must be tailored to the data in the table.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Colorado, Colorado Springs, CO, USA", classification = "723", journalabr = "J Pascal Ada Modula", keywords = "Ada; binary search; computer programming languages; computer systems programming --- Table Lookup; hash function; Modula-2; reserved words", } @Article{Shapiro:1986:JPD, author = "L. D. Shapiro", title = "Join Processing in Database Systems with Large Main Memories", journal = j-TODS, volume = "11", number = "3", pages = "239--264", month = sep, year = "1986", 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, keywords = "memory query evaluation classical simple hybrid hash joins TODS", } @Book{Sincovec:1986:DSU, author = "R. F. Sincovec and R. S. Wiener", title = "Data Structures Using Modula-2", publisher = pub-JW, address = pub-JW:adr, pages = "xxiii + 500", year = "1986", ISBN = "0-471-81489-X", ISBN-13 = "978-0-471-81489-4", LCCN = "QA76.73.M63 S56 1986", bibdate = "Wed Jul 13 18:50:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Baum, Datenabstraktion, Datenstruktur, Hashing, Implementierung, Liste, Modula, Queue, Rekursion, Sortieren, Speicherverwaltung, Stack", remark = "Lehrbuch ueber Datenstrukturen, Genauer Datenabstraktionen und Deren Implementierungen in Modula-2 Kritik: Nur Kurze Erklaerungen von Datenstrukturen und Algorithmen, Wenig Fortgeschrittene Konzepte, Uebertrieben Viel Programm-texte und Programm-walkthroughs, Keine Analysen.", } @Book{Tenenbaum:1986:DSP, author = "Aaron M. Tenenbaum and Moshe J. Augenstein", title = "Data Structures Using Pascal", publisher = pub-PH, address = pub-PH:adr, edition = "Second", pages = "x + 774", year = "1986", ISBN = "0-13-196668-5", ISBN-13 = "978-0-13-196668-0", LCCN = "QA76.9.D35 T46 1986", bibdate = "Tue Jul 19 00:03:38 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "New section on dynamic hashing added for this edition.", price = "US\$36.95", acknowledgement = ack-nhfb, } @InProceedings{Thom:1986:SAD, author = "J. A. Thom and K. Ramamohanarao and L. Naish", key = "Thom et al.", title = "A Superjoin Algorithm for Deductive Databases", crossref = "Chu:1986:VLD", pages = "189--196", month = aug, year = "1986", bibdate = "Mon Jul 18 09:13:23 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes a join algorithm suitable for deductive and relational databases which are accessed by computers with large main memories. Using multi-key hashing and appropriate buffering, joins can be performed on very large relations more efficiently than with existing methods. Furthermore, this algorithm fits naturally into top-down Prolog computations and can be made very flexible by incorporating additional Prolog features.", acknowledgement = ack-nhfb, keywords = "partial match retrieval, Prolog, hashing, joins, optimization, database, relational, deductive", } @InProceedings{Toyama:1986:DOQ, author = "M. Toyama", key = "Toyama", title = "Data Organizations and Query Processing in Database Systems", crossref = "Chu:1986:VLD", pages = "25--32", month = aug, year = "1986", bibdate = "Mon Jul 18 09:13:20 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "On eof the features possessed only by relational database systems is their powerful query processing. Today, when relational database systems are widely populated, optimization of query evaluation procedures is becoming even more important. Much more efficient query processing is expected on interactive inquiry and on view realization. Query processing should take full advantage of physical organization of the given database. To achieve higher performance, physical database organization must be tuned. This tutorial overviews the recent development of dynamic hash based file organizations and discusses their applicability to relational databases.", acknowledgement = ack-nhfb, } @Article{VanWyk:1986:CHL, author = "Christopher J. {Van Wyk} and Jeffrey Scott Vitter", title = "Complexity of Hashing with Lazy Deletion", journal = "Algorithmica (New York)", volume = "1", number = "1", pages = "17--29", year = "1986", CODEN = "ALGOEJ", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We examine a version of the dynamic dictionary problem in which stored items have expiration times and can be removed from the dictionary once they have expired. We show that under several reasonable assumptions about the distribution of the items, hashing with lazy deletion uses little more space than methods that use eager deletion. The simple algorithm suggested by this observation was used in a program for analyzing integrated circuit artwork.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "714; 723", journalabr = "Algorithmica (New York)", keywords = "complexity; computer programming --- Algorithms; data processing; Data Structures; dynamic dictionary problem; hashing algorithms; integrated circuits --- Computer Aided Design; lazy deletion strategies", } @Article{Ventae:1986:NDS, author = "Olli Ventae", title = "{N}-Gram Driven Search for Sentences in a Syntactic Network", journal = j-PROC-ICASSP, pages = "1145--1148", year = "1986", CODEN = "IPRODJ", ISSN = "0736-7791", 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.", abstract = "A text reconstruction method is described that finds in a large N-gram-network near-optimal paths that match well with the erroneous input strings to be corrected. The paths in the network and an input string are first compared by a redundant hash-addressing method which makes the search very selective and especially fast in spite of the fact that holding the network is held in a disk file during processing. The final selection of a near-optimal path is carried out using the unweighted Levenshtein-distance criterion. The computation-bound dynamic programming algorithm needs to be applied only to selected portions of the strings, however.", acknowledgement = ack-nhfb, affiliationaddress = "Helsinki Univ of Technology, Espoo, Finl", classification = "723; 921", conference = "ICASSP 86 --- Proceedings, IEEE-IECEJ-ASJ International Conference on Acoustics, Speech, and Signal Processing.", journalabr = "Proc ICASSP IEEE Int Conf Acoust Speech Signal Process", keywords = "computer programming --- Algorithms; data processing; mathematical programming, dynamic; n-gram-driven search; near-optimal path selection; redundant hash addressing; text reconstruction; unweighted Levenshtein distance criterion; Word Processing", meetingaddress = "Tokyo, Jpn", sponsor = "IEEE Acoustics, Speech, and Signal Processing Soc, New York, NY, USA; Inst of Electronics \& Communications Engineers of Japan, Jpn; Acoustical Soc of Japan, Jpn", } @MastersThesis{Warren:1986:GHR, author = "Van Warren", title = "Geometric Hashing for Rendering Complex Scenes", type = "M.Sc. thesis", school = "University of Utah", pages = "ix + 74", month = may, year = "1986", LCCN = "T 7.5 1985 v35", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "geometric hashing, grid subdivision", remark = "Divides the scene into a volume of regular small cubes, and traces the rays between cubes.", } @Article{Wiener:1986:EVH, author = "Richard S. Wiener", title = "An efficient virtual hash algorithm for a spelling checker", journal = j-J-PAS-ADA-MOD, volume = "5", number = "1", pages = "23--29", month = jan # "--" # feb, year = "1986", CODEN = "JOPAD5, JPAME8", ISSN = "0735-1232", 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 examines a new speed and memory-efficient algorithm for a spelling checker with a dictionary containing about 35,000 English words and its implementation in Modula-2 using a personal computer with a data space constraint of 64,000 bytes. The algorithm is based on virtual hashing and is a variation of a technique suggested by Radue. The algorithm requires no dictionary compression, imposes no limit on the length of English words, and provides access to a dictionary of approximately 35,000 words in an efficient manner. Program listings are presented that contain the interface to the virtual hash table and display it when it is brought from RAM disk into active memory (if not already present there).", acknowledgement = ack-nhfb, affiliation = "Univ of Colorado at Colorado Springs, Dep of Computer Science, Colorado Springs, CO, USA", affiliationaddress = "Univ of Colorado at Colorado Springs, Dep of Computer Science, Colorado Springs, CO, USA", classification = "723", journalabr = "J Pascal Ada Modula", keywords = "algorithms; Algorithms; computer programming; computer programs; data storage, digital --- Virtual; design; information science --- Language Translation and Linguistics; languages; measurement; Modula-2 language; performance; personal computer-based dictionary; spelling checker; virtual hash algorithm", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-2 \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, Spelling \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations", } @Book{Wirth:1986:ADS, author = "Niklaus Wirth", title = "Algorithms and Data Structures", publisher = pub-PH, address = pub-PH:adr, pages = "288", year = "1986", ISBN = "0-13-022005-1", ISBN-13 = "978-0-13-022005-9", LCCN = "QA76.9.D35 W58 1986", bibdate = "Mon Jul 18 23:54:15 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$32.95", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Baum, Datenstruktur, Datentyp, Hashing, Liste, Modula-2, Programmierung, Rekursiver Algorithmus, Sortieren, Suchen, Textsuche", remark = "Lehrbuch; Gegenueber Frueheren Auflagen Ueberarbeitet; Programmiersprache: Modula-2.", } @Article{Wyk:1986:CHL, author = "Christopher J. Van Wyk and Jeffrey Scott Vitter", title = "The Complexity of Hashing with Lazy Deletion", journal = j-ALGORITHMICA, volume = "1", number = "1", pages = "17--29", month = jan, year = "1986", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68P10", MRnumber = "MR833116", bibdate = "Mon Jan 22 05:36:17 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica1.html#WykV86; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "WykV86", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/WykV86", } @InProceedings{Yuen:1986:DFO, author = "T. S. Yuen and H. C. Du", key = "Yuen \& Du", booktitle = "Proceedings of the International Conference on Data Engineering", title = "Dynamic File Organizations for Partial Match Retrieval Based on Linear Hashing", organization = "IEEE Computer Society", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "116--123", month = feb, year = "1986", ISBN = "0-8186-0655-X", ISBN-13 = "978-0-8186-0655-7", LCCN = "????", 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.", abstract = "Two new file organizations based on linear hashing are proposed for partial match retrieval. The first organization introduces a load-balancing scheme whereby overflow records are stored temporarily in other primary buckets so that the allocations of overflow buckets are deferred. The second organization defers the physical splitting of underflow buckets, so that the records belonging to underflow buckets can be retrieved together. These two techniques are then combined to form a new variation of linear hashing. Compared with the original scheme, the performance of these organizations for partial match retrieval is improved, in terms of both storage utilization and retrieval time.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA", classification = "723; 903", conference = "International Conference on Data Engineering.", keywords = "data processing; Database management; dynamic file organizations; File Organization; file organization; information science --- Information Retrieval; information storage and retrieval; linear hashing; partial match retrieval; physical design; retrieval time; storage utilization", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Yuen:1986:DFS, author = "T. S. Yuen and H. C. Du", title = "Dynamic file structure for partial match retrieval based on overflow bucket sharing", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-12", number = "8", pages = "??", month = aug, year = "1986", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Thu Jul 21 09:38:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "A generalization of extendible hashing. Overflow pages are shared by primary data pages from neighboring directory entries. Simulation results obtained from uniform record distributions.", review = "ACM CR 8707-599", } @TechReport{Ahn:1987:AH, author = "I. Ahn", key = "Ahn", title = "Adaptive Hashing", institution = "????", pages = "??", year = "1987", bibdate = "Thu Jul 21 08:49:29 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Aldous:1987:HLP, author = "David J. Aldous", title = "Hashing with linear probing, under non-uniform probabilities", number = "TR-88", institution = "University of California, Berkeley. Dept. of Statistics", pages = "15", month = feb, year = "1987", LCCN = "QA276.A1 T43 no.88", bibdate = "Sun Jul 17 09:22:36 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Astrahan:1987:ANU, author = "M. M. Astrahan and M. Schkolnick and K. Y. Whang", title = "Approximating the number of unique values of an attribute without sorting", journal = j-INFO-SYS, volume = "12", number = "1", pages = "11", year = "1987", CODEN = "INSYD6", ISSN = "0306-4379", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "hashing hash InfSys", } @InProceedings{Barklund:1987:HTL, author = "J. Barklund and H. Millroth", title = "Hash Tables in Logic Programming", crossref = "Lassez:1987:PFI", pages = "411--427", year = "1987", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Berra:1987:CAS, author = "P. B. Berra and Soon M. Chung and Nabil I. Hachem", title = "Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base", journal = j-COMPUTER, volume = "20", number = "3", pages = "25--32", month = mar, year = "1987", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", bibdate = "Tue Jul 19 00:30:48 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "hashing concatenated code words superimposed code words transformed inverted lists", } @Article{Boehm:1987:BQK, author = "Alexander Boehm and Jannis Iliadis", title = "{Ein Beitrag zu den Quadratischen Kollisionsstrategien in Hash-Tabellen --- ein Neuer Algorithmus}", journal = "Angewandte Informatik, Applied Informatics", volume = "29", number = "3", pages = "111--118", month = mar, year = "1987", 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 new algorithm is introduced for handling collisions in a hash table. The algorithm belongs to the class of quadratic collision strategies for open hashing. We also make some comparison tests, in a real environment, with well known collision handling algorithms from which the efficiency of the suggested algorithm is shown. Finally we prove that the above algorithm traverses the whole hash table in order to find a free address.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Athen, Athens, Greece", classification = "723", journalabr = "Angew Inf Appl Inf", keywords = "Algorithms; computer programming; hashing algorithms", language = "German", } @TechReport{Boeker:1987:SAG, author = "Michael Boeker and Dietmar Fox and Elisabeth Rueter", title = "Setl in Action: {A} Gallery of Data Structures", institution = "????", address = "Hildesheim, Germany", pages = "??", year = "1987", bibdate = "Tue Jul 26 09:04:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Esprit, Geographie, Hash-methoden, Rapid Prototyping, Schlange, Sed, Setl, Sortierverfahren, Suchbaum, Windows", remark = "Bibliotheken Fuer: (1) Suchbaeume: Binaerbaeume, Avl-baeume, 2--3-baeume, B,b+,b*,k-d, Quad.-baeume (2) Hashmethoden: Offen, Geschlossenlinear, Doppelt, Virtuell, Dynamisch, Partiell, Spiral (3) Sortierungsverfahren und Prioritaetsschlangen (4) Geographie: Konvexe Huellen, Voronoi-diagramme, Kontur von Rechtecken, Durchschnitt von Rechtecken.", } @Article{Bohm:1987:QSH, author = "Alexander Bohm and Jannis Illiadis", title = "{Ein Beitrag zu den quadratischen Kollisionsstrategien in Hash-Tabellen---Ein neuer Algorithmus} (English: On Quadratic Strategies for Handling Collisions in Hash Tables---{A} New Algorithm)", journal = j-ANG-INFO, volume = "29", number = "3", pages = "111--118", month = mar, year = "1987", bibdate = "Wed Jul 20 23:09:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Cercone:1987:FAP, author = "Nick Cercone", title = "Finding and Applying Perfect Hash Functions", journal = j-APPL-MATH-LETT, volume = "0", number = "1", pages = "21--24", year = "1987", CODEN = "AMLEEL", ISSN = "0893-9659", bibdate = "Tue Nov 05 09:15:13 2002", bibsource = "http://ai.uwaterloo.ca/~ncercone/publications.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, xxnote = "Cercone's Web page says Applied Mathematics Letters 1(1), 25-29 (1987). Resolve discrepancy??", } @Article{Chang:1987:PAG, author = "C. C. Chang and C. Y. Chen", title = "Performance Analysis of the Generalised Disc Modulo Allocation Method for Multiple Key Hashing Files on Multi-Disc Systems", journal = j-COMP-J, volume = "30", number = "6", pages = "535--540", month = dec, year = "1987", 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 = "In this paper, we discuss the performance of the Generalised Disc Modulo (GDM) allocation method for multiple key hashing (MKH) files on multi-disc systems. A very important performance formula which can be used directly to evaluate the average response time over all possible partial match queries is derived.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723", journalabr = "Comput J", keywords = "average response time; data processing; database systems; File Organization; generalised disc modulo allocation method; multi-disc systems; multiple key hashing files; partial match queries", } @Article{Chang:1987:PAM, author = "Chin-Chen Chang and Don-Hsin Su", title = "Performance Analyses of Multi-Attribute Files Based Upon Multiple Key Hashing Functions and Haphazard Files", journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers", volume = "10", number = "1", pages = "99--105", month = jan, year = "1987", CODEN = "CKCKDZ", 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, a new multi-attribute file, called haphazard file, is introduced. We derive two formulas for the average number of buckets to be examined over all possible partial match queries for multi-attribute files based upon multi-key hashing functions and haphazard files, respectively. Theoretical results show that the performance of multi-attribute files based upon multiple key hashing functions is always superior to that of haphazard files.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung-Hsing Univ, Taichung, Taiwan", classification = "903; 921", journalabr = "Chung kuo Kung Ch'eng Hsueh K'an", keywords = "haphazard file; information retrieval systems; mathematical techniques --- Algorithms; multi-attribute file; multiple key hashing functions; partial match query", } @InProceedings{Damgaard:1987:CFH, author = "I. B. Damg{\aa}rd", title = "Collision Free Hash Functions and Public Key Signature Schemes", crossref = "Chaum:1987:ACE", pages = "203--216", year = "1987", bibdate = "Sat Jul 16 17:40:13 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ellis:1987:CLH, author = "Carla Schlatter Ellis", title = "Concurrency in Linear Hashing", journal = j-TODS, volume = "12", number = "2", pages = "195--217", month = jun, year = "1987", 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 \cite{ACM:1985:PFA}.", abstract = "Concurrent access to complex shared data structures, particularly structures useful as database indices, has long been of interest in the database community. In dynamic databases, tree structures such as B-trees have been used as indices because of their ability to handle growth; whereas hashing has been used for fast access in relatively static databases. Recently, a number of techniques for dynamic hashing have appeared. They address the major deficiency of traditional hashing when applied to databases that experience significant change in the amount of data being stored. This paper presents a solution that allows concurrency in one of these dynamic hashing data structures, namely linear hashfiles. The solution is based on locking protocols and minor modifications in the data structures.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, USA", classification = "723", journalabr = "ACM Trans Database Syst", keywords = "complex shared data structures; concurrent access; data processing; Data Structures; database systems; linear hashing", remark = "Searching can proceed in parallel with splits. Also discusses distributed access.", } @Article{Faloutsos:1987:DPA, author = "Christos Faloutsos and Stavros Christodoulakis", title = "Description and Performance Analysis of Signature File Methods for Office Filing", journal = j-TOOIS, volume = "5", number = "3", pages = "237--257", month = jul, year = "1987", CODEN = "ATOSDO", ISSN = "0734-2047", bibdate = "Sat Jan 16 19:04:41 MST 1999", bibsource = "Compendex database; http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80", abstract = "Signature files have attracted a lot of interest as an access method for text and specifically for messages in the office environment. Messages are stored sequentially in the message file, whereas their hash-coded abstractions (signatures) are stored sequentially in the signature file. To answer a query, the signature file is examined first, and many nonqualifying messages are immediately rejected. In this paper we examine the problem of designing signature extraction methods and studying their performance. We describe two old methods, generalize another one, and propose a new method and its variation. We provide exact and approximate formulas for the dependency between the false drop probability and the signature size for all the methods, and we show that the proposed method (VBC) achieves approximately ten times smaller false drop probability than the old methods, whereas it is well suited for collections of documents with variable document sizes.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "723; 903", journalabr = "ACM Trans Off Inf Syst", keywords = "Access methods; Applications; database systems; Design; Document retrieval; electronic message filing; General; Inf. storage and retrieval; Information retrieval; information retrieval systems --- Online Searching; Information systems applications; libraries --- Automation; Library automation; office automation; Office automation; Performance; Physical design; Signature files; Superimposed coding; Text processing; Text retrieval; TOOIS TOIS Database management", } @Article{Faloutsos:1987:OSE, author = "Christos Faloutsos and Stavros Christodoulakis", title = "Optimal Signature Extraction and Information Loss", journal = j-TODS, volume = "12", number = "3", pages = "395--428", month = sep, year = "1987", 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/1987-12-3/p395-faloutsos/p395-faloutsos.pdf; http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p395-faloutsos/; http://www.acm.org/pubs/toc/Abstracts/tods/214285.html", abstract = "Signature files seem to be a promising access method for text and attributes. According to this method, the documents (or records) are stored sequentially in one file (``text file''), while abstractions of the documents (``signatures'') are stored sequentially in another file (``signature file''). In order to resolve a query, the signature file is scanned first, and many nonqualifying documents are immediately rejected. We develop a framework that includes primary key hashing, multiattribute hashing, and signature files. Our effort is to find the optimal signature extraction method.\par The main contribution of this paper is that we present optimal and efficient suboptimal algorithms for assigning words to signatures in several environments. Another contribution is that we use information theory, and study the relationship of the false drop probability $F_d$ and the information that is lost during signature extraction. We give tight lower bounds on the achievable $F_d$ and show that a simple relationship holds between the two quantities in the case of optimal signature extraction with uniform occurrence and query frequencies. We examine hashing as a method to map words to signatures (instead of the optimal way), and show that the same relationship holds between $F_d$ and {\em loss}, indicating that an invariant may exist between these two quantities for every signature extraction method.", acknowledgement = ack-nhfb, classification = "723", generalterms = "Design; Performance", keywords = "data processing; database systems; information loss; optimal signature extraction; performance; signature files, design", remark = "superimposed coding", subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods. {\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf E.5}: Data, FILES. {\bf H.3.2}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization.", } @Article{Felician:1987:LHI, author = "Leonardo Felician", title = "Linked Hashing: an Improvement of Open Addressing Techniques for Large Secondary Storage Files", journal = j-INFO-SYS, volume = "12", number = "4", pages = "385--390", year = "1987", 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 = "An improvement of open addressing resolution schemes for hash-based files on secondary storage is defined in this paper. Linked hashing exploits the increase in compressibility of a hash file when buckets are larger, given a fixed file allocation. Both average access times and the number of records stored can significantly improve, for large files where the ratio between the key length and the record length is much less than 1.", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Udine, Udine, Italy", classification = "723", journalabr = "Inf Syst", keywords = "computer operating systems; data processing; File Organization; InfSys; large secondary storage files; linked hashing; memory management; open addressing techniques", } @Article{Floyd:1987:HHS, author = "Edwin T. Floyd", title = "Hashing for High-Performance Searching", journal = j-DDJ, volume = "12", number = "2", pages = "34--??", month = feb, year = "1987", CODEN = "DDJTEQ", ISSN = "0888-3076", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Programs that process symbolic information, such as compilers, interpreters, assemblers, spelling checkers, and text formatters, maintain an internal list of symbols or words --- a symbol table. The speed of the symbol table's search and update operations often determines the performance of these programs. A hashing or scatter storage symbol table is easy to program and nearly always performs much better than a linear list or binary tree. This article describes a technique called open hashing, discusses some of its performance factors, and then introduces a simple modification that can more than double the speed of the technique.", acknowledgement = ack-nhfb, affiliation = "Hughston Sports Medicine Foundation, Columbus, GA, USA", affiliationaddress = "Hughston Sports Medicine Foundation, Columbus, GA, USA", classification = "723", journalabr = "Dr Dobb's J Software Tools", keywords = "computer operating systems; computer programming languages --- Pascal; computer programs; hashing symbol table; open hashing; Pascal source code; Performance; pointer identifier list; search and update operations", pagecount = "5p between p 34 and 41 plus listings", } @Book{Folk:1987:FSC, author = "Michael J. Folk and Bill Zoellick", title = "File Structures: {A} Conceptual Toolkit", publisher = pub-AW, address = pub-AW:adr, pages = "xxi + 538", year = "1987", ISBN = "0-201-12003-8", ISBN-13 = "978-0-201-12003-5", LCCN = "QA76.9.F5 F651 1987", bibdate = "Sat Feb 14 10:47:07 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "{\em Computing Reviews}: ``A surprisingly thorough discussion of hashing algorithms, collision resolution, and the use and performance of hashed files completes the text with chapter 11.''", price = "US\$32.95", acknowledgement = ack-nhfb, } @Book{Fontayne:1987:MSR, author = "Yves D. Fontayne and Robert J. Bowman", title = "Multiple Storage Radix Hash Tree: an Improved Region Query Data Structure", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "302--305", year = "1987", ISBN = "0-8186-0814-5", ISBN-13 = "978-0-8186-0814-8", LCCN = "TK 7874 I3235 1987", bibdate = "Tue May 12 09:48:31 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "A description is given of a region query data structure with improved performance characteristics compared to other recently developed structures such as the multiple storage quadtree and the multidimensional binary or k-d tree. For VLSI CAD tool applications, in which fast region query is essential, the multiple storage radix hash tree significantly reduces tree scan overhead. Theoretical and experimental performance data on retrieval time and memory utilization are provided. The data structure and supporting algorithms are well suited for design viewing, design rule checking, cell compaction, circuit connectivity extraction, and circuit extraction.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, NY, USA", classification = "723", conference = "IEEE International Conference on Computer-Aided Design: ICCAD-87 --- Digest of Technical Papers.", keywords = "computer programming --- Algorithms; database systems; integrated circuits, VLSI --- Computer Aided Design; memory utilization; multiple storage radix hash tree; Query Languages; region query data; retrieval time; VLSI cad tool", meetingaddress = "Santa Clara, CA, USA", sponsor = "IEEE, Circuits \& Systems Soc, New York, NY, USA; IEEE Computer Soc, Los Alamitos, CA, USA; IEEE, Electron Devices Soc, New York, NY, USA; ACM, Special Interest Group on Design Automation, New York, NY, USA", } @TechReport{Gerber:1987:IHS, author = "R. H. Gerber and D. J. DeWitt", title = "The Impact of Hardware and Software Alternatives on the Performance of the Gamma Database Machine", number = "CS TR 708", institution = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", month = jul, year = "1987", bibdate = "Thu Jul 21 08:49:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "simple hybrid hash join parallel linear speedup scaleup", } @InProceedings{Girault:1987:HFU, author = "Mark Girault", title = "Hash-Functions Using Modulo-{N} Operations", crossref = "Chaum:1987:ACE", pages = "217--226", year = "1987", bibdate = "Thu Oct 31 18:56:11 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, xxpages = "218--226", } @Book{He:1987:PAS, author = "Guo He", title = "Pipelined Array System for Relational Database Operations", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "795--801", year = "1987", ISBN = "0-8186-0780-7", ISBN-13 = "978-0-8186-0780-6", LCCN = "QA75.5 .I5761 1987", bibdate = "Tue May 12 09:48:39 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "A design is presented of a pipelined array system that can do sorting as well as relational database operations. With feedback through a buffer memory, an array system with a small number of simple cells can efficiently process arbitrarily large problems. Tagging and parallel hashing in the prefilters enable the dedicated units to perform relationsl database operations on the sorted output in high speed.", acknowledgement = ack-nhfb, affiliationaddress = "Wuhan Digital Engineering Inst, Wuhan, China", classification = "722; 723", conference = "Second International Conference on Computers and Applications.", keywords = "buffer memory; computer systems programming --- Sorting; computer systems, digital; database systems --- Relational; parallel hashing; Parallel Processing; pipelined array system; tagging", meetingaddress = "Beijing, China", sponsor = "Chinese Computer Federation, China; IEEE Computer Soc, Los Alamitos, CA, USA; Natl Natural Science Foundation of China, China", } @Article{Hofri:1987:PLR, author = "Micha Hofri and Alan G. Konheim", title = "Padded Lists Revisited", journal = j-SIAM-J-COMPUT, volume = "16", number = "6", pages = "1073--1114", month = dec, year = "1987", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We study a data structure L referred to variously as a padded list, controlled density array or sparse table containing records left brace R//i right brace each uniquely identified by a key left brace k(R//i) right brace. L is required to support the operations Search (L, k), Insert (L, k) and Delete (L, k) to search, insert and delete a record with key k. To optimize Search (L, k), records are stored with their keys in sorted order. If the order of the keys is to be maintained under insertion, records currently in L must be moved to free space. To improve the efficiency of Insert (L, k), records are stored in a circular buffer with `gaps' so that insertion necessitates moving only records up to the next gap. The array is expanded and contracted during a sequence of insertions and deletions depending upon the current number of gaps. In this paper we assess the amount of work required to insert a sequence of records.", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "723", journalabr = "SIAM J Comput", keywords = "computer operating systems; controlled density array; data processing; Data Structures; hashing; padded lists; sparse table", } @Article{Holub:1987:NHE, author = "Allen Holub", title = "{Nroff}: Hashing, Expressions, and Roman Numerals", journal = j-DDJ, volume = "12", number = "2", pages = "90--??", month = feb, year = "1987", CODEN = "DDJTEQ", ISSN = "0888-3076", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Nr, a version of the Unix text formatter nroff, is presented. It includes a bunch of subroutines that are useful even if not used as a word processor. Good examples are the hash table management functions and the general-purpose expression analyzer, which are discussed. The program is an almost complete implementation of nroff and it includes several of troff's features as well. It does hyphenation and proportional spacing, it can format equations and matrices, and it is easily configurable to most printers.", acknowledgement = ack-nhfb, classification = "722; 723", journalabr = "Dr Dobb's J Software Tools", keywords = "computer operating systems; computer peripheral equipment --- Printers; computer programming --- Subroutines; computer programs; data processing --- Word Processing; general-purpose expression analyzer; hash table management functions; Program Compilers; UNIX text formatter nroff", pagecount = "7p between p 90 and 100 plus listings", } @Article{Horspool:1987:HCT, author = "R. Nigel Horspool and Gordon V. Cormack", title = "Hashing as a Compaction Technique for {LR} Parser Tables", journal = j-SPE, volume = "17", number = "6", pages = "413--416", month = jun, year = "1987", 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 = "Authors of papers on LR parser table compaction and authors of books on compiler construction appear to have either overlooked or discounted the possibility of using hashing. It is argued that hashing is easy to implement as a compaction technique and gives reasonable performance. It produces tables that are as compact as some of the other techniques reported in the literature while permitting efficient table lookups.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Victoria, Victoria, BC, Can", classification = "723", journalabr = "Software Pract Exper", keywords = "compaction technique; computer operating systems --- Program Compilers; data processing; Data Structures; hashing; LR parser tables; table compaction", } @Article{Jung:1987:IRC, author = "Achim Jung", title = "Implementing the {RSA} Cryptosystem", journal = j-COMPUT-SECUR, volume = "6", number = "4", pages = "342--350", month = aug, year = "1987", CODEN = "CPSEDU", ISSN = "0167-4048", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Techniques for a software implementation of the RSA cryptosystem are presented. They allow both space and time requirements of the RSA scheme to be minimized. A hash function to be used in connection with the cryptosystem is presented; this function avoids weaknesses of other hash functions published previously. Performance results of several implementations are given, which show that the RSA algorithm is acceptably fast for a large number of applications.", acknowledgement = ack-nhfb, affiliationaddress = "Technische Hochschule Darmstadt, Darmstadt, West Ger", classification = "723", journalabr = "Comput Secur", keywords = "computer programming --- Algorithms; computer software; cryptography; cryptosystem; digital signatures; hash functions; primality tests", } @Article{Kabe:1987:RRT, author = "D. G. Kabe", title = "Reducing the Retrieval Time of Hashing Methods by Using Bucket Size", journal = j-IND-MATH, volume = "37", number = "pt 1", pages = "93--102", year = "1987", CODEN = "IMTHAI", ISSN = "0019-8528", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Poisson stochastic processes and Poisson distribution are now extensively studied by statisticians, and a considerable amount of literature on the properties of Poisson distribution is readily available in the statistical literature. Poisson distributions find a wide variety of applications in the file-organization theory with hash addressing methods. The purpose of this paper is to apply some known properties of the Poisson distribution to modify some previous results and to develop an alternative method to reduce the retrieval time of open addressing and multiple chaining hash methods by using bucket size.", acknowledgement = ack-nhfb, affiliationaddress = "St. Mary's Univ, Halifax, NS, Can", classification = "723; 922", journalabr = "Ind Math", keywords = "bucket size; data processing; File Organization; hashing methods; mathematical statistics; multiple chaining; open addressing; retrieval time", } @InProceedings{Kim:1987:ESJ, author = "Chang D. Kim and Yoon J. Lee", booktitle = "Proceedings --- TENCON 87: 1987 IEEE Region 10 Conference, 'Computers and Communications Technology Toward 2000'.", title = "Execution Strategies for Join Operation in Multi-Processor Main Memory Based Database System", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "302--306", year = "1987", 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.", abstract = "Execution strategies for a join operation are investigated for a general multiprocessor system with large sharable memory. First a parallel join processing strategy is proposed to decrease the average processing time for a join operation. Then a model to avoid the conflict of memory accesses is proposed so that processors can execute a join operation as independently as possible. Finally, two hash-based join algorithms, simple and hybrid, are compared to find an optimum join method. It is shown that the hybrid algorithm performs better than the simple algorithm when the number of processors is more than four.", acknowledgement = ack-nhfb, affiliationaddress = "Korea Advanced Inst of Science \& Technology, Seoul, South Korea", classification = "722; 723", keywords = "access conflict avoidance; computer systems, digital --- Parallel Processing; database systems; hash-based join algorithms; hybrid algorithm; parallel join processing strategies; query processing strategies", meetingaddress = "Seoul, S Korea", sponsor = "IEEE, Korea Section; IEEE, Region 10; Korea Inst of Electronic Engineers, South Korea", } @InProceedings{Kriegel:1987:MDH, author = "H. P. Kriegel and B. Seeger", title = "Multidimensional Dynamic Hashing Is Very Efficient for Nonuniform Record Distributions", crossref = "IEEE:1987:DEP", pages = "10", year = "1987", bibdate = "Sat Jul 16 19:27:09 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Kriegel:1987:MDQ, author = "Hans-Peter Kriegel and Bernhard Seeger", title = "Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions", crossref = "IEEE:1987:DEP", pages = "10--17", year = "1987", 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.", abstract = "The authors present the quantile method as a scheme that exhibits for nonuniform distributions, practically the same performance as for uniform distributions. This is underlined by experimental runs with an implementation of the authors' scheme. In addition to its excellent performance, the scheme fulfills all the necessary requirements to be used in an engineering database system: it is dynamic, suitable for secondary storage devices, supports point data and spatial data objects, and supports spatial clustering (proximity queries).", acknowledgement = ack-nhfb, affiliationaddress = "Univ Wuerzburg, West Ger", classification = "723; 903", keywords = "database systems; engineering; information retrieval systems; Performance; proximity queries; quantile hashing; spatial clustering", } @Article{Lebedev:1987:EEU, author = "G. V. Lebedev", title = "Estimating the Efficiency of a Uniform-Grid Two-Dimensional Hashing Algorithm for Hidden Line and Surface Removal in Computer Graphics", journal = "Automation and Remote Control (English translation of Avtomatika i Telemekhanika)", volume = "48", number = "7 pt 2", pages = "968--975", month = jul, year = "1987", CODEN = "AURCAT", ISSN = "0005-1179", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We briefly describe a uniform-grid two-dimensional hashing algorithm in application to hidden line and surface removal and derive some theoretical bounds on its efficiency under the characteristic assumptions of finite-element models. The upper bounds are given for separate directions and averaged over all directions. It is shown that these bounds are unimprovable. Some practical aspects of the two-dimensional hashing algorithm are discussed in application to hidden line and surface removal.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Autom Remote Control", keywords = "computer graphics; computer programming --- Algorithms; hidden line removal; image processing; surface removal; uniform-grid two-dimensional hashing algorithm", } @Article{Litwin:1987:NMF, author = "Witold Litwin and David B. Lomet", title = "New Method for Fast Data Searches with Keys", journal = j-IEEE-SOFTWARE, volume = "4", number = "2", pages = "16--24", month = mar, year = "1987", CODEN = "IESOEG", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", 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 the bounded disorder method, which merges the advantages of tree indexing and hashing. Indexing is used to provide both random and sequential access to data. Central to the speed of the method is the assumption that the entire index is stored in main memory. Hashing is used to access data in large, multibucket nodes, dramatically reducing the index size for any given file size, and enabling a main memory index to be achieved. The discussion covers current data search methods; the bounded disorder concept; the file structure used; handling of overflow; controlling the i-ratio; index representation; and the performance of the method.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Research Inst, Le Chesnay, Fr", classification = "723; 903", journalabr = "IEEE Software", keywords = "data search methods; hashing; index representation; information retrieval systems; information science --- Indexing; tree indexing", } @Book{Miller:1987:STS, author = "Webb Miller", title = "A Software Tools Sampler", publisher = pub-PH, address = pub-PH:adr, pages = "viii + 344", year = "1987", ISBN = "0-13-822305-X", ISBN-13 = "978-0-13-822305-2", LCCN = "QA76.754 M55 1987", bibdate = "Tue Jul 19 00:19:59 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$24.95", acknowledgement = ack-nhfb, } @Article{Morrison:1987:QAH, author = "John A. Morrison and Larry A. Shepp and Christopher J. {Van Wyk}", title = "A queueing analysis of hashing with lazy deletion", journal = j-SIAM-J-COMPUT, volume = "16", number = "6", pages = "1155--1164", month = dec, year = "1987", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "60K25 (68M20 68P05 68Q25)", MRnumber = "89a:60226", MRreviewer = "Micha Hofri", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hashing with lazy deletion is a simple method for maintaining a dynamic dictionary: items are inserted and sought as usual in a separate-chaining hash table; however, items that no longer need to be in the data structure remain until a later insertion operation stumbles on them and removes them from the table. Because hashing with lazy deletion does not delete items as soon as possible, it keeps more items in the dictionary than methods that use more careful deletion strategies. On the other hand, its space overhead is much smaller than those more careful methods, so if the number of extra items is not too large, hashing with lazy deletion can be a practical algorithm when space is scarce. In this paper, we analyze the expected amount of excess space used by hashing with lazy deletion.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723", journalabr = "SIAM J Comput", keywords = "algorithms; computer operating systems; data processing; Data Structures; dynamic dictionary; first passage times; hashing with lazy deletion", } @Article{Pflug:1987:LPN, author = "Georg Ch. Pflug and Hans W. Kessler", title = "Linear Probing with a Nonuniform Address Distribution", journal = j-J-ACM, volume = "34", number = "2", pages = "397--410", month = apr, year = "1987", CODEN = "JACOAH", ISSN = "0004-5411", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper presents a new approach to the analysis of hashing with linear probing for nonuniformly distributed hashed keys. The use of urn models is avoided. Instead, some facts about empirical processes, which are well known in statistics, are used. In particular, an asymptotic formula for the expected probe length for both a successful and an unsuccessful search is obtained. The accuracy of the approximation is confirmed by simulation.", acknowledgement = ack-nhfb, affiliationaddress = "Justus Liebig Univ, Giessen, West Ger", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "computer simulation; data processing; File Organization; hash-table representations; linear probing; nonuniform address distribution", } @Article{Ponder:1987:AHA, author = "Carl D. Ponder", title = "Applications of hashing in algebraic manipulation (an annotated bibliography)", journal = j-SIGSAM, volume = "21", number = "4", pages = "10--13", month = nov, year = "1987", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", bibdate = "Sat Aug 13 17:21:21 MDT 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "theory", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems \\ A.2 General Literature, REFERENCE", } @InProceedings{Raite:1987:PTC, author = "T. Raita and J. Teuhola", title = "Predictive Test Compression by Hashing", crossref = "Yu:1987:RDI", pages = "223--233", year = "1987", bibdate = "Tue Jul 19 08:43:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Richardson:1987:DEP, author = "James P. Richardson and Hongjun Lu and Krishna Mikkilineni", title = "Design and evaluation of parallel pipelined join algorithms", crossref = "Dayal:1987:PAC", pages = "399--409", year = "1987", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p399-richardson/p399-richardson.pdf; http://www.acm.org/pubs/citations/proceedings/mod/38713/p399-richardson/", abstract = "The join operation is the most costly operation in relational database management systems. Distributed and parallel processing can effectively speed up the join operation. In this paper, we describe a number of highly parallel and pipelined multiprocessor join algorithms using sort-merge and hashing techniques. Among them, two algorithms are parallel and pipelined versions of traditional sort-merge join methods, two algorithms use both hashing and sort-merge techniques, and another two are variations of the hybrid hash join algorithms. The performance of those algorithms is evaluated analytically against a generic database machine architecture. The methodology used in the design and evaluation of these algorithms is also discussed. \par The results of the analysis indicate that using a hashing technique to partition the source relations can dramatically reduce the elapsed time hash-based algorithms outperform sort-merge algorithms in almost all cases because of their high parallelism. Hash-based sort-merge and hybrid hash methods provide similar performance in most cases. With large source relations, the algorithms which replicate the smaller relation usually give better elapsed time. Sharing memory among processors also improves performance somewhat.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Design; Performance; Theory", subject = "Information Systems --- Database Management --- Logical Design (H.2.1): {\bf Data models}; Mathematics of Computing --- Numerical Analysis --- General (G.1.0): {\bf Parallel algorithms}", } @InProceedings{Ruchte:1987:LHP, author = "Willard D. Ruchte and Alan L. Tharp", title = "Linear Hashing with Priority Splitting: a Method for Improving the Retrieval Performance of Linear Hashing", crossref = "IEEE:1987:DEP", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "2--9", year = "1987", ISBN = "0-8186-0762-9", ISBN-13 = "978-0-8186-0762-2", LCCN = "QA76.9.D3I5582 1987", bibdate = "Tue May 12 09:48:44 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The authors present a straightforward modification of linear hashing which, according to experimental results, significantly reduces the average number of retrieval probes in almost all cases when compared with standard linear hashing. The parameter of overflow page size is an important one for adjusting performance. By choosing an appropriate overflow page size, the user may obtain results that are better or comparable to those of other variants of linear hashing. In addition, the paper analyzes the effects of varying the primary page size, the overflow page size, and the packing factor on retrieval performance.", acknowledgement = ack-nhfb, affiliationaddress = "North Carolina State Univ, Raleigh, NC, USA", classification = "723; 903", conference = "Proceedings --- Third International Conference on Data Engineering.", keywords = "data processing --- File Organization; information retrieval systems; linear hashing; page size; Performance", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Sacks-Davis:1987:MAM, author = "R. Sacks-Davis and A. Kent and K. Ramamohanarao", key = "Sacks-Davis et al.", title = "Multikey Access Methods Based on Superimposed Coding Techniques", journal = j-TODS, volume = "12", number = "4", pages = "655--696", month = dec, year = "1987", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Tue Jan 26 14:49:21 1988", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Both single-level and two-level indexed descriptor schemes for multikey retrieval are presented and compared. The descriptors are formed using superimposed coding techniques and stored using a bit-inversion technique. A fast-batch insertion algorithm for which the cost of forming the bit-inverted file is less than one disk access per record is presented. For large data files, it is how that the two-level implementation is generally more efficient for queries with a small number of matching records. For queries that specify two or more values, there is a potential problem with the two-level implementation in that costs may accure when blocks of records match the query but individual records within these blocks do not. One approach to overcoming this problem is to set bits in the descriptors based on pairs of indexed terms. This approach is presented and analyzed.", acknowledgement = ack-nhfb, keywords = "descriptors; Design; hashing; partial match retrieval; performance; record signatures; superimposed coding", } @InProceedings{Shultz:1987:TSM, author = "R. Shultz and I. Miller", key = "Shultz \& Miller", booktitle = "Proceedings of the International Conference on Data Engineering", title = "Tree Structured Multiple Processor Join Methods", organization = "IEEE Computer Society", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "190--199", month = feb, year = "1987", bibdate = "Thu Jul 14 16:46:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper summarizes the execution cost of join operations performed by parallel executing processors. Four different parallel join algorithms are proposed for execution on multiple processing nodes, interconnected on a tree structured communication network. Secondary storage is accessed in parallel by leaf nodes. An average execution cost analysis is presented for the multiple processor join methods. For a reasonable ratio of result to operand cardinality, joins which use hashing for semi-join of operands at the leaf node secondary storage interface are predicted to perform better than nested-loop and sort-merge joins. Both node memory capacity and join result cardinality have a large influence on the relative performance of the join methods. This analysis method forms a basis for selecting among alternative processing methods for statically linked, multiple processor computer architectures.", acknowledgement = ack-nhfb, } @Article{Snader:1987:LFH, author = "Jon C. Snader", title = "Look it up faster with hashing", journal = j-BYTE, volume = "12", number = "1", pages = "128--144", month = jan, year = "1987", CODEN = "BYTEDJ", ISSN = "0360-5280", bibdate = "Tue Jul 19 00:28:00 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Snader:1987:LIF, author = "Jon C. Snader", title = "Loop It up Faster with Hashing", journal = j-BYTE, volume = "12", number = "l", month = jan, year = "1987", CODEN = "BYTEDJ", ISSN = "0360-5280", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Many applications in programming require to store and retrieve information in tabular form. One method that minimizes the number of comparisons needed to find an item is the binary search. Unfortunately, the binary search suffers from two defects that limit its application. First, it requires that the table it is searching be in sorted order. Second, because of the first requirement, it is difficult to add items to the table. Quite frequently, the addition of a new item into an unsorted table is required. Table lookup methods classified as hashing schemes, or hash-table techniques, not only meet the two objections above but are usually faster than the binary search. Although several hashing schemes are known and in use, they divide into two subclasses known as chaining techniques and open-addressing techniques each type is examined, in turn some examples are given and their strengths and weaknesses are compared. For those who want to delve more deeply into the subject, the results of some recent research in this area are indicated and some references are provided.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of South Florida, Tampa, FL, USA", classification = "703; 902", journalabr = "Byte", keywords = "binary search; chaining techniques; computer programs; computer systems programming; hash-table techniques; hashing schemes; information retrieval systems --- Online Searching; open-addressing techniques; Table Lookup", pagecount = "9p between p l29 and l44", } @Book{Stubbs:1987:DSA, author = "Daniel F. Stubbs and Neil W. Webre", title = "Data Structures with Abstract Data Types and Modula-2", publisher = pub-BC, address = pub-BC:adr, pages = "xx + 556", year = "1987", ISBN = "0-534-07302-6", ISBN-13 = "978-0-534-07302-2", LCCN = "QA76.9.D35 S76 1987", bibdate = "Tue Jul 19 00:33:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Textbook treatment of hashing.", price = "US\$43.25", acknowledgement = ack-nhfb, } @Article{Terashima:1987:EPL, author = "Motoaki Terashima", title = "Extended Property List --- its Concept and Applications", journal = j-J-INF-PROCESS, volume = "10", number = "3", pages = "154--160", year = "1987", 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 = "The extended plist (property list) designed as a generalization of the plist of LISP is described with its software implementation using a hash scheme. The extended plist contains n-tuple data as the indicators and is compatible with the usual plist on the functions in use and the structure being implemented. The hash scheme is used to speed up the extended plist retrieval. Automatic reclaiming of inactive extended plist releases LISP programmers from the duty of storage management for the extended plist. The extended plist is also used to establish the modularity for naming systems.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Electro-Communications, Chofu, Jpn", classification = "723", journalabr = "J Inf Process", keywords = "computer programming languages --- lisp; data processing; Data Structures; extended plist retrieval; extended property list; hash scheme", } @Article{Valduriez:1987:JI, author = "Patrick Valduriez", title = "Join indices", journal = j-TODS, volume = "12", number = "2", pages = "218--246", month = jun, year = "1987", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Tue Jul 19 00:23:35 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Compares join indices with inverted indices, clustered indices, B+ trees, linked lists, and hybrid hash techniques.", acknowledgement = ack-nhfb, } @InProceedings{Varghese:1987:HHT, author = "George Varghese and Tony Lauck", title = "Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility", crossref = "ACM:1987:PEA", pages = "25--38", year = "1987", bibdate = "Thu Jul 14 01:55:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Published as ACM Operating Systems Review, SIGOPS, volume 21, number 5.", acknowledgement = ack-nhfb, } @Book{Vitter:1987:DAC, author = "Jeffrey Scott Vitter and Wen-Chin Chen", title = "The Design and Analysis of Coalesced Hashing", publisher = pub-OUP, address = pub-OUP:adr, pages = "xii + 160", year = "1987", ISBN = "0-19-504182-8", ISBN-13 = "978-0-19-504182-8", LCCN = "QA76.9.H36 V57 1987", bibdate = "Sat Jul 16 01:13:38 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$29.95", acknowledgement = ack-nhfb, } @Book{Wiederhold:1987:FOD, author = "Gio Wiederhold", title = "File Organisation For Database Design", publisher = pub-MH, address = pub-MH:adr, pages = "xiv + 619", year = "1987", ISBN = "0-07-070133-4", ISBN-13 = "978-0-07-070133-5", LCCN = "QA76.9.F5 W53 1987", bibdate = "Wed Jul 13 18:49:02 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$38.95", acknowledgement = ack-nhfb, descriptor = "Datenorganisation, Hashing, Index, Kryptographie, Speicherstruktur, Datei", } @Book{Wiedermann:1987:SA, author = "Juraj Wiedermann", title = "Searching Algorithms", publisher = pub-TEUBNER, address = pub-TEUBNER:adr, pages = "123", year = "1987", ISBN = "3-322-00433-3", ISBN-13 = "978-3-322-00433-8", LCCN = "QA76.9.D35 W525 1987", bibdate = "Sun Jul 17 11:14:22 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Wu:1987:ASM, author = "C. T. Wu and Walter A. Burkhard", title = "Associative Searching in Multiple Storage Units", journal = j-TODS, volume = "12", number = "1", pages = "38--64", month = mar, year = "1987", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Tue Jul 19 00:15:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses interpolation hashing, a multidimensional variant of linear hashing.", acknowledgement = ack-nhfb, } @TechReport{Adi:1988:DCC, author = "W. Adi", title = "Design Criteria and Complexity Evaluation of a Hash-based Join Processor", institution = "Technischen Universit{\"{a}}t Carolo-Wilhelmina zu Braunschweig", address = "Braunschweig, Germany", pages = "??", year = "1988", bibdate = "Sat Dec 30 09:28:57 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Hash-join, Join, Mikroprogramierung, Spezialhardware", } @InProceedings{Anderson:1988:PHK, author = "Paul B. Anderson", booktitle = "2nd Symposium on the Frontiers of Massively Parallel Computation (Oct 10--12 1988: Fairfax, VA, USA)", title = "Parallel hashed key access on the Connection Machine", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "643--645", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 88CH2649-2.", abstract = "The author discusses retrieval of a number of keys in parallel from a single hash table. The algorithm is a data parallel adaptation of a familiar sequential method. Changes made to suit the single-instruction stream, multiple-data stream Connection Machine are described. Running time is proportional to the maximum run of collisions rather than the average number. The algorithm was developed as a portion of a large X-ray crystallography application for the Connection Machine. The generality of the scheme makes it useful for other massively parallel applications.", acknowledgement = ack-nhfb, affiliation = "Planning Research Corp, McLean, VA, USA", classification = "722; 723; 933", conference = "Proceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations", conferenceyear = "1988", keywords = "Computer Architecture; Computer Systems Programming--Table Lookup; Computer Systems, Digital; Connection Machines; Crystals--X-Ray Analysis; Hash Tables; Parallel Processing", meetingabr = "Proc 2nd Symp Front Massively Parallel Comput", meetingaddress = "Fairfax, VA, USA", meetingdate = "Oct 10--12 1988", meetingdate2 = "10/10--12/1988", publisherinfo = "IEEE Service Center", } @TechReport{Barak:1988:HFS, author = "Amnon Barak and Bernard A. Galler and Yaron Farber", title = "A Holographic File System for a Multicomputer with Many Disk Nodes", number = "88-6", institution = "Dept. of Computer Science, Hebrew University of Jerusalem", pages = "??", month = may, year = "1988", bibdate = "Thu Jul 21 09:38:14 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, comment = "Describes a file system for a distributed system that scatters records of each file over many disks using hash functions. The hash function is known by all processors, so no one processor must be up to access the file. Any portion of the file whose disknode is available may be accessed. Shadow nodes are used to take over for nodes that go down, saving the info for later use by the proper node. Intended to easily parallelize read/write accesses and global file operations, and to increase file availability.", keywords = "parallel I/O, hashing, reliability, disk mirroring, pario bib", } @Article{Bennett:1988:PAP, author = "Charles H. Bennett and Gilles Brassard and Jean-Marc Robert", title = "Privacy Amplification by Public Discussion", journal = j-SIAM-J-COMPUT, volume = "17", number = "2", pages = "210--229", month = apr, year = "1988", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", bibdate = "Tue Jul 19 00:46:03 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Applies hash functions to problems of error correction in messages.", acknowledgement = ack-nhfb, } @Article{Bernstein:1988:OCE, author = "D. Bernstein and H. Boral and R. Y. Pinter", title = "Optimal Chaining in Expression Trees", journal = j-IEEE-TRANS-COMPUT, volume = "37", number = "11", pages = "1366--1374", month = nov, year = "1988", CODEN = "ITCOB4", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Jul 19 01:01:38 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Bradley:1988:BFP, author = "James Bradley", title = "Business file processing!: {COBOL}, {CICS}, and {SQL}", publisher = pub-MITCHELL, address = pub-MITCHELL:adr, pages = "400", year = "1988", ISBN = "0-394-39217-5", ISBN-13 = "978-0-394-39217-2", LCCN = "QA76.9.F5 B725 1988", bibdate = "Sat Nov 12 21:03:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Includes two chapters on hash file processing.", price = "US\$28.00", acknowledgement = ack-nhfb, } @Article{Brassard:1988:GRP, author = "Gilles Brassard and Sampath Kannan", title = "The generation of random permutations on the fly", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "207--212", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P05 (68Q20)", MRnumber = "89h:68016", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Montreal, Montreal, Que, Can", classification = "723; 921", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; balanced trees; computer programming; continuous rehashing; data processing --- Data Structures; design; design of algorithms; mathematical techniques --- Trees; random permutations; theory", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS \\ E.1 Data, DATA STRUCTURES \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", } @Article{Cercone:1988:FAP, author = "Nick Cercone", title = "Finding and Applying Perfect Hash Functions", journal = j-APPL-MATH-LETT, volume = "1", number = "1", pages = "25--28", year = "1988", CODEN = "AMLEEL", ISSN = "0893-9659", bibdate = "Tue Jul 19 01:37:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Chan:1988:OMP, author = "M. Y. Chan and W. L. Chung", title = "Optimal multidisk partial match file designs", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "149--155", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Dallas, Richardson, TX, USA", classification = "723; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA", journalabr = "Inf Process Lett", keywords = "data processing; design; disk modulo allocation; file buckets; file organisation; File Organization; hashing functions; information science --- Information Retrieval; management; multidisk file design; multidisk partial match file designs; multiple independently accessible disks; optimal assignments; optimisation; partial match queries; partial match query; redundancy; theory; verification", pubcountry = "Netherlands A07", subject = "H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management, File organization", treatment = "T Theoretical or Mathematical", } @Article{Chang:1988:APC, author = "C. C. Chang", title = "Application of Principal Component Analysis to Multi-Disk Concurrent Accessing", journal = "BIT (Copenhagen)", volume = "28", number = "2", pages = "205--214", year = "1988", 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 = "This paper is concerned with the allocation of multi-attribute records on several disks so as to achieve high degree of concurrency of disk access when responding to partial match queries. An algorithm to distribute a set of multi-attribute records onto different disks is presented. Principal component analysis is introduced and used to generate a set of real numbers which are the projections on the first principal component direction and can be viewed as hashing addresses. Then we propose an algorithm based upon these hashing addresses to allocate multi-attribute records onto different disks. Some experimental results show that our method can indeed be used to solve the multi-disk data allocation problem for concurrent accessing.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "computer operating systems; computer programming --- Algorithms; concurrent access; hashing addresses; multiattribute records; multidisk data allocation; Storage Allocation", } @Article{Chang:1988:OMP, author = "C. C. Chang and C. H. Chang", title = "An Ordered Minimal Perfect Hashing Scheme with Single Parameter", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "79--83", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper proposes a new ordered minimal perfect hashing scheme with only one parameter. By applying our hashing functions, all keys can be stored in ascending order. There is one very straightforward formula to compute the only parameter C, that requires O(n log//2K//n) time, where n is the total number of keys and k//n is the key with maximum magnitude.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723", journalabr = "Inf Process Lett", keywords = "addition chain method; algorithms; computer programming --- Algorithms; data processing; File Organization; hash-table representation; hashing functions; ordered minimal perfect hashing; theory; verification", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms", } @MastersThesis{Datta:1988:IPH, author = "S. Datta", title = "Implementation of a Perfect Hashing Function Scheme", type = "M.S. Thesis", number = "TR-89-9", school = inst-VIRGINIA-POLY-CS, address = inst-VIRGINIA-POLY-CS:adr, pages = "??", month = mar, year = "1988", bibdate = "Thu Jul 21 08:49:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Dietzfelbinger:1988:DPH, author = "M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. Meyer {auf der Heide} and H. Rohnert and R. E. Tarjan", title = "Dynamic perfect hashing: Upper and lower bounds", crossref = "IEEE:1988:ASF", pages = "524--531", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A randomized algorithm is given for the dictionary problem with O(1) worst-case time for lookup and O(1) amortized expected time for insertion and deletion. An \$Omega@(log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes. If the worst-case lookup time is restricted to k, then the lower bound for insertion becomes \$Omega@(kn${}^{1/ k}$).", acknowledgement = ack-nhfb, affiliation = "Univ Dortmund, West Ger", classification = "723", journalabr = "Annu Symp Found Comput Sci Proc", keywords = "Computer Programming--Algorithms; Data Processing; Dictionary Problem; Dynamic Perfect Hashing; File Organization; Lower Bounds; Randomized Algorithms", } @Article{Ellis:1988:CEH, author = "Carla Schlatter Ellis", title = "Concurrency in Extendible Hashing", journal = j-INFO-SYS, volume = "13", number = "1", pages = "97--109", month = jan, year = "1988", 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 = "Hashing has long been recognized as a fast method for accessing records by key in large, relatively static databases. However, when the amount of data is likely to grow significantly, traditional hashing suffers from performance degradation and may eventually require rehashing all the records into a larger space. Recently, a number of techniques for dynamic hashing have appeared. In this paper, we present a solution to allow for concurrency in one of these dynamic hashing data structures, namely extendible hashfiles. The solution is based on locking protocols and minor modifications in the data structure.", acknowledgement = ack-nhfb, affiliationaddress = "Duke Univ, Durham, NC, USA", classification = "723", journalabr = "Inf Syst", keywords = "concurrency; concurrent algorithms; data processing --- File Organization; database systems; dynamic hashing; extendible hashing; InfSys", } @Article{Enbody:1988:DHS, author = "R. J. Enbody and H. C. Du", key = "Enbody \& Du", title = "Dynamic Hashing Schemes", journal = j-COMP-SURV, volume = "20", number = "2", pages = "85--113", month = jun, year = "1988", CODEN = "CMSVAN", DOI = "http://doi.acm.org/10.1145/46157.330532", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Thu Jun 19 09:37:30 MDT 2008", bibsource = "Compendex database; compsurv.bib; http://www.acm.org/pubs/contents/journals/surveys/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A new type of dynamic file access called {\em dynamic hashing\/} has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ, East Lansing, MI, USA", classification = "723", journalabr = "Comput Surv", keywords = "data processing; database management; database systems; dynamic file access; dynamic hashing; Dynamic hashing; File Organization; hash-table representations", } @Article{Faloutsos:1988:GCP, author = "Christos Faloutsos", title = "{Gray} codes for partial match and range queries", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "14", number = "10", pages = "1381--1393", month = oct, year = "1988", 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 = "It is suggested that Gray codes be used to improve the performance of methods for partial match and range queries. Specifically, the author illustrates the improved clustering of similar records that Gray codes can achieve with multiattribute hashing. Gray codes are used instead of binary codes to map record signatures to buckets. In Gray codes, successive codewords differ in the value of exactly one bit position; thus, successive buckets hold records with similar record signatures. The proposed method achieves better clustering of similar records, thus reducing the I/O time. A mathematical model is developed to derive formulas giving the average performance of both methods, and it is shown that the proposed method achieves 0-50\% relative savings over the binary codes. The author also discusses how Gray codes could be applied to some retrieval methods designed for range queries, such as the grid file and the approach based on the so-called z-ordering. Gray codes are also used to design good distance-preserving functions, which map a k-dimensional (k-D) space into a one-dimensional one, in such a way that points are close in the k-D space are likely to be close in the 1-D space.", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland, College Park, MD, USA", classification = "723", conference = "1986 Workshop on Software Testing, Papers", journalabr = "IEEE Trans Software Eng", keywords = "codes, symbolic; computer aided design; database systems; distance-preserving mappings; gray codes; information retrieval systems; multiattribute hashing; partial match queries; Query Languages; secondary key retrieval; vision --- Artificial", meetingaddress = "Banff, Alberta, Can", meetingdate = "Jul 1986", meetingdate2 = "1986 Jul", remark = "Gray codes can produce signatures to cluster and maintain bucket sequences due to one-bit differences versus multi-at\-tribute hashing. Also applicable to grid-files.", sponsor = "IEEE, Computer Soc, Los Alamitos, CA, USA", } @Book{Feldman:1988:DSM, author = "Michael B. Feldman", title = "Data Structures with Modula-2", publisher = pub-PH, address = pub-PH:adr, pages = "xvii + 301", year = "1988", ISBN = "0-13-197344-4", ISBN-13 = "978-0-13-197344-2", LCCN = "QA76.73.M63 F45 1988", bibdate = "Tue Jul 19 00:36:14 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Includes chapter on hash tables.", price = "US\$40.00", acknowledgement = ack-nhfb, } @InProceedings{Fiat:1988:NOH, author = "A. Fiat and M. Naor and J. P. Schmidt and A. Siegel", title = "Non-oblivious hashing", crossref = "ACM:1988:PTA", pages = "367--376", year = "1988", bibdate = "Mon Jul 18 10:24:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Fox:1988:MCE, author = "Edward A. Fox and Qi-Fan Chen and Lenwood Heath and Sanjeev Datta", title = "A More Cost Effective Algorithm for Finding Perfect Hash Functions", number = "TR 88-30", institution = inst-VIRGINIA-POLY-CS, address = inst-VIRGINIA-POLY-CS:adr, pages = "11", year = "1988", bibdate = "Thu Jul 21 14:41:23 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Electronic mail to \path=fox@fox.cs.vt.edu=.", acknowledgement = ack-nhfb, } @InProceedings{Fuerer:1988:UHV, author = "M. F{\"u}rer", title = "Universal Hashing in {VLSI}", crossref = "Reif:1988:AWC", pages = "312--318", month = jun, year = "1988", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Gonnet:1988:EHL, author = "Gaston H. Gonnet and Per-{\AA}ke Larson", title = "External Hashing with Limited Internal Storage", journal = j-J-ACM, volume = "35", number = "1", pages = "161--184", month = jan, year = "1988", 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 following problem is studied: How, and to what extent, can the retrieval speed of external hashing be improved by storing a small amount of extra information in internal storage? Several algorithms that guarantee retrieval in one access are developed and analyzed. In the first part of the paper, a restricted class of algorithms is studied, and a lower bound on the amount of extra storage is derived. An algorithm that achieves this bound, up to a constant difference, is also given. In the second part of the paper a number of restrictions are relaxed and several more practical algorithms are developed and analyzed. The last one, in particular, is very simple and efficient.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; data processing; external hashing; File Organization; limited internal storage; retrieval speed", remark = "External hashing with signatures. Information-theoretic lower bound on the number of bits per bucket.", review = "ACM CR 8902--0062", } @TechReport{Graefe:1988:RDF, author = "Goetz Graefe", title = "Relational Division: Four Algorithms and Their Performance", institution = "????", address = "Beaverton, OR, USA", pages = "??", year = "1988", bibdate = "Thu Jul 21 09:38:16 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Algebra-operator, Hash-division, Relationale Division", remark = "Es Werden Drei Bekannte Algorithmen fuer Relationale Division, der Algebra-operator, der Benutzt Wird, Um Universelle Quantifizierung Auszudruecken, und ein Neuer Algorithmus, die Hash-division, Vorgestellt. Technical Report No. CS/E 88-022.", } @Book{Harbron:1988:FSS, author = "Thomas R. Harbron", title = "File Systems: Structures and Algorithms", publisher = pub-PH, address = pub-PH:adr, pages = "xv + 254", year = "1988", ISBN = "0-13-314709-6", ISBN-13 = "978-0-13-314709-4", LCCN = "QA76.9.F5 H37 1988", bibdate = "Tue Jul 19 00:50:46 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$33.00", acknowledgement = ack-nhfb, remark = "Basic Concepts, Devices, sequential chronological (6 standard functions), relative(direct), ordered, direct(hash), extendible hash, indexed sequential, indexes, multi-indexed, database systems. no references!", } @Book{Hille:1988:DAP, author = "Reinhold F. Hille", title = "Data Abstraction and Program Development using Pascal", publisher = pub-PH, address = pub-PH:adr, pages = "xi + 259", year = "1988", ISBN = "0-13-196552-2", ISBN-13 = "978-0-13-196552-2", LCCN = "QA76.9.A23 H55 1988", bibdate = "Tue Jul 19 00:51:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Chapter 6 discusses hash tables.", price = "US\$42.00", series = "Advances in Computer Science Series.", acknowledgement = ack-nhfb, } @Article{Hong:1988:IMM, author = "Jiawei Hong and Haim Wolfson", title = "Improved model-based matching method using footprints", journal = "Proceedings --- International Conference on Pattern Recognition", pages = "72--78", year = "1988", CODEN = "PICREG", ISBN = "0-8186-0878-1", ISBN-13 = "978-0-8186-0878-0", LCCN = "Q 327 I615 1988", bibdate = "Tue May 12 09:48:51 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2614-6). Piscataway, NJ, USA.", abstract = "A method for recognition of partially occluded and overlapping objects in composite scenes is presented. The objects to be recognized belong to a large database of model objects which are known in advance. A geometric hashing technique which is an improvement of a previous technique due to J. T. Schwartz and M. Sharir (1987) is proposed. The algorithm's complexity is linear in the number of sample points on the boundary of the composite scene. Experimental results from large databases are presented, including results that could not be obtained by the previous technique.", acknowledgement = ack-nhfb, affiliation = "New York Univ, New York, NY, USA", classification = "723; 921", conference = "9th International Conference on Pattern Recognition", conferenceyear = "1988", journalabr = "Proc Int Conf Pattern Recognit", keywords = "Computer Programming--Algorithms; Database Systems; Geometric Hashing Technique; Image Matching; Mathematical Techniques--Geometry; Object Recognition; Overlapping Objects; Partially Occluded Objects; Pattern Recognition", meetingaddress = "Rome, Italy", meetingdate = "Nov 14--17 1988", meetingdate2 = "11/14--17/88", publisherinfo = "IEEE Service Center", sponsor = "Int Assoc for Pattern Recognition, Paris, Fr", } @InProceedings{Hoshi:1988:AHF, author = "Mamoru Hoshi and Hajime Sato and Kingo Kobayashi", booktitle = "IEEE 1988 International Symposium on Information Theory --- Abstracts of papers", title = "Arithmetic hash functions", volume = "25 n 13", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "156--157", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2621-1). Piscataway, NJ, USA.", abstract = "Summary form only given. The authors have obtained a hash function by applying the arithmetic coding method to make full use of the nonuniformity of key generation. The resulting arithmetic hash function has good properties such as order-preservation, small probability of collision, and ease of computation. Experimental results have shown that the access cost of the arithmetic hash function is about 65\% less than that of the division method.", acknowledgement = ack-nhfb, affiliation = "Chiba Univ, Chiba, Jpn", classification = "723; 731", conferenceyear = "1988", keywords = "Abstract Only; Arithmetic Coding; Arithmetic Hash Functions; Codes, Symbolic; Key Generation; Signal Processing--Signal Encoding", meetingabr = "IEEE 1988 Int Symp on Inf Theory Abstr of Pap", meetingaddress = "Kobe, Jpn", meetingdate = "Jun 19--24 1988", meetingdate2 = "1988 Jun 19--24", sponsor = "IEEE, Information Theory Group, New York, NY, USA; Inst of Electronics, Information \& Communication Engineers of Japan, Jpn", } @Article{Hsiao:1988:AH, author = "Yeong-Shiou S. Hsiao and Alan L. Tharp", title = "Adaptive Hashing", journal = j-INFO-SYS, volume = "13", number = "1", pages = "111--127", year = "1988", 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 = "Adaptive hashing is a new file processing scheme which combines the organization of a B plus -Tree with the operational algorithms of order-preserving linear hashing, and in so doing, it fully utilizes the advantages of both. Its performance, which can be controlled by a single parameter, is stable under all circumstances. Its storage utilization is nearly 80 percent at any time under any circumstances. No other file organization or algorithms are known which attain such stable and predictable performance.", acknowledgement = ack-nhfb, affiliationaddress = "North Carolina State Univ, Raleigh, NC, USA", classification = "723", journalabr = "Inf Syst", keywords = "access method; adaptive hashing; computer programming --- Algorithms; data processing; direct access; File Organization; InfSys; sequential access", } @InProceedings{Hutflesz:1988:GOP, author = "Andreas Hutflesz and Hans-Werner Six and Peter Widmayer", title = "Globally Order Preserving Multidimensional Linear Hashing", crossref = "IEEE:1988:PFI", pages = "572--579", year = "1988", 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.", abstract = "The authors present a dynamic, globally order-preserving hashing technique, based on linear hashing, where the spatial proximity of points is preserved beyond data buckets. The method adaptively generates a bucket numbering, which is a flexible variant of the well-known z-ordering. In addition to the standard dictionary operations, the authors' dynamic z-hashing scheme supports the efficient implementation of proximity queries.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Karlsruhe, West Ger", classification = "722; 723; 921", keywords = "bucket numbering; data processing --- File Organization; data storage units; database systems; globally order-preserving hashing; linear hashing; mathematical techniques --- Algorithms; proximity queries; z-ordering and hashing", } @Article{Itano:1988:IPM, author = "Kozo Itano and Yutaka Sato and Hidemi Hirai and Tomoyoshi Yamagata", title = "An incremental pattern matching algorithm for the pipelined lexical scanner", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "253--258", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakura-mura, Jpn", classification = "723; C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; assemblers; C programs; compact binary form; compilers; computer programming; computer programming languages --- Pascal; computer systems, digital --- Parallel Processing; file organisation; hashing; incremental pattern matching algorithm; interpreters; language processors; languages; lexical scanning algorithm; measurement; Pascal programs; performance; pipeline processing; pipelined lexical scanner; program assemblers; program compilers; program interpreters; string compaction; theory; variable-length character strings", pubcountry = "Netherlands A06", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "P Practical", } @Article{Jan:1988:ALK, author = "Jinn-Ke Jan and Chin-Chen Chang", title = "Addressing for Letter-Oriented Keys", journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers", volume = "11", number = "3", pages = "279--284", month = may, year = "1988", CODEN = "JCIEEZ, CKCKDZ", ISSN = "0253-3839", 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 presents a new algorithm for hashing. In this approach each key (x, y) is denoted as a pair of letters, and this pair is extracted from each letter-oriented key in the key space according to a certain pre-determined extraction algorithm. Hashing functions are presented for the keys (x, y). These functions allow single probe retrieval from a minimally-sized space of letter-oriented keys. Various uses can be applied, such as searching reserved words in compilers and filtering frequently used words in natural language processing.", acknowledgement = ack-nhfb, affiliation = "Natl Chung Hsing Univ", affiliationaddress = "Taichung, Taiwan", classification = "722; 723; 903", journalabr = "Zhongguo Gongchen Xuekan; Chung kuo Kung Ch'eng Hsueh K'an", keywords = "Algorithms; computer peripheral equipment; Computer Programming; computer programming --- Algorithms; Data Processing --- File Organization; Extraction Algorithm; Information Science --- Information Retrieval; Keyboards; letter-oriented key; Letter-Oriented Keys; minimal perfect hashing; Minimal Perfect Hashing; Single Probe Retrieval", } @Book{Jones:1988:FTV, author = "Russell K. Jones and Tracy Crabtree", title = "{FORTRAN} tools for {VAX\slash VMS} and {MS-DOS}", publisher = pub-JW, address = pub-JW:adr, pages = "xii + 447", year = "1988", ISBN = "0-471-61976-0", ISBN-13 = "978-0-471-61976-5", LCCN = "QA76.73.F25 J66 1988", bibdate = "Tue Jul 19 01:03:25 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Hash tables are used in the implementation of a FORTRAN preprocessor for macro statements.", price = "US\$29.95", acknowledgement = ack-nhfb, } @Article{Karlin:1988:PHE, author = "Anna R. Karlin and Eli Upfal", title = "Parallel Hashing: An Efficient Implementation of Shared Memory", journal = j-J-ACM, volume = "35", number = "4", pages = "876--892", month = oct, year = "1988", 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 = "A central issue in the theory of parallel computation is the gap between the ideal models that utilize shared memory and the feasible models that consist of a bounded-degree network of processors sharing no common memory. This problem has been widely studied. Here a tight bound for the probabilistic complexity of this problem is established. The solution in this paper is based on a probabilistic scheme for implementing shared memory on a bounded-degree network of processors. This scheme, which we term parallel hashing, enables $n$ processors to store and retrieve an arbitrary set of $n$ data items in $O(\log n)$ parallel steps. The items' locations are specified by a function chosen randomly from a small class of universal hash functions. A hash function in this class has a small description and can therefore be efficiently distributed among the processors. A deterministic lower bound for the point-to-point communication model is also presented.", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, USA", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "Computer Programming --- Algorithms; Computer Systems, Digital --- Parallel Processing; Data Processing; Deterministic Lower Bound; File Organization; Parallel Algorithms; Parallel Hashing; Shared Memory", } @Article{Kelley:1988:MEH, author = "Keith L. Kelley and Marek Rusinkiewicz", title = "Multikey, extensible hashing for relational databases", journal = j-IEEE-SOFTWARE, volume = "5", number = "4", pages = "77--85", month = jul, year = "1988", CODEN = "IESOEG", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; Database/Wiederhold.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; Misc/hash.bib", abstract = "The design and implementation of a multikey, extensible hashing file addressing scheme and its application as an access method for a relational database are presented. This file organization was developed for Request, a testbed relational database-management system. It offers viable alternative to indexed sequential files. Access operations, concurrency control, and relational operations are examined. Results of an experimental evaluation are reported.", acknowledgement = ack-nhfb, affiliation = "IBM, Houston, TX, USA", classification = "723", journalabr = "IEEE Software", keywords = "concurrency control; data processing --- File Organization; database systems; extensible hashing; multikey extensible hashing; radix search trees; Relational; request database management system", remark = "Support sequential, full-key, and partial-key retrieval, concurrent access and primary key (optional uniqueness); uses multi-level bucket splitting.", } @Article{Knott:1988:LOA, author = "Gary D. Knott", title = "Linear Open Addressing and {Peterson's} Theorem Rehashed", journal = "BIT (Copenhagen)", volume = "28", number = "2", pages = "364--371", year = "1988", 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 = "Linear open addressing is a venerable hashing collision resolution method which exhibits primary clustering when items are stored. Linear open addressing is a 1-successor method as defined herein, but such methods do not exhaust the class of primary clustering methods. Being a primary clustering method does not, therefore, characterize linear open addressing. Linear open addressing is shown here to be characterized, however, by a description due to W. W. Peterson that the expected retrieval cost is independent of the order in which items arrive to be stored.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "723", journalabr = "BIT (Copenhagen)", keywords = "data processing; File Organization; hashing collision resolution; linear open addressing; Peterson's theorem; primary clustering; retrieval cost", } @InProceedings{Korner:1988:LDS, author = "J. Korner and G. Simonyi", booktitle = "IEEE 1988 International Symposium on Information Theory --- Abstracts of papers", title = "Locally different sequences", volume = "25 n 13", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "61--??", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2621-1). Piscataway, NJ, USA.", abstract = "Summary form only given. Let B be an alphabet of b elements. It is said that C in B${}^t$ is k-in-l-different if for any subject D in C of cardinality k there exist l coordinates such that the k elements of D are all different already when restricted to those l coordinates. For fixed b, k, and l the asymptotics of the largest possible size of C in B${}^t$ as t grows to infinity has been investigated. For l $=$ 1 the problem specializes to the widely investigated question of perfect hashing.", acknowledgement = ack-nhfb, affiliation = "Hungarian Acad of Sciences, Budapest, Hung", classification = "731; 921", conferenceyear = "1988", keywords = "Abstract Only; Codes Distance Problem; Codes, Symbolic; Locally Different Sequences; Mathematical Programming, Linear; Perfect Hashing; Shannon Theory", meetingabr = "IEEE 1988 Int Symp on Inf Theory Abstr of Pap", meetingaddress = "Kobe, Jpn", meetingdate = "Jun 19--24 1988", meetingdate2 = "1988 Jun 19--24", sponsor = "IEEE, Information Theory Group, New York, NY, USA; Inst of Electronics, Information \& Communication Engineers of Japan, Jpn", } @Article{Korner:1988:NBP, author = "J. Korner and K. Marton", title = "New Bounds for Perfect Hashing via Information Theory", journal = j-EUR-J-COMB, volume = "9", number = "6", pages = "523--??", day = "1", month = nov, year = "1988", CODEN = "EJOCDI", ISSN = "0195-6698", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Korner:1988:RAC, author = "J. Korner and K. Marton", title = "Random Access Communication and Graph Entropy", journal = j-IEEE-TRANS-INF-THEORY, volume = "34", number = "2", pages = "312--314", month = mar, year = "1988", CODEN = "IETTAW", DOI = "http://dx.doi.org/10.1109/18.2639", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A probabilistic problem that arise from conflict resolution in random-access communication is treated. An earlier conjecture is disproved and a technique for finding lower bounds on the number of graphs of given structure needed to cover all edges of a given graph is developed.", acknowledgement = ack-nhfb, affiliationaddress = "HAS, Budapest, Hung", classification = "716; 718; 731; 921; 922", journalabr = "IEEE Trans Inf Theory", keywords = "conflict resolution; connection with perfect hashing; graph entropy; information theory; mathematical techniques --- Graph Theory; Multiplexing; probability --- Random Processes; random access communication; telecommunication systems", } @Book{Kriegel:1988:PGF, author = "Hans-Peter Kriegel and Bernhard Seeger", title = "{PLOP-Hashing}: a Grid File without Directory", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "369--376", year = "1988", ISBN = "0-8186-0827-7", ISBN-13 = "978-0-8186-0827-8", LCCN = "QA 76.9 D3 I5582 1988", bibdate = "Tue May 12 09:49:15 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The authors consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, they suggest using piecewise linear expansions to distribute the load more evenly over the pages of the file. The resulting piecewise linear order preserving hashing scheme (PLOP-Hashing) is then compared to the two-level grid file, which turned out to be the most popular scheme in practical applications.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Bremen, West Ger", classification = "723; 921", conference = "Proceedings --- Fourth International Conference on Data Engineering.", keywords = "data processing; database systems --- Mathematical Models; File Organization; independent multidimensional record distribution; mathematical techniques --- Piecewise Linear Techniques; multidimensional dynamic hashing (MDH); multidimensional hashing schemes; piecewise linear expansions; piecewise linear order preserving (PLOP)-hashing", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Kriegel:1988:PHG, author = "H. P. Kriegel and B. Seeger", title = "{PLOP}-Hashing: {A} Grid File without Directory", crossref = "IEEE:1988:PFI", pages = "369", year = "1988", bibdate = "Sat Jul 16 19:24:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Lamdan:1988:GHG, author = "Yehezkel Lamdan and Haim J. Wolfson", title = "Geometric Hashing: {A} General and Efficient Model-Based Recognition Scheme", crossref = "IEEE:1988:SIC", pages = "238--249", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2664-1). Piscataway, NJ, USA.", abstract = "A general method for model-based object recognition in occluded scenes is presented that is based on geometric hashing. The method stands out for its efficiency. The general framework of the method is described and its applications illustrated for various recognition problems both in 3-D and 2-D. Special attention is given to the recognition of 3-D objects in occluded scenes from 2-D gray-scale images. Experimental results are included for this important case.", acknowledgement = ack-nhfb, affiliation = "New York Univ, New York, NY, USA", classification = "723; 741; 921", keywords = "Artificial; Geometric Hashing; Gray Scale Images; image part form, large dimensionality; Image Processing; Occluded Scenes; Pattern Recognition; Vision", } @Article{Larson:1988:DHT, author = "Per-{\AA}ke Larson", title = "Dynamic Hash Tables", journal = j-CACM, volume = "31", number = "4", pages = "446--457", month = apr, year = "1988", 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 = "Linear hashing and spiral storage are two dynamic hashing schemes originally designed for external files. This paper shows how to adapt these two methods for hash tables stored in main memory. The necessary data structures and algorithms are described, the expected performance is analyzed mathematically, and actual execution times are obtained and compared with alternative techniques. Linear hashing is found to be both faster and easier to implement than spiral storage. Two alternative techniques are considered: a simple unbalanced binary tree and double hashing with periodic rehashing into a larger table. The retrieval time of linear hashing is similar to double hashing and substantially faster than a binary tree, except for very small trees. The loading times of double hashing (with periodic reorganization), a binary tree, and linear hashing are similar. Overall, linear hashing is a simple and efficient technique for applications where the cardinality of the key set is not known in advance.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Commun ACM", keywords = "algorithms; computer programming --- Algorithms; data processing; Data Structures; design; dynamic hash tables; experimentation; linear hashing; performance; spiral storage", subject = "E.1 Data, DATA STRUCTURES, Tables \\ 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, Sorting and searching", } @Article{Larson:1988:LHS, author = "Per-{\AA}ke Larson", title = "Linear Hashing with Separators -- {A} Dynamic Hashing Scheme Achieving One-access Retrieval", journal = j-TODS, volume = "13", number = "3", pages = "366--388", month = sep, year = "1988", 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 = "A new dynamic hashing scheme is presented. Its most outstanding feature is that any record can be retrieved in exactly one disk access. This is achieved by using a small amount of supplemental internal storage that stores enough information to uniquely determine the current location of any record. The amount of internal storage required is small: typically one byte for each page of the file. The necessary address computation, insertion, and expansion algorithms are presented and the performance is studied by means of simulation. The new method is the first practical method offering one-access retrieval for large dynamic files.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "723", journalabr = "ACM Trans Database Syst", keywords = "address computation; data processing --- File Organization; database systems; dynamic hashing schemes; extendible hashing; linear hashing; linear probing; Management; one-access retrieval; open addressing", remark = "A small amount of supplemental internal storage stores enough information to uniquely determine the current location of any record.", review = "ACM CR 8811-0850", } @Article{Lesk:1988:GIL, author = "Michael Lesk", title = "{GRAB}\emdash{}Inverted Indexes with Low Storage Overhead", journal = j-COMP-SYS, volume = "1", number = "3", pages = "207--220", month = "Summer", year = "1988", CODEN = "CMSYE2", ISSN = "0895-6340", bibdate = "Fri Sep 13 09:01:18 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C7250L (Non-bibliographic systems)", keywords = "B-trees; Bit vector; Bytes; Fixed length codeword compression scheme; GRAB; Hash codes; Inverted indexes; Pointers; Preindexing pass; Searching command; Sparse vectors; Storage overhead; Whole words", thesaurus = "DEC computers; Information retrieval; Information retrieval systems; Operating systems [computers]; Unix", } @Article{Lewis:1988:HDS, author = "Ted G. Lewis and Curtis R. Cook", title = "Hashing for Dynamic and Static Internal Tables", journal = j-COMPUTER, volume = "21", number = "10", pages = "45--57 (or 45--56??)", month = oct, year = "1988", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; Misc/IMMD_IV.bib; Theory/ProbAlgs.bib", note = "The authors survey the classical hashing function approach to information retrieval and show how general hashing techniques exchange speed for memory. It is a tutorial paper that covers, among other topics, dynamic and static hash tables, perfect hashing, and minimal perfect hashing.", abstract = "The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow. They also discuss recent developments in perfect hashing and minimal perfect hashing, which provide speed and memory compactness when the keys are known in advance.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA", classification = "723; 903; C6120 (File organisation); C6130 (Data handling techniques)", journalabr = "Computer", keywords = "collision resolution; computer systems programming; Data handling; Data manipulation; Dynamic internal tables; File organisation; hashing techniques; Hashing-function; Information retrieval; information retrieval systems; Memory space; minimal perfect hashing; perfect hashing; Perfect hashing; retrieval time minimization; Static internal tables", thesaurus = "Data handling; File organisation; Information retrieval", } @Article{Litwin:1988:MTH, author = "W. Litwin and D. Zegour and G. Levy", title = "Multilevel Trie Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "303", publisher = pub-SV, address = pub-SV:adr, pages = "309--??", month = apr, year = "1988", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Thu Jul 21 09:22:34 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in/as: Institut National de la Recherche en Informatique et Automatique, TR-723, Aug. 1987.", acknowledgement = ack-nhfb, fixme = "???? Not a journal: should be InProceedings!", keywords = "EDBT", } @Article{Lomet:1988:SBD, author = "David B. Lomet", title = "A Simple Bounded Disorder File Organization with Good Performance", journal = j-TODS, volume = "13", number = "4", pages = "??", month = dec, year = "1988", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jul 21 09:38:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Index entries refer to large data nodes which are treated as separate hashed files.", review = "ACM CR 8904-0253", } @InProceedings{Lueker:1988:MAD, author = "G. S. Lueker and M. Molodowitch", title = "More analysis of double hashing", crossref = "ACM:1988:PTA", pages = "354--359", year = "1988", bibdate = "Mon Jul 18 10:24:46 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Mikkilineni:1988:ERJ, author = "Krishna P. Mikkilineni and Stanley Y. W. Su", title = "An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "14", number = "6", pages = "838--848", month = jun, year = "1988", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Sat Feb 14 10:47:12 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A query processing strategy which is based on pipelining and data-flow techniques is presented. Timing equations are developed for calculating the performance of four join algorithms: (1) nested block, (2) hash, (3) sort-merge, and (4) pipelined sort-merge. They are used to execute the join operation in a query in distributed fashion and in pipelined fashion. Based on these equations and similar sets of equations developed for other relational algebraic operations, the performance of query execution was evaluated using the different join algorithms. The effects of varying the values of (1) processing time, (2) I/O time, (3) communication time, (4) buffer size, and (5) join selectively on the performance of the pipelined join algorithms are investigated. The results are compared to the results obtained by employing the same algorithms for executing queries using the distributed processing approach which does not exploit the vertical concurrency of the pipelining approach. These results establish the benefits of pipelining.", acknowledgement = ack-nhfb, affiliationaddress = "Honeywell, Golden Valley, MN, USA", classification = "723", journalabr = "IEEE Trans Software Eng", keywords = "Algorithms; computer programming; data processing; data-flow techniques; hash sort-merge; nested block; pipelined query processing; relational join algorithms", remark = "(1) nested block, (2) hash, (3) sort-merge, and (4) pipelined sort-merge. 4 is best.", } @Article{Murthy:1988:SSC, author = "D. Murthy and Pradip K. Srimani", title = "Split Sequence Coalesced Hashing", journal = j-INFO-SYS, volume = "13", number = "2", pages = "211--218", month = may, year = "1988", 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 purpose of the present paper is to propose two new variants of coalesced hashing scheme with the objective of minimizing the number of probes needed for successful and unsuccessful search. We also describe our experience with the detailed simulation experiments done with different versions of the proposed schemes.", acknowledgement = ack-nhfb, affiliationaddress = "Southern Illinois Univ, Carbondale, IL, USA", classification = "723", journalabr = "Inf Syst", keywords = "computer programming --- Algorithms; computer simulation; data processing; File Organization; InfSys; insertion strategies; split sequence coalesced hashing", } @InProceedings{Nakayama:1988:HPJ, author = "M. Nakayama and M. Kitsuregawa and M. Takagi", title = "Hash-Partitioned Join Method Using Dynamic Destaging Strategy", crossref = "Bancilhon:1988:PFI", pages = "468", year = "1988", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "GRACE bucket tuning VLDB", } @Article{Okamoto:1988:DMS, author = "Tatsuaki Okamoto", title = "Digital multisignature scheme using Bijective public-key Cryptosystems", journal = j-TOCS, volume = "6", number = "4", pages = "432--441", month = nov, year = "1988", CODEN = "ACSYEC", ISSN = "0734-2071", 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 digital multisignature scheme using bijective public-key cryptosystems that overcomes the problems of previous signature schemes used for multisignatures is proposed. The principal features of this scheme are (1) the length of a multisignature message is nearly equivalent to that for a single signature message; (2) by using a one-way hash function, multisignature generation and verification are processed in an efficient manner; (3) the order of signing is not restricted; and (4) this scheme can be constructed on any bijective public-key cryptosystem as well as the RSA scheme. In addition, it is shown that the new scheme is considered as safe as the public-key cryptosystem used in this new scheme. Some variations based on the scheme are also presented.", acknowledgement = ack-nhfb, affiliation = "NTT", affiliationaddress = "Yokosuka, Jpn", classification = "723", journalabr = "ACM Trans Comput Syst", keywords = "Bijective Public-Key Cryptosystems; Computer-Based Message Systems; Cryptography; Digital Multisignature Scheme; Electronic Mail; One-Way Hash Function", } @InProceedings{Omiecinski:1988:CSS, author = "Edward Omiecinski", title = "Concurrent Storage Structure Conversion: From {B$^+$} Tree to Linear Hash File", crossref = "IEEE:1988:PFI", pages = "589--596", year = "1988", 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.", abstract = "The author shows that the efficient reorganization of a B plus tree file into a linear hash file can be done concurrently with user transaction processing. This conversion is motivated by a change in database processing, in which efficient sequential and direct access were originally needed, but now only efficient direct access is needed. This is quite reasonable for a database system which accommodates new and changing applications. Several existing database systems, e. g. INGRES, IMS and IDMS allow this type of reorganization, but the reorganization is performed offline. The author devises an algorithm which performs the conversion and presents an analytic model of the conversion process. The author uses a typical database simulation model to evaluate the reorganization scheme. The results from the analytic model are within 3\% (on the average) of the observed simulation results.", acknowledgement = ack-nhfb, affiliationaddress = "Georgia Inst of Technology, Atlanta, GA, USA", classification = "722; 723; 921", keywords = "computer programming --- Algorithms; computer simulation; concurrent storage structure conversion; data processing; data storage units; database systems --- Mathematical Models; File Organization; linear hash file; mathematical techniques --- Trees; user transaction processing", } @InProceedings{Otoo:1988:LBC, author = "Ekow J. Otoo", title = "Locally Balanced Compact Trie Hashing", crossref = "Beeri:1988:PTI", pages = "??--??", month = jun, year = "1988", bibdate = "Thu Jul 21 09:38:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Otoo:1988:LDG, author = "Ekow J. Otoo", title = "Linearizing the Directory Growth in Order Preserving Extendible Hashing", crossref = "IEEE:1988:PFI", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "580--588", year = "1988", ISBN = "0-8186-0827-7", ISBN-13 = "978-0-8186-0827-8", LCCN = "????", 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.", abstract = "The author proposes a method of implementing an order-preserving extendible hashing scheme using a balanced hierarchical directory. The directory is implemented as a balanced m-way tree where m equals 2** theta for some predefined constant theta. This approach gives an almost linear growth in the directory size for both uniform and nonuniform key distributions at the expense of possibly one extra disk. Given records whose pseudokeys are w-bit nonnegative integers, each of value K prime less than M equals 2**w, such that the records are grouped into pages of capacity C records, a record retrieval is achieved in at most lambda equals (w-log//2C)/ theta disk accesses.", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "722; 723; 903; 921", conference = "Proceedings --- Fourth International Conference on Data Engineering.", keywords = "balanced extendible hash (beh)-tree; balanced hierarchical directory; database systems; directory growth; information retrieval systems; mathematical techniques --- Trees; order preserving extendible hashing; uniform and nonuniform key distribution", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Ouksel:1988:IDS, author = "Mohamed Ouksel and Peter Scheuermann", title = "Implicit data structures for linear hashing schemes", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "183--189", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P10", MRnumber = "90c:68013", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The authors define two implicit data structures and study their relationship to the whole class of hashing functions that are variations of linear hashing. Both of the structures, the linear binary trie and the linear binary search tree, have the common property that their growth emulates the pattern of splittings in linear hashing. The authors show that certain linear hashing schemes based on digital search correspond to a linear binary trie which is maintained completely in implicit fashion. Next, they show how linear hashing can be extended into an order-preserving method that organizes the specific set of records whose directory corresponds to a linear binary search tree. This implicit data structure lends itself to a sequential storage scheme which requires no pointers, thus providing for a compact representation of the directory.", acknowledgement = ack-nhfb, affiliation = "Arizona State Univ", affiliationaddress = "Tempe, AZ, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "algorithms; Data Processing; Data Structures; Implicit Data Structures; Linear Binary Search Tree; Linear Binary Trie; Linear Hashing; Mathematical Techniques--Trees; theory; verification", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.1 Data, DATA STRUCTURES, Trees", } @InProceedings{Panneerselvam:1988:NAS, author = "G. Panneerselvam and G. A. Jullien and W. C. Miller", booktitle = "PROCEEDINGS --- INTERNATIONAL CONFERENCE ON SYSTOLIC ARRAYS (May 25--27 1988: San Diego, CA, USA)", title = "New architectures for systolic hashing", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "73--82", year = "1988", ISBN = "0-8186-8860-2", ISBN-13 = "978-0-8186-8860-7", LCCN = "QA76.5 .I546 1988 Sci-Eng", bibdate = "Tue May 12 09:49:20 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2603-9). Piscataway, NJ, USA.", abstract = "Two-and three-dimensional systolic architectures are proposed for the hash table data structure (hashing). The parallel systolic hashing architecture provides the facility for implementing the hash operations of Insert, Delete, and Member in a constant time complexity. The importance and advantages of extending sequential hashing to a parallelized form are discussed. An implementation is presented of a sorting problem of N numbers in an O(L) time complexity, where L is constant, using a three-dimensional parallelized systolic hashing process. This is compared to a sequential hashing process, which requires O(N) time complexity.", acknowledgement = ack-nhfb, affiliation = "Univ of Windsor, Ont, Can", classification = "722; 723", conference = "Proceedings --- International Conference on Systolic Arrays.", conferenceyear = "1988", keywords = "2-D systolic architecture; 3-D systolic architecture; Applications; computer architecture; computers, digital --- Design; systolic hashing", meetingabr = "Proc Int Conf on Systolic Arrays", meetingaddress = "San Diego, CA, USA", meetingdate = "May 25--27 1988", meetingdate2 = "1988 May 25--27", publisherinfo = "Computer Society", sponsor = "IEEE, Computer Soc, Los Alamitos, CA, USA; US Office of Naval Research, USA; SPIE, USA", } @Article{Pittel:1988:STE, author = "Boris Pittel and Jenn-Hwa Yu", title = "On search times for early-insertion coalesced hashing", journal = j-SIAM-J-COMPUT, volume = "17", number = "3", pages = "492--503", month = jun, year = "1988", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P10 (68Q25 68R05)", MRnumber = "89h:68020", MRreviewer = "Luc P. Devroye", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The distributions of the search times for an early-insertion form of coalesced hashing (first proposed by J.S. Vitter) are studied. It is demonstrated, in particular, that the largest search time is very close, in probability, to the one for the late-insertion coalesced hashing. In addition, a formula for the expected successful search time shown to follow directly from the analysis.", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ", affiliationaddress = "Columbus, OH, USA", classification = "723; 922", journalabr = "SIAM J Comput", keywords = "Coalesced Hashing; Computer Programming--Algorithms; Data Processing; File Organization; Hashing Algorithms; Largest Search Time; Probabilistic Analysis; Probability--Random Processes; Search Algorithms", } @Article{Pramanik:1988:OCR, author = "Sakti Pramanik and Farshad Fotouhi", title = "Optimizing the Cost of Relational Queries Using Partial-Relation Schemes", journal = j-INFO-SYS, volume = "13", number = "1", pages = "71--79", year = "1988", 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 = "In this paper we propose a new access path to a relation, called a Partial-Relation scheme, in order to speed up the relational join operations. We present two join algorithms which preprocess the Partial-Relations first and then join the selected tuples of the relations. We have considered join-only queries and queries involving restrictions, projections and joins. The performance of these algorithms is compared with sort-merge and hash-based join algorithms. The analysis is based on the cost of accesses to the secondary storage and the CPU usage. It has been shown that for a wide range of selectivity factors and\slash or join factors the proposed algorithms perform better than the sort-merge and hash-based join algorithms.", acknowledgement = ack-nhfb, affiliationaddress = "Michigan State Univ, East Lansing, MI, USA", classification = "723", journalabr = "Inf Syst", keywords = "computer programming --- Algorithms; database systems; hash-based join; join algorithms; partial-relation schemes; Relational; relational queries; semijoin", } @InProceedings{Ramakrishna:1988:ABD, author = "M. V. Ramakrishna and P. Mukhopadhyay", title = "Analysis of bounded disorder file organization", crossref = "ACM:1988:PPS", pages = "117--125", year = "1988", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p117-ramakrishna/p117-ramakrishna.pdf; http://www.acm.org/pubs/citations/proceedings/pods/308386/p117-ramakrishna/", abstract = "Recently Litwin and Lomet proposed the Bounded Disorder (BD) file organization which uses a combination of hashing and tree indexing Lomet provided an approximate analysis with a mention of the difficulty involved in exact modeling and analysis. The performance analysis of the method involves solving a classical sequential occupancy problem. We encountered this problem in our attempt to obtain a general model for single access and almost single access retrieval methods developed in the recent years. In this paper, we develop a probability model and present some preliminary results of the exact analysis.", acknowledgement = ack-nhfb, } @InProceedings{Ramakrishna:1988:EPM, author = "M. V. Ramakrishna", title = "An Exact Probability Model for Finite Hash Tables", crossref = "IEEE:1988:PFI", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "362--368", year = "1988", ISBN = "0-8186-0827-7", ISBN-13 = "978-0-8186-0827-8", LCCN = "????", 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.", abstract = "The author presents an exact probability model for finite hash tables and applies the model to solve a few problems in the analysis of hashing techniques. The model enables exact computation of table sufficiency index, a parameter useful in the design of small hash tables. The author also presents an exact analysis of the expected length of the longest probe sequence in hashing with separate chaining, and successful search length in infinite uniform hashing giving explicit expressions. It appears that the model can be extended to analyze other hashing schemes such as bounded disorder index method, and to problems in robust data structures etc.", acknowledgement = ack-nhfb, classification = "723; 922", conference = "Proceedings --- Fourth International Conference on Data Engineering.", keywords = "bounded disorder index method; data processing --- Data Structures; exact probability model; finite hash tables; infinite uniform hashing; probability; table sufficiency index", meetingaddress = "Los Angeles, CA, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Ramakrishna:1988:HPA, author = "M. V. Ramakrishna", title = "Hashing in Practice: Analysis of Hashing and Universal Hashing", crossref = "Boral:1988:SIC", pages = "191--199", year = "1988", bibdate = "Tue Jul 19 00:59:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Regnier:1988:THA, author = "Mireille Regnier", title = "Trie Hashing Analysis", crossref = "IEEE:1988:PFI", pages = "377--381", year = "1988", 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.", abstract = "The author presents an analysis of trie hashing for alphanumerical keys. He proposes a variant that uses a binary code and an asymptotic analysis of the size of the index. This provides, for biased distributions, a computable formula that predicts the size of the index as a function of the frequencies of the characters and the transition frequencies between these characters. These results are confirmed by a simulation. The author considers a Markovian probabilistic method and uses the Mellin transform.", acknowledgement = ack-nhfb, affiliationaddress = "INRIA, Le Chesnay, Fr", classification = "723; 921; 922", keywords = "alphanumerical keys; Analysis; asymptotic analysis; binary code; data processing --- File Organization; database systems; Markovian probabilistic method; probability; trie hashing", } @Article{Sakti:1988:GPP, author = "Pramanik Sakti and Myoung Ho Kim", title = "Generalized parallel processing models for database systems", journal = j-PROC-INT-CONF-PAR-PROC, volume = "3", pages = "76--83", year = "1988", 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", note = "Available from IEEE Service Cent (catalog number 88CH2625-2). Piscataway, NJ, USA.", abstract = "A two-stage abstract parallel-processing model is proposed to facilitate systematic design of parallel-processing database systems. The model maximizes throughput and minimizes response time through concurrent input\slash output (I/O) and processing of databases. Five classes of database queries with differing parallel processing characteristics are identified, and specific parallel-processing models are presented that follow the abstract models presented for two of the classes. One is the FX model for partial-match-retrieval applications, and the other is the multidirectory hashing model in which database accesses are based on primary keys. The models perform better than those proposed previously in the literature.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ, East Lansing, MI, USA", classification = "722; 723", conference = "Proceedings of the 1988 International Conference on Parallel Processing", conferenceyear = "1988", journalabr = "Proc Int Conf Parallel Process", keywords = "computer systems, digital; data processing; database systems; multidirectory hashing model; Parallel Processing; partial-match-retrieval", meetingaddress = "University Park, PA, USA", meetingdate = "Aug 15--19 1988", meetingdate2 = "1988 Aug 15--19", publisherinfo = "IEEE Service Center", sponsor = "Penn State Univ, University Park, PA, USA", } @Book{Salzberg:1988:FS, author = "Betty Salzberg", title = "File Structures", publisher = pub-PH, address = pub-PH:adr, pages = "x + 342", year = "1988", ISBN = "0-13-314691-X", ISBN-13 = "978-0-13-314691-2", LCCN = "QA76.9.F5 S25 1988", bibdate = "Wed Jul 13 19:03:16 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$36.95", acknowledgement = ack-nhfb, keywords = "book sort hash duality", remark = "A simplified version of Wiederhold: {\em File Organization for Database Design\/}, plus extendible hashing and a bit on joins.", } @TechReport{Schmidt:1988:SCO, author = "Jeanette P. Schmidt and Alan Siegel", title = "The Spatial Complexity of Oblivious {\it k}---probe Hash Functions", type = "Ultracomputer Note", number = "142", institution = "????", pages = "??", month = jun, year = "1988", bibdate = "Thu Jul 21 08:50:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Scott:1988:SMT, author = "Michael L. Scott and Raphael A. Finkel", title = "Simple mechanism for type security across compilation units", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "14", number = "8", pages = "1238--1239", month = aug, year = "1988", 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 = "A simple technique is described that detects structural-type clashes across compilation units with an arbitrarily high degree of confidence. The type of each external object is described in canonical form. A hash function compresses the description into a short code. If the code is embedded in a symbol-table name, then consistency can be checked by an ordinary linker. For distributed programs, run-time checking of message types can be performed with very little overhead.", acknowledgement = ack-nhfb, affiliation = "Univ of Rochester, NY, USA", classification = "723", conference = "International Computer and Software Applications Conference --- COMPSAC '86", journalabr = "IEEE Trans Software Eng", keywords = "canonical object description; compilation units; computer operating systems; computer systems, digital --- Distributed; hash function; Program Compilers", meetingaddress = "Chicago, IL, USA", meetingdate = "Oct 8--10 1986", meetingdate2 = "10/08--10/86", } @Book{Sedgewick:1988:A, author = "Robert Sedgewick", title = "Algorithms", publisher = pub-AW, address = pub-AW:adr, edition = "Second", pages = "xii + 657", year = "1988", ISBN = "0-201-06673-4", ISBN-13 = "978-0-201-06673-9", LCCN = "QA76.6 .S435 1988", bibdate = "Wed Dec 15 10:41:37 1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$34.95", acknowledgement = ack-nhfb, libnote = "Not yet in my library.", } @InProceedings{Shang:1988:DCP, author = "C. C. Shang and C. H. Lin", booktitle = "IEEE 1988 International Symposium on Information Theory --- Abstracts of papers", title = "On the difficulty of constructing perfect hashing functions", volume = "25 n 13", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "241--??", year = "1988", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2621-1). Piscataway, NJ, USA.", abstract = "Summary form only given, as follows. The authors study the difficulty of constructing perfect hashing functions by using a general method. First, they review several perfect hashing schemes. They then show that if GM is a general method to construct a perfect hashing function for any arbitrarily given key set, then the difficulty of constructing the perfect hashing function by using GM highly depends on the cardinality of the key set and the expected loading factor.", acknowledgement = ack-nhfb, affiliation = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "713; 921", conferenceyear = "1988", keywords = "Abstract Only; Function Generators; Hashing Functions; Information Theory; Mathematical Techniques--Function Evaluation; Perfect Hashing Schemes", meetingabr = "IEEE 1988 Int Symp on Inf Theory Abstr of Pap", meetingaddress = "Kobe, Jpn", meetingdate = "Jun 19--24 1988", meetingdate2 = "1988 Jun 19--24", sponsor = "IEEE, Information Theory Group, New York, NY, USA; Inst of Electronics, Information \& Communication Engineers of Japan, Jpn", } @Article{Shasha:1988:CSS, author = "Dennis Shasha and Nathan Goodman", title = "Concurrent Search Structure Algorithms", journal = j-TODS, volume = "13", number = "1", pages = "53--90", month = mar, year = "1988", 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/1988-13-1/p53-shasha/p53-shasha.pdf; http://www.acm.org/pubs/citations/journals/tods/1988-13-1/p53-shasha/; http://www.acm.org/pubs/toc/Abstracts/tods/42204.html", abstract = "A dictionary is an abstract data type supporting the actions member, insert, and delete. A search structure is a data structure used to implement a dictionary. Examples include B trees, hash structures, and unordered lists. Concurrent algorithms on search structures can achieve more parallelism than standard concurrency control methods would suggest, by exploiting the fact that many different search structure states represent one dictionary state. We present a framework for verifying such algorithms and for inventing new ones. We give several examples, one of which exploits the structure of Banyan family interconnection networks. We also discuss the interaction between concurrency control and recovery as applied to search structures.", acknowledgement = ack-nhfb, affiliation = "New York Univ, New York, NY, USA", affiliationaddress = "New York Univ, New York, NY, USA", classification = "723", generalterms = "Algorithms; Design; Performance", keywords = "abstract data type; Banyan interconnection networks; computer programming --- algorithms; concurrent algorithms, algorithms; data processing; Data Structures; design; dictionary; performance; search structure", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @InProceedings{Spector:1988:CFD, author = "A. Z. Spector and R. F. Pausch and G. Bruell", title = "{CAMELOT}: {A} Flexible, Distributed Transaction Processing System", crossref = "IEEE:1988:DPI", pages = "??", year = "1988", bibdate = "Mon Jul 25 11:37:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Camelot executes on a variety of uni- and multi-processors on top of the UNIX-compatible Mach operating system. Automatic management of threads, nested transactions, flexible synchronization, long and short transactions, small and large data objects, non-blocking commit protocols, logging, multiple servers, multiple disks per node. Data type library supports B-trees, extensible hash tables, and dynamic storage allocation.", } @InProceedings{Tanaka:1988:HSS, author = "Eiichi Tanaka and Atsuko Kogawara", title = "High Speed String Edit Methods Using Hierarchical Files and Hashing Technique", crossref = "IEEE:1988:ICP", journal = "Proceedings --- International Conference on Pattern Recognition", institution = "Utsonomiya U", pages = "334--336", year = "1988", CODEN = "PICREG", ISBN = "0-8186-0878-1", ISBN-13 = "978-0-8186-0878-0", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent (catalog number 88CH2614-6). Piscataway, NJ, USA.", abstract = "The first method uses a hierarchical file based on both the first and second kinds of class name expression. The second method applies a hashing technique to already proposed methods. The correction rates of both methods are same. An experiment using 3782 words of length shows that the computing time of the second method is 0.8\% of that of the weighted Levenshtein distance method in the case of a substitution recovery.", acknowledgement = ack-nhfb, affiliation = "Ishiimachi, Utsunomiya Univ, Dep of Inf Sci, Utsunomiya, Jpn", classification = "723; 741; 751; 922", conference = "9th International Conference on Pattern Recognition", conferenceyear = "1988", journalabr = "Proc Int Conf Pattern Recognit", keywords = "(IMAGE, SYMBOL); Character Recognition, Optical; Decision Theory and Analysis; Hashing Techniques; Hierarchical Files; OCR Output Correction; Speech--Recognition; Statistical Methods; String Edit Methods; Typographical Error Correction", meetingaddress = "Rome, Italy", meetingdate = "Nov 14--17 1988", meetingdate2 = "1988 Nov 14--17", publisherinfo = "IEEE Service Center", sponsor = "Int Assoc for Pattern Recognition, Paris, Fr", } @Book{Tharp:1988:FOP, author = "Alan L. Tharp", title = "File Organization and Processing", publisher = pub-JW, address = pub-JW:adr, pages = "xv + 398", year = "1988", ISBN = "0-471-60521-2", ISBN-13 = "978-0-471-60521-8", LCCN = "QA76.9.F5 T48 1988", bibdate = "Tue Jul 19 01:48:23 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Textbook treatment of hashing in Chapter 7.", price = "US\$28.00", acknowledgement = ack-nhfb, } @Book{Walker:1988:CSP, author = "Henry M. Walker", title = "Computer Science 2: Principles of Software Engineering, Data Types, and Algorithms", publisher = pub-SF, address = pub-SF:adr, pages = "xvii + 637", year = "1988", ISBN = "0-673-39829-3", ISBN-13 = "978-0-673-39829-1", LCCN = "QA76.758 .W35 1989", bibdate = "Tue Jul 19 01:05:45 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Textbook treatment of hashing.", price = "US\$25.00", acknowledgement = ack-nhfb, } @Article{Weems:1988:SPA, author = "Bob P. Weems", title = "A study of page arrangements for extendible hashing", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "245--248", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Extendible hashing has been proposed as an efficient dynamic hashing method. The method is essentially an implementation of radix search trees, or tries, which applies a scatter function to record keys. When used with a disk drive, there exists an opportunity to reduce the amount of arm movement (seek distance) by applying simple techniques for optimizing one-dimensional storage. This article examines the potential reduction in head movement when an optimal arrangement of pages is used instead of a random arrangement. Applications presently being evaluated include periodic static reorganization of the file and techniques for dynamic reorganization.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Arlington, Arlington, TX, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "data processing; disk page arrangement; extendible hashing; File Organization; file processing; measurement; performance; radix search trees; theory; tries", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", } @Article{Abdelguerfi:1989:EVA, author = "M. Abdelguerfi and A. K. Sood", title = "External {VLSI} algorithm for the relational database projection operation", journal = j-INT-J-ELECTRON, volume = "66", number = "3", pages = "339--347", month = mar, year = "1989", CODEN = "IJELA2", ISSN = "0020-7217", 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, techniques and strategies that allow a Bus Connected Cellular Array (BCA) unit of fixed size to process a large amount of data in the context of relational databases are investigated. An algorithm called hash-BCA projection is presented. This algorithm uses hashing to fragment the relation into small buckets that can be processed internally by the BCA processing unit. An algorithm called iterative BCA is used when the size of a bucket exceeds that of the BCA processing unit. In order to realistically analyse the performance of our design, we have incorporated a BCA processing unit of fixed size in a general purpose back-end database unit. Next, the performances of the overall system with a BCA processing unit as a major component has been analyzed.", acknowledgement = ack-nhfb, affiliation = "Univ of Detroit", affiliationaddress = "Detroit, MI, USA", classification = "713; 714; 722; 723; 921", journalabr = "Int J Electron", keywords = "Algorithms; Bus Connected Cellular Array (bca); Computer Architecture; Computer Programming; Database Systems--Relational; hash-bca Projection Algorithm; Integrated Circuits, VLSI; Iterative bca Algorithm; Relational Database Projection Operation; VLSI Algorithm", } @InProceedings{Asano:1989:CPP, author = "Tetsuo Asano and H. Imai and K. Imai", title = "Clustering/hashing points in the plane with maxmin criteria", crossref = "CCCG:1989:CCC", pages = "15", year = "1989", bibdate = "Mon Oct 24 18:03:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Baeza-Yates:1989:MSF, author = "Ricardo A. Baeza-Yates", title = "Modeling splits in file structures", journal = j-ACTA-INFO, volume = "26", number = "4", pages = "349--362", month = feb, year = "1989", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", ISSN-L = "0001-5903", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We analyze the expected behaviour of file structures where splits are used to handle overflows. Two cases are analyzed. The first model is of a file with an index on top of the data structure. We analyze the effect of unbalanced splits, and the effect of splitting in more than two buckets. The second model is of an ideal hash file, in which the probability of insertion remains the same for every bucket, regardless of how many times the bucket has been split. The result is an upper bound in any dynamic hashing method that uses splitting and does not allow overflow records. In both cases, the effect of using partial expansions is included.", acknowledgement = ack-nhfb, affiliation = "Univ of Waterloo", affiliationaddress = "Waterloo, Ont, Can", classification = "723", journalabr = "Acta Inf", keywords = "Data Processing; File Organization; File Overflows; File Structures; Hashing; Partial Expansions; Splits", } @Article{Bardin:1989:IUI, author = "B. Bardin and C. Colket and D. Smith", title = "Implementation of unsigned integers in Ada", journal = j-ADA-LETT, volume = "9", number = "1", pages = "47--70", month = jan # "--" # feb, year = "1989", CODEN = "AALEE5", bibdate = "Thu Dec 14 17:19:19 MST 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "It is suggested that the minimal goals for unsigned integers should include at least: providing an extended maximum non-negative integer range which fully exploits the available hardware (and which allows full range address arithmetic when appropriate); providing straightforward and efficiently-implementable logical operations (including shifts, rotates, and masks) on all bits of unsigned types; providing numeric literals in arbitrary bases (so that representations appropriate to a given architecture may be chosen for bit-level operations); and providing efficient support for modular arithmetic of arbitrary range (which allows checksums, hash functions, and pseudo-random number generators which generate all possible bit patterns in closed cycles to be cleanly written in Ada). The authors present a strawman proposal (draft of a draft) to meet the goals stated above.", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6140D (High level languages)", keywords = "Ada; Full range address arithmetic; Logical operations; Modular arithmetic; Numeric literals; Symbol manipulation; Unsigned integers", language = "English", pubcountry = "USA", thesaurus = "Ada; Digital arithmetic; Symbol manipulation", } @Article{Barkley:1989:PRH, author = "Ronald E. Barkley and T. Paul Lee", title = "Point representation and hashing of an interval", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "201--203", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P10", MRnumber = "89k:68023", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A system managing memory from a set of non-overlapping address intervals or pools must be able to take an arbitrary memory address and identify its parent pool. To make the lookup operation efficient, we would like to use some hashing scheme. In this paper, we introduce the notion of mapping address intervals to representative points. Each pool or interval can be mapped into a point x; we show that under a similar mapping function, any address from that interval has a value x or x + 1. Given this important property, we can use any reasonable hashing technique to do efficient address lookup.", acknowledgement = ack-nhfb, affiliation = "AT\&T Bell Lab", affiliationaddress = "Summit, NJ, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "Address Lookup; Computer Programming--Algorithms; Computer Systems Programming--Utility Programs; Data Processing; Data Structures; Global Quiescence Detection; Hashing; Intervals; Memory Management; performance; theory; verification", subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations", } @TechReport{Blakeley:1989:JIM, author = "J. A. Blakeley and N. L. Martin", title = "Join Index, Materialized View, and Hybrid-Hash Join: {A} Performance Analysis", number = "T", institution = "Indiana University, Computer Science Department", pages = "??", month = jun, year = "1989", bibdate = "Thu Jul 21 08:50:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Brain:1989:NHL, author = "Marshall D. Brain and Alan L. Tharp", title = "Near-perfect Hashing of Large Word Sets", journal = j-SPE, volume = "19", number = "10", pages = "967--978", day = "1", month = oct, year = "1989", 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; UnCover library database", abstract = "This article presents a procedure for constructing a near-perfect hashing function. The procedure, which is a modification of Cichelli's algorithm, builds the near-perfect hashing function sufficiently fast to allow larger word sets to be used than were previously possible. The improved procedure is the result of examining the original algorithm for the causes of its sluggish performance and then modifying them. In doing so an attempt was made to preserve the basic simplicity of the original algorithm. The improved performance comes at the expense of more storage. The six modifications used to improve performance are explained in detail and experimental results are given for word sets of varying sizes.", acknowledgement = ack-nhfb, affiliation = "North Carolina State Univ", affiliationaddress = "Raleigh, NC, USA", classification = "723", journalabr = "Software Pract Exper", keywords = "Computer Programming--Algorithms; Computer Systems Programming; Perfect Hashing", } @Article{Brain:1989:NPH, author = "Marshall D. Brain and Alan L. Tharp", title = "Near-perfect hashing for large word sets", journal = j-SPE, volume = "19", number = "10", pages = "967--978", month = oct, year = "1989", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", bibdate = "Wed Aug 24 15:30:20 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Breen:1989:HFP, author = "Edmond J. Breen and Keith L. Williams", title = "Hash function performance on different biological databases", journal = j-COMPUT-METH-PROG-BIOMED, volume = "28", number = "2", pages = "87--91", month = feb, year = "1989", CODEN = "CMPBEK", ISSN = "0169-2607", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Open hashing is used to demonstrate the effectiveness of several hashing functions for the uniform distribution of biological records. The three types of database tested include (1) genetic nomenclature, mutation sites and strain names, (2) surnames extracted from literature files and (3) a set of 1000 numeric ASCII strings. Several hash functions (hashpjw, hashcrc and hashquad) showed considerable versatility on all data sets examined while two hash functions, hashsum and hashsmc, performed poorly, on the same databases.", acknowledgement = ack-nhfb, affiliation = "Macquarie Univ", affiliationaddress = "Sydney, Aust", classification = "461; 723", journalabr = "Comput Methods Prog Biomed", keywords = "Biological Databases; Biomedical Engineering; Computer Applications; Computer Software; Data Processing--Medical Information; Database Systems; Genetic Engineering; Hash Functions; Hashing; Information Retrieval Systems; Key to Address Transform; Scatter Storage; Single Record Retrieval", } @TechReport{Burrows:1989:LAa, author = "Michael Burrows and Martin Abadi and Roger Needham", title = "A Logic of Authentication", number = "39", institution = "Digital Equipment Corporation, Systems Research Centre", pages = "48", day = "28", month = feb, year = "1989", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Questions of belief are essential in analyzing protocols for authentication in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required initial assumptions of the participants and their final beliefs. Our formalism has enabled us to isolate and express these differences with a precision that was not previously possible. It has drawn attention to features of protocols of which we and their authors were previously unaware, and allowed us to suggest improvements to the protocols. The reasoning about some protocols has been mechanically verified. This paper starts with an informal account of the problem, goes on to explain the formalism to be used, and gives examples of its application to protocols from the literature, both with conventional shared-key cryptography and with public-key cryptography. Some of the examples are chosen because of their practical importance, while others serve to illustrate subtle points of the logic and to explain how we use it. We discuss extensions of the logic motivated by actual practice -- for example, in order to account for the use of hash functions in signatures. The final sections contain a formal semantics of the logic and some conclusions.", acknowledgement = ack-nhfb, } @Article{Cercone:1989:IAP, author = "N. Cercone and M. Krause", title = "An informal analysis of perfect hash function search", journal = j-APPL-MATH-LETT, volume = "2", number = "3", pages = "287--291", year = "1989", CODEN = "AMLEEL", ISSN = "0893-9659", bibdate = "Thu Jun 15 11:52:09 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Cheiney:1989:PTC, author = "J.-P. Cheiney and C. de Maindreville", title = "A Parallel Transitive Closure Algorithm Using Hash-Based Clustering", crossref = "Boral:1989:DMS", pages = "301", month = jun, year = "1989", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Maindreville IWDM IWDBM", } @InProceedings{Christodoulakis:1989:FOA, author = "S. Christodoulakis and D. A. Ford", title = "File Organizations and Access Methods for {CLV} Optical Discs", crossref = "Belkin:1989:SPT", pages = "152", year = "1989", bibdate = "Mon Jul 18 11:45:11 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A large and important class of optical disc technology are CLV format discs such as CD ROM and WORM. In this paper, we examine the issues related to the implementation and performance of several different file organizations on CLV format optical discs such as CD ROM and WORM. The organizations examined are based on hashing and trees. The CLV recording scheme is shown to be a good environment for efficiently implementing hashing. Single seek access and storage utilization levels approaching 100\% can be achieved for CD ROM's. It is shown that a B-tree organization is not a good choice for WORM discs (both CAV and CLV), but a modified ISAM approach can be appropriate for WORM discs. We describe clustered BIM's, a class of tree organizations appropriate for CD ROMS. Expressions for the expected retrieval performance of both hashing and trees are also given. The paper concludes by outlining recent results and future directions on buffered implementations of access methods for WORM discs, as well as advantages of signature based access methods for text retrieval in WORM disc architectures.", acknowledgement = ack-nhfb, } @Article{Christodoulakis:1989:RPV, author = "Stavros Christodoulakis and Daniel Alexander Ford", title = "Retrieval performance versus disc space utilization on {WORM} optical discs", journal = j-SIGMOD, volume = "18", number = "2", pages = "306--314", month = jun, year = "1989", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:31 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", classification = "C5320K (Optical storage); C6120 (File organisation)", keywords = "Buffered hash file scheme; Data replication; Disc space; Disc space utilization; Disc storage space; Expected value analysis; Retrieval performance; Rewritable storage; Specification; Temporary buffering; WORM optical discs", thesaurus = "Buffer storage; File organisation; Optical disc storage", xxcrossref = "Anonymous:1989:ASI", } @InProceedings{Chung:1989:DSH, author = "Yunmo Chung and M. V. Ramakrishna", title = "Dynamic signature hashing", crossref = "Knafl:1989:PSC", pages = "257--262", year = "1989", bibdate = "Sat Nov 12 21:05:37 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A dynamic hashing scheme that guarantees single access retrieval from the disk is proposed. This is based on the external hashing scheme proposed by G. H. Gonnet and P. A. Larson (see JACM, vol. 35, no. 1, p. 161-84, 1988). The performance of the scheme is achieved at the cost of a small amount of internal memory which remains proportional to the file size. The necessary algorithms for address computation, insertions and file expansions are presented. Since theoretical analysis appears too difficult, the performance is studied using simulations with real-life files. (10 Refs.)", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA", classification = "C6120 (File organisation); C7250 (Information storage and retrieval)", keywords = "Address computation; Dynamic hashing scheme; Dynamic signature hashing; External hashing scheme; File expansions; File size; Insertions; Internal memory; Real-life files; Simulations; Single access retrieval; Theoretical analysis", language = "English", thesaurus = "Information retrieval systems; Magnetic disc storage; Storage management", } @TechReport{Datta:1989:IPH, author = "S. Datta and E. A. Fox", title = "Implementation of a perfect hash function scheme", type = "Technical Report", number = "TR 89-9", institution = inst-VIRGINIA-POLY-CS, address = inst-VIRGINIA-POLY-CS:adr, pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:25 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Du:1989:EFS, author = "D. H. C. Du and S. Ghanta and K. J. Maly", title = "An Efficient File Structure for Document Retrieval in the Automated Office Environment", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "1", number = "2", pages = "??", month = jun, year = "1989", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Thu Jul 21 09:38:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in \cite{IEEE:1987:DEP}.", acknowledgement = ack-nhfb, remark = "'Fuzzy' queries use multikey extendible hashing and signature files.", } @Article{Duncan:1989:PPH, author = "Ray Duncan", title = "Power Programming --- Understanding Hashing Techniques", journal = j-PC-MAGAZINE, volume = "8", number = "8", pages = "297--??", day = "25", month = apr, year = "1989", ISSN = "0888-8507", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Hashing techniques offer fast, nearly constant-speed searching of appropriate data sets. Here's a look at various methods, with test-bed programs to explore them.", acknowledgement = ack-nhfb, } @Article{Duncan:1989:UHT, author = "Ray Duncan", title = "Understanding Hashing Techniques", journal = j-PC-MAGAZINE, volume = "8", number = "8", pages = "297--??", day = "17", month = apr, year = "1989", ISSN = "0888-8507", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Hashing techniques offer fast, nearly constant-speed searching of appropriate data sets. Here's a look at various methods, with test-bed programs to explore them.", acknowledgement = ack-nhfb, } @InProceedings{Faloutsos:1989:DUE, author = "C. Faloutsos and D. Metaxas", title = "Declustering using error correcting codes", crossref = "ACM:1989:PPE", pages = "253--258", year = "1989", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/pods/73721/p253-faloutsos/p253-faloutsos.pdf; http://www.acm.org/pubs/citations/proceedings/pods/73721/p253-faloutsos/; http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p253-faloutsos/", abstract = "The problem examined is to distribute a binary Cartesian product file on multiple disks to maximize the parallelism for partial match queries. Cartesian product files appear as a result of some secondary key access methods, such as the multiattribute hashing [10], the grid file [6] etc.. For the binary case, the problem is reduced into grouping the 2 $n$ binary strings on $n$ bits in $m$ groups of unsimilar strings. The main idea proposed in this paper is to group the strings such that the group forms an Error Correcting Code (ECC). This construction guarantees that the strings of a given group will have large Hamming distances, i.e., they will differ in many bit positions. Intuitively, this should result into good declustering. We briefly mention previous heuristics for declustering, we describe how exactly to build a declustering scheme using an ECC, and we prove a theorem that gives a necessary condition for our method to be optimal. Analytical results show that our method is superior to older heuristics, and that it is very close to the theoretical (non-tight) bound.", acknowledgement = ack-nhfb, generalterms = "Design; Performance", keywords = "design; performance", subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf E.5} Data, FILES. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf H.2.2} Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @Article{Fateman:1989:SDS, author = "R. J. Fateman and C. G. Ponder", title = "Speed and data structures in computer algebra systems", journal = j-SIGSAM, volume = "23", number = "2", pages = "8--11", month = apr, year = "1989", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", bibdate = "Fri Feb 8 18:27:00 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Comparing the speed of computation in algebra systems is a perennial occupation of system designers and algorithm implementors. However, for many problems, the choice of a system makes much less difference that the approach used to represent the problem. The mapping from mathematics to a data representation and the choice of algorithms can make significant, and separate, contributions to efficiency. Systems which have the flexibility to provide several data structures and algorithms can provide an advantage in this respect. Macsyma is probably the system with the largest selection. On the other hand, Macsyma has not taken advantage of recent advances such as the extensive use of hash-coding incorporated in the University of Waterloo's Maple system. For the one somewhat artificial benchmark discussed, it appears that the Maple system does considerably better than any representation in Macsyma by precisely this mechanism.", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", classcodes = "C7310 (Mathematics); C6130 (Data handling techniques); C6120 (File organisation)", classification = "C6120 (File organisation); C6130 (Data handling techniques); C7310 (Mathematics)", corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", issue = "88", keywords = "algebra; algorithm implementors; Algorithm implementors; algorithms; benchmark; Benchmark; computation speed; Computation speed; computer algebra systems; Computer algebra systems; data; Data representation; data structures; Data structures; design; designers; hash-coding; Hash-coding; Macsyma; Maple; Maple system; mathematics; Mathematics; mathematics computing; performance; representation; selection; software; symbol manipulation; system; System designers", subject = "I.3.1 Computing Methodologies, COMPUTER GRAPHICS, Hardware architecture, Raster display devices \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ E.1 Data, DATA STRUCTURES", thesaurus = "Algebra; Data structures; Mathematics computing; Software selection; Symbol manipulation", treatment = "P Practical", } @Article{Fotouhi:1989:OSS, author = "F. Fotouhi and S. Pramanik", key = "Fotouhi \& Pramanik", title = "Optimal Secondary Storage Access Sequence for Performing Relational Join", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "1", number = "3", pages = "318--328", month = sep, year = "1989", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Fri Dec 8 11:47:48 1989", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Two graph models are developed to determine the minimum required buffer size for achieving the theoretical lower bound on the number of disk accesses for performing relational join. Here, the lower bound implies only one disk access per joining block or page. The first graph model is based on the block connectivity of the joining relations. Using this model, we considered the problem of determining an ordered list of joining blocks that requires the smallest size buffer. We have shown this problem as well as the problem of computing the least upper bound on the buffer size to be NP-hard. The second graph model represents the page connectivity of the joining relations. We have shown the problem of computing the least upper bound on the buffer size for the page connectivity model to be also NP-hard. We believe that the problem of determining an ordered list of pages which requires smallest size buffer is NP-hard. Heuristic procedures are presented for the page connectivity model and we showed that the sequence obtained using the heuristics requires a near optimal buffer size. We have also shown the performance improvement of the proposed heuristics over the hybrid-hash join algorithm for a wide range of join factors.", acknowledgement = ack-nhfb, keywords = "Database accesses; graph models; NP-complete problems; relational database; relational join", } @TechReport{Fox:1989:LAF, author = "E. A. Fox and L. Heath and Q. Chen", title = "An {O(n log n)} algorithm for finding minimal perfect hash functions", type = "Technical Report", number = "TR 89-10", institution = inst-VIRGINIA-POLY-CS, address = inst-VIRGINIA-POLY-CS:adr, pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:27 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Fox:1989:MCE, author = "Edward A. Fox and Qi-Fan Chen and Lenwood Heath and Sanjeev Datta", booktitle = "Computing Trends in the 1990's. Proceedings 1989 ACM Seventeenth Annual Computer Science Conference (Feb 21--23 1989: Louisville, KY, USA)", title = "A More Cost Effective Algorithm for Finding Perfect Hash Functions", crossref = "Riehl:1989:CTS", publisher = pub-ACM, address = pub-ACM:adr, pages = "114--122", year = "1989", ISBN = "0-89791-299-3", ISBN-13 = "978-0-89791-299-0", LCCN = "QA75.5 .A1371 1989", bibdate = "Tue May 12 09:49:30 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "As the use of knowledge-based systems increases, there will be a growing need for efficient artificial intelligence systems and methods to access large lexicons. In the COmposite Document Expert\slash extended\slash effective Retrieval (CODER) system we have, in order to provide rapid access to data items on CD-ROMs and to terms in a lexicon built from machine readable dictionaries investigated the construction of perfect hash functions. We have considered algorithms reported earlier in the literature, have made numerous enhancements to them, have developed new algorithms, and here report on some of our results. This paper covers an O(n${}^3$) algorithm that has been applied to building hash functions for a collection of 69806 words on a CD-ROM.", acknowledgement = ack-nhfb, affiliation = "Virginia Polytechnic Inst \& State Univ", affiliationaddress = "Blacksburg, VA, USA", classification = "723; 903", conference = "Seventeenth Annual ACM Computer Science Conference", conferenceyear = "1989", keywords = "Algorithms; Computer Programming; Information Retrieval Systems--Performance; Knowledge-Based Systems; Machine Readable Dictionaries; Perfect Hash Functions", meetingabr = "Seventeenth Annu ACM Comput Sci Conf", meetingaddress = "Louisville, KY, USA", meetingdate = "Feb 21--23 1989", meetingdate2 = "02/21--23/89", } @InProceedings{Fu:1989:CCN, author = "A. Fu and T. Kameda", title = "Concurrency control of nested transactions accessing {B}-trees", crossref = "ACM:1989:PPE", pages = "270--285", year = "1989", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/pods/73721/p270-fu/p270-fu.pdf; http://www.acm.org/pubs/citations/proceedings/pods/73721/p270-fu/; http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p270-fu/", abstract = "This paper presents a concurrency control algorithm for nested transactions accessing B-trees. It combines the idea of B-link tree with that of resilient 2-phase locking [Mos85b]. The I/O automaton model is used in the specification and proofs of correctness of the system. We define ``strongly-serially correct'' schedules and use this property as our correctness criterion.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Languages; Theory", keywords = "algorithms; languages; theory", subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf E.1} Data, DATA STRUCTURES, Trees. {\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata.", } @Article{Gori:1989:AAC, author = "M. Gori and G. Soda", title = "An algebraic approach to {Cichelli}'s perfect hashing", journal = j-BIT, volume = "29", number = "1", pages = "2--13", month = mar, year = "1989", CODEN = "BITTEL, NBITAB", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01932700", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10", MRnumber = "90d:68018", MRreviewer = "J. Paredaens", bibdate = "Wed Jan 4 18:52:21 MST 2006", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/bit.bib; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=29&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=29&issue=1&spage=2", acknowledgement = ack-nhfb, } @InProceedings{Graefe:1989:RDF, author = "Goetz Graefe", key = "Graefe", booktitle = "Proceedings of the Fifth International Conference on Data Engineering", title = "Relational Division: Four Algorithms and Their Performance", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "94--101", month = feb, year = "1989", ISBN = "0-8186-1915-5", ISBN-13 = "978-0-8186-1915-1", LCCN = "QA 76.9 D3 I5582 1989", bibdate = "Tue May 12 09:49:40 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent. Piscataway.", abstract = "We outline three known algorithms for relational division, the algebra operator used to express universal quantification (for-all conditions), and a new algorithm called hash-division. By comparing the algorithms analytically and experimentally, we show that the new algorithm provides performance competitive or superior to techniques used to-date, namely techniques using sorting or aggregate functions. Furthermore, the new algorithm can eliminate duplicates in the divisor on the fly, ignores duplicates in the dividend, and allows two kinds of partitioning, either of which can be used to resolve hash table overflow or to efficiently implement the algorithm on a multi-processor system.", acknowledgement = ack-nhfb, affiliation = "Oregon Graduate Cent, OR, USA", classification = "723; 921", conference = "Proceedings: Fifth International Conference on Data Engineering", conferenceyear = "1989", keywords = "Computer Programming--Algorithms; Computer Systems, Digital--Multiprocessing; Database Systems; Hash Divisions; Mathematical Techniques--Operators; Relational; Relational Division; Universal Quantification", meetingabr = "Proc Fifth Int Conf Data Eng", meetingaddress = "Los Angeles, CA, USA", meetingdate = "Feb 6--10 1989", meetingdate2 = "02/6--10/1989", publisherinfo = "IEEE Service Center", } @Article{Guinier:1989:FUA, author = "Daniel Guinier", title = "A Fast Uniform `Astronomical' Random Number Generator", journal = j-SIGSAC-REVIEW, volume = "7", number = "1", pages = "1--13", month = "Spring", year = "1989", CODEN = "SSARE7", DOI = "http://dx.doi.org/10.1145/70951.70952", ISSN = "0277-920X (print), 1558-0261 (electronic)", ISSN-L = "0277-920X", bibdate = "Thu Feb 23 10:39:51 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran2.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", abstract = "The present method generates machine-independent uniform random sequences of real numbers in the interval (0.,1.) excluding 1. It uses a set of up to 1024 independent multiplicative congruential generators working with:\par * modulii which are chosen prime numbers whose values have been fixed according to the positive 31-bit positive integer arithmetic available and in the form of $2^P'+1$, where $P$'s are also primes.\par * multipliers which are selected from one of their corresponding primitive elements as multipliers to achieve each full cycle independently.\par The `astronomical' maximum periodicity can be considered as infinite: $O^(10^{6021})$; it can be adjusted if required by the user in the sequential version RAN01 or statistically reaching the maximum in the improved `stagger' version DAN01.\par An `acceptable' composite period is estimated to be $O(10^{189})$ for a set of only 32 of such independent generators: this fact could find a nice application in the realization of efficient hash-functions in smart cards.\par An implementation in structured FORTRAN 77 shows very good results in terms of statistical properties, velocity and periodicity.", acknowledgement = ack-nhfb, fjournal = "SIG security, audit \& control review", } @InProceedings{Gupta:1989:SHI, author = "Govind Gupta", booktitle = "Computing Trends in the 1990's. Proceedings 1989 ACM Seventeenth Annual Computer Science Conference (Feb 21--23 1989: Louisville, KY, USA)", title = "Sorting by hashing and inserting", publisher = pub-ACM, address = pub-ACM:adr, pages = "409--??", year = "1989", ISBN = "0-89791-299-3", ISBN-13 = "978-0-89791-299-0", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Address calculation sorting method is discussed by Kronmal \& Tartar. Generally collision resolution is done by chaining, where the records are inserted in ordered linked lists with heads defined as array of pointers. Then the linked lists are merged in the original array. For uniformly distributed lists and careful choice of a hash function the algorithm works quite efficiently and is faster than other sorting methods. Our comparisons show that the algorithms works more than twice as fast as Quick Sort. The disadvantage with this method is that it needs extra space for 2N records. Also it is not an in place sort. The algorithm discussed in this paper improves on both these counts. It uses less than N extra spaces on average. For uniformly distributed keys extra space is less than N/4. There are less than 2N record movement with this algorithm.", acknowledgement = ack-nhfb, affiliation = "Miami Univ", affiliationaddress = "Oxford, OH, USA", classification = "723", conference = "Seventeenth Annual ACM Computer Science Conference", conferenceyear = "1989", keywords = "Computer Programming--Algorithms; Computer Systems Programming; Data Processing--File Organization; Hashing and Insertion Method; Sorting; Summary Only", meetingabr = "Seventeenth Annu ACM Comput Sci Conf", meetingaddress = "Louisville, KY, USA", meetingdate = "Feb 21--23 1989", meetingdate2 = "02/21--23/89", } @InProceedings{Hachem:1989:KAM, author = "Nabil I. Hachem and P. Bruce Berra", booktitle = "FIFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (Feb 6--10 1989: Los Angeles, CA, USA)", title = "Key-sequential access methods for very large files derived from linear hashing", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "305--2", year = "1989", ISBN = "0-8186-1915-5", ISBN-13 = "978-0-8186-1915-1", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Available from IEEE Service Cent. Piscataway.", abstract = "A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. With respect to previous methods DRSAM presents the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order-preserving schemes result in performance improvements for range queries and sequential processing; and (2) it adapts elastic buckets for the control of file growth. This approach outperforms the partial expansion method. The file structure is also extended with proper control mechanisms to cope with nonuniform distributions. The outcome is a multilevel trie stored as a two-level sequentially allocated file.", acknowledgement = ack-nhfb, affiliation = "Worcester Polytechnical Inst, Dep of Computer Science, Worchester, MA, USA", classification = "723", conference = "Proceedings: Fifth International Conference on Data Engineering", conferenceyear = "1989", keywords = "Computer Simulation; Data Processing; Database Access; Dynamic Hashing Structures; File Organization; Key Sequential Access; Range Queries", meetingabr = "Proc Fifth Int Conf Data Eng", meetingaddress = "Los Angeles, CA, USA", meetingdate = "Feb 6--10 1989", meetingdate2 = "02/6--10/1989", publisherinfo = "IEEE Service Center", } @InProceedings{Hachem:1989:KSA, author = "N. I. Hachem and B. P. Berra", key = "Hachem \& Berra", booktitle = "Proceedings of the Fifth International Conference on Data Engineering", title = "Key-Sequential Access Methods for Very Large Files Derived from Linear Hashing", publisher = "????", address = "Los Angeles, CA, USA", pages = "305--312", month = feb, year = "1989", bibdate = "Fri Jan 12 10:45:11 1990", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper a new class of order preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. With respect to previous methods DRSAM presents the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order preserving schemes result in performance improvements for range queries and sequential processing. (2) It adapts elastic buckets [LOM87] for the control of file growth. This approach outperforms the partial expansion method previously proposed by Larson [LAR82]. The file structure is also extended with proper control mechanisms to cope with non-uniform distributions. The outcome is a multi-level trie stored as a two-level sequentially allocated file.", acknowledgement = ack-nhfb, } @TechReport{Hecker:1989:IGH, author = "Yaron C. Hecker and Ruud M. Bolle", title = "{Is Geometric Hashing a Hough Transform?}", number = "RC 15202(\#67767)", institution = "{IBM Research Division, T. J. Watson Research Center}", pages = "??", year = "1989", bibdate = "Sat Aug 27 10:44:29 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Hejlsberg:1989:COT, author = "Anders Hejlsberg", title = "Container Object Types In {Turbo Pascal}", journal = j-DDJ, volume = "14", number = "11", pages = "56--??", day = "1", month = nov, year = "1989", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "When packaged in library modules, container objects can extend the underlying programming language by adding stacks, queues, trees, dynamic arrays, hash tables, and other such data structures.", acknowledgement = ack-nhfb, } @Book{Hekmatpour:1989:LPI, author = "Sharam Hekmatpour", title = "{LISP}: {A} Portable Implementation", publisher = pub-PH, address = pub-PH:adr, pages = "viii + 177", year = "1989", ISBN = "0-13-537490-1", ISBN-13 = "978-0-13-537490-0", LCCN = "QA 76.73 L23 H47 1989", bibdate = "Tue Jul 19 01:32:12 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Describes a hashed symbol table.", price = "US\$54.80", acknowledgement = ack-nhfb, } @Article{Heller:1989:EH, author = "Steve Heller", title = "Extensible Hashing", journal = j-DDJ, volume = "14", number = "11", pages = "66, 69--70, 116, 118, 120--121", day = "1", month = nov, year = "1989", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Sat May 25 14:38:43 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "With KRAM --- Steve's ``keyed random access method'' program --- you can retrieve any record in a multimegabyte file with a single disk access and any record in any size file with a maximum of two accesses.", acknowledgement = ack-nhfb, affiliation = "Chrysalis Software Corp., Baldwin, NY, USA", classification = "C6120 (File organisation)", keywords = "Disk access; Extensible hashing; Multimegabyte file; Record; Retrieve; Turbo Pascal program listing", thesaurus = "File organisation; Pascal listings", } @Article{Ho:1989:COM, author = "P. Ho and W. Yang and M. Hsu", key = "Ho et al.", title = "Concurrent Operations in Multi-Dimensional Extendible Hashing", journal = j-J-INFO-ENG, volume = "5", number = "??", pages = "51--72", year = "1989", bibdate = "Thu Jul 21 09:22:53 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An algorithm for synchronizing concurrent operations on multi-dimensional extendible hash files is presented. The algorithm is deadlock free and allows the search and partial-match operations to proceed concurrently with the insertion operations without having to acquire any locks. It also allows concurrent insertion/deletion operations to proceed without having to acquire locks on the directory entries. The algorithm combines the notion of verification, the principle of the optimistic concurrency control algorithm, and the special and known semantics of operations in multi-dimensional extendible hash files. A correctness argument for the proposed algorithm is also presented.", acknowledgement = ack-nhfb, keywords = "Concurrency control; extendible hashing", } @Article{Impagliazzo:1989:ECS, author = "Russell Impagliazzo and Moni Naor", title = "Efficient cryptographic schemes provably as secure as subset sum", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "236--241", month = nov, year = "1989", CODEN = "ASFPDV", ISBN = "0-8186-1982-1", ISBN-13 = "978-0-8186-1982-3", ISSN = "0272-5428", LCCN = "QA 76 S979 1989", bibdate = "Tue May 12 09:49:52 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 89CH2808-4.", abstract = "Very efficient constructions, based on the intractability of the subset sum problem for certain dimensions, are shown for a pseudorandom generator and for a universal one-way hash function. (Pseudorandom generators can be used for private key encryption, and universal one-way hash functions for signature schemes). The increase in efficiency in the construction is due to the fact that many bits can be generated\slash hashed with one application of the assumed one-way function. All the constructions can be implemented in NC using an optimal number of processors.", acknowledgement = ack-nhfb, affiliation = "Univ of California, Berkeley, CA, USA", classification = "723", conference = "30th Annual Symposium on Foundations of Computer Science", conferenceyear = "1989", journalabr = "Annu Symp Found Comput Sci Proc", keywords = "Cryptography; Hash Functions; Private Key Encryption; Pseudorandom Generators; Signature Schemes; Subset Sum Security; Universal One Way Rash Functions", meetingaddress = "Research Triangle Park, NC, USA", meetingdate = "Oct 30--Nov 1 1989", meetingdate2 = "10/30--11/01/89", publisherinfo = "Computer Society", sponsor = "IEEE Technical Committee on Mathematical Foundations of Computing; Academic Press Inc.; Addison-Wesley Publishing Co; AT\&T Bell Lab; Bell Communications Research; et al", } @TechReport{Jain:1989:CHS, author = "Raj Jain", key = "Jain:1989:CHS", title = "A Comparison of Hashing Schemes for Address Lookup in Computer Networks", number = "DEC-TR-593", institution = "Digital Equipment Corporation", pages = "??", month = feb, year = "1989", bibdate = "Thu Jul 21 08:50:43 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kelly:1989:POM, author = "Michael A. Kelly and Rudolph E. Seviora", title = "Performance of {OPS5} matching on {CUPID}", journal = j-MICROPROC-MICROPROG, volume = "27", number = "1-5", pages = "397--404", month = aug, year = "1989", CODEN = "MMICDT", ISSN = "0165-6074", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "CUPID is a multiprocessor architecture which runs the DRete matching algorithm. This paper describes the performance of the DRete\slash CUPID combination in executing OPS5 matching. Results from simulations and analysis are presented. They show that the DRete\slash CUPID combination is effective at extracting parallelism from the match operation and can execute the resulting parallel process efficiently. The amount of parallelism extracted from the programs studied ranges from 5.5 for the smallest to 21.8 for the largest. A standard cell design of the CUPID processing element has been done. Timing information from this design is incorporated into the simulator. Measurements indicate that the overall speedup obtained with the DRete\slash CUPID combination ranges from 22.9 to 53.6 over a VAX 11\slash 785 running compiled versions of the same programs. The analysis demonstrates that DRete can extract substantial parallelism where token hashing --- another method of extracting parallelism from OPS5 matching which is attracting a lot of attention --- has little success. The value of extending DRete by incorporating token hashing is discussed.", acknowledgement = ack-nhfb, affiliation = "Univ of Waterloo", affiliationaddress = "Waterloo, Ont, Can", classification = "722; 723", conference = "Fifteenth EUROMICRO Symposium on Microprocessing and Microprogramming --- (EUROMICRO 89)", journalabr = "Microprocess Microprogram", keywords = "Computer Architecture; Computer Programming Languages; Computer Programming--Algorithms; Computer Simulation; Computer Systems, Digital; cupid Multiprocessor Architecture; drete/cupid Combination; Matching Algorithm; Multiprocessing; OPS5 Matching; Token Hashing", meetingaddress = "Cologne, West Ger", meetingdate = "Sep 4--8 1989", meetingdate2 = "09/04--08/89", } @InProceedings{Kitsuregawa:1989:EBS, author = "Masaru Kitsuregawa and Masaya Nakayama and Mikio Takagi", title = "The Effect of Bucket Size Tuning in the Dynamic Hybrid {GRACE} Hash Join Method", crossref = "Apers:1989:VLD", pages = "257--266", month = aug, year = "1989", CODEN = "VLDBDP", 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 show detailed analysis and performance evaluation of the Dynamic Hybrid GRACE Hash Join Method (DHGH Method) when the tuple distribution in buckets is unbalanced. The conventional Hash Join Methods specify the tuple distribution in buckets statically. However it may differ from estimation since join operations are applied with selection operations. When the tuple distribution in buckets is unbalanced, the processing cost of join operation becomes more costly than the ideal case when you use Hybrid Hash Join Method (HH Method). On the other hand, when you use the DHGH Method, the destaging buckets are selected dynamically, gives the same performance as the ideal case even if the tuple distribution in buckets is unbalanced such as Zipf-like distributions.", acknowledgement = ack-nhfb, affiliation = "Univ of Tokyo", affiliationaddress = "Tokyo, Jpn", classification = "723", journalabr = "Very Large Data Bases Int Conf Very Large Data Bases", keywords = "Computer Metatheory --- Programming Theory; Computer Programming --- Algorithms; Database Systems; Query Processing; Relational; Relational Algebra; VLDB", } @InProceedings{Kitsuregawa:1989:JSK, author = "M. Kitsuregawa and L. Harada and M. Takagi", key = "Kitsuregawa et al.", booktitle = "Proceedings of the Fifth International Conference on Data Engineering", title = "Join Strategies on {KD}-Tree Indexed Relations", publisher = "????", address = "Los Angeles, CA, USA", pages = "85--93", month = feb, year = "1989", bibdate = "Fri Jan 12 09:43:55 1990", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper we present efficient join algorithms on very large relations indexed by KD-trees. There are previous works proposing the join on multi-attribute clustered relations based on hashing and also on grid-partitioning, whose shortcomings are non-order preservation and low load-factor, respectively. KD-tree indexed relations are characterized by preserving data order and maintaining high load-factors. However, KD-tree indexing has the disadvantage of generating clusters which are overlapped in the join attribute domain, what causes a very high I/O cost for naive join algorithms. Here we analyze strategies to deal with this problem and introduce efficient algorithms to join two non-resident relations indexed by KD-trees. First we introduce the concept of wave, which is a set of pages that is the object of join processing and that propagates over the relation space in the direction of the join attribute axis. Based on this new concept, we present five join algorithms and also four extended algorithms with a garbage collection mechanism to increase the effective space of the main memory. We extensively evaluate these join algorithms with analytical formulas and simulation results. It is shown that the join of very large relations indexed by KD-trees can be performed with one scan of the relations.", acknowledgement = ack-nhfb, } @Article{Knott:1989:HTC, author = "Gary D. Knott and Pilar de la Torre", title = "Hash Table Collision Resolution with Direct Chaining", journal = j-J-ALG, volume = "10", number = "1", pages = "20--34", month = mar, year = "1989", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Wed Jul 20 23:12:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Krichevskii:1989:ADC, author = "R. E. Krichevskii", title = "Accelerated determination of codes and hash functions", journal = j-SOVIET-PHYS-DOKL, volume = "34", number = "4", pages = "303--??", day = "1", month = apr, year = "1989", CODEN = "SPHDA9", ISSN = "0038-5689", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Kriegel:1989:MQH, author = "Hans-Peter Kriegel and Bernhard Seeger", title = "Multidimensional Quantile Hashing is very Efficient for Nonuniform Distributions", journal = j-INFO-SCI, volume = "48", number = "2", pages = "99--117", day = "1", month = jul, year = "1989", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Previous multidimensional hashing schemes without directory which generalize the concept of W. Litwin's linear hashing partition the data space into equidistant cells using a dynamic orthogonal grid. Thus the performance of these schemes degenerates in case of nonuniform record distributions. We propose a new scheme without directory, called multidimensional quantile hashing, which avoids this important drawback. Quantile hashing exhibits for independent nonuniform record distributions practically the same performance as for uniform distributions. The performance gain of quantile hashing in comparison with other schemes without directory is demonstrated by experiments.", acknowledgement = ack-nhfb, affiliation = "Univ of Bremen", affiliationaddress = "Bremen, West Ger", classification = "723", conference = "Third International Conference on Data Engineering", journalabr = "Inf Sci", keywords = "Data Processing; File Organization; Multidimensional Quantile Hashing; Nonuniform Distributions", meetingaddress = "Los Angeles, CA, USA", meetingdate = "Feb 2--6 1987", meetingdate2 = "02/02--06/87", } @Article{Kumar:1989:CCE, author = "Vijay Kumar", title = "Concurrency control on extendible hashing", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "35--41", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present a deadlock-free algorithm for managing concurrent operations on extendible hashing. Extendible hashing is a dynamic file structure that grows and shrinks gracefully with the database. The algorithm uses a two-phase locking protocol and verification process at the right moment to guarantee a consistent view of the data in the execution of concurrent transactions. Unlike an algorithm where both the directory and data pages are locked for any data modification, the present algorithm eliminates the need for locking the directory thus achieving a higher level of concurrency, and reducing locking overheads.", acknowledgement = ack-nhfb, affiliation = "Univ of Missouri-Kansas City", affiliationaddress = "Kansas City, MO, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; Concurrency Control; Data Processing--File Organization; Database Systems; Deadlock Avoidance; Distributed; Extendible Hashing; performance; theory; Two Phase Locking; verification", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency", } @InProceedings{Kumar:1989:CCM, author = "Vijay Kumar", booktitle = "Computing Trends in the 1990's. Proceedings 1989 ACM Seventeenth Annual Computer Science Conference (Feb 21--23 1989: Louisville, KY, USA)", title = "A Concurrency Control Mechanism Based on Extendible Hashing for Main Memory Database Systems", crossref = "Riehl:1989:CTS", publisher = pub-ACM, address = pub-ACM:adr, pages = "109--113", year = "1989", ISBN = "0-89791-299-3", ISBN-13 = "978-0-89791-299-0", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A non-preemptive deadlock-free concurrency control mechanism based on extendible hashing has been presented for main memory database system. The algorithm makes use of the verification process of the optimistic concurrency control algorithm and two-phase locking policy to manage concurrent operations on sharable data. We also present a comparison of our algorithm with other two-phase locking mechanisms and show that our algorithm is more robust, easier to implement and provides a higher degree of concurrency than other algorithms on extendible hash file.", acknowledgement = ack-nhfb, affiliation = "Univ of Missouri-Kansas City", affiliationaddress = "Kansas City, MO, USA", classification = "723", conference = "Seventeenth Annual ACM Computer Science Conference", conferenceyear = "1989", keywords = "Computer Operating Systems--Design; Computer Systems Programming; Concurrency Control; Data Processing--Data Structures; Database Systems--Design; Extendible Hashing; Main Memory Database Systems; Multiprocessing Programs", meetingabr = "Seventeenth Annu ACM Comput Sci Conf", meetingaddress = "Louisville, KY, USA", meetingdate = "Feb 21--23 1989", meetingdate2 = "02/21--23/89", } @Article{Kuo:1989:DSF, author = "Y. S. Kuo and S.-Y. Hwang and H. F. Hu", title = "Data structure for fast region searches", journal = "IEEE Design \& Test of Computers", volume = "6", number = "5", pages = "20--28", month = oct, year = "1989", CODEN = "IDTCEC", ISSN = "0740-7475", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Bucketing, also known as fixed cells, is a data structure that is especially suitable for queries that cover small windows. However, this technique is not efficient if objects are long and narrow, such as wires. Also, as more objects are added, the efficiency of the query process may suffer. The authors describe a dynamic bucketing structure that maintains a two-level directory structure and uses a directory doubting and merging technique called extendible hashing. This technique allows directories to expand without sacrificing performance as more objects are inserted into the structure. They report the results of tests comparing the performance of dynamic bucketing with the performance of the quad-tree algorithms.", acknowledgement = ack-nhfb, affiliation = "Acad Sinica, Taiwan", classification = "713; 714; 723; 922", journalabr = "IEEE Des Test Comput", keywords = "Computer Aided Design; Data Processing--Data Structures; Design Automation Software; Dynamic Bucketing Structure; Extendible Hashing; Integrated Circuits, VLSI; Mathematical Statistics--Random Number Generation; Quad-Tree Algorithms; Query Process Efficiency; Region Searches", } @Article{Leung:1989:LPA, author = "K. S. Leung and K. H. Lee and S. M. Cheang", title = "Lists processing for artificial intelligence applications", journal = j-MICROPROC-MICROPROG, volume = "26", number = "4", pages = "271--287", month = dec, year = "1989", CODEN = "MMICDT", ISSN = "0165-6074", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Lisp is one of the most common programming languages for expert systems implementation. However, many problems exist in the Lisp language which affect Lisp programs performance. An existing expert system shell with fuzzy concepts in Lisp is studies to identify the bottlenecks of such systems. A hardware assisted architecture is proposed to solve these problems. This paper presents these problems and suggests a hardware assisted approach. The proposed architecture emphasizes on the list data structure and hash-table handling. The evaluation of the performance of the architecture is also given.", acknowledgement = ack-nhfb, affiliation = "Chinese Univ of Hong Kong", affiliationaddress = "Hong Kong", classification = "723", journalabr = "Microprocess Microprogram", keywords = "Artificial Intelligence--Expert Systems; Computer Programming Languages; Hash-Table Handling; lisp; Lisp Machine; Lists Processing", } @InProceedings{Levy:1989:LPT, author = "G. Levy", title = "A language for the {P}-any trees --- Applications to the dynamic virtual hashing methods", crossref = "Litwin:1989:FDO", pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:29 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lin:1989:PIB, author = "Chih-Chen Lin and Leo Mark and Timos Sellis and Christos Faloutsos", title = "Performance issues in the binary relationship model", journal = j-DATA-KNOWLEDGE-ENG, volume = "4", number = "3", pages = "195--221", month = sep, year = "1989", CODEN = "DKENEW", ISSN = "0169-023X", 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 propose to use the Binary Relationship Model not only in the logical, but also in the physical level. At the logical level we propose and analyze a query optimization algorithm. The major optimization issue is to find an optimized join sequence for chain queries. A branch-and-bound search algorithm with dynamic programming is used in the search for such a sequence. At the physical level we propose to store the binary relations using multiattribute hashing. We develop a join algorithm which takes advantage of the clustering that multiattribute hashing achieves, and derive analytical formulas to predict its performance.", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland", affiliationaddress = "College Park, MD, USA", classification = "723", journalabr = "Data Knowl Eng", keywords = "Binary Relationship Model; Computer Metatheory--Programming Theory; Database Systems; Multiattribute Hashing; Performance; Query Optimization", } @Article{Litvinov:1989:HOD, author = "V. A. Litvinov", title = "Hash-Sequential Organization of Data Sets", journal = j-PROG-COMP-SOFT, volume = "15", number = "2", pages = "70--??", day = "1", month = mar, year = "1989", CODEN = "PCSODA", ISSN = "0361-7688 (print), 1608-3261 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Litwin:1989:CTH, author = "W. Litwin and Y. Sagiv and K. Vidyasankar", title = "Concurrency and Trie Hashing", journal = j-ACTA-INFO, volume = "26", number = "7", pages = "597--614", year = "1989", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", ISSN-L = "0001-5903", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "The Trie Hashing (TH), defined by Litwin, is one of the fastest access methods for dynamic and ordered files. The hashing function is defined in terms of a trie, which is basically a binary tree where a character string is associated implicitly with each node. This string is compared with a prefix of the given key in the search process, and depending on the result either the left or the right child is chosen as the next node to visit. The leaf nodes point to buckets which contain the records. The buckets are on a disk, whereas the trie itself is in the core memory. In this paper we consider concurrent execution of the TH operations. In addition to the usual search, insertion and deletion operations, we also include range queries among the concurrent operations.", acknowledgement = ack-nhfb, affiliation = "I.N.R.I.A.", affiliationaddress = "Le Chesney, Fr", classification = "723", journalabr = "Acta Inf", keywords = "Computer Programming--Algorithms; Computer Systems Programming; Multiprocessing Programs; Trie Hashing (th)", } @TechReport{Litwin:1989:THC, author = "W. Litwin and N. Roussopoulos and G. Levy and H. Wang", key = "Litwin et al.", title = "Trie Hashing with Controlled Load", number = "UMIACS-TR-89-11, CS-TR-2189, SRC-TR-89-13", institution = "INRIA; Institute for Advanced Computer Studies and Systems Research Center, Department of Computer Science", address = "78150 Le Chesnay France; University of Maryland, College Park, MD 20742", pages = "1--29", month = feb, year = "1989", bibdate = "Mon May 8 15:25:45 1989", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Trie hashing is an access methods to primary key ordered dynamic files. The key address is computed through a trie. Key search needs usually one disk access since the trie may be in core and need two accesses for very large files, when the trie h as to be on the disk. We present a new variant of the method that allows to set up an arbitrary load factor for ordered insertions. In particular, one may create compact files, loaded up to 100\%. We show that the capabilities of trie hashing make the method preferable to a B-tree by most of criteria that motivated the latter method supremacy over the database world.", acknowledgement = ack-nhfb, } @InProceedings{Lohman:1989:IQO, author = "Guy Lohman", title = "Is query optimization a `solved' problem?", crossref = "Anonymous:1989:DQO", pages = "??", year = "1989", bibdate = "Mon Oct 24 18:28:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "No. Mentions cardinality estimation, rule-based optimization, and search strategies as open areas. Thinks optimizer learning (from experience) has `real sex appeal'. Very opinionated. Considers work on yet another hash-join algorithm, semijoin ordering, and partition-oblivious parallel join worthless.", } @Article{McKenney:1989:HEC, author = "Paul E. McKenney", title = "High-speed event counting and classification using a dictionary hash technique", journal = j-PROC-INT-CONF-PAR-PROC, volume = "3", pages = "71--75", year = "1989", 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", note = "IEEE catalog number 89CH2701-1.", abstract = "A dictionary-hash technique is developed that, when presented with a large group of labeled events, can stochastically determine the number of unique labels quickly and with a small amount of memory. This technique is applicable to areas such as signal processing, process monitoring and control, and computer communication network monitoring and control. The author focuses on the application of this technique to congestion-avoidance algorithms in high-speed computer-communications packet networks. In this application, the events are packet arrivals at a particular network node, and the labels consist of the source and destination addresses in the packets. The set of all packets with a particular source\slash destination address pair constitutes a session; the more sophisticated congestion-avoidance algorithms require knowledge of the number of active sessions. This knowledge can be provided in an effective and timely manner by the dictionary-hash technique. The technique is configurable to any desired degree of accuracy and lends itself to a simple realization in high-speed parallel hardware.", acknowledgement = ack-nhfb, affiliation = "SRI Int, Menlo Park, CA, USA", classification = "718; 722; 723", conference = "Proceedings of the 1989 International Conference on Parallel Processing", conferenceyear = "1989", journalabr = "Proc Int Conf Parallel Process", keywords = "Computational Methods; Computer Networks--Local Networks; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Computer-Communications Packet Networks; Computers, Digital; Congestion Avoidance; Dictionary--Hash Technique; High-Speed Networks; Network Monitoring", meetingaddress = "University Park, PA, USA", meetingdate = "Aug 8--12 1989", meetingdate2 = "08/08--12/89", publisherinfo = "IEEE Service Center", sponsor = "Penn State Univ, University Park, PA, USA", } @InProceedings{McKenney:1989:HSE, author = "P. McKenney", title = "High-Speed Event Counting and Classification Using a Dictionary Hash Technique", crossref = "McAuliffe:1989:PIC", pages = "71--75", year = "1989", bibdate = "Thu Oct 31 18:57:17 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{McMillan:1989:RRU, author = "Thomas McMillan and William Collins", booktitle = "Computing Trends in the 1990's. Proceedings 1989 ACM Seventeenth Annual Computer Science Conference (Feb 21--23 1989: Louisville, KY, USA)", title = "Recurrence relation in uniform hashing", publisher = pub-ACM, address = pub-ACM:adr, pages = "410--??", year = "1989", ISBN = "0-89791-299-3", ISBN-13 = "978-0-89791-299-0", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Assume that uniform hashing is used to post items into a table with m rows. For any n such that 0 $leq$ n \$LS m, let E${}_{n,m}$ represent the expected number of probes needed to post the (n + 1)st item. Clearly, E${}_{0,m}$ $=$ 1 for any m \$GREQ 1. For n \$GRT 0, posting the (n + 1)st item will require only one probe if its key hashes to an open address, and the probability of this is (m-n)/m. Otherwise, with probability n/m, the (n + 1)st key will hash to an occupied address, so the number of probes required is one plus the number of probes required in the rest of the table. But since that occupied address will not be accessed in subsequent probes, the expected number of probes in the rest of the table is the same as the expected number of probes to post an nth item in a table of size m-1.", acknowledgement = ack-nhfb, affiliation = "Radford Univ", affiliationaddress = "Radford, VA, USA", classification = "723", conference = "Seventeenth Annual ACM Computer Science Conference", conferenceyear = "1989", keywords = "Computer Systems Programming; Data Processing--File Organization; Recurrence Relations; Sorting; Summary Only; Uniform Hashing", meetingabr = "Seventeenth Annu ACM Comput Sci Conf", meetingaddress = "Louisville, KY, USA", meetingdate = "Feb 21--23 1989", meetingdate2 = "02/21--23/89", } @Article{Mitchell:1989:RHF, author = "Chris Mitchell and Dave Rush and Michael Walker", title = "A Remark on Hash Functions for Message Authentication", journal = j-COMPUT-SECUR, volume = "8", number = "1", pages = "55--58", day = "1", month = feb, year = "1989", CODEN = "CPSEDU", ISSN = "0167-4048", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "This paper considers the use of hash functions for message authentication. It is shown that a proposed method for using hash functions does not provide a secure non-repudiation service.", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Ltd", affiliationaddress = "Bristol, Engl", classification = "723", journalabr = "Comput Secur", keywords = "Computer Networks--Protection; Cryptography; Hash Functions; Message Authentication", } @InProceedings{Miyaguchi:1989:NHF, author = "S. Miyaguchi and M. Iwata and K. Ohta", title = "New 128-bit Hash Function", crossref = "ACM:1989:PIJ", pages = "279--288", year = "1989", bibdate = "Sat Jul 16 17:37:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1989:UOH, author = "Moni Naor and Moti Yung", booktitle = "Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing. (May 15--17 1989: Seattle, WA, USA)", title = "Universal one-way hash functions and their cryptographic applications", publisher = pub-ACM, address = pub-ACM:adr, pages = "33--43", year = "1989", ISBN = "0-89791-307-8", ISBN-13 = "978-0-89791-307-2", LCCN = "QA 76.6 A13 1989", bibdate = "Tue May 12 09:50:01 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We prove constructively that universal one-way hash functions exist if any 1-1 one-way functions exist. Among the various applications of the primitive is a One-Way based Secure Digital Signature Scheme, a system which is based on the existence of any 1-1 One-Way Functions and is secure against the most general attack known. Previously, all provably secure signature schemes were based on the stronger mathematical assumption that trapdoor one-way functions exist.", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Berkeley, CA, USA", classification = "723", conference = "Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing", conferenceyear = "1989", keywords = "Computer Metatheory; Cryptography; Digital Signatures; Hash Functions; One Way Functions", meetingabr = "Proc Twenty First Annu ACM Symp Theory Comput", meetingaddress = "Seattle, WA, USA", meetingdate = "May 15--17 1989", meetingdate2 = "05/15--17/89", sponsor = "ACM, Special Interest Group for Automata and Computability Theory; SC New York, NY, USA; IEEE, Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Naor:1989:UOW, author = "M. Naor and M. Yung", title = "Universal one-way hash functions and their cryptographic applications", crossref = "ACM:1989:PTF", pages = "33--43", year = "1989", bibdate = "Mon Jul 18 10:26:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Ollmert:1989:DD, author = "Hans Joachim Ollmert", title = "Datenstrukturen und Datenorganisationen", publisher = pub-OLDENBOURG, address = pub-OLDENBOURG:adr, pages = "??", year = "1989", ISBN = "3-486-20667-2", ISBN-13 = "978-3-486-20667-8", bibdate = "Thu Jul 21 08:50:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Baum, Block, Daten, Datenstruktur, Index, Speichermethode, Suche, VSAM, Zugriffsmethode", remark = "Das Buch Beschreibt Datenstrukturen und Formen zur Datenorganisation: Z.b. Listen, Keller, Logische Bloecke, Datensaetze, Binaere Baeume, Avl-baeume, Hashmethoden, Sekundaerindizes und Funktionen von Zugriffsmethoden. Ausfuehrlich Behandeltwerden Indexsequentielle Dateien und VSAM. Weiterhin wird auf Sicherungsmassnahmen von Daten Eingegangen.", } @Article{Omiecinski:1989:CFC, author = "Edward Omiecinski", key = "Omiecinski", title = "Concurrent file conversion between {B}${}^+$-tree and linear hash files", journal = j-INFO-SYS, volume = "14", number = "5", pages = "371--383", year = "1989", 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; UnCover library database", abstract = "The motivation for this paper is to show that the conversion of a $B^+$ tree file into a linear hash file and the conversion of a linear hash file into a $B^+$ tree file can be done concurrently with user-transaction processing. The conversion process, in general is motivated by a change in database processing requirements. For the first case, efficient sequential access and direct access are originally needed but now only efficient direct access is needed. for the second case, the opposite is true. This is quite reasonable for a database system which accommodates new and changing applications. Several existing database systems allow an off-line reorganization to support thee changes. We devise an algorithm which performs a concurrent conversion for both cases and present an analytic model of the conversion process for each. We also employ a typical database simulation model to evaluate the reorganization scheme. The results from the analytic model for Case 1 are within 3\% (on average) of the observed simulation results and for Case 2 are within 4\% (on average) of the observed simulation results.", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technology", affiliationaddress = "Atlanta, GA, USA", classification = "723", journalabr = "Inf Syst", keywords = "Binary Tree Files; Computer Programming--Algorithms; Data Processing; Database Systems; File Conversion; File Organization; Linear Hash Files", } @Article{Omiecinski:1989:HBI, author = "E. Omiecinski and E. T. Lin", key = "Omiecinski \& Lin", title = "Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "1", number = "3", pages = "329--343", month = sep, year = "1989", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Fri Dec 8 11:58:00 1989", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See also September 1991 TKDE.", abstract = "The goal of this paper is to compare the performance of two different join algorithms on both cube and ring interconnections for message-based multicomputers, and to investigate the effects that the number of processors and the type of interconnection scheme have on the performance. First, the parallel Hybrid-Hash [5], [15] join algorithm and the parallel Join-Index [22] join algorithm for both the cube and ring connected multicomputers are presented. The performance of these algorithms is then compared through analytical cost modeling. The result shows that the Join-Index join algorithm gives good performance only when the join selectivity is very small, and the Hybrid-Hash join algorithm performs consistently well under most situations. Our result also shows that the cube topology yields better execution time than the same algorithm on the ring topology. Furthermore, increasing the number of processors has a more significant improvement on the execution time for the cube than the ring configuration. The applicability of join indexes on the parallel database algorithms is also discussed in this paper.", acknowledgement = ack-nhfb, keywords = "Hashing; hypercube; join index; join operator; parallel algorithms; relational database; ring", } @Article{Omiecinski:1989:HBJ, author = "Edward Omiecinski and Eileen Tien", title = "A hash-based join algorithm for a cube-connected parallel computer", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "269--275", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "A hybrid-hash join algorithm presented is extended to a cube-connected parallel computer architecture. The performance of this algorithm is predicted analytically. the influence of the number of processors and the disk\slash node ratio on the algorithm's performance is examined.", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technology", affiliationaddress = "Atlanta, GA, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Algorithms; Analytic Cost Models; Computation Cost; Computer Programming; Computer Systems, Digital--Parallel Processing; Database Systems--Relational; Hash Join Algorithms; Hypercubes; management; performance", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors", } @Article{Omiecinski:1989:HIJ, author = "Edward R. Omiecinski and Eileen Tien Lin", title = "Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "1", number = "3", pages = "329--343", day = "1", month = sep, year = "1989", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based multicomputers, and investigate the effects that the number of processors and the type of interconnection scheme have on the performance. First, the parallel hybrid-hash join algorithm and the parallel join-index join algorithm for both the cube and ring connected multicomputers are presented. The performance of these algorithms is then compared through analytical cost modeling. The result shows that the join-index join algorithm gives good performance only when the join selectivity is very small, and the hybrid-hash join algorithm performs consistently well under most situations. It is shown that the cube topology yields better execution time than the same algorithm on the ring topology. Furthermore, increasing the number of processors has a more significant improvement on the execution time of the cube than for the ring configuration. The applicability of join indexes on the parallel database algorithms is also discussed.", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technol, Sch of Inf \& Comput Sci, Atlanta, GA, USA", classification = "723", journalabr = "IEEE Trans Knowl Data Eng", keywords = "Computer Programming--Algorithms; Computer Systems, Digital--Multiprocessing; Cube Connected Multicomputers; Database Systems; Join Algorithms; Loosely Coupled Multiprocessors; Message Passing Multiprocessors; Relational; Ring Connected Multicomputers", } @Article{Omiecinski:1989:HJP, author = "Edward R. Omiecinski", title = "Heuristics for Join processing Using Nonclustered Indexes", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "15", number = "1", pages = "??", month = jan, year = "1989", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Thu Jul 21 09:38:46 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Heuristic for highly local hash join accesses; realistically an index strategy may be superior; the author does not state that his approach is the best possible.", review = "ACM CR 8912-0899", } @InProceedings{Ouksel:1989:CML, author = "M. Ouksel and J. AbdulGhaffar", title = "Concurrency in Multidimensional Linear Hashing", crossref = "Litwin:1989:FDO", pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:49 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Poblete:1989:LCF, author = "Patricio V. Poblete and J. Ian Munro", title = "Last-Come-First-Served Hashing", journal = j-J-ALG, volume = "10", number = "2", pages = "228--248", month = jun, year = "1989", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Thu Jul 21 08:11:53 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Poblete:1989:LH, author = "Patrocio V. Poblete and J. Ian Munro", title = "Last-Come-First-Served Hashing", journal = j-J-ALG, volume = "10", number = "2", pages = "228--??", day = "1", month = jun, year = "1989", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1989:CHB, author = "Bart Preneel and Antoon Bosselaers and Rene Govaerts and Joos Vandewalle", booktitle = "Proceedings 1989 International Carnahan Conference on Security Technology (Oct 3--5 1989: Zurich, Switzerland)", title = "Collision-free hashfunctions based on blockcipher algorithms", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "203--210", year = "1989", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 89CH2774-8.", abstract = "The use of collision-free hash functions in signature and message authentication schemes is addressed. Applications of hash functions are described, and an overview of proposed hash functions is given. Methods of attack on hash functions are examined, and the properties a hash function must satisfy to be useful for cryptographic applications are set forth. A fast and secure proposal is made for a 2n-bit collision-free hash function based on an n-bit encryption algorithm. In case of the DES (Data Encryption Standard) the length of the results is 128 bits, which suffices to thwart a birthday attack.", acknowledgement = ack-nhfb, affiliation = "Katholieke Univ Leuven, Lab ESAT, Heverlee, Belg", classification = "718; 723", conference = "Proceedings: 1989 International Carnahan Conference on Security Technology", conferenceyear = "1989", keywords = "Cryptographic Protocols; Cryptography--Design; Data Compression; Data Transmission--Security Systems; Encryption Algorithm; Hash Functions; Information Theory; Message Authentication; Signature Verification", meetingabr = "Proc 1989 Int Carnahan Conf Secur", meetingaddress = "Zurich, Switzerland", meetingdate = "Oct 3--5 1989", meetingdate2 = "10/3--5/1989", publisherinfo = "IEEE Service Center", sponsor = "Schweizerischer Electrotechnischer Verein (SEV), Switz", } @Article{Provenzano:1989:HTM, author = "Tom Provenzano", title = "A Hash Table Manager In {C++}", journal = j-CUJ, volume = "7", number = "11", pages = "83--??", month = nov, year = "1989", ISSN = "0898-9788", bibdate = "Fri Aug 30 16:52:23 MDT 1996", bibsource = "http://www.cuj.com/cbklist.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Quisquater:1989:BHF, author = "J. J. Quisquater and M. Girault", title = "$2n$-Bit Hash-Functions Using $n$-Bit Symmetric Block Cipher Algorithms", crossref = "Quisquater:1989:ACE", pages = "??", year = "1989", bibdate = "Sat Jul 16 17:49:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ramakrishna:1989:ARP, author = "M. V. Ramakrishna", title = "Analysis of random probing hashing", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "83--90", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Random probing and uniform hashing are theoretical models of hashing schemes based on open addressing such as double hashing. P.-A. Larson provided an asymptotic analysis of random probing hashing with multi-record buckets. His analysis was based on the Poisson approximation to the binomial distribution. The problems of obtaining an exact model and analyzing finite random probing hashing was left open with the mention of the difficulties involved. We address these open problems in this paper. Also, the search performance of full hash tables is analyzed.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ", affiliationaddress = "East Lansing, MI, USA", classification = "723; 922", journalabr = "Inf Process Lett", keywords = "Binomial Distribution; Data Processing; Double Hashing; File Organization; measurement; performance; Probability--Random Processes; Random Probing Hashing; Search Methods; theory", subject = "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, Sorting and searching", } @InProceedings{Ramakrishna:1989:DEH, author = "M. V. Ramakrishna and W. R. Tout", title = "Dynamic external hashing with guaranteed single access retrieval", crossref = "Litwin:1989:FDO", pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ramakrishna:1989:FOU, author = "M. V. Ramakrishna and Per-{\AA}ke Larson", title = "File Organization Using Composite Perfect Hashing", journal = j-TODS, volume = "14", number = "2", pages = "231--263", day = "1", month = jun, year = "1989", 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; UnCover library database", abstract = "Perfect hashing refers to hashing with no overflows. We propose and analyze a composite perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in a single disk access. Insertions and deletions are simple, and the file size may vary considerably without adversely affecting the performance. A simple variant of the scheme supports efficient range searches in addition to being a completely dynamic file organization scheme. These advantages are achieved at the cost of a small amount of additional internal storage and increased cost of insertions.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ", affiliationaddress = "East Lansing, MI, USA", classification = "723; 903", journalabr = "ACM Trans Database Syst", keywords = "Composite Perfect Hashing; Data Processing; Database Systems; Dynamic File Organization; File Organization; Information Science--Information Retrieval; Large External Files; Range Searches", } @Article{Ramakrishna:1989:PPB, author = "M. V. Ramakrishna", title = "Practical Performance of {Bloom} Filters and Parallel Free-text Searching", journal = j-CACM, volume = "32", number = "10", pages = "1237--1239", month = oct, year = "1989", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "{\em Computing Reviews}: ``This short communication deals with a special kind of hash function called `Bloom filters.' These filters are used, for example, to search a differential file containing updates to a main file.''", acknowledgement = ack-nhfb, keywords = "design; performance", review = "ACM CR 9005-0398", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process \\ H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage \\ H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods", } @InProceedings{Ramamohanarao:1989:PMRa, author = "K. Ramamohanarao and J. Shepherd and R. Sacks-Davis", title = "Partial-match Retrieval for Dynamic Files using Linear Hashing with Partial Expansions", crossref = "Litwin:1989:FDO", pages = "??", year = "1989", bibdate = "Thu Jul 21 09:38:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ramamohanarao:1989:PMRb, author = "K. Ramamohanarao and J. Shepherd and R. Sacks-Davis", booktitle = "Proc. of the 1st Intern. Symposium on Database Systems for Advanced Applications, Seoul, Korea", title = "Partial-match Retrieval using Multiple-Key Hashing with Multiple File Copies", publisher = "????", address = "????", pages = "??", month = apr, year = "1989", bibdate = "Thu Jul 21 09:38:53 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Bucket addresses are catenated field hashes. Size of field hashes is a function of query probability. To avoid independence assumption, use greedy method. Replicated files, with differing field length, greatly increase performance.", } @Article{Richter:1989:HAS, author = "Karol Richter and Dan Grigoras", title = "Hash-join algorithms for {SIMD-MIMD} computer architecture", journal = j-COMP-ART-INTELL, volume = "8", number = "4", pages = "369--384", year = "1989", CODEN = "CARIDY", ISSN = "0232-0274", 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 is devoted to hash-join algorithms, executable on a SIMD-MIMD computer architecture. First, a model of the computer system is described. Then, a class of algorithms is presented. It is shown that each algorithm has an application domain defined by the given configuration and the characteristics of the operand relations. However, all the algorithms make extensive use of the system's hardware features and implement three sorts of parallelism: pipelining, multiprocessing, and memory addressing by content. The analytical evaluation of the most complex algorithm, from which the performances of the others can be deduced, shows the dramatic influence of the architecture on the system throughput.", acknowledgement = ack-nhfb, affiliation = "Slovak Acad of Sciences", affiliationaddress = "Bratislava, Czech", classification = "722; 723", journalabr = "Comput Artif Intell", keywords = "Artificial Intelligence; Computer Architecture; Computer Programming --- Algorithms; Database Systems; Hash-Join Algorithms; Multiple Data Stream Architectures; SIMD-MIMD Computers", } @InProceedings{Rotem:1989:CMH, author = "Doron Rotem", booktitle = "Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Mar 29--31 1989: Philadelphia, PA, USA)", title = "Clustered Multiattribute Hash Files", crossref = "ACM:1989:PEA", publisher = pub-ACM, address = pub-ACM:adr, pages = "225--234", year = "1989", ISBN = "0-89791-308-6", ISBN-13 = "978-0-89791-308-9", LCCN = "QA 76.9 D3 A26 1989", 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 proposed a new method of arranging the buckets in a multiattribute hash files. The new method which is based on Attribute Gray Encoding was analyzed and shown to improve on existing methods in terms of number of clusters accessed for range queries and overhead computation. It was shown that the way a signature is constructed from the individual hash functions can be crucial to the performance of a hashing scheme and therefore it is important to find an optimal ordering of the attributes. The analysis was performed under the assumption of independence of attributes in queries.", acknowledgement = ack-nhfb, affiliation = "Lawrence Berkeley Lab", affiliationaddress = "Berkeley, CA, USA", classification = "723; 731", conference = "Proceedings of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems", conferenceyear = "1989", keywords = "Access Methods; Attribute Gray Encoding (ag); Codes, Symbolic--Encoding; Computer Programming--Algorithms; Data Processing; File Organization; Gray Code Hashing; Multidimensional Data", meetingabr = "Proc Eighth ACM SIGACT-SIGMOD-SIGART Symp Princ Database Syst", meetingaddress = "Philadelphia, PA, USA", meetingdate = "Mar 29--31 1989", meetingdate2 = "03/29--31/89", sponsor = "Special Interest Group for Automata and Computability Theory; Special Interest Group for the Management of Data; Special Interest Group for Artificial Intelligence", } @InProceedings{Schmidt:1989:AUP, author = "Jeanette P. Schmidt and Alan Siegel", booktitle = "Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing. (May 15--17 1989: Seattle, WA, USA)", title = "On aspects of universality and performance for closed hashing", crossref = "ACM:1989:PTF", publisher = pub-ACM, address = pub-ACM:adr, pages = "355--366", year = "1989", ISBN = "0-89791-307-8", ISBN-13 = "978-0-89791-307-2", LCCN = "????", 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 two hashing models for storing a set S a subset of \$LFBC@0,1,2,...,m \$MIN 1\$RTBC in a table T of size n. The first model uses universal hashing for a partially loaded table. A set of hash functions is universal if, for any the input set, a randomly selected function has an efficient expected performance. The second model is perfect hashing for a full table. In preprocessing the input set is used to determine a hash function that achieves some desired performance criteria. In both models a key problem is to construct a `small' set of functions that will permit a short description (program) for each function in the set. For perfect hashing, we obtain nearly tight results on the size of oblivious O(1)-probe hash functions.", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", affiliationaddress = "New Brunswick, NJ, USA", classification = "723", conference = "Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing", conferenceyear = "1989", keywords = "Closed Hashing; Computer Metatheory; Data Processing; Double Hashing; File Organization; Perfect Hashing; Universal Hashing", meetingabr = "Proc Twenty First Annu ACM Symp Theory Comput", meetingaddress = "Seattle, WA, USA", meetingdate = "May 15--17 1989", meetingdate2 = "05/15--17/89", sponsor = "ACM, Special Interest Group for Automata and Computability Theory; SC New York, NY, USA; IEEE, Computer Soc, Los Alamitos, CA, USA", } @TechReport{Schneider:1989:DTA, author = "Donovan Schneider and David J. DeWitt", title = "Design Tradeoffs of Alternative Query Tree Representations for Multiprocessor Database Machines", number = "TR 869", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = aug, year = "1989", bibdate = "Thu Jul 21 09:38:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "During the past five years the design, implementation, and evaluation of join algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, the methods used to represent join queries and their corresponding effects on performance has received little attention during this same time span. In this paper we examine the tradeoffs imposed by left-deep, right-deep and bushy query trees in a multiprocessor environment. Specifically, we address potential parallelism, memory consumption, support for dataflow processing, and the cost of optimization that are dictated by a particular query tree format. Results indicate that for hash-based join algorithms, right-deep query trees provide the best potential to exploit large multiprocessor database machines.", acknowledgement = ack-nhfb, } @TechReport{Schneider:1989:PEFa, author = "Donovan A. Schneider and David J. DeWitt", title = "A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment", number = "TR 836", institution = "University of Wisconsin", pages = "??", month = apr, year = "1989", bibdate = "Thu Jul 21 09:38:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join methods, Simple hash represents a looping algorithm with hashing, and our last algorithm is the more traditional sort-merge. The performance of each of the algorithms with different tuple distribution policies, the addition of bit vector filters, varying amounts of main-memory for joining, and non-uniformly distributed join attribute values is studied. The Hybrid hash-join algorithm is found to be superior except when the join attribute values of the inner relation are non-uniformly distributed and memory is limited. In this case, a more conservative algorithm such as the sort-merge algorithm should be used. The Gamma database machine serves as the host for the performance comparison.", acknowledgement = ack-nhfb, } @Article{Schneider:1989:PEFb, author = "Donovan A. Schneider and David J. DeWitt", title = "A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment", journal = j-SIGMOD, volume = "18", number = "2", pages = "110--121", month = jun, year = "1989", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:31 MST 2004", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Also published in \cite{Clifford:1989:AIC}.", URL = "(File organisation); C6130 (Data handling techniques); http://www.acm.org/pubs/articles/proceedings/mod/67544/p110-schneider/p110-schneider.pdf; http://www.acm.org/pubs/citations/proceedings/mod/67544/p110-schneider/", abstract = "In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join methods, Simple hash represents a looping algorithm with hashing, and our last algorithm is the more traditional sort-merge. The performance of each of the algorithms with different tuple distribution policies, the addition of bit vector filters, varying amounts of main-memory for joining, and non-uniformly distributed join attribute values is studied. The Hybrid hash-join algorithm is found to be superior except when the join attribute values of the inner relation are non-uniformly distributed and memory is limited. In this case, a more conservative algorithm such as the sort-merge algorithm should be used. The Gamma database machine serves as the host for the performance comparison.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", classification = "C5440 (Multiprocessor systems and techniques); C6120 (File organisation); C6130 (Data handling techniques); C6160 (Database management systems (DBMS))", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", generalterms = "Algorithms; Experimentation; Performance", keywords = "Bit vector filters; Conservative algorithm; Gamma database machine; Has-based join methods; Hybrid hash; Inner relation; Join attribute values; Looping algorithm; Main-memory; Non-uniformly distributed join attribute values; Parallel join algorithms; Performance comparison; Performance evaluation; Shared-nothing multiprocessor environment; Simple hash; Sort-merge algorithm; Tuple distribution policies", remark = "Simple hash join depends on memory capacity and uniformity. Grace is stable. A hybrid scheme is best. Bit filters improve all methods.", subject = "Information Systems --- Database Management --- Systems (H.2.4): {\bf Distributed databases}; Mathematics of Computing --- Numerical Analysis --- General (G.1.0): {\bf Parallel algorithms}; Information Systems --- Database Management --- Systems (H.2.4): {\bf Concurrency}; Data --- Data Storage Representations (E.2): {\bf Hash-table representations}", thesaurus = "Database management systems; File organisation; Parallel algorithms; Software selection; Sorting; Special purpose computers", xxcrossref = "Anonymous:1989:ASI", } @InProceedings{Schneider:1989:PEFc, author = "D. Schneider and D. DeWitt", title = "A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment", crossref = "Clifford:1989:AIC", pages = "110", year = "1989", bibdate = "Mon Jul 18 08:46:06 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Simple Hash Joins Hybrid Grace Merge Sort-merge comparison GAMMA", } @Article{Sequin:1989:PRT, author = "Carlo H. S{\'e}quin and Eliot K. Smyrl", title = "Parameterized Ray Tracing", journal = j-COMP-GRAPHICS, volume = "23", number = "3", pages = "307--314", month = jul, year = "1989", CODEN = "CGRADI, CPGPBZ", ISSN = "0097-8930", bibdate = "Mon Oct 4 18:48:32 MDT 1999", bibsource = "Graphics/imager/imager.89.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/graph/74333/p307-sequin/", acknowledgement = ack-nhfb, conference = "held in Boston, Massachusetts; 31 July -- 4 August 1989", keywords = "algorithms; hashing; parameterization; performance; ray tracing; rendering; runlength encoding; subexpression elimination; surface properties", remark = "store ray tree data to allow quick material changes \\ The construction and refinement of a computer graphics scene is unacceptably slow when using ray tracing. We introduce a new technique to speed up the generation of successive ray traced images when the geometry of the scene remains constant and only the light source intensities and the surface properties need to be adjusted. When the scene is first traced, an expression parameterized in the color of all lights and the surface property coefficients of all objects is calculated and stored for each pixel. Redisplaying a scene with a new set of lights and colors then consists of substituting values for the corresponding parameters and re-evaluating the expressions for the pixels. This parameter updating and redisplay takes only a few seconds, as compared to the many minutes or hours required to ray trace the entire scene again, but it uses much more memory and disk space. With suitable expression sharing, however, these storage needs can be reduced to an acceptable level.", subject = "{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representations. {\bf I.3.7} Computing Methodologies, COMPUTER GRAPHICS, Three-Dimensional Graphics and Realism, Color, shading, shadowing, and texture. {\bf I.3.3} Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Display algorithms.", } @InProceedings{Sethi:1989:FSR, author = "Ishwar K. Sethi and Nagarajan Ramesh", booktitle = "Proc. ROBEX '89 (sponsored by Robotics and Expert Systems Division, Instrument Society of America)", title = "A Flexible Shape Recognition Approach Through Hashing", publisher = "????", address = "????", pages = "185--188", year = "1989", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, city = "Palo Alto, CA", } @InProceedings{Siegel:1989:UCF, author = "Alan Siegel", title = "On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications", crossref = "IEEE:1989:ASF", journal = "Annual Symposium on Foundations of Computer Science (Proceedings)", pages = "20--25", month = nov, year = "1989", CODEN = "ASFPDV", ISBN = "0-8186-1982-1", ISBN-13 = "978-0-8186-1982-3", ISSN = "0272-5428", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 89CH2808-4.", abstract = "A mechanism is provided for constructing log-n--wise-independent hash functions that can be evaluated in O(1) time. A probabilistic argument shows that for fixed \$epsilon@ \$LS@ 1, a table of n\$+\$epsilon@\$/ random words can be accessed by a small O(1)-time program to compute one important family of hash functions. An explicit algorithm for such a family, which achieves comparable performance for all practical purposes, is also given. A lower bound shows that such a program must take \$Omega@(k/\$epsilon@) time, and a probabilistic argument shows that programs can run in O(k${}^2$/\$epsilon@${}^2$) time. An immediate consequence of these constructions is that double hashing using these universal functions has (constant factor) optimal performance in time, for suitably moderate loads. Another consequence is that a T-time PRAM (parallel random-access machine) algorithm for n log n processors (and n${}^k$ memory) can be emulated on an n-processor machine interconnected by an n \$MUL@ log n Omega network with a multiplicative penalty for total work that, with high probability, is only O(1).", acknowledgement = ack-nhfb, affiliation = "Dep of Comput Sci, Stanford Univ, Stanford, CA, USA", classification = "721; 723", conference = "30th Annual Symposium on Foundations of Computer Science", conferenceyear = "1989", journalabr = "Annu Symp Found Comput Sci Proc", keywords = "Algorithms; Automata Theory--Computability and Decidability; Computer Programming; Computer Systems Programming--Multiprocessing Programs; Double Hashing; Hash Functions; Omega Networks; Parallel Algorithms", meetingaddress = "Research Triangle Park, NC, USA", meetingdate = "Oct 30--Nov 1 1989", meetingdate2 = "10/30--11/01/89", publisherinfo = "Computer Society", sponsor = "IEEE Technical Committee on Mathematical Foundations of Computing; Academic Press Inc.; Addison-Wesley Publishing Co; AT\&T Bell Lab; Bell Communications Research; et al", } @InProceedings{Smith:1989:ITD, author = "F. J. Smith and L. C. Emerson", booktitle = "Second International Conference on Data and Knowledge Systems for Manufacturing and Engineering (Oct 16--18 1989: Gaithersburg, MD, USA)", title = "Indexing technical data in a materials database", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "12--18", year = "1989", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 89CH2806-8.", abstract = "Much of the data used by design engineers lack precision, particularly materials property data which are measured in inexact physical experiments and engineering tests. The indexing of such data needs to suit the various types of proximity searches of interest to an engineer. It is shown that B${}^{+}$-tree performance is best when the data are stored as specific values. A new structure, the interval tree, is presented and shown to be useful when much of the stored data is expressed in the form of ranges.", acknowledgement = ack-nhfb, affiliation = "Dep of Comput Sci, Queen's Univ of Belfast, Belfast, Engl", classification = "723; 903; 921", conference = "Second International Conference on Data and Knowledge Systems for Manufacturing and Engineering", conferenceyear = "1989", keywords = "B-Plus Trees; Computer Aided Engineering; Data Processing--Data Structures; Database Systems; Engineering Design; Hashing; Indexing; Information Science; Interval Trees; Materials; Materials Databases; Mathematical Techniques--Trees; Search Methods", meetingabr = "Second Int Conf Data Knowl Sys Manuf Eng", meetingaddress = "Gaithersburg, MD, USA", meetingdate = "Oct 16--18 1989", meetingdate2 = "10/16--18/89", publisherinfo = "IEEE Service Center", sponsor = "ACM, SIGMOD, New York, NY, USA; IEEE, Computer Soc, Los Alamitos, CA, USA; IBM Corp, USA; Siemens Corp Research; Natl Inst of Standards \& Technology, Gaithersburg, MD, USA", } @TechReport{Spetka:1989:THJ, author = "Scott Edward Spetka and Gerald Popek", title = "Three-way hash join query processing in distributed relational database systems", institution = "UCLA Computer Science Dept.", address = "Los Angeles, CA, USA", pages = "17", year = "1989", LCCN = "QA 75.5 R46", bibdate = "Sat Jul 16 00:50:03 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Takata:1989:MMM, author = "H. Takata and S. Komori and T. Tamura and F. Asai and T. Tokuda and K. Shima and H. Nishikawa and H. Terada", booktitle = "Symposium on VLSI Circuits Digest of Technical Papers (May 25--27 1989: Kyoto, Japan)", title = "100 Mega-access matching memory for a data-driven microprocessor", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "123--124", year = "1989", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 89TH0262-6.", abstract = "A 100 mega-access throughput matching memory for a data-driven microprocessor has been designed with a pipelined memory access using an elastic pipeline structure. A mixed mode address hashing scheme and a bit-reverse method have been used to decrease the probability of hashing address conflict. As a result, it is indicated that a 255-50-MOPS (million operations per second) data-driven processor could be developed using the 100 mega-access throughput matching memory.", acknowledgement = ack-nhfb, affiliation = "Mitsubishi Electr Corp, Itami, Jpn", classification = "713; 721; 722", conference = "Symposium on VLSI Circuits 1989", conferenceyear = "1989", keywords = "Computers, Microcomputer; Data Flow Computing; Data Storage, Digital; Digest of Paper; Integrated Circuits, VLSI; Mixed Mode Address Hashing; Pipelined Memory Access; Storage Devices", meetingabr = "Symp VLSI Circuit 1989", meetingaddress = "Kyoto, Japan", meetingdate = "May 25--27 1989", meetingdate2 = "05/25--27/1989", publisherinfo = "IEEE Service Center", } @Article{Taylor:1989:SAC, author = "Jeff Taylor", title = "String-indexed arrays in {C++}", journal = j-COMP-LANG-MAG, volume = "6", number = "12", pages = "43--??", day = "1", month = dec, year = "1989", CODEN = "COMLEF", ISSN = "0749-2839", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "C + +'s operator overloading capabilities let you index arrays with strings, floats, or user-defined types. Sample binary search tree and hash table implementations show how to put this power to good use.", acknowledgement = ack-nhfb, } @Book{Wiederhold:1989:DD, author = "Gio Wiederhold", title = "Dateiorganisation in Datenbanken", publisher = pub-MH, address = pub-MH:adr, pages = "??", year = "1989", ISBN = "3-89028-133-8", ISBN-13 = "978-3-89028-133-9", bibdate = "Thu Jul 21 08:50:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Dateiorganisation, Datenbank, Hashingdatei, Ringdatei, Transaktion", remark = "Transaktionen An Dateien, Hardware und Ihre Parameter, Grundlegende Dateien, Indizierte Dateien, Hashingdateien und Ringdateien, Kombination der Dateiverfahren, Indeximplementierung, Dateiorganisation, Speicherorganisation, Dezentralisiertedateien, Analyseverfahren, Datendarstellung, Dateisystemauswertung, Dateischutz.", } @Article{Wogulis:1989:SSS, author = "James Wogulis", title = "Self-adjusting and split sequence hash tables", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "185--188", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "The author proposes a combination of two hashing techniques: split sequence hash search and self-adjusting hash tables. Split sequence search is applicable to chaining, and open addressing hashing. Self-adjusting hash tables are intended for use when the keys to be found do not occur in a random distribution (i.e., for a hash table of size N, each table location has the probability P $=$ 1/N of being requested), but rather when certain keys are looked up more frequently than others. The author demonstrates how the two methods can be combined, and provides some experimental data comparing these different methods.", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Irvine, CA, USA", classification = "723", journalabr = "Inf Process Lett", keywords = "algorithms; Chaining; Computer Programming--Algorithms; Data Processing; File Organization; Open Addressing; performance; Self Adjusting Hash Tables; Split Sequence Hash Search; theory", subject = "E.1 Data, DATA STRUCTURES \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", } @MastersThesis{Wood:1989:PQP, author = "D. Wood", title = "Parallel Queues and Pools, An Evaluation", type = "Master's Thesis", school = "Courant Institute, New York University", address = "New York, NY, USA", pages = "??", month = jan, year = "1989", bibdate = "Thu Jul 21 09:38:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Revised version available as NYU Ultracomputer Note \#150.", abstract = "Also describes dynamic hash table-based queue algorithm.", acknowledgement = ack-nhfb, } @InProceedings{Yamane:1989:DEH, author = "Y. Yamane and M. Narita and F. Kozakura and A. Makinouchi", booktitle = "Proc. of the 1st Intern. Symposium on Database Systems for Advanced Applications, Seoul, Korea", title = "Design and Evaluation of a High-Speed Extended Relational Database Engine, {XRDB}", publisher = "????", address = "????", pages = "??", month = apr, year = "1989", bibdate = "Thu Jul 21 09:38:57 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Object layer on relations. 4 relation implementation types: chained, B-tree, hash nested. 15 operations, some with identical function, but different action. File server.", } @Article{Yasuda:1989:AMU, author = "Takuya Yasuda and Satoshi Igarashi and Oichi Atoda and Nobuo Saito", title = "`Pattern associative memory' and its use in logic programming language processors", journal = j-SYS-COMP-JAPAN, volume = "20", number = "11", pages = "11--20", month = nov, year = "1989", CODEN = "SCJAEP", ISSN = "0882-1666", bibdate = "Thu Oct 31 17:45:50 2002", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The traditional speed improvement of the logic language processing system has been based on the parallelism of clauses, and aimed at speeding up of the unification. However, there can be another approach. By introducing a specific function to the memory hardware, the database can be managed independently of the host CPU. Then the speed is improved by minimizing the data traffic through the von Neumann bottleneck in the retrieval of candidate clauses. This paper proposes a pattern associative memory (PAM) which maintains the clauses by the structural representation in it and retrieves them by pattern matching with a high speed. To make use of argument parallelism of clauses, parallel hashing is adopted in PAM.", acknowledgement = ack-nhfb, affiliation = "Tokyo Univ of Agriculture and Technology", affiliationaddress = "Koganei, Jpn", classification = "722; 723; 922", journalabr = "Syst Comput Jpn", keywords = "Associative; Candidate Clause Retrieval; Computer Systems, Digital --- Parallel Processing; Data Storage, Digital; Database Systems; Garbage Collection; Hash Table; Hashing Processor; Logic Language Processing; Pattern Associative Memory; Probability", } @Article{Yokoyama:1989:NLP, author = "Shoichi Yokoyama and Fumio Motoyoshi and Hitoshi Isahara", title = "Natural language processing system with a large vocabulary in secondary storage", journal = "Denshi Gijutsu Sogo Kenkyusho Iho/Bulletin of the Electrotechnical Laboratory", volume = "53", number = "5", pages = "52--70", year = "1989", CODEN = "DGSKAR", ISSN = "0366-9092", 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 a natural language processing system with a large vocabulary. When the vocabulary is very large, it is difficult to deal with such vocabulary `in-core' as one in a traditional system. In this paper, words are grouped into those of primary importance and those of secondary importance. The former are located in the main memory (i.e., `in-core'), and the latter are located in secondary storage. When the system consults a dictionary, the `in-core' is looked up first, and then the secondary storage is accessed. Efficient access requires a good configuration of the secondary storage. The ordered hashing mechanism is adopted because of its quick access, and because its structure can be uniquely constructed due to the dictionary order. The grammar written by Mizutani is adopted for the system because it has been intended for machine oriented grammar and because the number of the tree structures is less than that of the traditional approach.", acknowledgement = ack-nhfb, classification = "721; 723; 903", journalabr = "Denshi Gijutsu Sogo Kenkyusho Iho", keywords = "Automata Theory--Grammars; Data Processing; Information Science--Language Translation and Linguistics; Large Scale Dictionary; Mizutani Grammar; Natural Language Processing; Ordered Hashing Mechanism; Secondary Storage", } @InProceedings{Asano:1990:APP, author = "Tetsuo Asano and T. Tokuyama", title = "Algorithms for projecting points to give the most uniform distribution with application to hashing", crossref = "Asano:1990:ISS", pages = "300--309", year = "1990", bibdate = "Thu Jul 14 16:41:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Banieqbal:1990:RMH, author = "B. Banieqbal and S. Hilditch", title = "The Random Matrix Hashing Algorithm", number = "UMCS-90-9-1", institution = inst-MANCHESTER-CS, address = inst-MANCHESTER-CS:adr, pages = "??", year = "1990", bibdate = "Thu Jul 21 09:38:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Blakeley:1990:JIM, author = "Jose A. Blakeley and Nancy L. Martin", key = "Blakeley \& Martin", title = "Join Index, Materialized View, and Hybrid-Hash Join: {A} Performance Analysis", crossref = "IEEE:1990:PSI", pages = "256--263", year = "1990", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "views", } @Article{Bollobas:1990:CDC, author = "B{\'e}la Bollob{\'a}s and Andrei Z. Broder and Istvan Simon", title = "The Cost Distribution of Clustering in Random Probing", journal = j-J-ACM, volume = "37", number = "2", pages = "224--237", month = apr, year = "1990", 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 = "A new approach to the analysis of random probing hashing algorithms is presented. The probability-generating function in closed form for the asymptotic cost of insertion via random probing with secondary clustering is derived. For higher-order clustering, it is shown that all the moments of the probability distribution of the insertion cost exist and are asymptotically equal to the corresponding moments of the cost distribution under uniform hashing. The method in this paper also leads to simple derivations for the expected cost of insertion for random probing with secondary and higher-order clustering.", acknowledgement = ack-nhfb, affiliation = "Univ of Cambridge", affiliationaddress = "Cambridge, Engl", classification = "723", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; clustering; Clustering; Computer Programming; Cost Distribution; Data Processing--Data Structures; Data Structure and Algorithms; hashing; Hashing Algorithms; open addressing; Random Probing; random probing; Theory; uniform hashing", } @InProceedings{Bourdon:1990:ORU, author = "Olivier Bourdon and G\'{e}rard Medioni", title = "{Object Recognition Using Geometric Hashing on the Connection Machine}", crossref = "Freeman:1990:ICP", pages = "596--600", year = "1990", bibdate = "Mon Jul 18 11:54:29 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Brain:1990:PHU, author = "Marshall D. Brain and Alan L. Tharp", title = "Perfect Hashing using sparse matrix packing", journal = j-INFO-SYS, volume = "15", number = "3", pages = "281--290", year = "1990", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Broder:1990:MAH, author = "Andrei Z. Broder and Anna R. Karlin", title = "Multilevel Adaptive Hashing", crossref = "ACM:1990:PFA", pages = "43--53", year = "1990", bibdate = "Thu Oct 31 18:59:26 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Burkowski:1990:UPH, author = "F. J. Burkowski and G. V. Cormack", title = "Use of Perfect Hashing in a Paged Memory Management Unit", crossref = "Wah:1990:PIC", pages = "96--100", year = "1990", bibdate = "Mon Jul 18 11:59:38 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Cheiney:1990:PST, author = "J. P. Cheiney and C. de Maindreville", title = "A Parallel Strategy for Transitive Closure Using Double Hash-Based Clustering", crossref = "McCleod:1990:VLD", pages = "347", year = "1990", bibdate = "Mon Jul 18 09:32:11 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "recursive query processing VLDB", } @TechReport{Chung:1990:BCW, author = "S. Chung", title = "Block Code Words for Partial Match Retrieval in Very Large Databases,", number = "WSU-CS-90-10", institution = "Washington State University", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:00 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A block Concatenated Code Word (BCCW) surrogate file scheme is developed to speed up partial match retrieval in very large databases. A BCCW is generated for each block of the data file by hashing the attribute values in the data block. The BCCW's forms a surrogate file which is used as an index to the data file. For a partial match retrieval query, a block query code word (BQCW) is generated and compared with the BCCW's. Thus, we can obtain considerable speed up in partial match retrieval by using the BCCW surrogate file. The storage requirement and performance of the BCCW surrogate file are evaluated and compared with those of other schemes.", acknowledgement = ack-nhfb, } @InProceedings{Damgaard:1990:DPH, author = "I. B. Damg{\aa}rd", title = "A Design Principle for Hash Functions", crossref = "Brassard:1990:ACC", pages = "416--427", year = "1990", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{DeWitt:1990:GDMa, author = "David J. DeWitt and Shahram Ghandeharizadeh and Donovan Schneider and Allan Bricker and Hui-I Hsiao and Rick Rasmussen", title = "The Gamma Database Machine Project", number = "TR 921", institution = "University of Wisconsin", pages = "??", month = mar, year = "1990", bibdate = "Thu Jul 21 09:39:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives. Gamma employs three key technical ideas which enable the architecture to be scaled to 100s of processors. First, all relations are horizontally partitioned across multiple disk drives enabling relations to be scanned in parallel. Second, novel parallel algorithms based on hashing are used to implement the complex relational operators such as join and aggregate functions. Third, dataflow scheduling techniques are used to coordinate multioperator queries. By using these techniques it is possible to control the execution of very complex queries with minimal coordination --- a necessity for configurations involving a very large number of processors. In addition to describing the design of the Gamma software, a thorough performance evaluation of the iPSC/2 hypercube version of Gamma is also presented. In addition to measuring the effect of relation size and indices on the response time for selection, join, aggregation, and update queries, we also analyze the performance of Gamma relative to the number of processors employed when the sizes of the input relations are kept constant (speedup) and when the sizes of the input relations are increased proportionally to the number of processors (scaleup). The speedup results obtained for both selection and join queries are linear; thus, doubling the number of processors halves the response time for a query. The scaleup results obtained are also quite encouraging. They reveal that a nearly constant response time can be maintained for both selection and join queries as the workload is increased by adding a proportional number of processors and disks.", acknowledgement = ack-nhfb, } @Article{DeWitt:1990:GDMb, author = "David J. DeWitt and Shaharm Ghandeharizadeh and Donovan A. Schneider and Allan Bricker and Hui-i Hsiao and Rick Rasmusen", key = "DeWITT et al.", title = "The Gamma Database Machine Project", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "2", number = "1", pages = "44--62", month = mar, year = "1990", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Thu Jul 14 02:12:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives. Gamma employs three key technical ideas which enable the architecture to be scaled to hundreds of processors. First, all relations are horizontally partitioned across multiple disk drives enabling relations to be scanned in parallel. second, novel parallel algorithms based on hashing are used to implement the complex relational operators such as join and aggregate functions. Third, dataflow scheduling techniques are used to coordinate multioperator queries. By using these techniques it is possible to contol the execution of very complex queries with minimal coordination --- a necessity for configurations involving a very large number of processors. In addition to describing the design of the gamma software, a thorough performance evaluation of the iPSC/2 hypercube version of /Gamma is also presented. in addition to measuring the effect of relation size and indexes on the response time for selection, join, aggregation, and update queries, we also analyze the performance of gamma relative to the numver of processors employed when the sizes of the input relations and kept constant (speedup) and when the sizes of the input relations are increased proportionally to the number of processors(scaleup). The speedup results obtained for both selection and join qeries are linear; thus, doubling the number of processors halves the response time for a query. The scaleup results obtained are also quite encouraging. They reveal that a nearly constant response time can be maintained for both selection and join queries as the workload is increased by adding a proportional number of processors and disks.", acknowledgement = ack-nhfb, keywords = "database machines, dataflow query processing, distributed database systems, parallel algorithms, relational database systems.", remark = "Relational database machine operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives; relations are horizontally partitioned across multiple disk drives; hashing used to implement join and aggregates; dataflow scheduling coordinates multioperator queries.", } @TechReport{Diby:1990:DDK, author = "K. Diby and P. Mateti", title = "Design Documentation of {Knuth}'s Solution to the Common Words Problem,", number = "WSU-CS-90-08", institution = "Washington State University", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:02 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The problem and Knuth's solution use structures that are known as dictionaries, and hash tries, and notions such as lexical structures. This report given precise definitions for all these in a language called OM, a software design specification language that combines functional programming with logic.", acknowledgement = ack-nhfb, } @InProceedings{Dietzfelbinger:1990:HDD, author = "Martin Dietzfelbinger", booktitle = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14--16 1990: Baltimore, MD, USA)", title = "How to distribute a dictionary in a complete network", publisher = pub-ACM, address = pub-ACM:adr, pages = "117--127", year = "1990", ISBN = "0-89791-361-2", ISBN-13 = "978-0-89791-361-4", LCCN = "QA 76.6 A13 1990", bibdate = "Tue May 12 09:50:17 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present a distributed (dynamic) dictionary implemented on a complete network of p processors. The (randomized) algorithm is based on hashing and needs expected O(n/p) time to execute n arbitrary instructions (Insert, Delete, Lookup). The response time for each lookup is expected constant. The algorithm applies a novel, randomized construction of hash functions. These functions can be evaluated in constant time, constructed on sublinear space in sublinear expected time, and have many features of random functions. The algorithm further makes use of a new Monte Carlo type sequential dictionary with worst case constant time per instruction, which was recently developed by the authors. Applications of the distributed dictionary are e.g., two improvements of PRAM-simulations: A PRAM with p processors can be simulated by a complete network with p processors with expected delay log p/log log p (before: log p), and on one with p/log p processors with optimal expected delay log p (before: p\$+1\$MIN\$epsilon\$/ processors, delay p\$+\$epsilon\$/).", acknowledgement = ack-nhfb, affiliation = "Univ GH Paderborn", affiliationaddress = "Paderborn, West Ger", classification = "722; 723; 922", conference = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing", conferenceyear = "1990", keywords = "Computer Programming--Algorithms; Computer Systems, Digital; Distributed; Distributed Dictionaries; Hash Functions; Parallel Random Access Machines; Probabilistic Algorithms; Probability--Random Processes; Randomized Algorithms", meetingabr = "Proc 22nd Annu ACM Symp Theory Comput", meetingaddress = "Baltimore, MD, USA", meetingdate = "May 14--16 1990", meetingdate2 = "05/14--16/90", sponsor = "ACM Special Interest Group for Automata and Computability Theory (SIGACT); IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Dietzfelbinger:1990:NUC, author = "M. Dietzfelbinger and Meyer auf der Heide", title = "A New Universal Class of Hash Functions and Dynamic Hashing in Real Time", crossref = "Paterson:1990:ALP", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:03 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Dontas:1990:FHI, author = "Kejitan Dontas and Jayshree Sarma and Padmini Srinivasan and Harry Wechsler", title = "Fault-tolerant hashing and information retrieval using back propagation", journal = "Proceedings of the Hawaii International Conference on System Science", volume = "4", pages = "345--352", year = "1990", CODEN = "PHISD7", ISBN = "0-8186-2011-0", ISBN-13 = "978-0-8186-2011-9", ISSN = "0073-1129", LCCN = "QA76.9.S88H38 1990", bibdate = "Tue May 12 09:50:24 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 90TH0294-9.", abstract = "The architecture and performance of neural networks designed and trained to compute hashing functions is described. The networks described are of the connectionist type and are capable of learning complex mappings using the back-propagation of error algorithm. Connectionist networks are robust, are capable of limited error correction, and offer several advantages over traditional hashing methods. Multiple indexing, which implements many-to-one mapping, can be easily realized by training a network for each key attribute. The neural network approach can be used to train a very large number of pattern associations by dividing a problem into smaller problems. This neural network consists of several subnetworks, each solving a specific mapping task. The experimental results show that small neural networks with simple processing elements can learn complex mappings that implement index search in constant time.", acknowledgement = ack-nhfb, affiliation = "George Mason Univ, Sch of Inf Technol \& Eng, Fairfax, VA, USA", classification = "723; 903", conference = "Proceedings of the Twenty-Third Annual Hawaii International Conference on System Sciences. Volume 4: Emerging Technologies and Applications Track", conferenceyear = "1990", journalabr = "Proc Hawaii Int Conf Syst Sci", keywords = "Backpropagation Algorithm; Computer Programming--Algorithms; Connectionist Networks; Data Processing--File Organization; Fault Tolerant Information Retrieval; Fault-Tolerant Hashing; Hashing Functions; Information Science--Information Retrieval; Neural Nets; Systems Science and Cybernetics", meetingaddress = "Kailua-Kona, HI, USA", meetingdate = "Jan 2--5 1990", meetingdate2 = "01/02--05/90", sponsor = "Univ of Hawaii, Honolulu, HI, USA; ACM, New York, NY, USA; IEEE Computer Soc, Los Alamitos, CA, USA; Pacific Research Inst for Information Systems \& Management (PRIISM)", } @InProceedings{Dontas:1990:FTH, author = "K. Dontas and J. Sarma and P. Srinivasan and H. Wechsler", booktitle = "Proceedings of HICCS-90", title = "Fault Tolerant Hashing and Information Retrieval Using Back Propagation", publisher = "????", address = "????", pages = "345--352", year = "1990", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "neural networks robustness modular networks", } @Article{Eugenides:1990:ESM, author = "J. G. Eugenides", title = "Easier strings for the {Mac}. {Get} a handle on {Mac} strings with this {C++} class", journal = j-BYTE, volume = "15", number = "13", pages = "349--350, 352", month = dec, year = "1990", CODEN = "BYTEDJ", ISSN = "0360-5280", bibdate = "Thu Sep 12 18:39:30 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Solutions Inc., Williston, VT, USA", classification = "C6120 (File organisation)", keywords = "C++; C++ `StringList' class; Mac; Resource type; STR Hash; String lists", thesaurus = "C language; Data structures", xxtitle = "Easier Strings for the Mac: {C++} routines simplify {Macintosh} string-handling", } @InProceedings{Fox:1990:OPM, author = "E. A. Fox and Q. F. Chen and A. M. Daoud and L. S. Heath", title = "Order Preserving Minimal Perfect Hash Functions and Information Retrieval", crossref = "Vidick:1990:PIC", pages = "279", year = "1990", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. Indeed, the algorithm described gives hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order preserving minimal perfect hash functions (OPMPHFs) can be found using space and time that is on average linear in the number of keys involved.", acknowledgement = ack-nhfb, } @Article{Franco:1990:TFL, author = "John Franco and Daniel P. Friedman", title = "Towards a facility for lexically scoped, dynamic mutual recursion in {Scheme}", journal = j-COMP-LANGS, volume = "15", number = "1", pages = "55--64", month = "????", year = "1990", CODEN = "COLADA", ISSN = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Indiana Univ", affiliationaddress = "Bloomington, IN, USA", classcodes = "C4210 (Formal logic); C6140D (High level languages); C6120 (File organisation)", classification = "723", corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", journalabr = "Comput Lang", keywords = "algorithmic; algorithmic languages; associative structures; boundedness; Computer Programming Languages; Computer Programming--Object Oriented Programming; data structures; Design; DMRS elements; dynamic letrec capability; dynamic mutual recursion; dynamic mutually recursive; functional specifications; Hashing; high level; language; languages; lexical scoping; memo-functions; Mutual Recursion; object-oriented style; procedural; Programming Language Scheme; recursive functions; Scheme; side-effected; specifications; structures; unbounded; unbounded vectors; vector", treatment = "P Practical", } @Article{Ganguly:1990:FPP, author = "Sumit Ganguly and Avi Silberschatz and Shalom Tsur", title = "A Framework for the Parallel Processing of {Datalog} Queries", journal = j-SIGMOD, volume = "19", number = "2", pages = "143--152", month = jun, year = "1990", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:34 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper presents several complementary methods for the parallel, bottom-up evaluation of Datalog queries. We introduce the notion of a discriminating predicate, based on hash functions, that partitions the computation between the processors in order to achieve parallelism. A parallelization scheme with the property of non-redundant computation (no duplication of computation by processors) is then studied in detail. The mapping of Datalog programs onto a network of processors, such that the result is a non-redundant computation, is also studied. The methods reported in this paper clearly demonstrate the trade-offs between redundancy and interprocessor-communication for this class of problems.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Texas Univ.", affiliationaddress = "Austin, TX, USA", classification = "722; 723; C1230 (Artificial intelligence); C6110 (Systems analysis and programming); C6160 (Database management systems (DBMS))", conference = "Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1990", keywords = "Bottom-up evaluation; Computer Networks; Computer Systems, Digital; Database Systems --- Query Languages; Datalog Programs, Parallel evaluation; Datalog queries; Discriminating predicate; Hash functions; Network of processors; Nonredundant computation; Parallel Processing; Parallel processing; Parallelism; Partitions", meetingaddress = "Atlantic City, NJ, USA", meetingdate = "May 23--25 1990", meetingdate2 = "05/23--25/90", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM SIGMOD, New York, NY, USA", thesaurus = "Database management systems; Information retrieval; Logic programming; Parallel programming", xxcrossref = "Anonymous:1990:ASI", } @Article{Gibson:1990:SCD, author = "J. K. Gibson", title = "Some comments on {Damg{\aa}rd's} hashing principle", journal = j-ELECT-LETTERS, volume = "26", number = "15", pages = "1178--1179", day = "19", month = jul, year = "1990", CODEN = "ELLEAK", ISSN = "0013-5194", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "A general principle given by Damg{\aa}rd for constructing hash functions is modified and used to show how the security of block cipher hashing can be improved. A small correction to Damg{\aa}rd's work is made.", acknowledgement = ack-nhfb, affiliation = "Birkbeck Coll", affiliationaddress = "London, Engl", classification = "723; 921", journalabr = "Electron Lett", keywords = "Analysis; Block Cipher Hashing; Codes, Symbolic; Cryptography; Hash Functions", } @InProceedings{Gil:1990:AKC, author = "Joseph Gil and Friedhelm {Meyer auf der Heide} and Avi Wigderson", booktitle = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14--16 1990: Baltimore, MD, USA)", title = "Not all keys can be hashed in constant time", crossref = "ACM:1990:PTS", publisher = pub-ACM, address = pub-ACM:adr, pages = "244--253", year = "1990", ISBN = "0-89791-361-2", ISBN-13 = "978-0-89791-361-4", LCCN = "????", 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 present a simple new model that captures many natural (sequential and parallel) hashing algorithms. In a game against nature, the algorithm and coin-tosses cause the evolution of a random tree, whose size corresponds to space (hash table size), and two notions of depth correspond respectively to the largest probe sequences for insertion (parallel insertion time) and search of a key. It was observed, that although average insertion time per element is constant, parallel application of this (and other) algorithms cannot work in constant time. The reason is that while the average is constant, some elements will have to be hashed nonconstant number of times. The main results exhibit tight trade-offs between space and parallel time, in the basic model and three variants, which capture standard hashing practice.", acknowledgement = ack-nhfb, affiliation = "Hebrew Univ", affiliationaddress = "Jerusalem, Isr", classification = "723", conference = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing", conferenceyear = "1990", keywords = "Chaining; Computer Programming--Algorithms; Data Processing; File Organization; Hashing Algorithms; Probability--Random Processes; Retries; Root Node Hashing", meetingabr = "Proc 22nd Annu ACM Symp Theory Comput", meetingaddress = "Baltimore, MD, USA", meetingdate = "May 14--16 1990", meetingdate2 = "05/14--16/90", sponsor = "ACM Special Interest Group for Automata and Computability Theory (SIGACT); IEEE Computer Soc, Los Alamitos, CA, USA", } @Article{Gonnet:1990:AKS, author = "Gaston H. Gonnet and Ricardo A. Baeza-Yates", title = "Analysis of the {Karp-Rabin} string matching algorithm", journal = j-INFO-PROC-LETT, volume = "34", number = "5", pages = "271--274", month = may, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Tue Apr 14 12:06:34 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present an average case analysis of the Karp-Rabin string matching algorithm. This algorithm is a probabilistic algorithm that adapts hashing techniques to string searching. We also propose an efficient implementation of this algorithm.", acknowledgement = ack-nhfb, affiliation = "Univ of Waterloo", affiliationaddress = "Waterloo, Ont, Canada", classification = "723; 922", journalabr = "Inf Process Lett", keywords = "Algorithms; Computer Programming; Hashing; Karp-Rabin Algorithm; Probability; String Matching; String Searching", } @InProceedings{Guh:1990:PPS, author = "Keh-Chang Guh and Jose Chavarria", booktitle = "Proceedings --- Parbase-90 International Conference on Databases, Parallel Architectures, and Their Applications (Mar 7--9 1990: Miami Beach, FL, USA)", title = "Parallel processing strategy for computing transitive closure of a database relation", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "37--43", year = "1990", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 90CH2728-4.", abstract = "A parallel strategy for computing transitive closure of a database relation is given. The method uses a hashing technique for horizontal data fragmentation to achieve high parallelism. It integrates left and right computations to achieve a simple scheme of one-direction message passing. Therefore, a pipeline technique can be incorporated into the strategy. A performance analysis shows that the strategy may achieve high parallelism with small communication overhead.", acknowledgement = ack-nhfb, affiliation = "Univ of Wisconsin, Dep of Electr Eng \& Comput Sci, Milwaukee, WI, USA", classification = "723", conference = "PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications", conferenceyear = "1990", keywords = "Computer Systems, Digital--Parallel Processing; Database Relation; Database Systems; Hashing Technique; Pipeline Technique; Relational; Transitive Closure", meetingabr = "PARBASE 90 Int Conf Databases Parallel Archit Appl", meetingaddress = "Miami Beach, FL, USA", meetingdate = "Mar 7--9 1990", meetingdate2 = "03/07--09/90", publisherinfo = "IEEE Service Center", sponsor = "Florida Int Univ, Miami, FL, USA; IEEE; Euromicro", } @TechReport{Hanson:1990:PMAa, author = "E. N. Hanson", title = "A Predicate Matching Algorithm for Database Rule Systems,", number = "WSU-CS-90-01", institution = "Washington State University", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:04 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Forward-chaining rule systems must best each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We introduce an algorithm for finding the matching predicates that is more efficient than the standard algorithm when the number of predicates is large. This algorithm is well-suited for database rule systems, where predicate-testing speed is critical.", acknowledgement = ack-nhfb, } @Article{Hanson:1990:PMAb, author = "Eric N. Hanson and Moez Chaabouni and Chang-Ho Kim and Yu-Wang Wang", title = "A Predicate Matching Algorithm for Database Rule Systems", journal = j-SIGMOD, volume = "19", number = "2", pages = "271--280", month = jun, year = "1990", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:34 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/93597/p271-hanson/p271-hanson.pdf; http://www.acm.org/pubs/citations/proceedings/mod/93597/p271-hanson/", abstract = "Forward-chaining rule systems must test each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We introduce an algorithm for finding the matching predicates that is more efficient than the standard algorithm when the number of predicates is large. We focus on equality and inequality predicates on totally ordered domains. This algorithm is well-suited for database rule systems, where predicate-testing speed is critical. A key component of the algorithm is the {\em interval binary search tree\/} (IBS-tree). The IBS-tree is designed to allow efficient retrieval of all intervals (e.g., range predicates) that overlap a point, while allowing dynamic insertion and deletion of intervals. The algorithm could also be used to improve the performance of forward-chaining inference engines for large expert systems applications.", acknowledgement = ack-nhfb, affiliation = "USAF Wright R and D Center, WRDC/TXI", affiliationaddress = "Dayton, OH, USA", classification = "723; 921; C6160D (Relational DBMS); C6170 (Expert systems)", conference = "Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1990", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", generalterms = "Algorithms; Performance", keywords = "Computer Metatheory--Binary Sequences; Computer Programming--Algorithms; Database rule systems; Database Systems; Design; Expert Systems; Inequality predicates; Interval binary search tree; Interval Binary Search Trees, Equality predicates; Mathematical Techniques--Trees; Predicate matching algorithm; Predicate-testing speed; Totally ordered domains", meetingaddress = "Atlantic City, NJ, USA", meetingdate = "May 23--25 1990", meetingdate2 = "05/23--25/90", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM SIGMOD, New York, NY, USA", subject = "Computing Methodologies --- Artificial Intelligence --- Knowledge Representation Formalisms and Methods (I.2.4): {\bf Representations (procedural and rule-based)}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Heuristic methods}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Graph and tree search strategies}; Information Systems --- Database Management --- Systems (H.2.4)", thesaurus = "Expert systems; Relational databases", xxcrossref = "Anonymous:1990:ASI", } @InProceedings{Heide:1990:DHS, author = "Meyer auf der Heide", title = "Dynamic Hashing Strategies", crossref = "Rovan:1990:MFC", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Hsu:1990:COL, author = "Meichun Hsu and Shang-Sheng Tung and Wei-Pang Yang", title = "Concurrent Operations in Linear Hashing", journal = j-INFO-SCI, volume = "51", number = "2", pages = "193--??", day = "1", month = jul, year = "1990", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Huisman:1990:SEM, author = "Leendert M. Huisman", title = "Simulation of embedded memories by defective hashing", journal = j-IBM-JRD, volume = "34", number = "2/3", pages = "289--298", month = mar # "\slash " # may, year = "1990", 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 = "Because logic designs are becoming more complex and extensive, they increasingly tend to contain embedded memories. In the simulation (particularly fault simulation) of these designs, the embedded memories may be found to require large amounts of storage unless a carefully designed simulation strategy is adopted. This paper describes a technique that drastically reduces the storage required in the fault simulation of such large designs. The required amount of storage can be fixed at compile time or at load time, and can almost always be made to fit in the available storage at the cost of only a small decrease in the predicted exposure probabilities.", acknowledgement = ack-nhfb, affiliation = "IBM Research Div, Thomas J. Watson Research Cent", affiliationaddress = "Yorktown Heights, NY, USA", classification = "721; 722; 723; B1265B (Logic circuits); B1265D (Memory circuits); C5210 (Logic design methods); C5320G (Semiconductor storage); C6120 (File organisation)", journalabr = "IBM J Res Dev", keywords = "Computer Simulation; Data Storage, Digital; Defective hashing; Defective Hashing; Embedded memories; Embedded Memories; Fault simulation; Fault Simulation; Logic Design; Logic designs", thesaurus = "Fault location; File organisation; Logic design; Logic testing; Semiconductor storage", } @Article{Ivanov:1990:HOD, author = "M. B. Ivanov and V. A. Litvinov", title = "Hash-sequential organization of data sets", journal = j-PROG-COMP-SOFT, volume = "15", number = "2", pages = "70--75 (or 70--76??)", month = jan, year = "1990", CODEN = "PCSODA", ISSN = "0361-7688 (print), 1608-3261 (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 theoretical prerequisites are presented for realizing a hash function ordering the records in a data set in key sequence. A method of piecewise-uniform approximating the distribution of keys in the set, and an algorithm for implementing the method are given. Experimental analyses show that a data set with a hash-sequential organization has an undoubted advantage over one with an index-sequential organization.", acknowledgement = ack-nhfb, classification = "723; 921", journalabr = "Program Comput Software", keywords = "Data Sets; Data Storage, Digital --- Random Access; Database Systems; Hash Function Ordering; Hash Tables; Hash-Sequential Organization; Index-Sequential Organization; Information Retrieval Systems; Key Sequences; Mathematical Techniques --- Algorithms", } @InProceedings{Kanada:1990:VTH, author = "Yasusi Kanada", booktitle = "Proceedings --- Parbase-90 International Conference on Databases, Parallel Architectures, and Their Applications (Mar 7--9 1990: Miami Beach, FL, USA)", title = "Vectorization technique of hashing and its application to several sorting algorithms", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "147--151", year = "1990", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 90CH2728-4.", abstract = "A vectorized algorithm for entering data into a hash table is presented. A program that enters multiple data could not be executed on vector processors by conventional vectorization techniques because of data dependences. The proposed method enables execution of multiple data entry by conventional vector processors and improves the performance by a factor of 12.7, compared with the normal sequential method, when 4099 pieces of data are entered on the Hitachi S-810. This method is applied to address calculation sorting and the distribution counting sort, whose main part was unvectorizable by previous techniques. It improves performance by a factor of 12.8 when n $=$ 2${}^{14}$ on the S-810.", acknowledgement = ack-nhfb, affiliation = "Hitachi Ltd, Kokubunji, Jpn", classification = "722; 723", conference = "PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications", conferenceyear = "1990", keywords = "Address Calculation Sorting; Computer Systems Programming; Computer Systems, Digital--Parallel Processing; Hash Table; Sorting; Vector Processing", meetingabr = "PARBASE 90 Int Conf Databases Parallel Archit Appl", meetingaddress = "Miami Beach, FL, USA", meetingdate = "Mar 7--9 1990", meetingdate2 = "03/07--09/90", publisherinfo = "IEEE Service Center", sponsor = "Florida Int Univ, Miami, FL, USA; IEEE; Euromicro", } @InProceedings{Kitsuregawa:1990:BSP, author = "M. Kitsuregawa and Y. Ogawa", title = "Bucket Spreading Parallel Hash: {A} New, Robust, Parallel Hash Join Method for Skew in the Super Database Computer ({SDC})", crossref = "McCleod:1990:VLD", pages = "210", year = "1990", bibdate = "Mon Jul 18 09:32:06 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "VLDB", } @Article{Kumar:1990:COE, author = "Vijay Kumar", title = "Concurrent operations on extendible hashing and its performance", journal = j-CACM, volume = "33", number = "6", pages = "681--694", month = jun, year = "1990", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/78979.html", abstract = "Extendible hashing is a dynamic data structure which accommodates expansion and contraction of any stored data efficiently. In this article, an algorithm has been developed for managing concurrent operations on extendible hashing by achieving optimal memory utilization by supporting directly expansion and contraction, page split, and merge. The results of this study have been encouraging in the sense that it seems to provide a higher degree of concurrency compared to other algorithms on an extendible hash file.", acknowledgement = ack-nhfb, keywords = "algorithms; design; performance", remark = "Includes simulation results and code for algorithms.", review = "ACM CR 9012-0959", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf E.1}: Data, DATA STRUCTURES. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.5}: Data, FILES, Sorting/searching.", } @InProceedings{Lu:1990:HBJ, author = "H. Lu and K. L. Tan and M. C. Shan", title = "Hash-Based Join Algorithms for Multiprocessors with Shared Memory", crossref = "McCleod:1990:VLD", pages = "198", year = "1990", bibdate = "Mon Jul 18 09:32:23 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "VLDB", } @InProceedings{Mansour:1990:CCU, author = "Yishay Mansour and Noam Nisan and Prasoon Tiwari", booktitle = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14--16 1990: Baltimore, MD, USA)", title = "The Computational Complexity of Universal Hashing", crossref = "ACM:1990:PTS", publisher = pub-ACM, address = pub-ACM:adr, pages = "235--243", year = "1990", ISBN = "0-89791-361-2", ISBN-13 = "978-0-89791-361-4", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS $=$ \$Omega@(nm). The bound holds in the general boolean branching program model, and thus in essentially any model of computation. As a corollary, computing a + b * c in any field F requires a quadratic time-space tradeoff, and the bound holds for any representation of the elements of the field. Other lower bounds on the complexity of any implementation of universal hashing are given as well: Quadratic AT${}^2$ bound for VLSI implementation; \$Omega@(log n) parallel time bound on a CREW PRAM; and exponential size for constant depth circuits.", acknowledgement = ack-nhfb, affiliation = "MIT, Lab for Computer Science", affiliationaddress = "Cambridge, MA, USA", classification = "723", conference = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing", conferenceyear = "1990", keywords = "Branching Programs; Computer Metatheory--Computational Complexity; Data Processing; File Organization; Hash Functions; Universal Hashing", meetingabr = "Proc 22nd Annu ACM Symp Theory Comput", meetingaddress = "Baltimore, MD, USA", meetingdate = "May 14--16 1990", meetingdate2 = "05/14--16/90", sponsor = "ACM Special Interest Group for Automata and Computability Theory (SIGACT); IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Matias:1990:PHI, author = "Y. Matias and U. Vishkin", title = "On Parallel Hashing and Integer Sorting", crossref = "Paterson:1990:ALP", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{McKenzie:1990:SHA, author = "Bruce J. McKenzie and R. Harries and Timothy C. Bell", title = "Selecting a Hashing Algorithm", journal = j-SPE, volume = "20", number = "2", pages = "209--224", day = "1", month = feb, year = "1990", 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; UnCover library database", abstract = "Hashing is so commonly used in computing that one might expect has functions to be well understood, and that choosing a suitable function should not be difficult. The results of investigations into the performance of some widely used hashing algorithms are presented and it is shown that some of these algorithms are far from optimal. Recommendations are made for choosing a hashing algorithm and measuring its performance.", acknowledgement = ack-nhfb, affiliation = "Univ of Canterbury", affiliationaddress = "Christchurch, NZ", classification = "723", journalabr = "Software Pract Exper", keywords = "Computer Programming--Algorithms; Data Processing; File Organization; Hashing; hashing; Symbol Tables; symbol tables", } @Article{Mehlhorn:1990:BOD, author = "Kurt Mehlhorn and Stefan Naeher", title = "Bounded ordered dictionaries in {$O(\log \log n)$} time and {$O(n)$} space", journal = j-INFO-PROC-LETT, volume = "35", number = "4", pages = "183--189", month = aug, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Univ des Saarlandes", affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "723; 921", journalabr = "Inf Process Lett", keywords = "Bounded Ordered Dictionaries; Bounded Priority Queues; Computational Complexity; Data Processing; Data Structures; Dictionaries; Hashing; Mathematical Techniques--Trees; Search Trees", } @Article{Meichun:1990:COL, author = "Hs Meichun and Tung Shang-Sheng and Yang Wei-Pang", title = "Concurrent Operations in Linear Hashing", journal = j-INFO-SCI, volume = "51", number = "2", pages = "193--212", year = "1990", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Merkle:1990:FSO, author = "Ralph C. Merkle", title = "A fast software one-way hash function", journal = j-J-CRYPTOLOGY, volume = "3", number = "1", pages = "43--58", month = "????", year = "1990", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", MRclass = "68P25", MRnumber = "91m:68041", bibdate = "Sat Nov 21 16:36:38 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Xerox PARC", affiliationaddress = "Palo Alto, CA, USA", classification = "723; 731", journalabr = "J Cryptol", keywords = "Codes, Symbolic --- Encoding; Computer Crime --- Viruses; Computer Programming --- Algorithms; Computer Software; Cryptography; Data Processing --- Security of Data; Manipulation Detection Codes (mdcs); Message Digest Algorithm; One-Way Hash Function; Snefru Hash Function", } @InProceedings{Merkle:1990:OWH, author = "Ralph C. Merkle", title = "One Way Hash Functions and {DES}", crossref = "Brassard:1990:ACC", pages = "428--446 (or 428--466??)", year = "1990", bibdate = "Thu Oct 31 18:58:35 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Based on unpublished paper from 1979 and his Ph.D thesis, Stanford, 1979.", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 11]{Bellare:1996:MAU}, \cite[Ref. 6]{Kaliski:1995:MAM}.", } @TechReport{Midkiff:1990:ICO, author = "Samuel P. Midkiff and David A. Padua", title = "Issues in the compile-time optimization of parallel programs", type = "Technical Report", number = "CSRD 993", institution = inst-UIUC-CSRD, address = inst-UIUC-CSRD:adr, pages = "26", month = may, year = "1990", bibdate = "Fri Aug 30 08:01:51 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed.", acknowledgement = ack-nhfb, keywords = "Compiling (Electronic computers); Parallel programming (Computer science)", remark = "To appear in Proc. of the Int'l. Conf. on Parallel Processing, St. Charles, IL, 1990. Supported in part by the Air Force Office of Scientific Research. Supported in part by the NASA Ames Research Center. Supported in part by Control Data Corporation. Supported in part by the U.S. Department of Energy. Supported in part by the National Science Foundation.", } @InProceedings{Miyaguchi:1990:CSH, author = "S. Miyaguchi and K. Ohta and M. Iwata", title = "Confirmation that Some Hash Functions are not Collision Free", crossref = "Damgaard:1990:ACE", pages = "293--308", year = "1990", bibdate = "Sat Jul 16 17:50:28 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Mohan:1990:ACC, author = "C. Mohan", title = "{ARIES\slash LHS}: {A} Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators", institution = "IBM Corporation", address = "San Jose, CA, USA", pages = "??", month = mar, year = "1990", bibdate = "Thu Jul 21 09:39:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @PhdThesis{Molodowitch:1990:ADAa, author = "Mariko Molodowitch", title = "Analysis and design of algorithms: double hashing and parallel graph searching", school = "Dept. of Information and Computer Science, University of California, Irvine", address = "Irvine, CA, USA", pages = "xiii + 164", year = "1990", LCCN = "LD 791.9 .I5 1990 M65", bibdate = "Sat Jul 16 01:04:06 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Molodowitch:1990:ADAb, author = "Mariko Molodowitch", title = "Analysis and design of algorithms: double hashing and parallel graph searching", number = "TR 90-43", institution = "Dept. of Information and Computer Science, University of California, Irvine", pages = "xii + 112", year = "1990", bibdate = "Sun Jul 17 08:43:16 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Originally presented as the author's Ph.D. thesis.", acknowledgement = ack-nhfb, } @InProceedings{Naor:1990:SPS, author = "Joseph Naor and Moni Naor", booktitle = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14--16 1990: Baltimore, MD, USA)", title = "Small-bias probability spaces. Efficient constructions and applications", publisher = pub-ACM, address = pub-ACM:adr, pages = "213--223", year = "1990", ISBN = "0-89791-361-2", ISBN-13 = "978-0-89791-361-4", LCCN = "????", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with `almost' equal probability. They are called \$epsilon@-biased random variables. The number of random bits needed to generate the random variables is O(log n + log 1/\$epsilon@). Thus, if \$epsilon is polynomially small, then the size of the sample space is also polynomial. \$epsilon@-biased random variables can be used to construct `almost' k-wise independent random variables where \$epsilon is a function of k. Applications are shown to derandomization of algorithms, reducing the number of random bits required by certain randomized algorithms, exhaustive testing of combinatorial circuits, communication complexity and construction of hash functions.", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, USA", classification = "721; 723; 922", conference = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing", conferenceyear = "1990", keywords = "Communication Complexity; Computer Programming--Algorithms; Data Processing--Data Structures; Hash Functions; Logic Circuits, Combinatorial--Testing; Probabilistic Algorithms; Probability; Probability Spaces; Random Processes; Randomized Algorithms", meetingabr = "Proc 22nd Annu ACM Symp Theory Comput", meetingaddress = "Baltimore, MD, USA", meetingdate = "May 14--16 1990", meetingdate2 = "05/14--16/90", sponsor = "ACM Special Interest Group for Automata and Computability Theory (SIGACT); IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Newman:1990:PHG, author = "Ilan Newman and Prabhakar Ragde and Avi Wigderson", title = "Perfect Hashing, Graph Entropy, and Circuit Complexity", crossref = "IEEE:1990:FAS", pages = "91--99", year = "1990", bibdate = "Thu Oct 31 18:59:52 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Olken:1990:RSH, author = "Frank Olken and Doron Rotem and Ping Xu", title = "Random sampling from hash files", journal = j-SIGMOD, volume = "19", number = "2", pages = "375--386", month = jun, year = "1990", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:34 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper we discuss simple random sampling from hash files on secondary storage. We consider both iterative and batch sampling algorithms from both static and dynamic hashing methods. The static methods considered are open addressing hash files and hash files with separate overflow chains. The dynamic hashing methods considered are Linear Hash files and Extendible Hash files. We give the cost of sampling in terms of the cost of successfully searching a hash file and show how to exploit features of the dynamic hashing methods to improve sampling efficiency.", acknowledgement = ack-nhfb, affiliation = "Comput. Sci. Res. and Dev. Dept., Lawrence Berkeley Lab.", affiliationaddress = "Berkeley, CA, USA", classification = "723; 903; 911; 922; C4250 (Database theory); C6120 (File organisation); C6160 (Database management systems (DBMS))", conference = "Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1990", keywords = "Batch sampling algorithms; Computer Programming --- Algorithms; Cost Accounting; Data Processing --- File Organization; Dynamic hashing; Dynamic Hashing Methods; Evaluation; Extendible Hash Files, Static hashing; Extensible hash files; Information Retrieval Systems; Iterative sampling algorithms; Linear hash files; Linear Hash Files; Open addressing hash files; Random sampling; Sampling; Secondary storage; Separate overflow chains", meetingaddress = "Atlantic City, NJ, USA", meetingdate = "May 23--25 1990", meetingdate2 = "05/23--25/90", publisherinfo = "Fort Collins Computer Center", remark = "Fair sampling.", sponsor = "ACM SIGMOD, New York, NY, USA", thesaurus = "Database management systems; Database theory; File organisation", xxcrossref = "Anonymous:1990:ASI", } @InProceedings{Panneerselvam:1990:RSA, author = "G. Panneerselvam and G. A. Jullien and S. Bandyopadhyay and W. C. Miller", booktitle = "Proceedings --- Parbase-90 International Conference on Databases, Parallel Architectures, and Their Applications (Mar 7--9 1990: Miami Beach, FL, USA)", title = "Reconfigurable systolic architectures for hashing", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "543--??", year = "1990", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 90CH2728-4.", abstract = "The authors develop a novel technique in which concepts of both bucketing and open addressing schemes are modified in such a manner that they can be suitable for VLSI\slash WSI implementation, namely, dynamically reconfigurable hash tables. In this method, finite storage is allocated for each bucket. Instead of searching the entire table or a part of the table for an empty storage place, the overflowing synonyms are inserted into the successor's bucket (next to the home bucket). If the successor's bucket overflows, the same technique is repeated until the table is stable. The host bucket takes care of all the relative operations for its guest items. As soon as an empty place arises in the original bucket, the host bucket returns the guest element to the original bucket; in essence, dynamically variable capacity buckets have been created. These buckets are designed using systolic arrays.", acknowledgement = ack-nhfb, affiliation = "VLSI Research Group, Univ of Windsor, Windsor, Ont, Can", classification = "722; 723", conference = "PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications", conferenceyear = "1990", keywords = "Computer Architecture; Computer Systems, Digital--Multiprocessing; Data Processing--File Organization; Dynamically Reconfigurable Hash Tables; Hashing; Reconfigurable Systolic Architectures", meetingabr = "PARBASE 90 Int Conf Databases Parallel Archit Appl", meetingaddress = "Miami Beach, FL, USA", meetingdate = "Mar 7--9 1990", meetingdate2 = "03/07--09/90", publisherinfo = "IEEE Service Center", sponsor = "Florida Int Univ, Miami, FL, USA; IEEE; Euromicro", } @Article{Pearson:1990:FHV, author = "Peter K. Pearson", title = "Fast Hashing of Variable-Length Text Strings", journal = j-CACM, volume = "33", number = "6", pages = "677--680", month = jun, year = "1990", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Apr 29 17:41:24 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See \cite{Dittmer:1976:IEP,Dittmer:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH,Savoy:1991:NFH}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/78978.html", abstract = "Tailored to variable-length text strings, this hashing function uses very little arithmetic and can be used where perfect hashing is desired.", acknowledgement = ack-nhfb, comment = "A simple fast hashing algorithm is given for variable length text strings. Essentially an xor is done over all of the characters of the string and the result is the hash value. Some analysis is done and a practical implementation is reported on.", keywords = "algorithms; design", remark = "Based on exclusive OR (XOR).", review = "ACM CR 9012-0958", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @InProceedings{Pramanik:1990:HSK, author = "S. Pramanik and C. Severance and T. Rosenau", booktitle = "Proceedings --- Parbase-90 International Conference on Databases, Parallel Architectures, and Their Applications (Mar 7--9 1990: Miami Beach, FL, USA)", title = "A High Speed {KDL-RAM} File System For Parallel Computers", crossref = "Rishe:1990:PIC", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "195--203", year = "1990", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE catalog number 90CH2728-4.", abstract = "The design, implementation, and performance of a main memory file system are presented. The implementation is based on a two-stage abstract parallel processing model. The objective of this model is to maximize throughput and minimize response time. To maximize throughput, lock structures, access structures, and shared variables are distributed among the shared memories. A novel approach based on hash-based parallel accesses is used. The effect of lock conflict is minimized by an optimistic locking protocol. Analytical models are developed for hot spot memory accesses, distributed data accesses, and space-versus-time tradeoffs for fast accesses to records. On the basis of the performance results of these models, a high-speed KDL-RAM (key accessed, dynamically reconfigurable, distributed locked random-access memory) file system has been implemented on the Butterfly PLUS Parallel Processor. Various performance results of this system are given. It is shown that the performance improvement of this system is considerably better than BBN's Butterfly RAMFile system on the Butterfly PLUS Parallel Processor.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ, Comput Sci Dep, E Lansing, MI, USA", classification = "722; 723", conference = "PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications", conferenceyear = "1990", keywords = "Butterfly plus Parallel Processor; Computer Networks--Protocols; Computer Systems, Digital; Data Processing--File Organization; Data Storage, Digital--Random Access; Distributed Data Access; Hash-Based Parallel Accesses; kdl-ram File System; Optimistic Locking Protocol; Parallel Processing", meetingabr = "PARBASE 90 Int Conf Databases Parallel Archit Appl", meetingaddress = "Miami Beach, FL, USA", meetingdate = "Mar 7--9 1990", meetingdate2 = "03/07--09/90", publisherinfo = "IEEE Service Center", remark = "Linear hashing and parallelizing splits of overflow blocks for unique entries.", sponsor = "Florida Int Univ, Miami, FL, USA; IEEE; Euromicro", } @InProceedings{Preneel:1990:ATH, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "An Attack on Two Hash Functions by Zheng-Matsumoto-Imai", crossref = "Seberry:1990:ACA", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1990:PMD, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "On the Power of Memory in the Design of Collision Resistant Hash Functions", crossref = "Seberry:1990:ACA", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:42 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Quisquater:1990:BHF, author = "Jean-Jacques Quisquater and Marc Girault", title = "$2n$-Bit Hash-Functions Using $n$-Bit Symmetric Block Cipher Algorithms", journal = j-LECT-NOTES-COMP-SCI, volume = "434", pages = "102--??", year = "1990", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Feb 4 12:01:57 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0434.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0434/04340102.htm; http://link.springer-ny.com/link/service/series/0558/papers/0434/04340102.pdf", acknowledgement = ack-nhfb, } @InProceedings{Rabitti:1990:DST, author = "F. Rabitti and P. Zezula", title = "A Dynamic Signature Technique for Multimedia Databases", crossref = "Vidick:1990:PIC", pages = "193", year = "1990", bibdate = "Mon Jul 18 12:24:20 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A signature file acts as a filtering mechanism to reduce the amount data needs to be searched during query evaluation. Even though several techniques for organizing and searching signature files have been proposed in literature, they have serious limitations when applied to multimedia databases, where integrated access methods to text and image content are needed. A new signature technique, called Quick Filter, is proposed in the paper. According to this technique, signatures are divided into partitions, each of which holds signatures sharing the same characteristic key. As a result, it is possible to determine if the signatures in a partition satisfy a query by merely examining the key. Partitions not matching the key need not be searched. This method is based on dynamic hashing since signatures are hashed into partitions according to the keys and the file size, computed algorithmically from the signatures. Implementation of this technique is illustrated using an example and is verified by analytical performance evaluation. The result is a signature technique which satisfies the requirements for access methods in multimedia databases: dynamicity, with respect to insertions and updates, good query processing performance on large databases for high-weight queries.", acknowledgement = ack-nhfb, } @InProceedings{Raghavan:1990:RIM, author = "R. Raghavan and J. P. Hayes", title = "On randomly interleaved memories", crossref = "IEEE:1990:PSN", pages = "49--58", year = "1990", bibdate = "Wed Apr 15 18:34:48 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C5310 (Storage system design); C5440 (Multiprocessor systems and techniques); C6120 (File organisation); C6150J (Operating systems)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI, USA", keywords = "bank addresses; bijective property; concurrency control; conflict-free steady state; conflicting vector streams; linear transformation; MASH; memory address interleaving; memory architecture; memory contention; module interleaving; multiplicative hashing function; parallel architectures; random interleaving schemes; RANDOM-H; randomization; randomly interleaved memories; storage allocation; storage management; vector processors", sponsororg = "IEEE; ACM; Lawrence Livermore Nat. Lab.; Los Alamos Nat. Lab.; NASA Ames Res. Center; Nat. Center Atmos. Res.; NSF; SIAM; Supercomput. Res. Center", treatment = "P Practical", } @Article{Ramamohanarao:1990:MAH, author = "Kotagiri Ramamohanarao and John Shepherd and Ron Sacks-Davis", title = "Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval", journal = j-BIT, volume = "30", number = "3", pages = "404--423", year = "1990", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10", MRnumber = "1 059 304", bibdate = "Fri Nov 13 11:52:58 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Santis:1990:DPS, author = "A. De Santis and M. Yung", title = "On the Design of Provably-Secure Cryptographic Hash Functions", crossref = "Damgaard:1990:ACE", pages = "377--397", year = "1990", bibdate = "Sat Jul 16 12:02:43 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Savoy:1990:SBF, author = "Jacques Savoy", title = "Statistical Behavior of Fast Hashing of Variable Length Test Strings", journal = j-SIGIR-FORUM, volume = "24", number = "3", pages = "62--??", month = "Fall", year = "1990", CODEN = "FASRDV", ISSN = "0163-5840", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Schmidt:1990:ACH, author = "Jeanette P. Schmidt and Alan Siegel", booktitle = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14--16 1990: Baltimore, MD, USA)", title = "The analysis of closed hashing under limited randomness", crossref = "ACM:1990:PTS", publisher = pub-ACM, address = pub-ACM:adr, pages = "224--234", year = "1990", ISBN = "0-89791-361-2", ISBN-13 = "978-0-89791-361-4", LCCN = "????", 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 gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby establish the first proof of optimality for hashing arbitrarily selected data, by virtually any classical closed scheme, with hash functions that are programmable and initialized by a small number of random bits.", acknowledgement = ack-nhfb, affiliation = "Polytechnic Univ", affiliationaddress = "Brooklyn, NY, USA", classification = "723; 921; 922", conference = "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing", conferenceyear = "1990", keywords = "Closed Hashing; Data Processing; Data Structures; Hash Functions; Hashing Schemes; Limited Randomness; Mathematical Techniques--Graph Theory; Probability--Random Processes", meetingabr = "Proc 22nd Annu ACM Symp Theory Comput", meetingaddress = "Baltimore, MD, USA", meetingdate = "May 14--16 1990", meetingdate2 = "05/14--16/90", sponsor = "ACM Special Interest Group for Automata and Computability Theory (SIGACT); IEEE Computer Soc, Los Alamitos, CA, USA", } @InProceedings{Schmidt:1990:GPH, author = "Douglas C. Schmidt", title = "{GPERF}: {A} Perfect Hash Function Generator", crossref = "USENIX:1990:UCC", pages = "87--101", year = "1990", bibdate = "Mon Jul 18 12:21:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Schmidt:1990:SCO, author = "Jeanette P. Schmidt and Alan Siegel", title = "The spatial complexity of oblivious $k$-probe hash functions", journal = j-SIAM-J-COMPUT, volume = "19", number = "5", pages = "775--786", month = oct, year = "1990", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P05 (68P10 68Q25)", MRnumber = "91e:68032", bibdate = "Sat Jan 18 18:03:50 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Schneider:1990:CQP, author = "Donovan A. Schneider", title = "Complex Query Processing in Multiprocessor Database Machines", number = "TR 965", institution = "University of Wisconsin", pages = "??", month = sep, year = "1990", bibdate = "Thu Jul 21 09:39:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "High performance multiprocessor database machines have been made feasible with the advent of cheap, powerful microprocessors and large main memories. However, exploiting these platforms to support high speed complex query processing has lagged behind the hardware technology. The thrust of this dissertation has concentrated on developing strategies for efficiently processing join queries consisting of on the order of 10 joins in a parallel database machine with hundreds of processors. Although the algorithms were developed with a shared-nothing architecture in mind, the algorithms can be applied to shared-memory systems with little modification. For queries that join only a few relations, we have found that the parallel Hybrid hash-join algorithm dominates under most circumstances, except when the join attribute values of the building relation are highly skewed. For multi-way join queries, a subset of the optimization search space of query plans called right-deep query plans is identified as being particularly important in this highly-parallel environment. Several algorithms are proposed for processing right-deep query plans and results from a simulation model are presented that demonstrate that right-deep plans can indeed offer significant performance advantages over the more traditional left-deep plans under many conditions.", acknowledgement = ack-nhfb, } @TechReport{Schneider:1990:TPCa, author = "Donovan Schneider and David J. DeWitt", title = "Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines", number = "TR 930", institution = "University of Wisconsin", pages = "??", month = apr, year = "1990", bibdate = "Thu Jul 21 09:39:45 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "During the past five years the design, implementation, and evaluation of join algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, most of this work has addressed the problem of executing joins involving only two relations. In this paper we examine the problem of processing multi-way join queries through hash-based join methods in a shared-nothing database environment. We first discuss how the choice of a format for a complex query can significantly affect performance in a multiprocessor database machine. Experimental results obtained from a simulation study are then presented to demonstrate the tradeoffs of left-deep and right-deep scheduling strategies for complex join query evaluation. These results demonstrate that right-deep scheduling strategies can provide significant performance advantages in large multiprocessor database machines, even when memory is limited.", acknowledgement = ack-nhfb, } @InProceedings{Schneider:1990:TPCb, author = "D. Schneider and D. DeWitt", title = "Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines", crossref = "McCleod:1990:VLD", pages = "469", year = "1990", bibdate = "Mon Jul 18 09:32:33 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Alternative Joins Left-Deep Right-Deep Bushy Trees GAMMA VLDB", } @Book{Sedgewick:1990:AC, author = "Robert Sedgewick", title = "Algorithms in {C}", publisher = pub-AW, address = pub-AW:adr, pages = "xii + 657", year = "1990", ISBN = "0-201-51425-7", ISBN-13 = "978-0-201-51425-4", LCCN = "QA76.73.C15 S43 1990", bibdate = "Wed Dec 15 10:41:38 1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Severance:1990:DLH, author = "C. Severance and S. Pramanik and P. Wolberg", title = "Distributed Linear Hashing and Parallel Projection in Main Memory Databases", crossref = "McCleod:1990:VLD", pages = "674", year = "1990", bibdate = "Mon Jul 18 09:32:44 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "VLDB", } @TechReport{Shekita:1990:PEPa, author = "Eugene J. Shekita and Michael J. Carey", title = "A Performance Evaluation of Pointer-Based Joins", number = "TR 916", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = mar, year = "1990", bibdate = "Thu Jul 21 08:51:03 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems. Each join algorithm is described and an analysis is carried out to compare the performance of the pointer-based algorithms to their standard, non-pointer-based counterparts. The results of the analysis show that the pointer-based algorithms can provide significant performance gains in many situations. The results also show that the pointer-based nested-loops join algorithm, which is perhaps the most natural pointer-based join algorithm to consider using in an object-oriented database system, performs quite poorly on most medium to large joins.", acknowledgement = ack-nhfb, } @InProceedings{Shekita:1990:PEPb, author = "E. J. Shekita and M. J. Carey", title = "A Performance Evaluation of Pointer-Based Joins", crossref = "Garcia-Molina:1990:ASI", pages = "??", month = may, year = "1990", bibdate = "Thu Jul 21 09:39:46 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Similar to ADABAS? variants of the nested-loops, sort-merge, and hybrid hash join algorithms; pointer-based algorithms can provide significant performance gains in many situations; the nested-loops algorithm performs quite poorly on most medium to large joins; a parameter is result to source size ratio.", } @Article{Shekita:1990:PEPc, author = "Eugene J. Shekita and Michael J. Carey", title = "A Performance Evaluation of Pointer-Based Joins", journal = j-SIGMOD, volume = "19", number = "2", pages = "300--311", month = jun, year = "1990", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:34 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/93597/p300-shekita/p300-shekita.pdf; http://www.acm.org/pubs/citations/proceedings/mod/93597/p300-shekita/", abstract = "In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems. Each join algorithm is described and an analysis is carried out to compare the performance of the pointer-based algorithms to their standard, non-pointer-based counterparts. The results of the analysis show that the pointer-based algorithms can provide significant performance gains in many situations. The results also show that the pointer-based nested-loops join algorithm, which is perhaps the most natural pointer-based join algorithm to consider using in an object-oriented database system, performs quite poorly on most medium to large joins.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ.", affiliationaddress = "Madison, WI, USA", classification = "723; C4240 (Programming and algorithm theory); C6160D (Relational DBMS)", conference = "Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1990", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", generalterms = "Algorithms; Performance", keywords = "Computer Programming --- Algorithms; Database Systems; Hybrid-hash join; Performance evaluation; Pointer-based join algorithms; Pointer-Based Joins, Nested-loops join; Relational; Relational database systems; Sort-merge join", meetingaddress = "Atlantic City, NJ, USA", meetingdate = "May 23--25 1990", meetingdate2 = "05/23--25/90", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM SIGMOD, New York, NY, USA", subject = "Information Systems --- Database Management --- Logical Design (H.2.1): {\bf Data models}; Information Systems --- Database Management --- Systems (H.2.4): {\bf Query processing}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}", thesaurus = "Computational complexity; File organisation; Merging; Performance evaluation; Relational databases; Sorting", xxcrossref = "Anonymous:1990:ASI", } @Article{Vijay:1990:COE, author = "Vijay Kumar", title = "Concurrent Operations on Extensible Hashing and Its Performance", journal = j-CACM, volume = "33", number = "6", pages = "681--694", month = jun, year = "1990", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Whang:1990:LTP, author = "K. Y. Whang and B. T. {Vander Zanden} and H. M. Taylor", title = "A Linear-Time Probabilistic Counting Algorithm for Database Applications", journal = j-TODS, volume = "15", number = "2", pages = "208", month = jun, year = "1990", 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, keywords = "hashing sampling TODS", remark = "Counting the number of unique values in the presence of duplicates; O(n) time complexity based on hashing.", } @Article{White:1990:CSA, author = "L. B. White and B. Boashash", title = "Cross Spectral Analysis of Nonstationary Processes", journal = j-IEEE-TIT, volume = "36", number = "4", pages = "830", year = "1990", bibdate = "Thu Jul 21 08:14:31 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Winters:1990:MPHa, author = "Vincent G. Winters", title = "Minimal Perfect Hashing in Polynomial Time", journal = j-BIT, volume = "30", number = "2", pages = "235--244", year = "1990", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P10 (68P20 68Q25)", MRnumber = "91a:68044", bibdate = "Fri Nov 13 07:00:34 MST 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Winters:1990:MPHb, author = "Vincent G. Winters", title = "Minimal Perfect Hashing For Large Sets of Data", crossref = "Akl:1990:ACI", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:48 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Yen:1990:HTS, author = "I.-L. Yen and D.-R. Leu and F. B. Bastani", title = "Hash Table and Sorted Array: {A} Case Study of Multi-Entry Data Structures in Massively Parallel Systems", crossref = "Jaja:1990:SFM", pages = "51--54", year = "1990", bibdate = "Thu Oct 31 19:01:35 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zeller:1990:AHJ, author = "H. Zeller and J. Gray", title = "An Adaptive Hash Join Algorithm for Multiuser Environments", crossref = "McCleod:1990:VLD", pages = "186", year = "1990", bibdate = "Mon Jul 18 09:32:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Tandem VLDB", } @InProceedings{Zeller:1990:HJA, author = "H. Zeller and J. Gray", title = "Hash Join Algorithms in a Multiuser Environment", crossref = "McCleod:1990:VLD", pages = "??--??", year = "1990", bibdate = "Mon Oct 24 17:55:43 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zheng:1990:HOW, author = "Y. Zheng and J. Pieprzyk and J. Seberry", title = "{HAVAL} -- {A} One-way Hashing Algorithm with Variable Length of Output", crossref = "Seberry:1990:ACA", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:50 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @PhdThesis{Zheng:1990:PDS, author = "Yuliang Zheng", title = "Principles for Designing Secure Block Ciphers and One-Way Hash Functions", school = "Yokohama National University", address = "Yokohama, Japan", pages = "??", year = "1990", bibdate = "Thu Jul 21 09:39:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Anderson:1991:TFC, author = "Ross J. Anderson", title = "Tree Functions and Cipher Systems", journal = j-CRYPTOLOGIA, volume = "15", number = "3", pages = "194--202", month = jul, year = "1991", CODEN = "CRYPE6", DOI = "http://dx.doi.org/10.1080/0161-119191865858", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibdate = "Mon Jun 30 15:39:00 MDT 2008", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; OCLC Article1st database", note = "encryption systems; plaintext bit; hash function; ciphertext errors; error extension; tree function; ciphertext attack; computable attack; connectivity; DES; RSA key selection; algorithm design", URL = "http://www.informaworld.com/smpp/content~content=a741902753~db=all~order=page", abstract = "A number of encryption systems work by combining each plaintext bit with a hash function of the last $n$ ciphertext bits. Such systems are self-synchronising in that they recover from ciphertext errors with an error extension of $n$. The author shows that if the hash function is a tree function, then the system is vulnerable to a chosen ciphertext attack and, under certain circumstances, to a chosen plaintext attack; secondly, that all hash functions are equivalent to some tree function; thirdly, that whether or not this gives a computable attack on a given algorithm depends on the connectivity of a graph associated with the hash function; and, fourthly, the implications for DES, for RSA key selection, and for algorithm design in general", acknowledgement = ack-nhfb, keywords = "algorithm theory; cryptography; data integrity; file organisation; trees (mathematics)", language = "English", romanvolume = "XV", } @Book{Aoe:1991:CAK, author = "Jun-ichi Aoe", title = "Computer Algorithms: Key Search Strategies", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xi + 139", year = "1991", ISBN = "0-8186-2123-0 (paperback), 0-8186-2123-2 (hardcover), 0-8186-6123-2 (microfiche)", ISBN-13 = "978-0-8186-2123-9 (paperback), 978-0-8186-2123-9 (hardcover), 978-0-8186-6123-5 (microfiche)", LCCN = "QA76.9.A43 C66 1991", bibdate = "Fri Sep 16 12:02:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, descriptor = "Algorithmus, Hash, Suchbaum", remark = "Es Werden Ueberblicke Gegeben Ueber: Hashmethoden Binaere Suchbaeume B-baeume Digitale Suchbaeume Suchverfahren MIT Mehreren Schluesseln.", } @InProceedings{Azadegan:1991:PJA, author = "Shiva Azadegan and Anand Tripathi", title = "Parallel Join Algorithms for {SIMD} Models", crossref = "Wu:1991:PIC", volume = "III, Algorithms \& Applications", pages = "III-125--III-133", month = aug, year = "1991", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "algorithms, join operator, relational database, hashing, parallel algorithms, SIMD models, Connection Machine,", } @InProceedings{Bast:1991:FRP, author = "Holger Bast and Torben Hagerup", title = "Fast and Reliable Parallel Hashing", crossref = "ACM:1991:AAS", pages = "50--61", year = "1991", bibdate = "Thu Oct 31 19:02:06 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Biham:1991:DCFa, author = "Eli Biham and Adi Shamir", title = "Differential cryptanalysis of {Feal} and {N}-Hash", type = "Technical report", number = "CS91-17", institution = "Department of Applied Mathematics and Computer Science, Weizmann Institute of Science", address = "Rehovot, Israel", pages = "34", month = oct, year = "1991", bibdate = "Mon Oct 19 08:47:56 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[11] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function. In addition, we show how to transform differential cryptanalytic chosen plaintext attacks into known plaintext attacks.", acknowledgement = ack-nhfb, keywords = "Cryptography.", } @InProceedings{Biham:1991:DCFb, author = "E. Biham and A. Shamir", title = "Differential Cryptanalysis of {Feal} and {N}-Hash", crossref = "Davies:1991:ACE", pages = "1--??", year = "1991", bibdate = "Thu Jul 21 09:39:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Biham:1991:DCS, author = "Eli Biham and Adi Shamir", title = "Differential cryptanalysis of {Snefru}, {Khafre}, {REDOC-II}, {LOKI} and {Lucifer}", type = "Technical report", number = "CS91-18", institution = "Department of Applied Mathematics and Computer Science, Weizmann Institute of Science", address = "Rehovot, Israel", pages = "36", month = oct, year = "1991", bibdate = "Wed Nov 25 07:07:05 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In [1,2] we introduced the notion of differential cryptanalysis based on chosen plaintext attacks. In [3,4] we described the application of differential cryptanalysis to Feal [13,12] and extended the method to known plaintext attacks. In this paper differential cryptanalysis methods are applied to the hash function Snefru[10] and to the cryptosystems Khafre [11], REDOC-II [6,7], LOKI [5] and Lucifer [8].", acknowledgement = ack-nhfb, keywords = "Cryptography.", } @MastersThesis{Bremers:1991:HPP, author = "H. L. Bremers", title = "Hash Partitioning Performance Improved By Exploiting Skew and Dealing with Duplicates", type = "M.S. thesis", school = "Univ. of Colorado at Boulder", address = "Boulder, CO, USA", pages = "??", year = "1991", bibdate = "Thu Jul 21 09:39:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "join joins non-uniform hash value distribution", } @InProceedings{Cai:1991:LMN, author = "Jiazhen Cai and Robert A. Paige", title = "Look ma, no hashing, and no arrays neither", crossref = "ACM:1991:PPE", pages = "143--154", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p143-cai/", acknowledgement = ack-nhfb, keywords = "algorithms; design", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Cai:1991:MNH, author = "Jiazhen Cai and Robert Paige", title = "``{Look Ma}, No Hashing, And No Arrays Neither''", crossref = "ACM:1991:CRE", pages = "143--154", year = "1991", bibdate = "Mon Jul 18 12:26:35 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Camion:1991:KHF, author = "P. Camion and J. Patarin", title = "The Knapsack Hash Function Proposed at {Crypto '89} Can be Broken", crossref = "Davies:1991:ACE", pages = "39--53", year = "1991", bibdate = "Sat Jan 20 16:08:00 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Cesarini:1991:DHM, author = "F. Cesarini and G. Soda", title = "A Dynamic Hash Method with Signature", journal = j-TODS, volume = "16", number = "2", pages = "309--337", day = "1", month = jun, year = "1991", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chang:1991:DMP, author = "C. C. Chang and C. Y. Chen and J. K. Jan", title = "On the design of a machine-independent perfect hashing scheme", journal = j-COMP-J, volume = "34", number = "5", pages = "469--474", month = oct, year = "1991", 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; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/469.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/470.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/471.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/472.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/473.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_05/tiff/474.tif", acknowledgement = ack-nhfb, affiliation = "Inst of Comput. Sci. and Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan", classcodes = "C6120 (File organisation); C4240 (Programming and algorithm theory)", classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst of Comput. Sci. and Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan", keywords = "algorithm; compilers; Compilers; English letters; file organisation; function names; Function names; keywords; Keywords; letter-oriented merging-and-exchanging; Letter-oriented merging-and-exchanging algorithm; machine-independent perfect hashing scheme; Machine-independent perfect hashing scheme; operating systems; Operating systems; programming theory; reserved words; Reserved words", thesaurus = "File organisation; Programming theory", treatment = "P Practical", } @Article{Chang:1991:LOP, author = "Chin-Chen Chang and Tzong-Chen Wu", title = "A Letter-oriented Perfect Hashing Scheme Based upon {Sparse} Table Compression", journal = j-SPE, volume = "21", number = "1", pages = "35--49", month = jan, year = "1991", 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", acknowledgement = ack-nhfb, } @Article{Chang:1991:NAK, author = "C. C. Chang and C. Y. Chen", title = "A Note on Allocating $k$-ary Multiple Key Hashing Files Among Multiple Disks", journal = j-INFO-SCI, volume = "55", number = "1 / 3", pages = "69--??", day = "1", month = jun, year = "1991", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chapman:1991:QSS, author = "Rob Chapman", title = "{QuikFind} String Search", journal = j-FORTH-DIMENSIONS, volume = "13", number = "4", pages = "21--??", day = "1", month = nov, year = "1991", CODEN = "FODMD5", ISSN = "0884-0822", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Sure, ``Forth is fast'-repeat that mantra to yourself while waiting to compile code from a dictionary of several thousand words. The author tweaked his system a bit, then got hooked on the potential. His years-long self-study course is described succinctly here, along with the anticipated results: a fast hash algorithm for dictionary searches that won't turn your modules into molasses.", acknowledgement = ack-nhfb, } @Article{Chen:1991:DMK, author = "C. Y. Chen and C. C. Chang and R. C. T. Lee", title = "On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks", journal = j-INFO-SYS, volume = "16", number = "6", pages = "613--626", year = "1991", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Chen:1991:HNT, author = "Tung-Shou Chen and Arbee L. P. Chen and Wei-Pang Yang", booktitle = "Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems, Taipei, Taiwan, April 14--16, 1991", title = "Hash-semijoin: a new technique for minimizing distributed query time", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "325--330 (of xiii + 426)", year = "1991", ISBN = "0-8186-2755-7", ISBN-13 = "978-0-8186-2755-2", LCCN = "QA76.9.D5 I335 1992", bibdate = "Thu Jun 15 11:56:03 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Chin:1991:LPH, author = "A. Chin", title = "Locality-Preserving Hash Functions for General Purpose Parallel Computation", number = "PRG-TR-9-91", institution = "Programming Research Group, Oxford University", pages = "??", year = "1991", bibdate = "Thu Jul 21 09:39:53 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Chung:1991:IEH, author = "Soon M. Chung", title = "Indexed Extendible Hashing for Databases,", number = "WSU-CS-91-02", institution = "Washington State University", pages = "??", year = "1991", bibdate = "Tue Mar 14 19:22:39 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In the context of very large databases, the main problem is how to access the relevant data blocks in the minimum amount of time to satisfy the user queries. To speed up the retrieval operations on very large databases, we propose a hashing scheme named Indexed Extendible Hashing (IEH). Indexed extendible hashing a modification of the well known Extendible Hashing (EH) scheme. Compared to the directory of EH, the directory of IEH has better storage utilization and smaller size, especially when the distributions of the attribute values are not uniform. Due to the small directory size and direct access, considerable processing time can be saved by using IEH as an access mechanism for very large databases. IEH can also be used for multiattribute clustering to speed up partial match retrieval.", acknowledgement = ack-nhfb, } @TechReport{Cobb:1991:SIP, author = "Jorge A. Cobb and Shiow-yang Wu and Daniel P. Miranker", title = "Skew insensitive parallel join with sampling", number = "TR-91-35", institution = "University of Texas, Austin", address = "Austin, TX, USA", pages = "18", month = nov, year = "1991", bibdate = "Sun Oct 25 10:34:14 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The problem of skewed distribution of data values in a relation has been identified as a major performance limiting factor for external parallel join algorithms. The effective parallelism of both sort-merge based and hash based algorithms degrade significantly with skew on the join attribute values as well as skew on the distribution of data among processors. In this paper, we propose an external parallel join algorithm, derived from quick-sort, which performs well even in the case of skew. The algorithm uses range partitioning to split each relation into buckets, where the range values are determined using sampling techniques. Furthermore, each bucket is distributed evenly among all system disks, ensuring that all processors may work in parallel to further partition each bucket. Since both the task of partitioning the relations and the join of the final buckets are evenly distributed over all processors, the problem of skew is solved effectively. Experimental results show that a close to linear speedup can still be obtained even in the case of skew.", acknowledgement = ack-nhfb, keywords = "Parallel Join Algorithms Very Large Data Bases Skewed Data Distribution Skew Problem Sampling Join Algorithm.", } @TechReport{Darragh:1991:BCR, author = "John J. Darragh and John G. Cleary and Ian H. Witten", title = "Bonsai: {A} Compact Representation of Trees Predictive Interfaces: What Will They Think of Next? Oriented Database Definitions", number = "91/447/31", institution = "University of Calgary", pages = "??", month = oct, year = "1991", bibdate = "Thu Jul 21 09:39:55 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "(email parin@cpsc.ucalgary.ca).", abstract = "This paper shows how trees can be stored in a very compact form, called ``Bonsai'', using hash tables. A method is described that is suitable for large trees that grow monotonically within a predefined maximum size limit. Using it, pointers in any tree can be represented within $6 + ceil$ bits per node where $n$ is the maximum number of children a node can have. We first describe a general way of storing trees in hash tables, and then introduce the idea of compact hashing which underlies the Bonsai structure. These two techniques are combined to give a compact representation of trees, and a practical methodology is set out to permit the design of these structures. The new representation is compared with two conventional tree implementations in terms of the storage required per node. Examples of programs that must store large trees within a strict maximum size include those that operate on trie structures derived from natural language text. We describe how the Bonsai technique has been applied to the trees that arise in text compression and adaptive prediction, and include a discussion of the design parameters that work well in practice.", acknowledgement = ack-nhfb, } @InProceedings{DeSantis:1991:DPS, author = "A. {De Santis} and M. Yung", title = "On the Design of Provably-Secure Cryptographic Hash Functions", crossref = "Damgaard:1991:ACE", pages = "377--397", year = "1991", bibdate = "Sat Jul 16 12:02:43 1994", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Dietzfelbinger:1991:DPH, author = "M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. Meyer auf def Heide and H. Rohnert and Robert E. Tarjan", title = "Dynamic perfect hashing: upper and lower bounds", type = "Technical Report", number = "CS-TR-310-91", institution = inst-PRINCETON-CS, address = inst-PRINCETON-CS:adr, pages = "??", month = mar, year = "1991", bibdate = "Thu Jul 21 09:39:55 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Dittmer:1991:NFH, author = "I. Dittmer", title = "Note on Fast Hashing of Variable Length Text Strings", journal = j-CACM, volume = "34", number = "11", pages = "118--118", month = nov, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Apr 29 17:39:01 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Points out that Pearson's hashing algorithm \cite{Pearson:1990:FHV} was discovered fourteen years earlier by this author \cite{Dittmer:1976:IEP}. See also comments in \cite{Savoy:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}.", acknowledgement = ack-nhfb, } @Article{Donovan:1991:PSM, author = "Kevin Donovan", title = "Performance of shared memory in a parallel computer", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "2", number = "2", pages = "253--256", month = apr, year = "1991", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Fri Apr 11 15:20:39 MDT 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Dept of Comput Sci, New York Univ, NY, USA", classification = "722; 723; 922; C5470 (Performance evaluation and testing); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA", fjournal = "IEEE Transactions on Parallel and Distributed Systems", journalabr = "IEEE Trans Parallel Distrib Syst", keywords = "Computer Programming --- Algorithms; Computer Systems, Digital; conflict-; Data Storage Units --- Performance; evaluation; file organisation; free; hashing; memory queues; Memory Queues; Multiprocessing; Parallel Algorithms; parallel architectures; parallel computer; performance; Probability --- Queueing Theory; queue length; shared memory; Shared Memory Multiprocessors", treatment = "T Theoretical or Mathematical", } @Article{Du:1991:MEH, author = "D. H. C. Du and S.-R. Tong", key = "Du \& Tong", title = "Multilevel Extendible Hashing: {A} File Structure for Very Large Databases", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "3", number = "3", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "357--370", day = "1", month = sep, year = "1991", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Hashing schemes have been found to be one of the useful access methods for physical database system implementation. In the last decade several schemes have been proposed to extend the applicability of hashing methods to dynamic files. When a very large database system is considered, besides the space utilization and the retrieval time of the directory also become a major concern. In this paper, we propose a new dynamic hashing scheme, based on extendible hashing, whose directory can grow into a multilevel directory. We compare the proposed scheme to two other schemes, the Extendible hashing and the Extendible Hashing Tree schemes. The simulation results reveal that the proposed scheme is superior than the other two in the aspect of directory space utilization, especially for files with nonuniform record distribution. Furthermore, this scheme can be easily extended to multikey file systems and also has good performance.", acknowledgement = ack-nhfb, keywords = "physical design indices TKDE", } @Article{Du:1991:PDD, author = "D. H. C. Du and S.-R. Tong", title = "Physical Database Design Multilevel Extendible Hashing: {A} File Structure for Very Large Databases", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "3", number = "3", pages = "357--??", month = sep, year = "1991", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Elleithy:1991:VIS, author = "K. M. Elleithy and M. A. Bayoumi and L. M. Delcambre", title = "{VLSI} implementation of a systolic database machine for relational algebra and hashing", journal = j-INTEGRATION-VLSI-J, volume = "11", number = "2", pages = "169--??", day = "1", month = apr, year = "1991", CODEN = "IVJODL", ISSN = "0167-9260", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Faudemay:1991:AAL, author = "Pascal Faudemay and Mongia Mhiri", title = "An Associative Accelerator for Large Databases", journal = j-IEEE-MICRO, volume = "11", number = "6", pages = "22--34", month = dec, year = "1991", CODEN = "IEMIDZ", ISSN = "0272-1732 (print), 1937-4143 (electronic)", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; Science Citation Index database (1980--2000)", abstract = "Implementing relational operations at speeds adaptable to advanced microprocessors", acknowledgement = ack-nhfb, affiliation = "Lab MASI, Univ Pierre et Marie Curie, Paris, France", classcodes = "B1265D (Memory circuits); C5340 (Associative storage); C6160D (Relational DBMS); C6120 (File organisation); C5470 (Performance evaluation and testing); C5220 (Computer architecture)", classification = "722.1; 723.3", corpsource = "Lab. MASI, Univ. Pierre et Marie Curie, Paris, France", fjournal = "IEEE Micro", keywords = "add-on boards; architecture; associative accelerator; Associative memory capacity; Associative storage; Bit-parallel mode; bit-parallel mode; Computer architecture; content-addressable storage; data; Data structures; data structures; environments; hardwired control; hashing buckets; intelligent data; logical journal = j-IEEE-MICRO, formulas; microprocessors; performance; performance evaluation; processor; RAPID-1; rapid-1 associative accelerator; record; reduced instruction set; Reduced instruction set computer; reduced instruction set computing; relational access; Relational access processor; Relational database systems; relational databases; relations; structures; tuples", treatment = "P Practical", } @Article{Fox:1991:GEI, author = "Edward A. Fox", title = "Guest Editor's Introduction: Standards and the Emergence of Digital Multimedia Systems", journal = j-CACM, volume = "34", number = "4", pages = "26--29", month = apr, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Tue Aug 13 12:48:12 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/ATM.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "See \cite{Fox:1992:PMP}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/103086.html", abstract = "Standards will have far-reaching effects on the multimedia technology industry. The scope of computers and communications will expand into the areas of television and publishing. Integrated digital archives will store video, audio, and images, as well as data and text now recorded. Hypertext will develop into hypermedia and will be vital in document processing. Every branch of computer science will have a role in this growing field and will contribute to the development of digital multimedia systems. Interactive digital multimedia applications will change the way people learn and will have the potential to motivate them to learn and discover more. Research involving analog videodiscs will lead to more effective digital versions. [this article summarizes the other articles in this issue]", acknowledgement = ack-nhfb, keywords = "compression ADPCM (adaptive pulse code modulation) DPCM; design; digital JPEG MPEG DVI video; multimedia video; standardization", subject = "{\bf H.5.1}: Information Systems, INFORMATION INTERFACES AND PRESENTATION, Multimedia Information Systems.", } @Article{Fox:1991:OPM, author = "Edward A. Fox and Qi Fan Chen and Amjad M. Daoud and Lenwood S. Heath", title = "Order Preserving Minimal Perfect Hash Functions and Information Retrieval", journal = j-TOIS, volume = "9", number = "3", pages = "281--308", month = jul, year = "1991", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:02:45 MST 1999", bibsource = "http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Special Issue on Research and Development in Information Retrieval.", URL = "http://www.acm.org:80", abstract = "Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. The algorithms described give hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order-preserving minimal perfect hash functions (OPMPHFs) can be found using time and space that are linear in the number of keys involved; this is close to optimal.", acknowledgement = ack-nhfb, keywords = "TOOIS TOIS Data, Data storage representations, Hash table representations, Database management, Physical design, Access methods, Information storage and retrieval, Content analysis and indexing, Indexing methods, Information storage and retrieval, Information storage, File organization, Algorithms, Experimentation, Dictionary structure, Indexing, Inverted file structures, Minimal perfect hashing, Perfect hashing, Random graph", } @Article{Gadia:1991:IIT, author = "Shashi K. Gadia and Chuen-Sing Yeung", title = "Inadequacy of Interval Timestamps in Temporal Databases", journal = j-INFO-SCI, volume = "54", number = "1/2", pages = "1--??", year = "1991", CODEN = "ISIJBC", ISSN = "0020-0255", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Gibson:1991:DLH, author = "J. K. Gibson", title = "Discrete logarithm hash function that is collision free and one way", journal = j-IEE-PROC-E, volume = "138", number = "6", pages = "407--410", day = "1", month = nov, year = "1991", CODEN = "IPETD3", ISSN = "0143-7062", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Gil:1991:FHP, author = "Joseph Gil and Yossi Matias", title = "Fast Hashing on a {PRAM} -- Designing by Expectation", crossref = "ACM:1991:PSA", pages = "271--280", year = "1991", bibdate = "Thu Jul 21 09:39:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Goldsmith:1991:SCIa, author = "Judy Goldsmith and Lane A. Hemachandra and Kenneth Kunen", title = "On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions", journal = j-FSTTCS, volume = "11", number = "??", pages = "??", year = "1991", bibdate = "Mon Jan 22 12:15:00 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Goldsmith:1991:SCIb, author = "Judy Goldsmith and Lane A. Hemachandra and Kenneth Kunen", title = "On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "560", pages = "212--223", year = "1991", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Jan 20 16:08:00 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Gonnet:1991:HAD, author = "Gaston H. Gonnet and Ricardo Baeza-Yates", title = "Handbook of Algorithms and Data Structures: in {Pascal} and {C}", publisher = pub-AW, address = pub-AW:adr, edition = "Second.", pages = "xiv + 424", year = "1991", ISBN = "0-201-41607-7", ISBN-13 = "978-0-201-41607-7", LCCN = "QA76.73.P2 G66 1991", bibdate = "Wed Jul 20 00:30:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "UK\pounds 18.95", acknowledgement = ack-nhfb, } @TechReport{Graefe:1991:SVH, author = "G. Graefe and A. Linville and L. D. Shapiro", key = "Graefe et al.", title = "Sort versus Hash Revisited", type = "Technical report", number = "CU-CS-534-91", institution = "University of Colorado at Boulder", pages = "25", month = jul, year = "1991", bibdate = "Tue Oct 27 20:02:46 1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Many query processing operations can be implemented using sort or hash-based algorithms, e.g., join, intersection, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are frequently considered generally superior to sort-based algorithms such as merge join. In this report, we compare sort and hash-based query processing algorithms using the Volcano query execution engine and conclude that (a) many dualities exist between the two types of algorithms, (b) their costs differ mostly by percentages rather than factors, (c) special cases exist that favor one or the other choice, and (d) there is a strong reason why both sort and hash-based algorithms should be available in a query processing system.", acknowledgement = ack-nhfb, } @Article{Heller:1991:MHY, author = "Steve Heller", title = "Making a Hash of Your Data", journal = j-COMP-LANG-MAG, volume = "8", number = "8", pages = "47--??", day = "1", month = aug, year = "1991", CODEN = "COMLEF", ISSN = "0749-2839", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Hashing is a reliable way to rapidly retrieve data, as long as certain conditions are met. This article quickly recounts the benefits of hashing and then reviews in detail the techniques and caveats you must know if you're to avoid performance degradation.", acknowledgement = ack-nhfb, } @Article{Herrin:COMPSYS-4-2-127, author = "Erin H. {Herrin II} and Raphael Finkel", title = "An {ASCII} database for fast queries of relatively stable data", journal = j-COMP-SYS, volume = "4", number = "2", pages = "127--155", month = "Spring", year = "1991", CODEN = "CMSYE2", ISSN = "0895-6340", bibdate = "Fri Sep 13 08:00:08 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Kentucky Univ., Lexington, KY, USA", classification = "C6160 (Database management systems (DBMS))", keywords = "ASCII database; BSD; Database querying; Hash-based searching; Inverted index; Qddb; System V Unix", thesaurus = "Database management systems; Information retrieval; Query languages", } @Article{Hiranandani:1991:PHC, author = "Seema Hiranandani and Joel Saltz and Piyush Mehrotra and Harry Berryman", title = "Performance of hashed cache data migration schemes on multicomputers", journal = j-J-PAR-DIST-COMP, volume = "12", number = "4", pages = "415--422", month = aug, year = "1991", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Rice Univ", affiliationaddress = "Houston, TX, USA", classification = "722; 723; C5220 (Computer architecture); C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Comput. Inf. and Technol. Inst., Rice Univ., Houston, TX, USA", journalabr = "J Parallel Distrib Comput", keywords = "buffer storage; cache data migration; Computer Systems Programming --- Multiprocessing Programs; Computer Systems, Digital; Distributed; Distributed Shared Memory; evaluation; full enumeration; hash; hashed cache; Hashed Cache Data Migration; multiprocessing systems; nonlocal data; off-processor array elements; partial enumeration; performance; tables", treatment = "P Practical", } @Article{Inoue:1991:RRD, author = "Ushio Inoue and Tetsuji Satoh and Haruo Hayami and Hideaki Takeda and Toshio Nakamura and Hideki Fukuoka", title = "{Rinda}: a relational database processor with hardware specialized for searching and sorting", journal = j-IEEE-MICRO, volume = "11", number = "6", pages = "61--70", month = dec, year = "1991", CODEN = "IEMIDZ", ISSN = "0272-1732 (print), 1937-4143 (electronic)", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; Science Citation Index database (1980--2000)", abstract = "Reducing a host computer's CPU and I/O times with specialized hardware", acknowledgement = ack-nhfb, affiliation = "NTT Commun \& Inf Process Lab, Yokosuka-shi, Kanagawa, Japan", classcodes = "B1265D (Memory circuits); C5340 (Associative storage); C6160D (Relational DBMS)", classification = "722; 723.3", corpsource = "NTT Commun. and Inf. Process. Lab., Kanagawa, Japan", fjournal = "IEEE Micro", keywords = "channel interfaces; computer; Content search processors; content search processors; content-addressable storage; Database queries acceleration; disk storage; general-purpose host; Hashing function; main memory; purpose computers; Relational database processor; relational database processor; relational database queries; Relational database systems; relational databases; relational operational accelerating processors; Rinda; rinda processor; search rows; searching; sort rows; Sorting; sorting; special", treatment = "P Practical", } @Article{Jagannathan:1991:OPH, author = "Raj Jagannathan", title = "Optimal Partial-Match Hashing Design", journal = j-ORSA-J-COMPUT, volume = "3", number = "2", pages = "86--??", month = "Spring", year = "1991", CODEN = "OJCOE3", ISSN = "0899-1499", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Kanada:1991:MVP, author = "Y. Kanada", title = "A method of vector processing for shared symbolic data", crossref = "IEEE:1991:PSA", pages = "722--731", year = "1991", bibdate = "Wed Apr 15 16:28:01 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Hitachi Ltd., Tokyo, Japan", keywords = "address calculation sorting; data structures; dynamic data structures; filtering-overwritten-label method; graphs; hash table; Hitachi S-810; lists; microprocessors; multiple processings; parallel algorithms; parallel programming; parallel rewriting; performance; performance processing; programming theory; rewriting systems; shared elements; shared symbolic data; symbolic processing algorithms; trees; vector formulas", sponsororg = "IEEE; ACM", treatment = "T Theoretical or Mathematical", } @InProceedings{Keller:1991:APH, author = "A. Keller and S. Roy", title = "Adaptive Parallel Hash Join in Main-Memory Databases", crossref = "ACM:1991:PFI", pages = "??", year = "1991", bibdate = "Thu Jul 21 08:51:25 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "PDIS", } @Article{Kenyon:1991:MQS, author = "Claire M. Kenyon and Jeffrey Scott Vitter", title = "Maximum Queue Size and Hashing with Lazy Deletion", journal = j-ALGORITHMICA, volume = "6", number = "4", pages = "597--619", year = "1991", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68M20", MRnumber = "MR1107819 (92f:68015)", bibdate = "Mon Jan 22 05:30:41 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica6.html#KenyonV91; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database; UnCover library database", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "KenyonV91", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/KenyonV91", } @TechReport{Kim:1991:ISSa, author = "Yul H. Kim and Mark D. Hill and David A. Wood", title = "Implementing Stack Simulation for Highly-Associative Memories", number = "TR 997", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = feb, year = "1991", bibdate = "Thu Jul 21 09:39:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Prior to this work, all implementations of stack simulation required more than linear time to process an address trace. In particular these implementations are often slow for highly-associative memories and traces with poor locality, as can be found in simulations of file systems. We describe a new implementation of stack simulation where the referenced block and its stack distance are found using a hash table rather than by traversing the stack. This allows the trace-driven simulation of multiple alternative memories with the same block size, the same number of sets (e.g., fully associative), and using the least-recently-used replacement policy, with one pass through the trace in linear time. The key to this implementation is that designers are rarely interested in a continuum of memory sizes, but instead desire metrics for only a small, discrete set of alternatives (e.g., powers of two). We determine the memories in which a block resides by augmenting the state of each block with an index to the largest memory that contains that block. We update this state by using pointers to the block below the least-recently-used block in each memory. Our experimental evaluation confirms that the run-time of the new implementation is linear in address trace length and independent of trace locality.", acknowledgement = ack-nhfb, } @Article{Kim:1991:ISSb, author = "Yul H. Kim and Mark D. Hill and David A. Wood", title = "Implementing stack simulation for highly-associative memories", journal = j-SIGMETRICS, volume = "19", number = "1", pages = "212--213", month = may, year = "1991", CODEN = "????", DOI = "http://doi.acm.org/10.1145/107972.107995", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 11:11:17 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Prior to this work, all implementations of stack simulation [MGS70] required more than linear time to process an address trace. In particular these implementations are often slow for highly-associative memories and traces with poor locality, as can be found in simulations of tile systems. We describe a new implementation of stack simulation where the referenced block and its stack distance are found using a hash table rather than by traversing the stack. The key to this implementation is that designers are rarely interested in a continuum of memory sizes, but instead desire metrics for only a discrete set of alternatives (e.g., powers of two). Our experimental evaluation shows the run-time of the new implementation to be linear in address trace length and independent of trace locality. Kim, et al., [KHW91] present the results of this research in more detail.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", } @Article{Kotikalapudiram:1991:VPC, author = "Kotikalapudi Sriram and R. Scott McKinney and Mostafa Hashem Sherif", title = "Voice Packetization and Compression in Broadband {ATM} Networks", journal = j-IEEE-J-SEL-AREAS-COMMUN, volume = "9", number = "3", pages = "294--304", month = apr, year = "1991", CODEN = "ISACEM", ISSN = "0733-8716", bibdate = "Tue Mar 14 19:23:09 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Log Number 9042034.", abstract = "The purpose of this paper is to examine some methods of supporting voice in broadband ISDN's (B-ISDN) asynchronous transfer mode (ATM), including voice compression. Techniques for voice compression with variable-length packet format at DS1 transmission rate [e.g., wideband packet technology (WPT)] have been successfully implemented utilizing embedded ADPCM coding, digital speech interpolation (DSI), and block-dropping schemes. For supporting voice in B-ISDN, we consider voice compression techniques similar to those use in WPT but with different packetization and congestion control methods designed for the fixed-length ATM protocol. Possible approaches for packetization and implementation of variable bit-rate voice coding schemes are described. We consider using ADPCM and DSI for voice coding and compression, and cell discarding (CD) for congestion control. The advantages of voice compression and cell discarding in ATM networks are demonstrated in terms of transmission bandwidth savings and resiliency of the network during congestion.", acknowledgement = ack-nhfb, keywords = "voice compression ATM ADPCM (adaptive pulse code modulation) wideband packet technology (WPT) G727 G764 Packet Voice Protocol (PVP) digital speech interpolation (DSI) cell discarding (CD) cell prioritization queueing delay congestion control echo cancellation clock synchronization coding, voice packetization performance modeling performance analysis queueing model queue, M/D/1/k", } @Article{Kurosawa:1991:CFH, author = "Kaoru Kurosawa and Hirofumi Kasai and Shigeo Tsujii", title = "Collision Free Hash Function Based on the r-th Residue Cryptosystem", journal = j-IEICE-TCEIS, volume = "E74", number = "8", pages = "2114--2117", year = "1991", CODEN = "IEITEF", ISSN = "0917-1673", bibdate = "Thu Oct 31 19:04:50 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Litsios:1991:NFH, author = "James Litsios", title = "Note on Fast Hashing of Variable Length Text Strings", journal = j-CACM, volume = "34", number = "11", pages = "118--120", month = nov, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Apr 29 17:40:42 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Suggests a simple extension of Pearson's hashing algorithm \cite{Pearson:1990:FHV} that supports non-character data. See also comments in \cite{Dittmer:1991:NFH,Savoy:1991:NFH,Pearson:1991:NFH}, and early work in \cite{Dittmer:1976:IEP}.", acknowledgement = ack-nhfb, } @Article{Litwin:1991:THC, author = "W. A. Litwin and N. Roussopoulos and G. Levy and W. Hong", title = "Trie Hashing With Controlled Load", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "17", number = "7", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "678--691", day = "1", month = jul, year = "1991", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Luccio:1991:APU, author = "Fabrizio Luccio and Andrea Pietracaprina and Geppino Pucci", title = "Analysis of Parallel Uniform Hashing", journal = j-INFO-PROC-LETT, volume = "37", number = "2", pages = "67--69", day = "31", month = jan, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Univ of Pisa", affiliationaddress = "Pisa, Italy", classification = "723", journalabr = "Inf Process Lett", keywords = "Computer Programming --- Algorithms; Computer Systems Programming --- Multiprocessing Programs; Data Processing; File Organization; Hash Tables; Parallel Algorithms; Parallel Uniform Hashing", } @InProceedings{Matias:1991:CHP, author = "Yossi Matias and Uzi Vishkin", title = "Converting high probability into nearly-constant time, with applications to parallel hashing", crossref = "ACM:1991:PTT", pages = "307--316", year = "1991", bibdate = "Fri Jul 22 10:05:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Matias:1991:PHI, author = "Yossi Matias and Uzi Vishkin", title = "On Parallel Hashing and Integer Sorting", journal = j-J-ALG, volume = "12", number = "4", pages = "573--606", day = "1", month = dec, year = "1991", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Miyaguchi:1991:CSH, author = "Shoji Miyaguchi and Kazuo Ohta and Masahiko Iwata", title = "Confirmation that Some Hash Functions Are Not Collision Free", journal = j-LECT-NOTES-COMP-SCI, volume = "473", pages = "326--??", year = "1991", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Feb 4 12:02:01 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0473.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0473/04730326.htm; http://link.springer-ny.com/link/service/series/0558/papers/0473/04730326.pdf", acknowledgement = ack-nhfb, } @Article{Mullin:1991:CUC, author = "James K. Mullin", title = "A Caution on Universal Classes of Hash Functions", journal = j-INFO-PROC-LETT, volume = "37", number = "5", pages = "247--256", day = "14", month = mar, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Univ of Western Ontario", affiliationaddress = "London, Ont, Can", classification = "723", journalabr = "Inf Process Lett", keywords = "Computers, Microcomputer; Data Processing; Data Structures; Fixed Precision Hash Functions; Hash Functions; Hashing Performance; Universal Hash Functions", } @Article{Negri:1991:DJN, author = "M. Negri and G. Pelagatti", key = "Negri \& Pelagatti", title = "Distributive Join: {A} New Algorithm for Joining Relations", journal = j-TODS, volume = "16", number = "4", pages = "655--669", month = dec, year = "1991", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jan 16 16:10:28 1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes a new algorithm for performing joins in the absence of access paths. This algorithm is shown to perform better than the merging scan algorithm, which can be considered the paradigm of join algorithms. Finally this algorithm is compared with another recent sub-sort-merge algorithm.", acknowledgement = ack-nhfb, keywords = "Algorithm, Performance, buffer, hashing, join, merging scan, nested scan, sort", } @TechReport{Omicinski:1991:AHJ, author = "E. Omicinski and E. T. Lin", key = "Omiecinski \& Lin", title = "The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer", institution = "School of Information and Computer Science, Georgia Institute of Technology", pages = "30", year = "1991", bibdate = "Tue Aug 11 14:14:02 1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The goal of this research is to design efficient relational join algorithms for large databases on a hypercube multicomputer in which data and processing power are distributed. The Cube Hybrid-Hash join algorithm was shown to outperform other algorithms in our previous research. Unfortunately, its performance greatly deteriorates when bucket overflow occurs in the inner rlation of the join operation. In this paper, we present the Cube Adaptive-Hash join algorithm, which is designed to combine the merits of Nested-Loop and Hybrid-Hash. The performance of these algorithms are compared through analytical cost modeling. The non-uniform data value distribution of the inner relation is shown to have a greater impact than that of the outer relation. The Cube Adaptive-Hash join algorithm outperforms the Cube Hybrid-Hash algorithm when bucket overflow occurs. In the worst case, this algorithm converges to the Cube Nested-Loop-Hash join algorithm. When there is no hash table overflow, the Cube Adaptive-Hash join algorithm converges to the Cube Hybrid-Hash join algorithm. Since the Cube Adaptive-Hash join algorithm adapts itself depending on the characteristics of the relations, it is relatively immune to the data distribution. We believe that the Cube Adaptive-Hash join algorithm should be the algorithm of choice to perform the relational join operator for large databases on the hypercube multicomputer.", acknowledgement = ack-nhfb, } @InProceedings{Omiecinski:1991:PAL, author = "E. Omiecinski", key = "Omiecinski", title = "Performance Analysis of a Load Balancing Hash-Jpoin Algorithm for a Shared Memory Multiprocessor", crossref = "Lohman:1991:VLD", pages = "375--385", year = "1991", bibdate = "Mon Jul 18 09:35:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Within the last several years, there has been a growing interest in applying general multiprocessor systems to relational database query processing. Efficient parallel algorithms have been designed for the join operation but usually have been failing in that their performance deteriorates greatly when the data is nonuniform. In this paper, we propose a new version of the hash-based join algorithm that balances the load between the processors, for any given bucket, in a shared everything environment. We develop an analytical model of the cost of the algorithm and implement the algorithm on a shared memory multiprocessor machine. We also perform a number of experiments comparing our model with our empirical results.", acknowledgement = ack-nhfb, keywords = "hash join joins VLDB", } @Article{Otken:1991:HF, author = "John Otken", title = "Hashing Functions", journal = j-PROGRAM-J, volume = "9", number = "3", pages = "69--??", day = "1", month = may, year = "1991", ISSN = "0747-5861", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "John examines string hashing functions for fast table lookup and explains why a hash table, unlike your car's gas tank, should never be full. He also creates equivalent functions in assembly language for Windows 3 routines that manage handle-based dynamic storage and atoms (hashed strings).", acknowledgement = ack-nhfb, } @Article{Ou:1991:HSU, author = "Seng Fat Ou and Alan L. Tharp", title = "High Storage Utilisation for Single-Probe Retrieval Linear Hashing", journal = j-COMP-J, volume = "34", number = "5", pages = "455--468", day = "1", month = oct, year = "1991", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Jul 21 08:18:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Pearson:1991:NFH, author = "Peter Pearson", title = "Note on Fast Hashing of Variable Length Text Strings", journal = j-CACM, volume = "34", number = "11", pages = "120", month = nov, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Apr 29 17:43:03 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Responds to several comments \cite{Dittmer:1991:NFH,Litsios:1991:NFH,Savoy:1991:NFH} on the author's earlier paper \cite{Pearson:1990:FHV}, and early work \cite{Dittmer:1976:IEP}.", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1991:CRH, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "Collision resistant hash functions based on blockciphers", crossref = "Feigenbaum:1991:ACC", pages = "??", year = "1991", bibdate = "Sat Jul 16 17:43:33 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ramakrishna:1991:DPH, author = "M. V. Ramakrishna and Y. Bannai", title = "Direct perfect hashing functions for external files", journal = j-J-DATABASE-ADM, volume = "2", number = "1", pages = "19--29", year = "1991", CODEN = "JDADEX", ISSN = "1047-9430", bibdate = "Thu Jun 15 12:23:23 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ramakrishna:1991:PHF, author = "M. V. Ramakrishna and G. A. Portice", title = "Perfect Hashing Functions for Hardware Applications", crossref = "IEEE:1991:PSI", pages = "464", month = apr, year = "1991", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Rathi:1991:PCE, author = "Ashok Rathi and Huizu Lu and G. E. Hedrick", title = "Performance Comparison of Extendible Hashing an Linear Hashing Techniques", journal = j-SIGSMALL-PC-NOTES, volume = "17", number = "2", pages = "19--??", month = "Summer", year = "1991", CODEN = "SGBLEC", ISSN = "0893-2875", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @TechReport{Roy:1991:LBH, author = "S. Roy and A. Keller", title = "Load Balancing in Hash-Based Parallel Join Computation in Presence of Data Skew", institution = "????", pages = "??", year = "1991", bibdate = "Thu Jul 21 09:40:00 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Submitted to DE91.", acknowledgement = ack-nhfb, } @InProceedings{Sadeghiyan:1991:COW, author = "B. Sadeghiyan and J. Pieprzyk", title = "A Construction for One Way Hash Functions and Pseudorandom Bit Generators", crossref = "Davies:1991:ACE", pages = "431--445", year = "1991", bibdate = "Sat Jul 16 17:48:51 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Savoy:1991:NFH, author = "Jacques Savoy", title = "Note on Fast Hashing of Variable Length Text Strings", journal = j-CACM, volume = "34", number = "11", pages = "118--119", month = nov, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu Apr 29 17:43:31 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Suggests an improvement to Pearson's hashing algorithm \cite{Pearson:1990:FHV} that avoids secondary clustering. Exhibits a key set for which Pearson's algorithm produces alarming clustering. See also comments in \cite{Dittmer:1991:NFH,Litsios:1991:NFH,Pearson:1991:NFH}, and early work in \cite{Dittmer:1976:IEP}.", acknowledgement = ack-nhfb, } @Article{Schneier:1991:OHF, author = "Bruce Schneier", title = "One-Way Hash Functions: Probabilistic algorithms can be used for general-purpose pattern matching", journal = j-DDJ, volume = "16", number = "9", pages = "148--151", day = "1", month = sep, year = "1991", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 09:11:02 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover database", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", keywords = "128-Bit hash; 32 Bit; 32-Bit architectures; 32-Bit operands; Cryptographic algorithm; DES; Digital Encryption Standard; MD5; Message Digest; One-way hash function", thesaurus = "C listings; Cryptography; File organisation", } @InProceedings{Schnorr:1991:FHE, author = "C. P. Schnorr", title = "{FFT}-Hashing, An Efficient Cryptographic Hash Function", crossref = "Feigenbaum:1991:ACC", pages = "??", year = "1991", bibdate = "Sat Jul 16 17:51:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Seltzer:1991:NHP, author = "Margo Seltzer and Ozan Yigit", title = "A New Hashing Package for {UNIX}", crossref = "USENIX:1991:PWU", pages = "173--184", year = "1991", bibdate = "Mon Jul 18 12:17:04 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Shasha:1991:OEQ, author = "Dennis Shasha and Tsong-Li Wang", title = "Optimizing Equijoin Queries in Distributed Databases where Relations are Hash-Partitioned", journal = j-TODS, volume = "16", number = "2", pages = "279--??", day = "1", month = jun, year = "1991", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jul 14 02:29:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, remark = "No shared memory so that processor must repartition the relations and intermediate results in a multijoin query for lost hashkeys (not dynamic optimization); optimum solutions for closed chain queries, NP-completeness of star, tree, and general graph queries and effective heuristics.", } @TechReport{Shekita:1991:HPF, author = "Eugene Shekita", title = "High-Per\-for\-mance Implementation Techniques for Next-Generation Database Systems", number = "TR 1026", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = may, year = "1991", bibdate = "Thu Jul 21 09:40:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Database systems have traditionally been designed for business applications. In the last decade, however, it has become increasingly clear that application areas such as computer-aided design and manufacturing (CAD/CAM), computer-aided software engineering (CASE), image processing, etc., can also benefit from database technology. Unfortunately, the relational database systems that are used for business applications are often ill suited for these sorts of applications. More recently, several `next-generation' database systems, which are often classified as extended relational database systems or object-oriented database systems, have appeared to address the demands of these emerging application areas. Of course, whether these next-generation database systems actually succeed will largely depend on their performance. This thesis describes and analyzes three different implementation techniques for improving the performance of next-generation database systems. A separate research chapter is devoted to each technique. In the first research chapter of this thesis, we describe a technique called {\it field replication,} which uses replicated data to eliminate some of the functional joins that would otherwise be required for query processing. We describe how field replication is specified at the data model level and present storage-level mechanisms to efficiently support it. An analytical cost model is developed to give some feel for how beneficial this technique can be and the circumstances under which it breaks down. While field replication is a relatively simple notion, the analysis shows that it can provide significant performance gains in many situations. In the second research chapter of this thesis, we examine how physical pointers can be used effectively in join processing. We describe several pointer-based join algorithms that are simple variations on the well known nested-loops, sort-merge, hybrid-hash, and hash-loops join algorithms used in relational database systems. An analytical cost model is developed to compare the performance of the pointer-based join algorithms to their standard counterparts. The results of the analysis show that the pointer-based algorithms can often provide significant performance gains over conventional, value-based join algorithms. In the final research chapter of this thesis, we argue that traditional database storage systems are poorly suited for some emerging application areas such as CAD/CAM, and that an approach based on a single-level store may offer better performance. We describe a prototype storage system called Cricket that was developed to explore the feasibility of such an approach. Cricket uses the memory management primitives of the Mach operating system to provide the abstraction of a shared, transactional, single-level store. Performance results for the Sun Benchmarks indicate that the approach taken in Cricket has the potential to perform well on applications whose working sets fit in memory.", acknowledgement = ack-nhfb, } @TechReport{Shih:1991:CDC, author = "C.-S. Shih and A. Dan and W. H. Kohler", title = "Comparison of Distributed Concurrency Control Protocols on a Distributed Database Testbed", number = "COINS TR 91-13", institution = "University of Massachusetts", pages = "??", year = "1991", bibdate = "Thu Jul 21 09:40:02 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we compare the performance of several concurrency control protocols by executing these protocols under various workloads in a common distributed database testbed environment. We study the effect of implementation overhead on the performance of three classes of distributed concurrency control protocols: two-phase locking, optimistic approach with backward validation, and optimistic approach with forward validation. We develop and evaluate several optimizations for optimistic concurrency control with backward validation. To minimize the non-essential variations in implementation, we use a common hash table implementation for both the lock table as well as the validation table. The main emphasis here is to contrast the difference in protocol overhead based on the number of high level operations required by different protocols while taking the common low level implementation overhead into consideration. We believe that this is one of the first comprehensive, {\it experimental} study of distributed concurrency control protocols. In our experimental environment, two-phase locking performed significantly better than the backward validation optimistic approaches on most of the workloads (except for read-only workloads). For query-intensive (read-only) workloads, optimistic protocols with backward validation can simplify their validation check and outperform both two-phase locking and the optimistic with forward validation. Two-phase locking also performed better than optimistic with forward validation. Two-phase locking also performed better than optimistic with forward validation (except for the long response time situations). We observed that the locking protocol usually required less system resources (CPU and Disk I/O) than the optimistic approaches and supported higher throughput. On some of the workloads, the most important performance degradation factor for the two-phase locking protocol was a long blocking time on locks whereas it was the high transaction abort rate for the optimistic protocols, especially for the ones with backward validation.", acknowledgement = ack-nhfb, } @Article{Stinson:1991:UHA, author = "D. R. Stinson", title = "Universal hashing and authentication codes", journal = j-LECT-NOTES-COMP-SCI, volume = "576", pages = "74--85", year = "1991", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 09 17:36:04 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; MathSciNet database", acknowledgement = ack-nhfb, } @InProceedings{Sundar:1991:LBD, author = "R. Sundar", title = "A lower bound for the dictionary problem under a hashing model", crossref = "IEEE:1991:PAS", pages = "612--621", year = "1991", bibdate = "Mon Jul 18 11:06:25 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Teuhola:1991:MSA, author = "Jukka Teuhola and Lutz Wegner", title = "Minimal Space, Average Linear Time Duplicate Deletion", journal = j-CACM, volume = "34", number = "3", pages = "62--73", month = mar, year = "1991", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", MRclass = "68P10", MRnumber = "095 875", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Hashing, with collision moved to tail end of the file can be made stable.", } @Article{Tharp:1991:BTB, author = "Alan L. Tharp and William Boswell", title = "${B}^+$ trees, bounded disorder and adaptive hashing", journal = j-INFO-SYS, volume = "16", number = "1", pages = "65--72", year = "1991", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Tien:1991:CBI, author = "J. Y. Tien and W. P. Yang", title = "Comments on ``Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers''", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "3", number = "3", pages = "??", year = "1991", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Thu Jul 21 09:40:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tien:1991:CHI, author = "J.-Y. Tien and W.-P. Yang", title = "Comments on ``Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers.''", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "3", number = "3", pages = "387--??", day = "1", month = sep, year = "1991", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Wolf:1991:EAP, author = "J. L. Wolf and D. M. Dias and P. S. Yu and J. Turek", title = "An Effective Algorithm for Parallelizing Hash Joins in the Presence of Data Skew", crossref = "IEEE:1991:PSI", pages = "200", month = apr, year = "1991", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "PSYu", } @InProceedings{Yao:1991:WRA, author = "Andrew C. Yao", title = "Weighted Random Assignments with Application to Hashing", crossref = "Hsu:1991:IAI", pages = "42--42", year = "1991", bibdate = "Thu Jul 21 09:40:06 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Yen:1991:MPH, author = "I.-L. Yen", title = "Massively Parallel Hash Algorithms and Performance", crossref = "ACM:1991:ACS", pages = "21--28", year = "1991", bibdate = "Thu Oct 31 19:06:39 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @PhdThesis{Zeller:1991:AHJ, author = "H. Zeller", title = "Adaptive Hash-Join-Algorithmen (in German)", type = "Ph.D. thesis", school = "University of Stuttgart", address = "Stuttgart, Germany", pages = "??", month = nov, year = "1991", bibdate = "Thu Jul 21 09:40:07 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zemor:1991:HFG, author = "G. Zemor", title = "Hash Functions and Graphs with Large Girths", crossref = "Davies:1991:ACE", pages = "508--511", year = "1991", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Jan 22 12:39:19 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Zezula:1991:DPS, author = "P. Zezula and F. Rabitti and P. Tiberio", title = "Dynamic Partitioning of Signature Files", journal = j-TOIS, volume = "9", number = "4", pages = "336--369", month = oct, year = "1991", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:02:45 MST 1999", bibsource = "http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80", abstract = "The signature file access method has proved to be a convenient indexing technique, in particular for text data. Because it can deal with unformatted data, many application domains have shown interest in signature file techniques, e.g., office information systems, statistical and logic databases. We argue that multimedia databases should also take advantage of this method, provided convenient storage structures for organizing signature files are available. Our main concern here is the dynamic organization of signatures based on a partitioning paradigm called Quick Filter. A signature file is partitioned by a hashing function and the partitions are organized by linear hashing. Thorough performance evaluation of the new scheme is provided, and it is compared with single-level and multilevel storage structures. Results show that quick filter is economical in space and very convenient for applications dealing with large files of dynamic data, and where user queries result in signatures with high weights. These characteristics are particularly interesting for multimedia databases, where integrated access to attributes, text and images must be provided.", acknowledgement = ack-nhfb, keywords = "TOOIS TOIS Data, Files, Organization / structure, Database management, Physical design, Access methods, Information storage and retrieval, Information storage, File organization, Information systems applications, Office automation, Design, Performance, Access methods, Dynamic data, Hashing, Information retrieval, Multimedia data, Performance evaluation, Signature file partitioning", } @Article{Zheng:1991:SPO, author = "Y. Zheng and T. Matsumoto and H. Imai", title = "Structural Properties of One-way Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "537", pages = "285--302", year = "1991", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Jan 20 16:08:00 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, xxpages = "263--280", } @InProceedings{Ajtai:1992:FTG, author = "M. Ajtai and N. Alon and J. Bruck and R. Cypher and C. Ho and M. Naor and E. Szemer{\'e}di", title = "Fault tolerant graphs, perfect hash functions and disjoint paths", crossref = "IEEE:1992:PAS", pages = "693--702", year = "1992", bibdate = "Mon Jul 18 11:08:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Aldous:1992:MSD, author = "David Aldous and Micha Hofri and Wojciech Szpankowski", title = "Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited", journal = j-SIAM-J-COMPUT, volume = "21", number = "4", pages = "713--732", month = aug, year = "1992", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P05 (60K25 60K30 68P20)", MRnumber = "93i:68042", MRreviewer = "Helmut Alt", bibdate = "Sat Jan 18 18:03:50 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Analyti:1992:FSM, author = "Anastasia Analyti and Sakti Pramanik", title = "Fast search in main memory databases", crossref = "Stonebraker:1992:PAS", pages = "215--224", year = "1992", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/130283/p215-analyti/p215-analyti.pdf; http://www.acm.org/pubs/citations/proceedings/mod/130283/p215-analyti/", abstract = "The objective of this paper is to develop and analyze high performance hash based search methods for main memory databases. We define optimal search in main memory databases as the search that requires at most one key comparison to locate a record. Existing hashing techniques become impractical when they are adapted to yield optimal search in main memory databases because this implementation is that designers are rarely of their large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over single-directory hashing techniques. A multi-directory hashing scheme, called fast search multi-directory hashing, and its generalization, called controlled search multi-directory hashing, are presented. Both methods achieve linearly increasing expected directory size with the number of records. Their performance is compared to existing alternatives.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Measurement; Performance; Theory; Verification", subject = "Information Systems --- Database Management --- Physical Design (H.2.2): {\bf Access methods}; Data --- Data Storage Representations (E.2): {\bf Hash-table representations}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}", } @Article{Bauspiess:1992:RCH, author = "Fritz Bauspiess and Frank Damm", title = "Requirements for cryptographic hash functions", journal = j-COMPUT-SECUR, volume = "11", number = "5", pages = "427--437", day = "1", month = sep, year = "1992", CODEN = "CPSEDU", ISSN = "0167-4048", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Becker:1992:RBO, author = "Ludger Becker and Ralf Hartmut G{\"u}ting", title = "Rule-Based Optimization and Query Processing in an Extensible Geometric Database System", journal = j-TODS, volume = "17", number = "2", pages = "247--303", month = jun, year = "1992", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "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/1992-17-2/p247-becker/p247-becker.pdf; http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p247-becker/; http://www.acm.org/pubs/toc/Abstracts/tods/128905.html", abstract = "Gral is an extensible database system, based on the formal concept of a many-sorted relational algebra. Many-sorted algebra is used to define any application's query language, its query execution language, and its optimization rules. In this paper we describe Gral's optimization component. It provides (1) a sophisticated rule language --- rules are transformations of abstract algebra expressions, (2) a general optimization framework under which more specific optimization algorithms can be implemented, and (3) several control mechanisms for the application of rules. An optimization algorithm can be specified as a series of steps. Each step is defined by its own collection of rules together with a selected control strategy. \par The general facilities are illustrated by the complete design of an example optimizer --- in the form of a rule file --- for a small nonstandard query language and an associated execution language. The query language includes selection, join, ordering, embedding derived values, aggregate functions, and several geometric operations. The example shows in particular how the special processing techniques of a geometric database systems, such as spatial join methods and geometric index structures, can be integrated into query processing and optimization of a relational database system. A similar, though larger, optimizer is fully functional within the geometric database system implemented as a Gral prototype.", acknowledgement = ack-nhfb, affiliation = "Univ. Gesamthochschule Siegen, Germany", fjournal = "ACM Transactions on Database Systems", generalterms = "Algorithms; Languages", keywords = "algorithms; extensibility; geometric query processing; languages, Guting Gral TODS; many-sorted algebra; optimization; relational algebra; rule-based optimization", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems.", } @Article{Burk:1992:HGP, author = "Ron L. Burk", title = "Hashing: From Good To Perfect", journal = j-CUJ, volume = "10", number = "2", pages = "41--??", month = feb, year = "1992", ISSN = "0898-9788", bibdate = "Fri Aug 30 16:52:23 MDT 1996", bibsource = "http://www.cuj.com/cbklist.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Celis:1992:AHL, author = "Pedro Celis and John Franco", title = "The Analysis of Hashing with Lazy Deletions", journal = j-INFO-SCI, volume = "62", number = "1 / 2", pages = "13--26", day = "1", month = jul, year = "1992", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chang:1992:OPD, author = "C. C. Chang and H. F. Lin and C. Y. Chen", title = "Optimality Properties of the Disc Modulo Allocation Method for $k$-ary Multiple Key Hashing Files", journal = j-COMP-J, volume = "35", number = "4", pages = "390--394", day = "1", month = aug, year = "1992", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Chen:1992:USR, author = "M-S. Chen and M. L. Lo and P. S. Yu and H. C. Young", title = "Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins", crossref = "Yuan:1992:VLD", pages = "15", year = "1992", bibdate = "Mon Jul 18 09:37:09 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "bushy tree query processing MLLo PSYu VLDB", } @Article{Chung:1992:IEH, author = "Soon M. Chung", title = "Indexed Extendible Hashing", journal = j-INFO-PROC-LETT, volume = "44", number = "1", pages = "1--6", day = "9", month = nov, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Wright State Univ", affiliationaddress = "Dayton, OH, USA", classification = "722.1; 723.2; 723.3; 903.1; 903.3", journalabr = "Inf Process Lett", keywords = "Data structures; Database systems; Directory; Extendible hashing; Hashing; Indexed extendible hashing; Indexing (of information); Information retrieval; Query languages; Storage allocation (computer); Storage utilization", } @Article{Cotter:1992:CTK, author = "N. E. Cotter and T. J. Guillerm", title = "The {CMAC} and a Theorem of Kolmogorov", journal = j-NEURAL-NETWORKS, volume = "5", number = "??", pages = "221--228", year = "1992", CODEN = "NNETEB", ISSN = "0893-6080", bibdate = "Thu Jul 21 09:23:32 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CMAC, Kolmogorov theorem, Hash tables, Spurious activity", ref = "SS70", } @TechReport{Czech:1992:OAGa, author = "Zbigniew J. Czech and George Havas and Bohdan S. Majewski", title = "An Optimal Algorithm for Generating Minimal Perfect Hash Functions", number = "92-24", institution = "Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University, New Jersey", pages = "??", year = "1992", bibdate = "Thu Jul 21 09:40:09 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Czech:1992:OAGb, author = "Zbigniew J. Czech and George Havas and Bohdan S. Majewski", title = "An Optimal Algorithm for Generating Minimal Perfect Hash Functions", journal = j-INFO-PROC-LETT, volume = "43", number = "5", pages = "257--264", day = "5", month = oct, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Silesia Univ of Technology", affiliationaddress = "Gliwice, Pol", classification = "721.1; 722.1; 723.1; 723.2; 921.4; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. of Comput. Sci., Silesia Univ. of Technol., Gliwice, Poland", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; Computer systems programming; Data handling; Data structures; expected linear time; file organisation; Graph theory; graph theory; Hashing; Minimal perfect hash functions; minimal perfect hash functions; order preserving hash functions; Perfect hash functions; probabilistic algorithm; Probabilistic logics; random graph generation; Random graphs; Random processes; Table lookup; word representation", treatment = "T Theoretical or Mathematical", } @InProceedings{Delis:1992:PSC, author = "A. Delis and N. Roussopoulos", booktitle = "Proceedings of the 18th Conference on Very Large Databases, Vancouver", title = "Performance and Scalability of Client-Server Architectures", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adr, pages = "??", month = aug, year = "1992", bibdate = "Mon Oct 24 17:41:53 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Caching is effective simulation up to hashing limit.", } @TechReport{DeWitt:1992:PSH, author = "David J. DeWitt and Jeffrey F. Naughton and Donovan A. Schneider and S. Seshadri", title = "Practical Skew Handling in Parallel Joins", number = "TR 1098", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = jul, year = "1992", bibdate = "Thu Jul 21 09:40:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed data without degrading the performance of the system on non-skewed data. The main idea is to use multiple algorithms, each specialized for a different degree of skew, and to use a small sample of the relations being joined to determine which algorithm is appropriate. We developed, implemented, and experimented with four new skew-handling parallel join algorithms; one, which we call virtual processor range partitioning, was the clear winner in high skew cases, while traditional hybrid hash join was the clear winner in lower skew or no skew cases. We present experimental results from an implementation of all four algorithms on the Gamma parallel database machine. To our knowledge, these are the first reported skew-handling numbers from an actual implementation.", acknowledgement = ack-nhfb, } @InCollection{Dietzfelbinger:1992:HPU, author = "Martin Dietzfelbinger and Friedhelm Meyer auf der Heide", title = "High Performance Universal Hashing, with Applications to Shared Memory Simulations", crossref = "Monien:1992:DSE", pages = "250--269", year = "1992", bibdate = "Thu Jul 21 09:40:10 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Dietzfelbinger:1992:PHF, author = "M. Dietzfelbinger and J. Gil and Y. Matias and N. Pippenger", title = "Polynomial Hash Functions Are Reliable", crossref = "Kuich:1992:ALP", pages = "235--246", year = "1992", bibdate = "Mon Jan 22 12:40:51 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Dolev:1992:NPH, author = "D. Dolev and others", title = "On neighborhood preserving hashing", type = "Technical report", number = "92-31", institution = "Hebrew University of Jerusalem, Department of Computer Science", pages = "??", year = "1992", bibdate = "Wed Nov 01 08:12:22 2000", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Fiat:1992:NH, author = "Amos Fiat and Moni Naor and Jeanette P. Schmidt and Alan Siegel", title = "Nonoblivious Hashing", journal = j-J-ACM, volume = "39", number = "4", pages = "764--782", day = "1", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411", bibdate = "Sat May 25 15:19:54 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, keywords = "Algorithms; Analysis of Algorithms; dictionary problem; model of computation; O(1) probe search; oblivious and nonoblivious search; perfect hashing; Theory; upper and lower bounds", } @Article{Flynn:1992:ORU, author = "P. J. Flynn", title = "{$3$D} object recognition using invariant feature indexing of interpretation tables", journal = j-CVGIP-IU, volume = "55", number = "2", pages = "119--129", month = mar, year = "1992", CODEN = "CIUNEJ", ISSN = "1049-9660", bibdate = "Sat Sep 14 09:22:46 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Sch. of Electr. Eng. and Comput. Sci., Washington State Univ., Pullman, WA, USA", classification = "C5260B (Computer vision and picture processing)", keywords = "3D object recognition; CAD models; CAD-based vision; Geometric hashing; Interpretation tables; Invariant feature indexing; Matching score; Prototype hypotheses; Range data; Scene entities; Surface patches", language = "English", pubcountry = "USA", thesaurus = "CAD; Computer vision; Computerised pattern recognition; Indexing; Table lookup", } @InProceedings{Fox:1992:FAC, author = "E. A. Fox and Q. F. Chen and L. S. Heath", title = "A Faster Algorithm for Constructing Minimal Perfect Hash Functions", crossref = "Belkin:1992:PAI", pages = "266--273", year = "1992", bibdate = "Mon Jul 18 12:02:52 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, language = "english", } @Article{Fox:1992:MPH, author = "Edward A. Fox and Lenwood S. Heath and Qi Fan Chen and Amjad M. Daoud", title = "Minimal Perfect Hash Functions for Large Databases", journal = j-CACM, volume = "35", number = "1", pages = "105--121", month = jan, year = "1992", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu May 20 17:19:08 1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "This is the first published algorithm for computing minimal perfect hash functions for lists of millions of words; previous algorithms were computationally infeasible for more than a few hundred words.", acknowledgement = ack-nhfb, } @Article{Fox:1992:PMP, author = "Edward A. Fox and Lenwood S. Heath and Qi Fan Chen and Amjad M. Daoud", title = "Practical minimal perfect hash functions for large databases", journal = j-CACM, volume = "35", number = "1", pages = "105--121", month = jan, year = "1992", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Thu May 20 17:19:08 1993", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "This is the first published algorithm for computing minimal perfect hash functions for lists of millions of words; previous algorithms were computationally infeasible for more than a few hundred words.", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/129623.html", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; performance", note2 = "This paper presents two randomized algorithm for minimal perfect hashing functions that are designed for use with data bases with as many as a million keys. The algorithms have been experimentally evaluated. The first algorithm generates hash functions that are less than $O(n)$ computer words long, and the second generates functions that approach the theoretical lower bound of $\Omega(n/\log{n})$ words. This work is a predecessor of \cite{Fox:1991:GEI}.", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @Article{Gavrila:1992:ORI, author = "D. M. Gavrila and F. C. A. Groen", title = "{$3$D} object recognition from {$2$D} images using geometric hashing", journal = j-PATTERN-RECOGN-LETT, volume = "13", number = "4", pages = "263--278", month = apr, year = "1992", CODEN = "PRLEDG", ISSN = "0167-8655", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Graefe:1992:QPT, author = "G. Graefe", key = "Graefe", title = "Query Processing Techniques for Large Databases", number = "CU-CS-579-92", institution = "Department of Computer Science", address = "University of Colorado at Boulder", pages = "87", month = jan, year = "1992", bibdate = "Sat Nov 14 11:38:03 1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide competitive performance. The advent of object-oriented and extensible database systems will not solve the problem; on the contrary, modern data models exacerbate the problem. In order to manipulate large sets of complex objects as efficiently as today's database systems manipulate simple records, query processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database mangement software. The survey provides foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation technique for both relational and post-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.", acknowledgement = ack-nhfb, keywords = "Complex Query Evaluation Plans; Dynamic Query Evaluation Plans; Emerging Database Application Domains.; Iterators; Operator Model of Parallelization; Parallel Algorithms; Query Execution Architecture; Relational, Extensible, and Object-Oriented Database Systems; Set Matching Algorithms; Sort-Hash Duality", } @Article{Hachem:1992:NOP, author = "N. I. Hachem and P. B. Berra", key = "Hachem \& Berra", title = "New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "4", number = "1", pages = "68--82", day = "1", month = feb, year = "1992", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "In this paper a new class of order preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. We propose a new logical to physical mapping based on sequential bucket allocations in hash order. With respect to previous methods this allocation technique has the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order preserving (OPH) schemes should result in performance improvements for range queries and sequential processing. (2) It adapts elastic buckets for the control of growth. Under specific conditions, this approach outperforms the partial expansion method previously proposed by Larson.", acknowledgement = ack-nhfb, keywords = "Access method, consecutive retrieval, dynamic file structures, management of very large files, order preserving hashing, random and sequential files, searching, TKDE", } @InProceedings{Ichiyoshi:1992:ALB, author = "Nobuyuki Ichiyoshi and Kouichi Kimura", title = "Asymptotic Load Balance of Distributed Hash Tables", crossref = "Moto-oka:1992:FGC", pages = "869--876", year = "1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Jacobson:1992:ETH, author = "David Jacobson", title = "Engineer's Toolbox: Hashing in {Mathematica}", journal = j-MATHEMATICA-J, volume = "2", number = "4", pages = "??--??", month = "Fall", year = "1992", CODEN = "????", ISSN = "1047-5974", bibdate = "Sat Nov 6 13:33:42 MDT 2010", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.mathematica-journal.com/issue/v2i4/", URL = "http://www.mathematica-journal.com/issue/v2i4/tutorials/toolbox/index.html", acknowledgement = ack-nhfb, } @TechReport{Jain:1992:CHSa, author = "R. Jain", title = "A Comparison of Hashing Schemes for Address Lookup in Computer Networks", institution = "DEC", pages = "17", year = "1992", bibdate = "Mon Aug 17 17:45:43 1998", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.cis.ohio-state.edu/~jain/papers/hash_ps.htm", annote = "This is a more detailed version of the paper with the same title published in the IEEE Transactions on Communications, October 1992.", } @Article{Jain:1992:CHSb, author = "R. Jain", title = "A Comparison of Hashing Schemes for Address Lookup in Computer Networks", journal = j-IEEE-TRANS-COMM, volume = "40", number = "10", pages = "1570--1573", day = "1", month = oct, year = "1992", CODEN = "IECMBT", ISSN = "0090-6778", bibdate = "Mon Aug 17 17:45:43 1998", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", URL = "http://www.cis.ohio-state.edu/~jain/papers/hash_ieee_2col.htm", abstract = "Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, folding of address octets using the exclusive-or operation and bit extraction from the address. Guidelines are provided for determining the size of the hashmark required to achieve a specified level of performance.", acknowledgement = ack-nhfb, } @InProceedings{Kahrs:1992:UUL, author = "S. Kahrs", title = "Unlimp, Uniqueness as a Leitmotiv for Implementation", crossref = "Bruynooghe:1992:PLI", pages = "115--129", year = "1992", bibdate = "Thu Jul 14 16:32:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "When evaluation in functional programming languages is explained using gamma-calculus and/or term rewriting systems, expressions and function definitions are often defined as terms, that is as trees. Similarly, the collection of all terms is defined as a forest, that is a directed, acyclic graph where every vertex has at most one incoming edge. Concrete implementations usually drop the last restriction (and sometimes acyclicity as well), i.e., many terms can share a common subterm, meaning that different paths of subterm edges reach the same vertex in the graph. Any vertex in such a graph represents a term. A term is represented uniquely in such a graph if there are no two different vertices representing it. Such a representation can be established by using hash-consing for the creation of heap objects. The authors investigate the consequences of adopting uniqueness in this sense as a leitmotiv for implementation (called Unlimp), i.e., not allowing any two different vertices in a graph to represent the same term.", acknowledgement = ack-nhfb, keywords = "functional lambda calculus graph rewrite", } @Article{Kato:1992:PCI, author = "K. Kato and T. Masuda", key = "Kato \& Masuda", title = "Persistent Caching: An Implementation Technique for Complex Objects with Object Identity", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "18", number = "7", pages = "631--645", month = jul, year = "1992", CODEN = "IESEDJ", ISSN = "0098-5589 (print), 1939-3520 (electronic)", bibdate = "Mon Oct 5 19:16:31 1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Database systems that can efficiently manage complex objects are increasingly needed in many different fields, such as office automation, knowledge processing, CAD, CAM, CASE, etc. A lot of recent complex object database systems support the concepts of object identity and object identifier. Following an object identifier to access the referenced object is called navigation operation and is an essential operation in dealing with complex objects. Navigation operation is a difficult operation to implement efficiently since every navigation operation inherently causes one disk access operation. This paper proposes a scheme to notably accelerate the navigation operation among a sea of complex objects, by increasing the effective number of objects in one disk page. The main concept of the presented technique is threefold. The first idea is to store a cache value within a complex object that is referencing another complex object. The second is that when the referenced object is to be updated the update propagation is delayed until the time when the cached value is referenced. The third is to utilize a hashed table on main memory to efficiently validate the consistency between the cached values and the original values.", acknowledgement = ack-nhfb, keywords = "cache values with pointer root, hash table for out-of-date items lazy update upon reference TSE, caching; complex objects; delayed update propagation; object identity; object-oriented database; persistent objects", } @Article{Katzenelson:1992:TMT, author = "Jacob Katzenelson and Shlomit S. Pinter and Eugen Schenfeld", title = "Type Matching, Type-Graphs, and the {Schanuel} Conjecture", journal = j-TOPLAS, volume = "14", number = "4", pages = "574--588", month = oct, year = "1992", CODEN = "ATPSDT", ISSN = "0164-0925 (print), 1558-4593 (electronic)", bibdate = "Fri Jan 5 07:58:42 MST 1996", bibsource = "Compiler/TOPLAS.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0164-0925/133247.html", abstract = "This work considers type systems that are defined by type-graphs (tgraphs), which are rooted directed graphs with order among the edges leaving each node. Tgraphs are uniquely mapped into polynomials which, in turn, are each evaluated at a special point to yield an irrational number named the tgraph's {\em magic number}. This special point is chosen using the Schanuel conjecture. It is shown that each tgraph can be uniquely represented by this magic number; namely, types are equal if and only if the corresponding magic numbers are equal. Since irrational numbers require infinite precision, the algorithm for generating magic numbers is carried out using a double-precision floating-point approximation. This approximation is viewed as a hashing scheme, mapping the infinite domain of the irrational numbers into finite computer words. The proposed hashing scheme was investigated experimentally, with the conclusion that it is a good and practical hashing method. In tests involving over a million randomly chosen tgraphs, we have not encountered a single collision. We conclude that this method for representation and management of types is practical, and offers novel possibilities for enforcing strict type matching at link time among separately compiled modules.", acknowledgement = ack-nhfb # " and " # ack-pb, keywords = "languages", subject = "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Composite structures. {\bf I.1.1}: Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (general and polynomial). {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors.", } @Article{Kedem:1992:OPA, author = "Z. M. Kedem and K. V. Palem", title = "Optimal parallel algorithms for forest and term matching", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "245--264", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1230 (Artificial intelligence); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6110L (Logic programming)", corpsource = "Dept. of Comput. Sci., Courant Inst. of Math. Sci., New York Univ., NY, USA", keywords = "computational complexity; concurrent writes; CRCW PRAM; CREW PRAM; forest matching; hashing; logic programming; nodes; parallel algorithm; parallel algorithms; rewriting systems; term matching; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @InProceedings{Kitsuregawa:1992:PGH, author = "M. Kitsuregawa and S.-I. Tsudaka and M. Nakano", title = "Parallel {GRACE} Hash Join on Shared-Everything Multiprocessor: Implementation and Performance Evaluation on Symmetry {S81}", crossref = "Golshani:1992:EIC", pages = "256--264", month = feb, year = "1992", bibdate = "Thu Jun 15 12:19:30 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Sequent", } @TechReport{Knudsen:1992:CL, author = "Lars Ramkilde Knudsen", title = "Cryptanalysis of {LOKI}", type = "Technical Report", number = "DAIMI PB-403", institution = "Computer Science Department, Aarhus University", address = "{\AA}rhus, Denmark", pages = "17", month = jul, year = "1992", bibdate = "Mon Oct 19 08:47:56 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In [BrPiSe90] Brown, Pieprzyk and Seberry proposed a new encryption primitive, which encrypts and decrypts a 64-bit block of data using a 64-bit key. Furthermore they propose a way to build private versions of LOKI. In this paper we show first that the keyspace of any LOKI-version is only 2p60s, not 2p64 sas claimed. Therefore there are 15 equivalent keys for every key, that encrypts/decrypts texts the same way. An immediate consequence is, that the proposed Single Block Hash Mode is no good. It is very easy to find collisions. Secondly we do differential cryptanalysis on LOKI and show that n-round LOKI, n [< or =] 14 is vulnerable to this kind of attack, at least in principle. We show that we cannot find a characteristic with a probability high enough to break LOKI with 16 rounds. However one might find a private LOKI-version, that is vulnerable to a differential attack for n=16. Finally we consider differentials, introduced in [LMM91], versus characteristics, introduced in [BiSha90].", acknowledgement = ack-nhfb, keywords = "Cryptography.", } @Article{Koushik:1992:LDH, author = "Murlidhar Koushik and George Diehr", title = "Linear-density hashing with dynamic overflow sharing", journal = j-INFO-SYS, volume = "17", number = "5", pages = "359", year = "1992", CODEN = "INSYD6", ISSN = "0306-4379", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Koushik:1992:LHD, author = "Murlidhar Koushik and George Diehr", title = "Linear-density hashing with dynamic overflow sharing", journal = j-INFO-SYS, volume = "17", number = "5", pages = "359--380", month = sep, year = "1992", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Book{Lai:1992:DSB, author = "Xuejia Lai", title = "On the design and security of block ciphers", publisher = pub-HARTUNG-GORRE, address = pub-HARTUNG-GORRE:adr, pages = "xii + 108", year = "1992", ISBN = "3-89191-573-X", ISBN-13 = "978-3-89191-573-8", LCCN = "???", bibdate = "Sun Jul 17 11:09:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "This is the author's Ph.D. dissertation. ``Secret-key block ciphers are the subject of this work. The design and security of block ciphers, together with their application in hashing techniques, are considered. In particular, iterated block ciphers that are based on iterating a weak round function several times are considered. Four basic constructions for the round function of an iterated cipher are studied.''", acknowledgement = ack-nhfb, } @Article{Leng:1992:OWA, author = "Chun-Wu Roger Leng and Dik Lun Lee", title = "Optimal Weight Assignment for Signature Generation", journal = j-TODS, volume = "17", number = "2", pages = "346--373", month = jun, year = "1992", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Database/bibdb.bib; 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/1992-17-2/p346-leng/p346-leng.pdf; http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p346-leng/; http://www.acm.org/pubs/toc/Abstracts/tods/128907.html", abstract = "Previous work on superimposed coding has been characterized by two aspects. First, it is generally assumed that signatures are generated from {\em logical\/} text blocks of the same size; that is, each block contains the same number of unique terms after stopword and duplicate removal. We call this approach the fixed-size block (FSB) method, since each text block has the same size, as measured by the number of unique terms contained in it. Second, with only a few exceptions [6,7,8,9,17], most previous work has assumed that each term in the text contributes the same number of ones to the signature (i.e., the weight of the term signatures is fixed). The main objective of this paper is to derive an optimal weight assignment that assigns weights to document terms according to their occurrence and query frequencies in order to minimize the false-drop probability. The optimal scheme can account for both uniform and nonuniform occurrence and query frequencies, and the signature generation method is still based on hashing rather than on table lookup. Furthermore, a new way of generating signatures, the fixed-weight block (FWB) method, is introduced. FWB controls the weight of {\em every\/} signature to a constant, whereas in FSB, only the {\em expected\/} signature weight is constant. We have shown that FWB has a lower false-drop probability than that of the FSB method, but its storage overhead is slightly higher. Other advantages of FWB are that the optimal weight assignment can be obtained analytically without making unrealistic assumptions and that the formula for computing the term signature weights is simple and efficient.", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ., Columbus, OH, USA", generalterms = "Design; Performance", keywords = "access method; coding methods; design; document retrieval; information retrieval; optimization; performance; signature file; superimposed coding; text retrieval", subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Retrieval models. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods. {\bf H.3.6}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Library Automation. {\bf I.7.1}: Computing Methodologies, TEXT PROCESSING, Text Editing.", } @TechReport{Lieuwen:1992:PBJ, author = "Daniel F. Lieuwen and David J. DeWitt and Manish Mehta", title = "Pointer-based Join Techniques for Object-Oriented Databases", number = "TR 1099", institution = "Computer Sciences Department", address = "University of Wisconsin--Madison", pages = "??", month = jul, year = "1992", bibdate = "Thu Jul 21 08:51:48 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we describe and analyze four parallel pointer-based joins for set-valued attributes. These joins will be common in next-generation object-oriented database systems, so efficiently supporting them is crucial to the performance of such systems. Pointer-based join algorithms based on Hybrid-hash provide good performance, but algorithms that require less replication will often produce as good or better performance, especially if each set-valued attribute references a small number of nodes.", acknowledgement = ack-nhfb, } @Article{Luccio:1992:AIP, author = "F. Luccio and A. Pietracaprina and G. Pucci", title = "Analysis and Implementation of Parallel Uniform Hashing", journal = j-INT-J-FOUND-COMP-SCI, volume = "3", number = "1", pages = "55--64", month = mar, year = "1992", CODEN = "IFCSEN", ISSN = "0129-0541", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Luhandjula:1992:FSI, author = "M. K. Luhandjula and H. Ichihashi and M. Inuiguchi", title = "Fuzzy and Semite-Infinite Mathematical Programming", journal = j-INFO-SCI, volume = "61", number = "3", pages = "233", year = "1992", CODEN = "ISIJBC", ISSN = "0020-0255", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Mairson:1992:ETE, author = "Harry G. Mairson", title = "The Effect of Table Expansion on the Program Complexity of Perfect Hash Functions", journal = j-BIT, volume = "32", number = "3", pages = "430--440", year = "1992", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68P20", MRnumber = "93i:68062", bibdate = "Fri Nov 13 07:00:34 MST 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @TechReport{Majewski:1992:FGM, author = "Bohdan S. Majewski and Nicholas C. Wormald and Zbigniew J. Czech and George Havas", title = "A Family of Generators of Minimal Perfect Hash Functions", number = "92-16", institution = "Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University, New Jersey", pages = "??", year = "1992", bibdate = "Thu Jul 21 09:40:12 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Manolopoulos:1992:AHF, author = "Y. Manolopoulos and N. Fistas", title = "Algorithms for a Hashed File with Variable-Length Records", journal = j-INFO-SCI, volume = "63", number = "3", pages = "229", year = "1992", CODEN = "ISIJBC", ISSN = "0020-0255", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Mullin:1992:HFH, author = "J. K. Mullin", title = "Hash functions for hash-based join methods", journal = j-COMP-J, volume = "35", number = "6", pages = "A499--A503", month = dec, year = "1992", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Sep 12 19:26:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Western Ontario Univ., London, Ont., Canada", classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", keywords = "Alphabetic data; Cost; Division remainder hashing; Hash-based join methods; Join algorithms; Relational database systems; Split files; Universal hash functions", thesaurus = "Data structures; Database management systems", } @Manual{NIST:1992:PYA, author = "{National Institute of Standards and Technology (NIST)}", title = "Publication {YY}: Announcement and Specifications for a {Secure Hash Standard} ({SHS})", pages = "??", month = jan # " 22", year = "1992", bibdate = "Thu Jul 21 08:52:08 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Omiecinski:1992:AHJ, author = "E. Omiecinski and E. T. Lin", key = "Omiecinski \& Lin", title = "The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "3", number = "3", publisher = pub-IEEE, pages = "334--349", month = may, year = "1992", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Thu Jan 28 19:14:12 1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The goal of this research is to design efficient relational join algorithms for large databases on a hypercube multicomputer in which data and processing power are distributed. The Cube Hybrid-Hash join algorithm was shown to outperform other algorithms in our previous research. Unfortunately, its performance greatly deteriorates when bucket overflow occurs in the inner relation of the join operation. In this paper, we present the Cube Adaptive-Hash join algorithm, which is designed to combine the merit of Nested-Loop and Hybrid-Hash. The performance of these algorithms are compared through analytical cost modeling. The nonuniform data value distribution of the inner relation is shown to have a greater impact than that of the outer relation. The Cube Adaptive-Hash join algorithm outperforms the Cube Hybrid-Hash join algorithm when bucket overflow occurs. In the worst case, this algorithm converges to the Cube Nested-Loop-Hash join algorithm. When there is no hash table overflow, the Cube Adaptive-Hash join algorithm converges to the Cube Hybrid-Hash join algorithm. Since the Cube Adaptive-Hash join algorithm adapts itself depending on the characteristics of the relations, it is relatively immune to the data distribution. We believe that the Cube Adaptive-Hash join algorithm should be the algorithm of choice to perform the relational join operator for large databases on the hypercube multicomputer.", acknowledgement = ack-nhfb, keywords = "Analytical modeling; data skew; hash join algorithms; hypercube multiprocessor; nested loop algorithm; performance; relational join operator", } @Article{Omiecinski:1992:AJA, author = "E. Omiecinski and E. T. Lin", title = "A Adaptive-Hash Join Algorithm for a Hypercube Multicomputer", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "3", number = "3", pages = "334--??", day = "1", month = may, year = "1992", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Pal:1992:SPD, author = "Srimanta Pal", title = "Search Performance of Double-Linked Coalesced Hashing Can Not Exceed ``Bucketing''", journal = j-INFO-SCI, volume = "65", number = "1 / 2", pages = "123--142", day = "1", month = nov, year = "1992", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Panti:1992:MOH, author = "Maurizio Panti and Salvatore Valenti", title = "A Modulus Oriented Hash Function for the Construction of Minimal Perfect Tables", journal = j-SIGPLAN, volume = "27", number = "11", pages = "33--38", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1992:CSH, author = "B. Preneel and R. Govaerts and J. Vandewalle", booktitle = "????", title = "Cryptographically Secure Hash Functions: an Overview", publisher = "????", address = "????", pages = "??", year = "1992", bibdate = "Sat Jul 16 17:43:33 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Reference in \cite[p.~186]{Pieprzyk:1993:DHA}.", acknowledgement = ack-nhfb, } @Article{Radhakrishnan:1992:IBC, author = "Jaikumar Radhakrishnan", title = "Improved bounds for covering complete uniform hypergraphs", journal = j-INFO-PROC-LETT, volume = "41", number = "4", pages = "203--207", day = "18", month = mar, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68R10 (05C65 05C85)", MRnumber = "92m:68095", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", affiliationaddress = "New Brunswick, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", journalabr = "Inf Process Lett", keywords = "complete uniform hypergraphs; computational complexity; Computer Metatheory --- Computational Complexity; Computer Programming --- Algorithms; covering bounds; Graph Algorithms; Graph Covering; Graph Theory; graph theory; Hypergraphs; lower bounds; Mathematical Techniques; Mathematical Techniques --- Combinatorial Mathematics; perfect hash function; vertices", treatment = "T Theoretical or Mathematical", } @Article{Ramakrishna:1992:ODS, author = "M. V. Ramakrishna and E. A. Ramos", title = "Optimal Distribution of Signatures in Signature Hashing", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "4", number = "1", pages = "83--88", day = "1", month = feb, year = "1992", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Ramakrishna:1992:SPH, author = "M. V. Ramakrishna", title = "A Simple Perfect Hashing Method for Static Sets", crossref = "Koczkodaj:1992:IPF", pages = "401--404", year = "1992", bibdate = "Thu Oct 31 19:07:22 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ramamohanarao:1992:PRU, author = "K. Ramamohanarao and J. Shepherd and R. Sacks-Davis", title = "Partial-Match Retrieval Using Multiple-Key Hashing with Multiple File Copies", crossref = "Kim:1992:DSN", pages = "250--275", year = "1992", bibdate = "Sat Dec 7 16:52:15 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, annote = "Also known as DASFAA '89", keywords = "advanced; applications; DASFAA; database systems; next-generation applications", } @Article{Raschid:1992:PPS, author = "Louiqa Raschid and Stanley Y. W. Su", title = "A Parallel Pipelined Strategy for Evaluating Linear Recursive Predicates in a Multiprocessor Environment", journal = j-J-PAR-DIST-COMP, volume = "14", number = "2", pages = "146--162", month = feb, year = "1992", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland", affiliationaddress = "College Park, MD, USA", classification = "722; 723; 921; C4240P (Parallel programming and algorithm theory); C4250 (Database theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Inf. Syst., Maryland Univ., College Park, MD, USA", journalabr = "J Parallel Distrib Comput", keywords = "bottom-up semi-naive algorithm; Computer Architecture; Computer Operating Systems--Program Compilers; Computer Programming--Algorithms; Computer Systems, Digital; database relation; Database Systems; database theory; hash; linear recursive predicates; Multiprocessing; multiprocessor environment; multiprocessor system; Optimization; Parallel algorithms; parallel pipelined strategy; Parallel pipelining; parallel programming; performance evaluation; pipeline; pipelined butterfly; program compilers; Recursive predicates; table overflow", treatment = "T Theoretical or Mathematical", } @InProceedings{Remy:1992:ERE, author = "Didier R{\'e}my", title = "Efficient Represent of Extensible Records", crossref = "Anonymous:1992:PAW", pages = "12--16", year = "1992", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, remark = "Describes polymorphic access to extensible records by using a perfect hash on the labels to keep the necessary headers small and the access time good. This works reasonably with records of less than 30 fields, but the headers get large as the number of fields increases.", } @Article{Rigoutsos:1992:MPM, author = "Isidore Rigoutsos and Robert Hummel", title = "Massively Parallel Model Matching: Geometric Hashing on the {Connection Machine}", journal = j-COMPUTER, volume = "25", number = "2", pages = "33--42", month = feb, year = "1992", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", bibdate = "Sat Feb 1 16:21:14 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Geometric hashing provides a parallel method for model matching. However, the design and implementation of parallel algorithms for AI applications is fraught with subtlety and challenge.", acknowledgement = ack-nhfb, affiliation = "New York Univ., NY, USA", classification = "722; 723; C4260 (Computational geometry); C5260B (Computer vision and picture processing); C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C6120 (File organisation)", journalabr = "Computer", keywords = "Broadcast facilities; Building-block parallel algorithms; Computer Metatheory--Programming Theory; Computer Systems, Digital; Connection Machine; Dot patterson; Extracted features; Geometric Hashing; Geometric hashing; Geometric properties; Hash table data structure; Model information; Multiple-viewpoint; Parallel hypercube techniques; Parallel Processing; Preprocessing phase; Recognition phase", thesaurus = "Computational geometry; Computerised pattern recognition; Data structures; Parallel algorithms; Parallel machines; Parallel programming", xxauthor = "Isidore Rigoustos and Robert Hummel", } @InProceedings{Russell:1992:NSC, author = "Alexander Russell", title = "Necessary and Sufficient Conditions for Collision-Free Hashing", crossref = "Brickell:1992:ACC", pages = "433--441", year = "1992", bibdate = "Thu Oct 31 19:09:27 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Schmidt:1992:GPH, author = "Douglas C. Schmidt and Tatsuya Suda", title = "{GPERF}: a perfect hash function generator", number = "TR 92-47", institution = "Information and Computer Science, University of California, Irvine", address = "Irvine, CA, USA", pages = "19", year = "1992", LCCN = "Z699 .C3 no. 92-47", bibdate = "Sat Jul 16 00:53:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Sedgewick:1992:AC, author = "Robert Sedgewick", title = "Algorithms in {C++}", publisher = pub-AW, address = pub-AW:adr, pages = "xiv + 656", year = "1992", ISBN = "0-201-51059-6", ISBN-13 = "978-0-201-51059-1", LCCN = "QA76.73.C153 S38 1992", bibdate = "Mon Jan 3 12:10:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, libnote = "Not yet in my library.", } @TechReport{Seiden:1992:FSO, author = "Steven S. Seiden and Daniel S. Hirschberg", title = "Finding succinct ordered minimal perfect hashing functions", number = "TR 92-23", institution = "Information and Computer Science, University of California, Irvine", pages = "10", year = "1992", LCCN = "Z699 .C3 no. 92-23", bibdate = "Sat Jul 16 01:09:01 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Snellen:1992:ITS, author = "David Snellen", title = "{Ingres} Table Structures", journal = j-DBMS, volume = "5", number = "8", pages = "60--63", month = jul, year = "1992", CODEN = "DBMSEO", ISSN = "1041-5173", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "DBAs often overlook table storage structure --- the physical placement of data on a disk drive --- in their efforts to improve database performance. The Ingres RDBMS gives DBAs ten storage-structure options: ISAM, B-tree, hash, heap, and heap sort, as well as compressed versions of these methods.", acknowledgement = ack-nhfb, } @Article{Soukup:1992:SCL, author = "J. Soukup", title = "Selecting a {C++} library", journal = j-C-PLUS-PLUS-REPORT, volume = "4", number = "1", pages = "1, 4--6", month = jan, year = "1992", CODEN = "CRPTE7", ISSN = "1040-6042", bibdate = "Tue Mar 25 13:34:48 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "There is a major difference in both the construction and use of libraries in C and C++. Unless special tools are available, it is difficult to code a general library in C for structures such as linked lists, trees, graphs, or hash tables. However, in C++, whole organizations can be treated as objects, which helps in library design and simplifies its use. The availability of such a library speeds up development, improves code quality, and greatly enhances the maintainability of the software. This paper concentrates mainly on general-purpose libraries that manage basic data structures such as linked lists, trees, graphs, or entity-relationship models. These organizations typically combine several different object types connected by pointers. It lists the good and bad things for which one has to watch when selecting a library. It also suggests a benchmark that measures both ease of use and library performance.", acknowledgement = ack-nhfb, classcodes = "C6110J (Object-oriented programming); C0310H (Equipment and software evaluation methods)", classification = "C0310H (Equipment and software evaluation methods); C6110J (Object-oriented programming)", keywords = "Benchmark; benchmark; C language; C++; C++ library; Code quality; code quality; Data structures; data structures; Entity-relationship models; entity-relationship models; Graphs; graphs; library; Linked lists; linked lists; maintenance; Object types; object types; Object-oriented programming; object-oriented programming; Pointers; pointers; software; Software maintenance; software maintenance; software selection; Trees; trees", thesaurus = "C language; Object-oriented programming; Software maintenance; Software selection", treatment = "P Practical", } @InProceedings{Spetka:1992:DAD, author = "S. Spetka", title = "A Decomposition Algorithm for Distributed Hash Join Query Processing", crossref = "Yu:1992:IWR", pages = "53--60", year = "1992", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Toptsis:1992:LBP, author = "Anestis A. Toptsis", title = "Load Balancing in Parallel Hash Join with Data Skew", crossref = "Finin:1992:IKM", pages = "??", month = nov, year = "1992", bibdate = "Thu Jul 21 09:40:15 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Trono:1992:UPC, author = "John A. Trono", title = "An Undergraduate Project to Compute Minimal Perfect Hashing Functions", journal = j-SIGCSE, volume = "24", number = "3", pages = "??", year = "1992", CODEN = "SIGSD3", ISSN = "0097-8418", bibdate = "Mon Apr 24 09:49:47 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Tsudaka:1992:PHJ, author = "S.-I. Tsudaka and M. Nakano and M. Kitsuregawa and M. Takagi", title = "Parallel Hash Join on Shared-Everything Multiprocessor: Implementation and Performance Evaluation", crossref = "Golshani:1992:EIC", pages = "??", month = feb, year = "1992", bibdate = "Thu Jul 21 09:40:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tsudik:1992:MAOa, author = "G. Tsudik", title = "Message Authentication with One-Way Hash functions", journal = j-COMP-COMM-REV, volume = "22", number = "5", pages = "29--38", day = "1", month = oct, year = "1992", CODEN = "CCRED2", ISSN = "0146-4833", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Tsudik:1992:MAOb, author = "G. Tsudik", title = "Message authentication with one-way hash functions", crossref = "IEEE:1992:PII", pages = "??--??", year = "1992", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 17]{Bellare:1996:MAU}.", } @InProceedings{Vandery:1992:FHN, author = "S. Vandery", title = "{FFT}-Hash {II} is not yet collision-free", crossref = "Brickell:1992:ACC", pages = "??", year = "1992", bibdate = "Thu Jul 21 09:40:17 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Vaudenay:1992:FHI, author = "S. Vaudenay", title = "{FFT}-Hash-{II} is not yet Collision-free", crossref = "Brickell:1992:ACC", pages = "587--593", year = "1992", bibdate = "Thu Oct 31 19:11:46 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InCollection{Wartik:1992:HA, author = "Steven Wartik and Edward Fox and Lenwood Heath and Qi-Fan Chen", title = "Hashing Algorithms", crossref = "Frakes:1992:IRD", chapter = "13", pages = "293--362", year = "1992", bibdate = "Mon Aug 22 14:04:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ahn:1993:FH, author = "Ilsoo Ahn", title = "Filtered Hashing", crossref = "Lomet:1993:FDO", pages = "85--100", year = "1993", bibdate = "Thu Jul 21 09:40:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Analyti:1993:PAM, author = "Anastasia Analyti and Sakti Pramanik", title = "Performance Analysis of a Main Memory Multi-directory Hashing Technique", journal = j-INFO-PROC-LETT, volume = "45", number = "4", pages = "191--197", day = "22", month = mar, year = "1993", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P20", MRnumber = "93k:68026", bibdate = "Sat Apr 11 12:24:19 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Anderson:1993:CHF, author = "R. Anderson", title = "The classification of hash functions", crossref = "Farrell:1993:CCC", pages = "83--94", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Manual{Anonymous:1993:FSH, author = "Anonymous", title = "{FIPS} 180, Secure Hash Standard", organization = "NIST, US Department of Commerce", address = "Washington, DC, USA", month = may, year = "1993", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Appel:1993:HCG, author = "Andrew W. Appel and Marcelo J. R. Goncalves", title = "Hash-consing Garbage Collection", number = "CS-TR-412-93", institution = "Princeton University", address = "Computer Science Department", pages = "??", month = feb, year = "1993", bibdate = "Thu Jul 21 09:40:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Asano:1993:APP, author = "Tetsuo Asano and Takeshi Tokuyama", title = "Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing", journal = j-ALGORITHMICA, volume = "9", number = "6", pages = "572--590", month = jun, year = "1993", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68U05 (68Q25)", MRnumber = "MR1221819 (94e:68162)", bibdate = "Mon Jan 22 05:23:07 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica9.html#AsanoT93; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database; UnCover library database", note = "Selections from SIGAL International Symposium on Algorithms (Tokyo, 1990)", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "AsanoT93", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/AsanoT93", } @Article{AufDerHeide:1993:HSS, author = "Friedhelm Meyer Auf Der Heide", title = "Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "678", pages = "20--29", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ban-Hashemi:1993:FAC, author = "A. Ban-Hashemi", title = "A {Fourier} Approach to Camera Orientation", journal = j-IEEE-TRANS-PATT-ANAL-MACH-INTEL, volume = "15", number = "11", pages = "1197", year = "1993", CODEN = "ITPIDJ", ISSN = "0162-8828", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Baritaud:1993:FHIa, author = "T. Baritaud and H. Gilbert and M. Girault", title = "{FFT} hashing is not collision-free", journal = j-LECT-NOTES-COMP-SCI, volume = "658", pages = "35--44", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0658.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0658/06580035.htm; http://link.springer-ny.com/link/service/series/0558/papers/0658/06580035.pdf", acknowledgement = ack-nhfb, } @InProceedings{Baritaud:1993:FHIb, author = "T. Baritaud and H. Gilbert", title = "{FFT} Hashing is not Collision-free", crossref = "Rueppel:1993:ACE", pages = "31--40", year = "1993", bibdate = "Sat Jul 16 11:53:45 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Bierbrauer:1993:FHF, author = "J. Bierbrauer and T. Johansson and G. Kabatianskii and B. Smeets", title = "On families of hash functions via geometric codes and concatenation", crossref = "Stinson:1993:ACC", pages = "331--342", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Cesarini:1993:SAH, author = "F. Cesarini and G. Soda", title = "Single access hashing with overflow separators for dynamic files", journal = j-BIT, volume = "33", number = "1", pages = "15--28", year = "1993", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", bibdate = "Fri Nov 13 07:00:34 MST 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", URL = "http://www.mai.liu.se/BIT/contents/bit33.html", acknowledgement = ack-nhfb, } @Article{Chang:1993:HON, author = "C. C. Chang and T. C. Wu", title = "A hashing oriented nearest neighbor searching scheme", journal = j-PATTERN-RECOGN-LETT, volume = "14", number = "8", pages = "625--??", day = "1", month = aug, year = "1993", CODEN = "PRLEDG", ISSN = "0167-8655", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chang:1993:RCO, author = "Chin-Chen Chang and Huey-Cheue Kowng and Tzong-Chen Wu", title = "A refinement of a compression-oriented addressing scheme", journal = j-BIT, volume = "33", number = "4", pages = "529--535", month = dec, year = "1993", CODEN = "BITTEL, NBITAB", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01990533", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", bibdate = "Wed Jan 4 18:52:23 MST 2006", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/bit.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=33&issue=4; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.mai.liu.se/BIT/contents/bit33.html; http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=33&issue=4&spage=529", abstract = "Chang and Wu have proposed a letter-oriented perfect hashing scheme based on sparse matrix compression. We present a method which is a refinement of the Chang-Wu scheme. By experimental evaluation, we show that the hashing of our refinement has more efficient storage utilization than Chang-Wu's method. Our refinement is valuable in practical implementations of hashing for large sets of keys.", acknowledgement = ack-nhfb, keywords = "perfect hashing; row displacement method; sparse matrix compression", } @InProceedings{Chen:1993:AHF, author = "M.-S. Chen and H.-I. Hsiao and P. S. Yu", title = "Applying Hash Filters to Improving the Execution of Bushy Trees", crossref = "Agrawal:1993:ICV", pages = "505--516", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "cost multi-join VLDB", } @InProceedings{Chin:1993:LPH, author = "Andrew Chin", title = "Locality-Preserving Hashing", crossref = "Anonymous:1993:SAD", pages = "87--98", year = "1993", bibdate = "Fri Jul 22 16:34:58 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "When simulating shared-memory parallel computations on physically distributed memory, it may be advantageous to hash the address space to prevent network congestion and memory bank contention. The decision whether or not to use hashing depends on the communication latency in the network and the locality of memory accesses in the algorithm. A complexity-theoretic basis for this decision is provided by the Block PRAM model of Aggarwal, Chandra and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families.", acknowledgement = ack-nhfb, keywords = "parallel computing model, hashing, locality, shared memory", } @Article{Cipra:1993:ETS, author = "Barry Cipra", title = "Electronic Time-Stamping: The Notary Public Goes Digital: All the Hash That's Fit to Print", journal = j-SCIENCE, volume = "261", number = "5118", pages = "162--163", day = "9", month = jul, year = "1993", CODEN = "SCIEAS", ISSN = "0036-8075 (print), 1095-9203 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "All the Hash That's Fit to Print.", acknowledgement = ack-nhfb, } @Article{Cooper:1993:TTA, author = "Robert B. Cooper and Martin K. Solomon", title = "Teletraffic Theory Applied to the Analysis of Hash-Structured Files", journal = j-AEU, volume = "47", number = "5 / 6", pages = "336--341", day = "1", month = sep, year = "1993", CODEN = "AEUTAH", ISSN = "0001-1096", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, country = "D", date = "12/10/93", descriptor = "Performance evaluation; Poisson process;", enum = "8431", language = "English", location = "PKI-OG: Lit-Fach Bri", references = "10", remark = "Certain hash-structured files consist of sequences (chains) of computer memory locations (slots) into which records are inserted, and from which they are later retrieved or deleted. If we assume that the records arrive to a file according to a Poisson process for insertion into a chain (\ldots), and reside in memory for a random length of time before deleted, then we can associate this with a teletraffic model\ldots.", revision = "26/10/93", town = "Stuttgart", } @Article{Czech:1993:LTA, author = "Zbigniew J. Czech and Bohdan S. Majewski", title = "A Linear Time Algorithm for Finding Minimal Perfect Hash Functions", journal = j-COMP-J, volume = "36", number = "6", pages = "579--587", month = dec, year = "1993", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Daemen:1993:CSH, author = "Joan Daemen and Antoon Bosselaers and Rene Govaerts and Joos Vandewalle", title = "Collisions for {Schnorr}'s Hash Function {FFT-Hash} Presented at {Crypto'91}", crossref = "Imai:1993:ACA", pages = "477--480", year = "1993", bibdate = "Sat Jul 16 19:02:25 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Daemen:1993:FDO, author = "Joan Daemen and Rene Govaerts and Joos Vandewalle", title = "A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damg{\aa}rd's One-Way Function Based on a Cellular Automaton", crossref = "Imai:1993:ACA", pages = "82--96", year = "1993", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Thu Jul 21 09:40:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Damgaard:1993:IHC, author = "I. B. Damg{\aa}rd", title = "Interactive Hashing Can Simplify Zero-Knowledge Protocol Design without Complexity Assumptions", crossref = "Stinson:1993:ACC", pages = "??", year = "1993", bibdate = "Thu Jul 21 09:40:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Davison:1993:MCR, author = "D. L. Davison and G. Graefe", title = "Memory-Contention Responsive Hash Joins", number = "CU-CS-682-93", institution = "University of Colorado Computer Science Department", address = "Boulder, CO, USA", pages = "??", year = "1993", bibdate = "Thu Jul 21 09:40:21 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "dynamic adjustment of cluster sizes", } @Article{Devine:1993:DID, author = "Robert Devine", title = "Design and Implementation of {DDH}: {A} Distributed Dynamic Hashing Algorithm", journal = j-LECT-NOTES-COMP-SCI, volume = "730", pages = "101--114", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Engelmann:1993:SBC, author = "Curd Engelmann and J{\"o}rg Keller", title = "Simulation-Based Comparison of Hash Functions for Emulated Shared Memory", crossref = "Bode:1993:PPA", pages = "1--11", year = "1993", bibdate = "Thu Oct 31 19:13:34 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{FIPS:1993:SHS, author = "{FIPS (Federal Information Processing Standards Publication)}", title = "Secure Hash Standard: {FIPS} {PUB} 180, May 11, 1993", publisher = pub-USGPO, address = pub-USGPO:adr, pages = "??", month = may # " 11", year = "1993", bibdate = "Thu Jul 21 08:52:12 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ghandeharizadeh:1993:ILS, author = "S. Ghandeharizadeh and R. Hull and D. Jacobs and J. Castillo and M. Escobar-Molano and S. Lu and J. Luo and C. Tsang and G. Zhou", title = "On Implementing a Language for Specifying Active Database Execution Models", crossref = "Agrawal:1993:ICV", pages = "441", year = "1993", bibdate = "Mon Jul 18 09:40:18 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "rules deltas triggers updates hash sort VLDB", } @TechReport{Gopal:1993:CCH, author = "R. D. Gopal and R. Ramesh and S. Zionts", title = "Criss-Cross Hashing by Page Map Zoning: An Efficient System for Binary View Generation", number = "Working Paper 851", institution = "SUNY Buffalo School of Management", address = "Buffalo, NY, USA", pages = "??", month = mar, year = "1993", bibdate = "Thu Jul 21 09:40:22 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "binary join processing hybrid hash join range partitioning. For a statically defined set of range partitions, keep a page list. A page is assigned to a partition according the page's lowest key. Ensure that the build partitions be smaller than memory. Keep a build partition in memory while processing reading and partitioning its probe partition; strongly amplifies the effect of hybrid hashing.", } @TechReport{Graefe:1993:PEHa, author = "G. Graefe", title = "Performance Enhancements for Hybrid Hash Join", institution = "????", pages = "??", year = "1993", bibdate = "Thu Jul 21 09:40:22 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "hash-join hashjoin tuning cluster size fan-out recursion depth statistics histograms non-uniformity duplicate skew role reversal multi-way joins VLDBJ", } @TechReport{Graefe:1993:PEHb, author = "G. Graefe", title = "A Performance Evaluation of Histogram-Driven Recursive Hybrid Hash Join", institution = "????", pages = "??", month = aug, year = "1993", bibdate = "Thu Jul 21 09:40:23 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "join statistics uniform continuous duplicate skew ACM TODS", } @Article{Graefe:1993:QET, author = "Goetz Graefe", title = "Query Evaluation Techniques for Large Databases", journal = j-COMP-SURV, volume = "25", number = "2", pages = "73--170", month = jun, year = "1993", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Sun Sep 25 10:59:43 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "processing execution iterators algorithms parallelism logical physical algebra level of abstraction performance meta-operator extensible object-oriented scientific operators sort sorting hash hashing duality", } @Article{Griswold:1993:DID, author = "William G. Griswold and Gregg M. Townsend", title = "The Design and Implementation of Dynamic Hashing for Sets and Tables in {Icon}", journal = j-SPE, volume = "23", number = "4", pages = "351--367", month = apr, year = "1993", 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", acknowledgement = ack-nhfb, } @Article{Hachem:1993:AAP, author = "Nabil I. Hachem", title = "An Approximate Analysis of the Performance of Extendible Hashing with Elastic Buckets", journal = j-INFO-PROC-LETT, volume = "48", number = "1", pages = "13--20", month = oct, year = "1993", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Worcester Polytechnic Inst", affiliationaddress = "Worcester, MA, USA", classification = "723.1; 723.2; 921", journalabr = "Inf Process Lett", keywords = "Algorithms; Approximation theory; Data handling; Data structures; Extendible hashing; Performance", } @Article{Harris:1993:ODM, author = "Evan P. Harris and Kotagiri Ramamohanarao", title = "Optimal dynamic multi-attribute hashing for range queries", journal = j-BIT, volume = "33", number = "4", pages = "561--579", year = "1993", CODEN = "BITTEL, NBITAB", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", bibdate = "Fri Nov 13 11:57:03 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.mai.liu.se/BIT/contents/bit33.html", acknowledgement = ack-nhfb, } @Article{Havas:1993:GTO, author = "George Havas and Bohdan Majewski", title = "Graph theoretic obstacles to perfect hashing", journal = j-CONG-NUM, volume = "98", pages = "81--??", year = "1993", ISSN = "0384-9864", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Heide:1993:HSS, author = "Friedhelm Meyer auf der Heide", title = "Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines", crossref = "Heide:1993:PAE", pages = "??", year = "1993", bibdate = "Thu Jul 21 09:40:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ho:1993:COM, author = "Pao-Chung Ho and Wei-Pang Yang and Meichun Hsu", title = "Concurrent Operations in Multi-Attribute Linear Hashing", journal = j-INFO-SCI, volume = "74", number = "1 / 2", pages = "29--??", day = "15", month = oct, year = "1993", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Hohl:1993:SIH, author = "W. Hohl and X. Lai and T. Meier and C. Waldvogel", title = "Security of iterated hash functions based on block ciphers", crossref = "Stinson:1993:ACC", pages = "379--390", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ishikawa:1993:MLI, author = "Hiroshi Ishikawa and Fumio Suzuki and Fumihiko Kozakura and Akifumi Makinouchi and Mika Miyagishima and Yoshio Izumida and Masaaki Aoshima and Yasuo Yamane", title = "The Model, Language, and Implementation of an Object-Oriented Multimedia Knowledge Base Management System", journal = j-TODS, volume = "18", number = "1", pages = "1--50", month = mar, year = "1993", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "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/1993-18-1/p1-ishikawa/p1-ishikawa.pdf; http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p1-ishikawa/; http://www.acm.org/pubs/toc/Abstracts/tods/151285.html", abstract = "New applications such as CAD, AI, and hypermedia require direct representation and flexible use of complex objects, behavioral knowledge, and multimedia data. To this end, we have devised a knowledge base management system called Jasmine. An object-oriented approach in a programming language also seems promising for use in Jasmine. Jasmine extends the current object-oriented approach and provides the following features. Our object model is based on functional data models and well-established set theory. Attributes or functions composing objects can represent both structural and behavioral knowledge. The object model can represent incomplete and generic knowledge. The model can support the basic storage and operations of multimedia data. The facets of attributes can flexibly represent constraints and triggers. The object manipulation language can support associative access of objects. The structural and behavioral knowledge can be uniformly treated to allow the user to specify complex object operations in a compact manner. The user-defined and system-defined attributes can be uniformly specified to ease user customization of the language. The classes and instances can be uniformly accessed. Incomplete knowledge can be flexibly accessed. The system has a layered architecture. Objects are stored in nested relations provided by extensive DBMS as a sublayer. User query of objects is compiled into relational operations such as select and join, which can be efficiently processed using hashing. The behavioral knowledge is compiled into predicate and manipulation function interfaces that can directly access tuples in a buffer.", acknowledgement = ack-nhfb, affiliation = "Fujitsu Labs., Ltd., Kawasaki, Japan", generalterms = "Design; Languages", keywords = "design; languages", subject = "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representations (procedural and rule-based). {\bf H.4.2}: Information Systems, INFORMATION SYSTEMS APPLICATIONS, Types of Systems. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.5.1}: Information Systems, INFORMATION INTERFACES AND PRESENTATION, Multimedia Information Systems.", } @Article{Itoh:1993:SCF, author = "Toshiya Itoh and Makoto Takeda", title = "A Simple Construction for a Family of Collision Intractable Hash Functions", journal = j-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI, volume = "76", number = "12", pages = "77--84", day = "1", month = dec, year = "1993", CODEN = "ECJSER", ISSN = "1042-0967", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Kak:1993:NNA, author = "Subhash Kak", title = "Neural Networks and Artificial Intelligence", journal = j-INFO-SCI, volume = "70", number = "1/2", pages = "1", year = "1993", CODEN = "ISIJBC", ISSN = "0020-0255", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kaliski:1993:SES, author = "Burt Kaliski", title = "A Survey of Encryption Standards", journal = j-IEEE-MICRO, volume = "13", number = "6", pages = "74--81", month = dec, year = "1993", CODEN = "IEMIDZ", ISSN = "0272-1732 (print), 1937-4143 (electronic)", bibdate = "Mon Apr 7 14:39:59 MDT 1997", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/ieeemicro.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Demystifying the large number of computer security algorithms and standards", acknowledgement = ack-nhfb, classcodes = "B6120B (Codes); B6210G (Electronic mail); C6130S (Data security); C7104 (Office automation); C7120 (Finance); C6120 (File organisation)", corpsource = "RSA Lab., Redwood City, CA, USA", keywords = "algorithms; authentication; banking; codes; cryptographic hash functions; cryptography; cryptosystems; digital signature schemes; directory; electronic mail; encryption; encryption standards; escrowed; file; key-agreement; network management; organisation; public-key; secret-key cryptosystems; secure communications; standards", treatment = "B Bibliography; P Practical", } @Article{Kanada:1993:MVP, author = "Y. Kanada", title = "A method of vector processing for shared symbolic data", journal = j-PARALLEL-COMPUTING, volume = "19", number = "10", pages = "1155--1175", month = oct, year = "1993", CODEN = "PACOEJ", ISSN = "0167-8191", bibdate = "Mon Apr 14 12:05:41 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5220P (Parallel architecture); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Real-World Comput. Partnership, Ibaraki, Japan", keywords = "address calculation; Connection Machines; CRAY-XMP; data structures; data-; dynamic data structures; file organisation; graphs; hash table; Hitachi S-810; lists; manipulation; parallel computers; parallel rewriting; shared symbolic data; sorting; symbol; trees; vector processing; vector processor systems", treatment = "P Practical", } @TechReport{Karp:1993:EPS, author = "R. Karp and M. Luby and F. Meyer auf der Heide", title = "Efficient {PRAM} Simulation on a Distributed Memory Machine", number = "TR-93-040", institution = inst-UC-BERKELEY-ICSI, address = inst-UC-BERKELEY-ICSI:adr, pages = "??", month = aug, year = "1993", bibdate = "Fri Jul 22 16:18:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM). In a PRAM, memory conflicts occur only through concurrent access to the same cell, whereas the memory of a DMM is divided into modules, one for each processor, and concurrent accesses to the same module create a conflict. The delay of a simulation is the time needed to simulate a parallel memory access of the PRAM. Any general simulation of an m processor PRAM on a n processor DMM will necessarily have delay at least m/n. A randomized simulation is called time-processor optimal if the delay is O(m/n) with high probability. Using a novel simulation scheme based on hashing we obtain a time-processor optimal simulation with delay O($\backslash$loglog(n)$\backslash$logstn). The best previous simulations use a simpler scheme based on hashing and have much larger delay.", acknowledgement = ack-nhfb, } @InProceedings{Keller:1993:HRP, author = "Joerg Keller", booktitle = "Proceedings of the 3rd Workshop on Parallel Algorithms (WOPA)", title = "Hashing and Rehashing in {PRAM} Emulations", publisher = "????", address = "????", pages = "??", month = may, year = "1993", bibdate = "Thu Jul 21 09:40:24 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We compare several classes of hash functions with respect to their usability in PRAM emulations. The comparison is done by simulations with synthetical traces and traces from applications. Linear hash functions seem to behave best for practical machine sizes. For linear hash functions, we also present an optimally fast algorithm to rehash an address space without using secondary storage.", acknowledgement = ack-nhfb, location = "San Diego, CA", } @Article{Koushik:1993:DHD, author = "Murlidhar Koushik", title = "Dynamic hashing with distributed overflow space: a file organization with good insertion performance", journal = j-INFO-SYS, volume = "18", number = "5", pages = "299--318", month = sep, year = "1993", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 15:07:52 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Lai:1993:HFBa, author = "X. Lai and J. L. Massey", title = "Hash Functions Based on Block Ciphers", crossref = "Rueppel:1993:ACE", pages = "53--66", year = "1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lai:1993:HFBb, author = "X. Lai and J. L. Massey", title = "Hash functions based on block ciphers", journal = j-LECT-NOTES-COMP-SCI, volume = "658", pages = "55--70", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lipton:1993:CAH, author = "Richard J. Lipton and Jeffrey F. Naughton", title = "Clocked Adversaries for Hashing", journal = j-ALGORITHMICA, volume = "9", number = "3", pages = "239--252", month = mar, year = "1993", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68P20", MRnumber = "MR1202742 (93i:68061)", bibdate = "Mon Jan 22 05:31:38 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica9.html#LiptonN93; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database; UnCover library database", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "LiptonN93", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/LiptonN93", } @Article{Litwin:1993:LLH, author = "Witold Litwin and Marie-Anne A. Neimat and Donovan A. Schneider", title = "{LH}${}^*$ --- linear hashing for distributed files", journal = j-SIGMOD, volume = "22", number = "2", pages = "327--336", month = jun, year = "1993", CODEN = "SRECD8", ISBN = "0-89791-592-5", ISBN-13 = "978-0-89791-592-2", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:44 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "LH${}^*$ generalizes Linear Hashing to parallel or distributed RAM and disk files. An LH file can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion is one in general, and three in the worst case. The number of messages per retrieval is two in general, and four in the worst case. The load factor can be about constant, 65-95\%, depending on the file parameters. The file can also support parallel operations. An LH${}^*$ file can be much faster than a single site disk file, and\slash or can hold a much larger number of objects. It can be more efficient than any file with a centralized directory, or static parallel or distributed hash file.", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Labs., Palo Alto, CA, USA", affiliationaddress = "Palo Alto, CA, USA", classification = "722.1; 722.4; 723.2; 723.3; 903.3; C5440 (Multiprocessor systems and techniques); C6120 (File organisation); C6160B (Distributed DBMS)", conference = "Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1993", keywords = "Data handling; Data reduction; Disk files; Distributed database; Distributed database systems; Distributed files; Distributed RAM; File organization; File parameter; File parameters; Information retrieval; LH; Linear hashing; Load factor; Parallel processing systems; Parallel RAM; Program processors; Random access storage", meetingaddress = "Washington, DC, USA", meetingdate = "May 26--28 1993", meetingdate2 = "05/26--28/93", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM, SIGMOD; Minerals, Metals \& Materials Society", thesaurus = "Distributed databases; File organisation; Shared memory systems", xxcrossref = "Anonymous:1993:SAS", } @Article{Lo:1993:OPA, author = "Ming-Ling Lo and Ming-Syan Chen and C. V. Ravishankar and Philip S. Yu", title = "On optimal processor allocation to support pipelined hash joins", journal = j-SIGMOD, volume = "22", number = "2", pages = "69--78", month = jun, year = "1993", CODEN = "SRECD8", ISBN = "0-89791-592-5", ISBN-13 = "978-0-89791-592-2", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:44 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we develop algorithms to achieve optimal processor allocation for pipelined hash joins in a multiprocessor-based database system. A pipeline of hash joins is composed of several stages, each of which is associated with one join operation. The whole pipeline is executed in two phases: (1) the table-building phase, and (2) the tuple-probing phase. We focus on the problem of allocating processors to the stages of a pipeline to minimize the query execution time. We formulate the processor allocation problem as a two-phase mini-max optimization problem, and develop three optimal allocation schemes under three different constraints. The effectiveness of our problem formulation and solution is verified through a detailed tuple-by-tuple simulation of pipelined hash joins. Our solution scheme is general and applicable to any optimal resource allocation problem formulated as a two-phase mini-max problem.", acknowledgement = ack-nhfb, affiliation = "Univ of Michigan at Ann Arbor", affiliationaddress = "Ann Arbor, MI, USA", classification = "723.1; 723.2; 723.3; 921.5; 921.6; C1180 (Optimisation techniques); C4250 (Database theory); C6110P (Parallel programming); C6120 (File organisation); C6150N (Distributed systems); C6160B (Distributed DBMS)", conference = "Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1993", keywords = "Algorithms; Computer simulation; Database systems; Heuristic methods; Large scale systems; Maximum principle; Multiprocessing systems; Multiprocessor-based database system; Optimal allocation schemes; Optimal processor allocation; Optimal resource allocation problem; Optimization; Pipeline processing systems; Pipelined hash join; Problem formulation; Processor allocation problem; Program processors; Query execution time; Query languages; Scheduling; Storage allocation (computer); Table building phase; Table-building phase; Tuple by tuple simulation, Pipelined hash joins; Tuple probing phase; Tuple-by-tuple simulation; Tuple-probing phase; Two phase mini-max optimization; Two-phase mini-max optimisation problem", meetingaddress = "Washington, DC, USA", meetingdate = "May 26--28 1993", meetingdate2 = "05/26--28/93", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM, SIGMOD; Minerals, Metals \& Materials Society", thesaurus = "Database theory; Distributed databases; Minimax techniques; Pipeline processing; Resource allocation; Storage management", xxcrossref = "Anonymous:1993:SAS", } @Article{Lucchesi:1993:AFA, author = "Claudio L. Lucchesi and Tomasz Kowaltowski", title = "Applications of finite automata representing large vocabularies", journal = j-SPE, volume = "23", number = "1", pages = "15--30", month = jan, year = "1993", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", bibdate = "Wed Jan 15 12:19:41 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfect hashing and text compression.", acknowledgement = ack-nhfb, affiliation = "Universidade Estadual de Campinas", affiliationaddress = "Campinas, Braz", classification = "721.1; 723.1; 723.2; 903.1", journalabr = "Software Pract Exper", keywords = "Algorithms; Data compression; Dictionaries; Finite acyclic automata; Finite automata; Minimal perfect hashing; Spelling checkers; Terminology; Text compression; Vocabularies; Vocabulary control", } @Article{Lueker:1993:MAD, author = "G. S. Lueker and Mariko Molodowitch", title = "More Analysis of Double Hashing", journal = j-COMBINATORICA, volume = "13", number = "1", pages = "83--96", year = "1993", CODEN = "COMBDI", ISSN = "0209-9683", bibdate = "Sat May 25 15:08:04 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Mansour:1993:CCU, author = "Y. Mansour and N. Nisan and P. Tiwari", title = "The computational complexity of universal hashing", journal = j-THEOR-COMP-SCI, volume = "107", number = "1", pages = "121--133", day = "4", month = jan, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:15:15 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", keywords = "boolean branching program model; computational complexity; constant-depth circuits; CREW PRAM; exponential size; file organisation; n-bit strings; parallel time bound; time-space tradeoff; universal hashing; VLSI implementation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @InProceedings{Matias:1993:HPR, author = "Yossi Matias", booktitle = "Proceedings of the 3rd Workshop on Parallel Algorithms (WOPA)", title = "Highly Parallel Randomized Algorithmics", publisher = "????", address = "????", pages = "??", month = may, year = "1993", bibdate = "Thu Jul 21 09:40:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We survey recently developed paradigms and techniques for extremely fast and efficient randomized parallel algorithms. Nearly-constant time efficient algorithms are obtained for fundamental problems in parallel computation, including hashing, dictionary, approximate compaction, approximate sum, and automatic processor scheduling in parallel algorithms. The new paradigms and algorithmic results have many applications. They imply that, under rather general circumstances, designers of parallel algorithms need not bother themselves with the issues of space efficiency, or with operations-to-processors allocation, since both these issues can be handled automatically.", acknowledgement = ack-nhfb, location = "San Diego, CA", } @InProceedings{Miller:1993:RFS, author = "Ethan L. Miller and Randy H. Katz", title = "{RAMA}: {A} File System for Massively-Parallel Computers", crossref = "Coleman:1993:PTI", pages = "163--168", year = "1993", bibdate = "Mon Jul 18 12:10:59 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, comment = "The multiprocessor's file system acts as a block cache for tertiary storage. Disk space is broken into ``lines'' of a few MB. Each line has a descriptor telling what blocks it has, and their status. (fileid, offset) hashed to find (disk, linenum). Intrinsic metadata stored at start of each file; positional metadata implicit in hashing, and line descriptors. Sequentiality parameter puts several blocks of a file in the same line, to improve medium-sized requests (otherwise generate lots of request-response net traffic). Not clear on best choice of size. No mention of atomicity wrt concurrent writes to same data. Blocks migrate to tertiary storage as they get old. Fetched on demand, by block (not file). Self-describing blocks have ids in block -- leads to screwy block sizes?", keywords = "parallel I/O, multiprocessor file system, pario bib", } @InProceedings{Mohan:1993:ACC, author = "C. Mohan", title = "{ARIES\slash LHS}: {A} Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators", crossref = "IEEE:1993:ICD", pages = "243", month = apr, year = "1993", bibdate = "Sat Jul 16 19:12:32 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Manual{NIST:1993:FPS, author = "{NIST}", title = "{FIPS PUB} 180: Secure Hash Standard {(SHS)}", organization = "National Institute of Standards and Technology", address = "Gaithersburg, MD, USA", pages = "??", day = "11", month = may, year = "1993", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 8]{Kaliski:1995:MAM}.", } @InProceedings{Palem:1993:HEA, author = "Krishna V. Palem and Yonathan Aumann and Zvi Kedem and Michael Rabin", booktitle = "Proceedings of the 3rd Workshop on Parallel Algorithms (WOPA)", title = "Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs", publisher = "????", address = "????", pages = "??", month = may, year = "1993", bibdate = "Thu Jul 21 09:40:26 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A parallel program P is {\em large-grained\/} if the instructions constituting its individual threads are complex procedures requiring numerous processor instructions. This practically relevant style arises naturally in the context of parallel data-processing programs and large scale parallel numerical computations, and large-granularity has been proposed as a means of coping with communication overheads via {\em latency masking}. It is distinct from classical models of parallel computing in that within a parallel step the computations on different threads may considerably vary in size. We present a transformation (compilation) of a large-grained program P into a program C(P) which correctly and efficiently effects the computation of P on an asynchronous machine M. Let W denote the total work required to execute P on a synchronous n-processor parallel system. Under moderate assumptions on the granularity of threads and the size of the program variables, an execution of C(P) on M requires just $O(W\log^*n)$ expected total work, and the memory space overhead is a small multiplicative constant. The solution involves a number of new concepts and methods which we feel are of independent interest, including methods for storing program and control variables, employing a combination of error correction codes with phase--dependent hashing into memory, and novel notions of stability in asynchronous machines.", acknowledgement = ack-nhfb, location = "San Diego, CA", } @TechReport{Pang:1993:PPHa, author = "H. Pang and M. Carey and M. Livny", title = "Partially Preemptible Hash Joins", number = "CS TR 1144", institution = "University of Wisconsin--Madison", address = "Madison, WI, USA", pages = "??", year = "1993", bibdate = "Thu Jul 21 09:40:27 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "PPHJ long version.", acknowledgement = ack-nhfb, } @Article{Pang:1993:PPHb, author = "HweeHwa H. Pang and Michael J. Carey and Miron Livny", title = "Partially preemptible hash joins", crossref = "Buneman:1993:PAS", journal = j-SIGMOD, volume = "22", number = "2", pages = "59--68", month = jun, year = "1993", CODEN = "SRECD8", ISBN = "0-89791-592-5", ISBN-13 = "978-0-89791-592-2", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:44 MST 2004", bibsource = "Compendex database; http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/170035/p59-pang/p59-pang.pdf; http://www.acm.org/pubs/citations/proceedings/mod/170035/p59-pang/", abstract = "With the advent of real-time and goal-oriented database systems, priority scheduling is likely to be an important feature in future database management systems. A consequence of priority scheduling is that a transaction may lose its buffers to higher-priority transactions, and may be given additional memory when transactions leave the system. Due to their heavy reliance on main memory, hash joins are especially vulnerable to fluctuations in memory availability. Previous studies have proposed modifications to the hash join algorithm to cope with these fluctuations, but the proposed algorithms have not been extensively evaluated or compared with each other. This paper contains a performance study of these algorithms. In addition, we introduce a family of memory-adaptive hash join algorithms that turns out to offer even better solutions to the memory fluctuation problem that hash joins experience.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Univ of Wisconsin - Madison", affiliationaddress = "Madison, WI, USA", classification = "722.1; 722.2; 722.4; 723.1; 723.3; 912.2; C4250 (Database theory); C6120 (File organisation); C6130 (Data handling techniques); C6160 (Database management systems (DBMS))", conference = "Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data", conferenceyear = "1993", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", keywords = "Algorithms; Computer simulation; Data handling; Data storage equipment; Database systems; Decision tables; First come first serve; Future database management systems; Goal oriented database system; Goal-oriented database systems; Hash join algorithm; Memory adaptive hash join algorithm; Memory availability; Memory fluctuation; Memory-adaptive hash join algorithms; Partially preemptible hash join; Performance study; Priority scheduling; Real time database; Real time systems; Round robin scheduling; Scheduling; Storage allocation (computer); System buffer usage, Partially preemptible hash joins; Time constraints; Transaction; User interfaces", meetingaddress = "Washington, DC, USA", meetingdate = "May 26--28 1993", meetingdate2 = "05/26--28/93", publisherinfo = "Fort Collins Computer Center", sponsor = "ACM, SIGMOD; Minerals, Metals \& Materials Society", thesaurus = "Database management systems; Database theory; Scheduling; Storage management; Transaction processing", xxauthor = "Hwee Hwa Pang and Michael J. Carey and Miron Livny", xxcrossref = "Anonymous:1993:SAS", } @Book{Pieprzyk:1993:DHA, author = "Josef Pieprzyk and Babak Sadeghiyan", title = "Design of Hashing Algorithms", volume = "756", publisher = pub-SV, address = pub-SV:adr, pages = "xiii + 194", year = "1993", CODEN = "LNCSD9", DOI = "????", ISBN = "3-540-57500-6 (Berlin), 0-387-57500-6 (New York)", ISBN-13 = "978-3-540-57500-9 (Berlin), 978-0-387-57500-1 (New York)", ISSN = "0302-9743 (print), 1611-3349 (electronic)", LCCN = "QA76.9.H36 P53 1993", bibdate = "Wed Feb 14 06:00:56 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", series = ser-LNCS, URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t0756.htm; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=756", acknowledgement = ack-nhfb, keywords = "computer algorithms; computer security; hashing (computer science)", } @InProceedings{Piper:1993:DSH, author = "F. Piper and P. Wild", title = "Digital Signatures and Hash Functions", crossref = "Anonymous:1993:CSA", pages = "124--130", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Pramanik:1993:MDH, author = "Sakti Pramanik and Anastasia Analyti and Henry Davies", title = "Multi-Directory Hashing", journal = j-INFO-SYS, volume = "18", number = "1", pages = "63", year = "1993", CODEN = "INSYD6", ISSN = "0306-4379", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Pramanik:1993:MH, author = "Sakti Pramanik and Anastasia Analyti and Henry Davies and Chou Hsiao-Yu", title = "Multi-Directory Hashing", journal = j-INFO-SYS, volume = "18", number = "1", pages = "63--74", month = jan, year = "1993", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Prencel:1993:ATH, author = "B. Prencel and R. Govaerts and J. Vandewalle", title = "An attack on two hash functions by {Zheng-Matsumoto-Imai}", crossref = "Seberry:1993:ACA", pages = "535--538", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @PhdThesis{Preneel:1993:ADC, author = "B. Preneel", title = "Analysis and Design of Cryptographic Hash Functions", type = "Thesis ({Ph.D.})", school = "Katholieke Universiteit Leuven", address = "Leuven, Belgium", pages = "355", month = jan, year = "1993", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://wwwlib.umi.com/dissertations/fullcit/f64276", abstract = "The subject of this thesis is the study of cryptographic hash functions. The importance of hash functions for protecting the authenticity of information is demonstrated. Applications include integrity protection, conventional message authentication and digital signatures. Theoretical results on cryptographic hash functions are reviewed. The information theoretic approach to authentication is described, and the practicality of schemes based on universal hash functions is studied. An overview is given of the complexity theoretical definitions and constructions. The main contribution of this thesis lies in the study of practical constructions for hash functions. A general model for hash functions is proposed and taxonomy for attacks is presented. Then all schemes in the literature are divided into three classes: hash functions based on block ciphers, hash functions based on modular arithmetic and dedicated hash functions. An overview is given of existing attacks, new attacks are demonstrated, and new schemes are proposed. The study of basic building blocks of cryptographic hash functions leads to the study of the cryptographic properties of Boolean functions. New criteria are defined and functions satisfying new and existing criteria are studied.", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 19]{Kaliski:1995:SUR}.", } @Article{Preneel:1993:ATH, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "An attack on two hash functions by {Zheng-Matsumoto-Imai}", journal = j-LECT-NOTES-COMP-SCI, volume = "718", pages = "535--538", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1993:CHF, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "Cryptographic Hash Functions", crossref = "Wolfowicz:1993:SPR", pages = "161--171", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1993:HFB, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "Hash functions based on block ciphers: a synthetic approach", crossref = "Stinson:1993:ACC", pages = "368--378", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1993:IAH, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "Information Authentication: Hash Functions and Digital Signatures", crossref = "Preneel:1993:CSI", pages = "87--131", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1993:PMD, author = "B. Preneel and R. Govaerts and J. Vandewalle", title = "On the power of memory in the design of collision resistant hash functions", crossref = "Seberry:1993:ACA", pages = "105--121", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Ruland:1993:RDS, author = "Christoph Ruland", title = "Realizing Digital Signatures with One-Way Hash Functions", journal = j-CRYPTOLOGIA, volume = "17", number = "3", pages = "285--300", month = jul, year = "1993", CODEN = "CRYPE6", DOI = "http://dx.doi.org/10.1080/0161-119391867953", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibsource = "cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; OCLC Article1st database; UnCover library database", note = "digital signatures; one-way hash functions; asymmetric cryptographic systems; smart cards; one-time signatures; optimally implemented hash functions; asymmetric algorithms; one-bit signatures; N-bit signatures; infinite signature trees; performance", URL = "http://www.informaworld.com/smpp/content~content=a748639237~db=all~order=page", abstract = "The possibility of digital signatures is one of the advantages of asymmetric cryptographic systems. The processing effort, however, is still an obstacle to widespread use of digital signatures, particularly when using smart cards. A more attractive idea is to realize digital signatures with one-time signatures using (conventional) hash functions. In this paper, different such procedures, known in theory, are presented comprehensively and analysed as to their practicality. It is concluded that digital signatures cannot be performed significantly faster with one-time signatures using optimally implemented hash functions than with asymmetric algorithms", acknowledgement = ack-nhfb, keywords = "cryptography; file organisation", language = "English", romanvolume = "XVII", } @Article{Russell:1993:NSC, author = "A. Y. Russell", title = "Necessary and Sufficient Conditions for Collision-Free Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "740", pages = "433--441", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1993.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology", } @InProceedings{Schnorr:1993:FHI, author = "C. P. Schnorr", title = "{FFT}-Hash {II}, Efficient Cryptographic Hashing", crossref = "Rueppel:1993:ACE", pages = "41--51", year = "1993", bibdate = "Sun Jul 17 19:44:40 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Schnorr:1993:FIE, author = "C. P. Schnorr", title = "{FFT-hash} {II}, efficient cryptographic hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "658", pages = "45--54", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Schweitz:1993:AHS, author = "Eric A. Schweitz and Alan L. Tharp", title = "Adaptive hashing with signatures", journal = j-INFO-SYS, volume = "18", number = "8", pages = "597--??", year = "1993", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Book{Sedgewick:1993:AM, author = "Robert Sedgewick", title = "Algorithms in {Modula-3}", publisher = pub-AW, address = pub-AW:adr, pages = "xiv + 656", year = "1993", ISBN = "0-201-53351-0", ISBN-13 = "978-0-201-53351-4", LCCN = "QA76.73.M63 S43 1993", bibdate = "Mon Jan 3 12:10:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, libnote = "Not yet in my library.", } @InProceedings{Sheffler:1993:AHP, author = "Thomas J. Sheffler and Randal E. Bryant", title = "An Analysis of Hashing on Parallel and Vector Computers", crossref = "Hariri:1993:PIC", pages = "III.29--III.36", year = "1993", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "parallel algorithms, CM-2, Cray Y-MP,", } @InProceedings{Soloviev:1993:THA, author = "V. Soloviev", key = "Soloviev", title = "A Truncating Hash Algorithm for Processing Band-Join Queries", crossref = "IEEE:1993:ICD", pages = "419--427", year = "1993", bibdate = "Sat Jul 16 19:12:39 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A non-equijoin of relations R and S is a based join if the join predicate requires values in the join attribute of R to fall within a specified band about the values in the join attributes of S. This paper describes a new algorithm, termed a truncating-hash band join, for evaluating band joins. This algorithm is based on the idea of truncating join attribute values in order to execute band joins in a way similar to hash join algorithms for equijoins. Unlike previously proposed algorithms for band joins, it does not sort either of the input relations during its execution. We present a comparison between the truncating-hash band join algorithm and previous algorithms for band joins using an analytical model. The model also compares an evaluation of band join algorithms for parallel implementation on a `shared-nothing' multiprocessor system. The results show that the truncating-hash band join algorithm outperforms the other band algorithms because of a significantly lower CPU cost.", acknowledgement = ack-nhfb, } @Article{Tan:1993:RSM, author = "Kian-Lee Tan and Hongium Lu", title = "On resource scheduling of multi-join queries in parallel database systems", journal = j-INFO-PROC-LETT, volume = "48", number = "4", pages = "189--195", day = "29", month = nov, year = "1993", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Jan 29 09:23:05 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Natl Univ of Singapore", affiliationaddress = "Singapore", classification = "722.4; 723.2; 723.3", journalabr = "Inf Process Lett", keywords = "Database systems; Hash join; Management; Multi joint queries; Parallel processing systems; Pipelining; Query languages; Scheduling", } @Article{Tang:1993:URH, author = "S. M. Tang and L. R. Chow", title = "Using Rank Hashing Function to Develop a Data Allocating Scheme for a Two-Disk System", journal = j-J-SYST-SOFTW, volume = "22", number = "2", pages = "107--116", day = "1", month = aug, year = "1993", CODEN = "JSSODM", ISSN = "0164-1212", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Tian:1993:NHF, author = "Z. Tian and S. Tong and S. Yang", title = "A New Hashing Function: Statistical Behavior and Algorithm", journal = j-SIGIR-FORUM, volume = "27", number = "1", pages = "3--??", month = "Spring", year = "1993", CODEN = "FASRDV", ISSN = "0163-5840", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Toyama:1993:JAM, author = "Motomichi Toyama", title = "Join Algorithm for Multidimensional Linear Hash Databases", journal = j-ADV-SOFT-SCI-TECH, volume = "4", number = "??", pages = "43--62", year = "1993", ISSN = "1044-7997", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Turau:1993:ETC, author = "V. Turau and H. Duchene", title = "Equality testing for complex objects based on hashing", journal = j-DATA-KNOWLEDGE-ENG, volume = "10", number = "1", pages = "101--112", month = feb, year = "1993", CODEN = "DKENEW", ISSN = "0169-023X", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Vaudenay:1993:FHI, author = "S. Vaudenay", title = "{FFT-Hash-II} is not yet Collision-free", journal = j-LECT-NOTES-COMP-SCI, volume = "740", pages = "587--593", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1993.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology", } @Article{Wang:1993:IAA, author = "Y. B. Wang and T. P. Mack", title = "An indexed-hash algorithm for an agrometeorological data management system", journal = j-COMPUT-ELECTRON-AGRIC, volume = "8", number = "2", pages = "105--??", day = "1", month = mar, year = "1993", CODEN = "CEAGE6", ISSN = "0168-1699", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Warren:1993:PHO, author = "Michael S. Warren and John K. Salmon", title = "A Parallel Hashed Oct-Tree {$N$}-Body Algorithm", crossref = "IEEE:1993:PSP", pages = "12--21", year = "1993", bibdate = "Sat Apr 24 14:53:31 1999", bibsource = "Compendex database; http://www.ccsf.caltech.edu/~johns/papers.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "ftp://ftp.cacr.caltech.edu/nbody/sc93.ps.Z", acknowledgement = ack-jks # " and " # ack-nhfb, affiliation = "Los Alamos Natl Lab", affiliationaddress = "Los Alamos, NM, USA", classification = "723; 723.5; 921; C4240P (Parallel programming and algorithm theory); C7320 (Physics and chemistry computing)", corpsource = "Los Alamos Nat. Lab., NM, USA", keywords = "512 processor Intel Touchstone Delta system; Algorithms; Complex physical system study; Computer aided analysis; Data storage equipment; efficient adaptive N-body method; force calculations; hash table; machine arithmetic accuracy; memory locations; Multiple processors; N-body method; N-body problems; N-body simulations; parallel algorithms; Parallel hashed Oct-tree N-body algorithm; parallel hashed oct-tree N-body algorithm; parallel program; particle number; physics computing; tree topology; Trees (mathematics); wide-ranging applications", sponsororg = "IEEE; ACM SIGARCH", treatment = "P Practical", } @Article{Wolf:1993:PHJ, author = "J. L. Wolf and P. S. Yu and J. Turek", title = "A Parallel Hash Join Algorithm for Managing Data Skew", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "4", number = "12", pages = "1355--??", day = "1", month = dec, year = "1993", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Woodruff:1993:HVT, author = "D. L. Woodruff and E. Zemel", title = "Hashing vectors for tabu search", journal = j-ANN-OPER-RESEARCH, volume = "40", number = "1 / 4", pages = "123--??", day = "1", month = may, year = "1993", CODEN = "AOREEV", ISSN = "0254-5330", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Yo:1993:OPA, author = "M.-L. Yo and M.-S. Chen and C. Ravishankar and P. Yu", title = "On Optimal Processor Allocation to Support Pipelined Hash Joins", crossref = "Buneman:1993:PAS", pages = "??", year = "1993", bibdate = "Sat Nov 12 21:04:41 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Zheng:1993:HOH, author = "Y. Zheng and J. Pieprzyk and J. Seberry", title = "{HAVAL} --- a one-way hashing algorithm with variable length of output", journal = j-LECT-NOTES-COMP-SCI, volume = "718", pages = "83--104", year = "1993", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zheng:1993:HOW, author = "Y. Zheng and J. Pieprzyk and J. Seberry", title = "{HAVAL} -- {A} One-way Hashing Algorithm with Variable Length of Output", crossref = "Seberry:1993:ACA", pages = "3.1--3.10", year = "1993", bibdate = "Thu Jul 14 16:43:02 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zhou:1993:DAH, author = "X. F. Zhou and M. E. Orlowska", title = "A Dynamic Approach for Handling Data Skew Problems in Parallel Hash Join Computation", crossref = "Anonymous:1993:TCC", pages = "133--137", year = "1993", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Aoe:1994:CAS, author = "Jun-ichi Aoe", title = "Computer Algorithms: String Pattern Matching Strategies", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "ix + 281", year = "1994", ISBN = "0-8186-5461-9 (microfiche), 0-8186-5462-7 (hardcover), 0-8186-5460-0 (paperback)", ISBN-13 = "978-0-8186-5461-9 (microfiche), 978-0-8186-5462-6 (hardcover), 978-0-8186-5460-2 (paperback)", LCCN = "QA76.9.A43 C67 1994", bibdate = "Wed Aug 10 14:48:05 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$56.00", acknowledgement = ack-nhfb, } @Article{Arikan:1994:IGB, author = "E. Arikan", title = "An Improved Graph-Entropy Bound for Perfect Hashing", journal = j-IEEE-INT-SYMP-INF-THEORY, pages = "314--??", year = "1994", CODEN = "PISTFZ", ISSN = "0271-4655", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Bellare:1994:ICC, author = "M. Bellare and O. Goldreich and S. Goldwasser", title = "Incremental cryptography: the case of hashing and signing", journal = j-LECT-NOTES-COMP-SCI, volume = "839", pages = "216--233", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1994.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology; IACR; IEEE", } @TechReport{Bellare:1994:OAEa, author = "Mihir Bellare and Phillip Rogaway", title = "Optimal asymmetric encryption", type = "Research report", number = "RC 19610 (86198)", institution = "IBM T. J. Watson Research Center", address = "Yorktown Heights, NY, USA", pages = "19", day = "16", month = jun, year = "1994", bibdate = "Mon Oct 19 08:47:56 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Appears in Advances in Cryptology --- Eurocrypt 94 Proceedings, 1994.", abstract = "Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(r[subscript x]), where r[subscript x] is a simple probabilistic encoding of x depending on the hash function; and (ii) the scheme can be proven semantically secure assuming the hash function is `ideal.' Moreover, a slightly enhanced scheme is shown to have the property that the adversary can create ciphertexts only of strings for which she `knows' the corresponding plaintexts --- such a scheme is not only semantically secure but also non-malleable and secure against chosen-ciphertext attack.", acknowledgement = ack-nhfb, keywords = "Cryptography.", } @Article{Benouamer:1994:HLN, author = "M. O. Benouamer and P. Jaillon and D. Michelucci and J.-M. Moreau", title = "Hashing Lazy Numbers: {Hash-Speicherung von ,,tragen'' Zahlen}", journal = j-COMPUTING, volume = "53", number = "3 / 4", pages = "205--??", year = "1994", CODEN = "CMPTA2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Sat Feb 14 10:46:50 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Benouamer:1994:HST, author = "M. O. Benouamer and P. Jaillon and D. Michelucci and J.-M. Moreau", title = "{Hash-Speicherung von ,,tragen'' Zahlen}. ({German}) [{Hashing} ``Lazy'' Numbers]", journal = j-COMPUTING, volume = "53", number = "3--4", pages = "205--217", year = "1994", CODEN = "CMPTA2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", MRclass = "68P10 (68U05 94A60)", MRnumber = "96a:68017", bibdate = "Mon Oct 11 20:38:38 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; MathSciNet database; OCLC Contents1st database; UnCover library database", note = "International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (Vienna, 1993).", acknowledgement = ack-nhfb, language = "German", } @Article{Bhatia:1994:FIP, author = "Sanjiv K. Bhatia and Chaman L. Sabharwal", title = "A Fast Implementation of a Perfect Hash Function for Picture Objects", journal = j-PATTERN-RECOGN, volume = "27", number = "3", pages = "365--376", month = mar, year = "1994", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Bhatia:1994:FPH, author = "S. Bhatia and C. Sabharwal", title = "A Fast Perfect Hash Function for Image Databases", crossref = "Anger:1994:IEA", pages = "337--346", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Bierbrauer:1994:FHF, author = "Jurgen Bierbrauer and Thomas Johansson and Gregory Kabatianskii and Ben Smeets", title = "On families of hash functions via geometric codes and concatenation", journal = j-LECT-NOTES-COMP-SCI, volume = "773", pages = "331--342", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Biliris:1994:EEO, author = "Alexandros Biliris and Euthimios Panagos", title = "{EOS}: An {Extensible Object Store}", journal = j-SIGMOD, volume = "23", number = "2", pages = "517--517", month = jun, year = "1994", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:48 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "AT\&T Bell Labs., Murray Hill, NJ, USA", classification = "C6120 (File organisation); C6160B (Distributed DBMS); C6160J (Object-oriented databases)", keywords = "Client-server architecture; Clustering hints; Configuration files; Database systems; Distributed computing environment; Distributed storage architectures; EOS; Extensible Object Store; Fast transparent access; Hashing; Hook functions; Index structures; Multigranularity 2-version 2-phase locking protocol; Object naming; Page objects; Persistent objects; Physical object placement; Programming languages; Storage manager; Transparent updating; Uninterpreted byte strings; Write-ahead redo-only logging scheme", thesaurus = "Distributed databases; Object-oriented databases; Storage management", xxcrossref = "Anonymous:1994:ASI", } @Article{Bjatia:1994:FIP, author = "S. K. Bjatia and C. L. Sabharwal", title = "A fast implementation of a perfect hash function for picture objects", journal = j-PATTERN-RECOGN, volume = "27", number = "3", pages = "365--??", year = "1994", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Brain:1994:UTE, author = "Marshall D. Brain and Alan L. Tharp", title = "Using Tries to Eliminate Pattern Collisions in Perfect Hashing", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "6", number = "2", pages = "239--247", month = apr, year = "1994", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Brian:1994:UTE, author = "M. D. Brian and A. L. Tharp", title = "Using Tries to Eliminate Pattern Collisions in Perfect Hashing", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "6", number = "2", pages = "239--??", day = "1", month = apr, year = "1994", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chin:1994:LHF, author = "A. Chin", title = "Locality-Preserving Hash Functions for General Purpose Parallel Computation", journal = j-ALGORITHMICA, volume = "12", number = "2 / 3", pages = "170--??", year = "1994", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", bibdate = "Sat May 25 15:09:11 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Chin:1994:LPH, author = "A. Chin", title = "Locality-Preserving Hash Functions for General Purpose Parallel Computation", journal = j-ALGORITHMICA, volume = "12", number = "2--3", pages = "170--181", year = "1994", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68Q10 (68P20)", MRnumber = "MR1282099 (95c:68076)", bibdate = "Mon Jan 22 05:25:26 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica12.html#Chin94; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database; UnCover library database", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "Chin94", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Chin94", } @Article{Chu:1994:ASH, author = "Jiang-Hsing Chu and Gary D. Knott", title = "An Analysis of Spiral Hashing", journal = j-COMP-J, volume = "37", number = "8", pages = "715--719", month = "????", year = "1994", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jul 21 09:54:15 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/Volume_37/Issue_08/Vol37_08.index.html", URL = "http://www3.oup.co.uk/computer_journal/Volume_37/Issue_08/Vol37_08.body.html#AbstractChu", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Southern Illinois Univ., Carbondale, IL, USA", author-1-adr = "Department of Computer Science, Southern Illinois University, Carbondale, IL 62901, USA", author-2-adr = "Civilized Software, Inc, 7735 Old Georgetown Road, #410 Bethesda, MD 20814, USA", classcodes = "C6120 (File organisation)", classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Southern Illinois Univ., Carbondale, IL, USA", keywords = "analysis; big-O term; Big-O term; cost; discrete; Discrete analysis; error; Error; expected amortized rehashing; Expected amortized rehashing cost; expected search cost; Expected search cost; extendible hashing method; Extendible hashing method; file organisation; search problems; spiral hashing; Spiral hashing", thesaurus = "File organisation; Search problems", treatment = "T Theoretical or Mathematical", } @InProceedings{Coburn:1994:ISH, author = "T. K. Coburn", title = "An Introduction to the {SSPIN} Hash Function: Making More Out of the Multidimensional Array", crossref = "IEEE:1994:NAE", pages = "919--925", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Coelkesen:1994:MVM, author = "R. Coelkesen and K. Balasubramanian and Z. G. Altun", title = "A Microprocessor-controlled Versatile {$3$D} Motion Control System Incorporating a Dynamic Hash Function Command Interpreter", journal = j-LAB-MICROCOMP, volume = "13", number = "1", pages = "3--??", year = "1994", CODEN = "LMICDI", ISSN = "0262-2955", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Cooperman:1994:CPR, author = "Gene Cooperman and Larry Finkelstein and Bryant York and Michael Tselman", title = "Constructing permutation representations for large matrix groups", crossref = "ACM:1994:IPI", pages = "134--138", year = "1994", bibdate = "Thu Mar 12 08:41:19 MST 1998", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/190347/p134-cooperman/", abstract = "New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, $n,$ can be 10,000,000 and larger. The key idea is to build the new permutation representation using the conjugation action on a conjugacy class of subgroups of prime order. A unique signature for each group element corresponding to the conjugacy class is used in order to avoid matrix multiplication. The requirement of at least $n$ matrix multiplications would otherwise have made the computation hopelessly impractical. Additional software optimizations are described, which reduce the CPU time by at least an additional factor of 10. Further, a special data structure is designed that serves both as a search tree and as a hash array, while requiring space of only $1.6 n log_2 n$ bits. The technique has been implemented and tested on the sporadic simple group Ly, discovered by Lyons (1972), in both a sequential (SPARCserver 670 MP) and parallel SIMD (MasPar MP-1) version. Starting with a generating set for $Ly$ as a subgroup of $GL(111, 5)$, a set of generating permutations for $Ly$ acting on 9, 606, 125 points is constructed as well as a base for this permutation representation. The sequential version required four days of CPU time to construct a data structure which can be used to compute the permutation image of an arbitrary matrix. The parallel version did so in 12 hours. Work is in progress on a faster parallel implementation.", acknowledgement = ack-nhfb, affiliation = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA", classification = "C4140 (Linear algebra); C4240C (Computational complexity); C7310 (Mathematics computing)", keywords = "algorithms; Conjugacy class; Conjugation action; Data structure; design; Hash array; Large matrix groups; Parallel version; performance; Permutation representation; Permutation representations; Search tree", subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations. {\bf E.1} Data, DATA STRUCTURES, Arrays. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", thesaurus = "Computational complexity; Matrix multiplication; (MasPar MP-1) version. Starting with a generating set Symbol manipulation", } @Article{Cousin:1994:PIS, author = "B. Cousin and J. Helary", title = "Performance Improvement of State Space Exploration by Regular and Differential Hashing Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "818", pages = "364--??", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Damgaard:1994:BAH, author = "I. B. Damg{\aa}rd and L. R. Knudsen", title = "The breaking of the {AR} hash function", crossref = "Helleseth:1994:ACE", pages = "286--292", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Damgard:1994:IHC, author = "Ivan B. Damgard", title = "Interactive hashing can simplify zero-knowledge protocol design without computational assumptions", journal = j-LECT-NOTES-COMP-SCI, volume = "773", pages = "100--109", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0773.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0773/07730100.htm; http://link.springer-ny.com/link/service/series/0558/papers/0773/07730100.pdf", acknowledgement = ack-nhfb, } @InProceedings{Davison:1994:MRH, author = "D. L. Davison and G. Graefe", title = "Memory-Contention Responsive Hash Joins", crossref = "Bocca:1994:ICV", pages = "379--390", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb94.html", URL = "http://www.vldb.org/dblp/db/conf/vldb/vldb94-379.html", acknowledgement = ack-nhfb, annote = "Also known as VLDB'94", authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/d/Davison:Diane_L=.html; http://www.vldb.org/dblp/db/indices/a-tree/g/Graefe:Goetz.html", keywords = "very large data bases; VLDB", } @Article{deKergommeaux:1994:PLP, author = "Jacques Chassin de Kergommeaux and Philippe Codognet", title = "Parallel logic programming systems", journal = j-COMP-SURV, volume = "26", number = "3", pages = "295--336", month = sep, year = "1994", CODEN = "CMSVAN", DOI = "http://doi.acm.org/10.1145/185403.185453", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Thu Jun 19 09:45:58 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Parallelizing logic programming has attracted much interest in the research community, because of the intrinsic OR- and AND-parallelisms of logic programs. One research stream aims at transparent exploitation of parallelism in existing logic programming languages such as Prolog, while the family of concurrent logic languages develops language constructs allowing programmers to express the concurrency --- that is, the communication and synchronization between parallel processes --- within their algorithms. This article concentrates mainly on transparent exploitation of parallelism and surveys the most mature solutions to the problems to be solved in order to obtain efficient implementations. These solutions have been implemented, and the most efficient parallel logic programming systems reach effective speedups over state-of-the-art sequential Prolog implementations. The article also addresses current and prospective research issues in extending the applicability and the efficiency of existing systems, such as models merging the transparent parallelism and the concurrent logic languages approaches, combination of constraint logic programming with parallelism, and use of highly parallel architectures.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", keywords = "AND-parallelism; binding arrays; concurrent constraint programming; constraints; guard; hash windows; load balancing; massive parallelism; memory management; multisequential implementation techniques; nondeterminism; OR-parallelism; Prolog; scheduling parallel tasks; static analysis; Warren Abstract Machine", } @Article{Dietzfelbinger:1994:DPH, author = "Martin Dietzfelbinger and Anna Karlin and Kurt Mehlhorn and Friedhelm Meyer auf der Heide and Hans Rohnert and Robert E. Tarjan", title = "Dynamic Perfect Hashing: Upper and Lower Bounds", journal = j-SIAM-J-COMPUT, volume = "23", number = "4", pages = "738--761", month = "????", year = "1994", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P10 (68Q20)", MRnumber = "95c:68055", bibdate = "Sat Jan 18 18:03:50 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Dolev:1994:NPH, author = "Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas", title = "Neighborhood Preserving Hashing and Approximate Queries", crossref = "ACM-SIAM:1994:ASD", pages = "73--85", year = "1994", bibdate = "Thu Oct 31 19:14:22 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Du:1994:ADV, author = "M.-W. Du and S. C. Chang", title = "Approach to designing very fast approximate string matching algorithms", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "6", number = "4", pages = "620--633", month = aug, year = "1994", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Wed Jan 15 12:19:41 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "An approach to designing very fast algorithms for approximate string matching in a dictionary is proposed. Multiple spelling errors corresponding to insert, delete, change, and transpose operations on character strings are considered in the fault model. The design of very fast approximate string matching algorithms through a four-step reduction procedure is described. The final and most effective step uses hashing techniques to avoid comparing the given word with words at large distances. The technique has been applied to a library book catalog textbase. The experiments show that performing approximate string Symbol manipulation", acknowledgement = ack-nhfb, affiliation = "GTE Lab Inc", affiliationaddress = "Waltham, MA, USA", classification = "721.1; 722.4; 723.1; 723.2; 903.1; 903.3", journalabr = "IEEE Trans Knowl Data Eng", keywords = "Algorithms; Character recognition; Character strings; Computational linguistics; Data reduction; Data structures; Error correction; Errors; Hashing techniques; Information retrieval; Interactive computer systems; Man machine systems; Multiple spelling errors; Nearest neighbor search; Terminology; Textbase; Very fast approximate string matching algorithms", } @Article{Englert:1994:NSS, author = "Susanne Englert", title = "{NonStop SQL}: Scalability and Availability for Decision Support", journal = j-SIGMOD, volume = "23", number = "2", pages = "491--491", month = jun, year = "1994", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:48 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Tandem Comput. Inc., Cupertino, CA, USA", classification = "C6140D (High level languages); C6160D (Relational DBMS); C7102 (Decision support systems)", keywords = "Aggregates; Availability; Cross product joins; Database product; Decision support; Hash join algorithm; Hash joins; Hashed groupings; Intra-query parallelism; Merge joins; Nested-loop joins; NonStop SQL; Query times; Scalability; Scaleup; Speedup; Table scans; Tandem", thesaurus = "Decision support systems; Relational databases; SQL", xxcrossref = "Anonymous:1994:ASI", } @Article{Fraenkel:1994:EMD, author = "Aviezri S. Fraenkel and Edward M. Reingold and Prashant Saxena", title = "Efficient management of dynamic tables", journal = j-INFO-PROC-LETT, volume = "50", number = "1", pages = "25--30", day = "8", month = apr, year = "1994", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Pennsylvania", affiliationaddress = "Philadelphia, PA, USA", classification = "721.1; 722.1; 723.1; 723.1.1; 723.2; 922.2; C6120 (File organisation)", corpsource = "Dept. of Math., Pennsylvania Univ., Philadelphia, PA, USA", journalabr = "Inf Process Lett", keywords = "Amortized analysis; Computer programming; Computer programming languages; cost; Data acquisition; Data reduction; Data structures; data structures; Decision tables; deletion; Dynamic table; dynamic table management; file organisation; Hashing function; Hierarchical systems; insertion; k dynamic tables; Paired stacks; paired stacks; Program compilers; sequential memory segment; storage allocation; Storage allocation (computer); Subroutines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gil:1994:SFP, author = "J. Gil and Y. Matias", title = "Simple Fast Parallel Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "820", pages = "239--??", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Girault:1994:LCH, author = "M. Girault and J. Stern", title = "On the length of cryptographic hash-values used in identification schemes", journal = j-LECT-NOTES-COMP-SCI, volume = "839", pages = "202--215", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1994.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology; IACR; IEEE", } @Article{Goldreich:1994:TFF, author = "O. Goldreich and A. Wigderson", title = "Tiny families of functions with random properties: a quality-size trade-off for hashing", journal = "Proceedings of the \ldots{} annual ACM Symposium on Theory of Computing", volume = "26", number = "??", pages = "574--??", year = "1994", ISSN = "0737-8017", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @TechReport{Gong:1994:AKD, author = "Li Gong and T. A. (Thomas A.) Berson and T. Mark A. Lomas", title = "Authentication, key distribution, and secure broadcast in computer networks using no encryption or decryption", type = "Technical report", number = "SRI-CSL-94-08", institution = "SRI International, Computer Science Laboratory", address = "Menlo Park, CA, USA", pages = "13 + 4 + 10", year = "1994", bibdate = "Mon Oct 19 08:47:56 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Computer network protocols.; Computer networks --- Security measures; Computer security", remark = "Cover title. ``Also included: Using one-way functions for authentication / Li Gong; Secure, keyed, and collisionful hash functions / Thomas A. Berson, Li Gong, and T. Mark A. Lomas.'' ``May 1994.''", } @TechReport{Graefe:1994:DAE, author = "G. Graefe", title = "Disk Arrays for External Sorting and Hybrid Hash Join", institution = "????", pages = "??", year = "1994", bibdate = "Thu Jul 21 09:40:30 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "query execution sort merging partitioning bandwidth contribution productivity sequential device striping temporary files", } @InProceedings{Graefe:1994:SIW, author = "G. Graefe", title = "Sort-Merge-Join: An Idea Whose Time Has(h) Passed?", crossref = "IEEE:1994:DEI", pages = "406--417", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Graefe:1994:SVH, author = "G. Graefe and A. Linville and L. D. Shapiro", title = "Sort vs. Hash Revisited", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "6", number = "6", pages = "934--??", day = "1", month = dec, year = "1994", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, keywords = "Volcano dual duality join benchmarks equal different size skew TKDE", } @Article{Graefe:1994:VEP, author = "G. Graefe", title = "{Volcano}, An Extensible and Parallel Dataflow Query Processing System", journal = j-IEEE-TRANS-KNOWL-DATA-ENG # " (to appear)", volume = "??", number = "??", pages = "??", year = "1994", bibdate = "Sun Oct 25 10:31:00 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "overview file buffer operators iterators exchange choose-plan hash one-to-one match overflow TKDE", } @Article{Greene:1994:MHI, author = "D. Greene and M. Parnas and F. Yao", title = "Multi-Index Hashing for Information Retrieval", journal = "Annual Symposium on Foundations of Computer Science [papers]", volume = "35", number = "??", pages = "722--??", year = "1994", ISSN = "0272-5428", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Greene:1994:MIH, author = "D. Greene and M. Parnas and F. Yao", title = "Multi-index hashing for information retrieval", crossref = "Goldwasser:1994:P", pages = "722--731", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Grewe:1994:ILM, author = "Lynne Grewe and Avi Kak", title = "Interactive Learning of Multiple Attribute Hash Table for Fast {$3$D} Object Recognition", crossref = "Kak:1994:CVW", pages = "17--27", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Gupta:1994:RSD, author = "Rajiv Gupta and Scott A. Smolka and Shaji Bhaskar", title = "On Randomization in Sequential and Distributed Algorithms", journal = j-COMP-SURV, volume = "26", number = "1", pages = "7--86", month = mar, year = "1994", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Tue Sep 06 21:46:47 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "algorithms; analysis of algorithms; Byzantine agreement; computational complexity; CSP; dining philosophers problem; distributed algorithms; graph isomorphism; hashing; interactive probabilistic proof systems; leader election; message routing; nearest-neighbors problem; perfect hashing; primality testing; probabilistic techniques; randomized or probabilistic algorithms; randomized quicksort; sequential algorithms; transitive tournaments; universal hashing", } @InProceedings{Havas:1994:GHH, author = "G. Havas and B. S. Majewski and N. C. Wormald and Z. J. Czech", title = "Graphs, hypergraphs and hashing", crossref = "vanLeeuwen:1994:GTC", pages = "153--165", month = jun, year = "1994", bibdate = "Mon Oct 26 08:32:32 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Hecker:1994:GHG, author = "Y. C. Hecker and R. M. Bolle", title = "On Geometric Hashing and the Generalized {Hough} Transform", journal = j-IEEE-TRANS-SYST-MAN-CYBERN, volume = "24", number = "9", pages = "1328--??", day = "1", month = sep, year = "1994", CODEN = "ISYMAW", ISSN = "0018-9472, 1083-4427", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Hohl:1994:SIH, author = "Walter Hohl and Lai Xuejia and Thomas Meier and Christian Waldvogel", title = "Security of iterated hash functions based on block ciphers", journal = j-LECT-NOTES-COMP-SCI, volume = "773", pages = "379--390", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Horton:1994:MLS, author = "Graham Horton and Scott T. Leutenegger", title = "A multi-level solution algorithm for steady-state {Markov} chains", journal = j-SIGMETRICS, volume = "22", number = "1", pages = "191--200", month = may, year = "1994", CODEN = "????", DOI = "http://doi.acm.org/10.1145/183018.183040", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 11:16:44 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss--Seidel and optimal SOR algorithms for a variety of test problems. It is shown how the well-known iterative aggregation-disaggregation algorithm of Takahashi can be interpreted as a special case of the new method.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", } @Article{Hsiao:1994:PEM, author = "Hui-I Hsiao and Ming-Syan Chen and Philip S. Yu", title = "On Parallel Execution of Multiple Pipelined Hash Joins", journal = j-SIGMOD, volume = "23", number = "2", pages = "185--196", month = jun, year = "1994", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:48 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", classification = "C1160 (Combinatorial mathematics); C4250 (Database theory); C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C6120 (File organisation); C6150J (Operating systems); C6160B (Distributed DBMS)", keywords = "Allocation tree; Bushy execution tree; DBMS; Hash filters; Hash tables; Multiple pipelined hash joins; Parallel execution; Pipeline; Processor allocation; Query processing; Synchronous execution time", thesaurus = "Distributed databases; Parallel programming; Pipeline processing; Query processing; Resource allocation; Trees [mathematics]", xxcrossref = "Anonymous:1994:ASI", } @Article{Ihlenfeldt:1994:HCI, author = "Wolf Dietrich Ihlenfeldt and Johann Gasteiger", title = "Hash Codes for the Identification and Classification of Molecular Structure Elements", journal = j-J-COMPUTATIONAL-CHEM, volume = "15", number = "8", pages = "793--??", day = "1", month = aug, year = "1994", CODEN = "JCCHDD", ISSN = "0192-8651", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Kergommeaux:1994:PLP, author = "Jacques Chassin de Kergommeaux and Philippe Codognet", title = "Parallel Logic Programming Systems", journal = j-COMP-SURV, volume = "26", number = "3", pages = "295--336", month = sep, year = "1994", CODEN = "CMSVAN", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Fri Dec 16 18:45:42 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/185453.html", abstract = "Parallelizing logic programming has attracted much interest in the research community, because of the intrinsic OR- and AND-parallelisms of logic programs. One research stream aims at transparent exploitation of parallelism in existing logic programming languages such as Prolog, while the family of concurrent logic languages develops language constructs allowing programmers to express the concurrency---that is, the communication and synchronization between parallel processes---within their algorithms. This article concentrates mainly on transparent exploitation of parallelism and surveys the most mature solutions to the problems to be solved in order to obtain efficient implementations. These solutions have been implemented, and the most efficient parallel logic programming systems reach effective speedups over state-of-the-art sequential Prolog implementations. The article also addresses current and prospective research issues in extending the applicability and the efficiency of existing systems, such as models merging the transparent parallelism and the concurrent logic languages approaches, combination of constraint logic programming with parallelism, and use of highly parallel architectures.", acknowledgement = ack-nhfb, keywords = "and parallel languages; AND-parallelism; B.3.2 [Memory Structures]: Design Styles---shared memory; binding arrays; C.1.2 [Processor Architectures]: Multiple Data Stream Architectures; concurrent constraint programming; constraints; D.1.3 [Programming Techniques]: Concurrent Programming---parallel programming; D.1.6 [Programming Techniques]: Logic Programming; D.3.2 [Programming Languages]: Language Classifications--concurrent; D.3.4 [Programming Languages]: Processors---compilers; distributed; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic--logic programming; guard; hash windows; interpreters; languages; load balancing; massive parallelism; memory management; multisequential implementation techniques; nondeterminism; OR-parallelism; preprocessors; Prolog; scheduling parallel tasks; static analysis; Warren Abstract Machine", subject = "{\bf D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming.", } @Article{Krawczyk:1994:LBH, author = "H. Krawczyk", title = "{LFSR}-based hashing and authentication", journal = j-LECT-NOTES-COMP-SCI, volume = "839", pages = "129--139", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1994.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology; IACR; IEEE", } @Article{Krichevskii:1994:CSE, author = "R. E. Krichevskii and V. N. Potapov", title = "Combinatorial Source Encoding and Perfect Hashing", journal = j-IEEE-INT-SYMP-INF-THEORY, pages = "319--??", year = "1994", CODEN = "PISTFZ", ISSN = "0271-4655", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kroll:1994:DST, author = "Brigitte Kr{\"o}ll and Peter Widmayer", title = "Distributing a search tree among a growing number of processors", journal = j-SIGMOD, volume = "23", number = "2", pages = "265--276", month = jun, year = "1994", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:48 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Inst. fur Theor. Inf., ETH Zentrum, Zurich, Switzerland", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C4250 (Database theory); C6120 (File organisation); C6160B (Distributed DBMS)", keywords = "Classical data structures field; Distributed computer systems; Distributed data structures; Distributed variant; Efficiency requirements; High query efficiency; Linear hashing; Linear order; Nearest neighbor; Non-distributed trees; Queries; Range queries; Search tree; Storage space utilization; Uncontrolled splits", thesaurus = "Distributed databases; Query processing; Search problems; Tree data structures; Trees [mathematics]", xxcrossref = "Anonymous:1994:ASI", } @InProceedings{Lai:1994:ADB, author = "X. Lai and L. Knudsen", title = "Attacks on Double Block Length Hash Functions", crossref = "Anderson:1994:FSE", pages = "157--165", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Liang:1994:OMK, author = "J. Liang and C.-C. Chang and R. G. McFadyen and R. C. T. Lee", title = "Optimal Multiple Key Hashing Files for Orthogonal Range Queries", journal = j-INFO-SCI, volume = "79", number = "1", pages = "145--??", year = "1994", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Manolopoulos:1994:PLH, author = "Y. Manolopoulos and N. Lorentzos", title = "Performance of linear hashing schemes for primary key retrieval", journal = j-INFO-SYS, volume = "19", number = "5", pages = "433--??", year = "1994", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Martin:1994:PHJ, author = "T. P. Martin and P.-A. Larson and V. Deshpande", title = "Parallel Hash-Based Join Algorithms for a Shared-Everything Environment", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "6", number = "5", pages = "750--??", day = "1", month = oct, year = "1994", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Mourad:1994:LPH, author = "A. N. Mourad and R. J. T. Morris and A. Swami and H. C. Young", title = "Limits of parallelism in hash join algorithms", journal = j-PERF-EVAL, volume = "20", number = "1 / 3", pages = "301--??", day = "1", month = may, year = "1994", CODEN = "PEEVD9", ISSN = "0166-5316", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Nilli:1994:PHP, author = "A. Nilli", title = "Perfect hashing and probability", journal = j-COMBIN-PROBAB-COMPUT, volume = "3", number = "3", pages = "407--409", year = "1994", CODEN = "CPCOFG", ISSN = "0963-5483 (print), 1469-2163 (electronic)", ISSN-L = "0963-5483", MRclass = "68P10 (68P05 94A60)", MRnumber = "MR1300975 (95g:68018)", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", fjournal = "Combinatorics, Probability and Computing", } @Article{Olagunju:1994:DPH, author = "Amos Olagunju and Rashaunda Gourdine", title = "A Dynamic Perfect Hashing Algorithm Using Prime Numbers", journal = j-J-ELISHA-MITCHELL-SCI-SOC, volume = "110", number = "2", pages = "68--??", month = "Summer", year = "1994", CODEN = "JEMSA5", ISSN = "0013-6220", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Olagunju:1994:ILS, author = "Amos Olagunju and Rashaunda Gourdine", title = "Innovative Least Squares Algorithms for Perfect Hashing", journal = j-J-ELISHA-MITCHELL-SCI-SOC, volume = "110", number = "2", pages = "76--??", month = "Summer", year = "1994", CODEN = "JEMSA5", ISSN = "0013-6220", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Ostrovsky:1994:IHSa, author = "R. Ostrovsky and R. Venkatesan and M. Yung", title = "Interactive hashing simplifies zero-knowledge protocol design", journal = j-LECT-NOTES-COMP-SCI, volume = "765", pages = "267--273", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Ostrovsky:1994:IHSb, author = "R. Ostrovsky and R. Venkatesan and M. Yung", title = "Interactive Hashing Simplifies Zero-Knowledge Protocol Design", crossref = "Helleseth:1994:ACE", pages = "??", year = "1994", bibdate = "Thu Jul 21 09:40:32 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Papadopoulos:1994:NHA, author = "Constantinos V. Papadopoulos", title = "A New Hashing Algorithm for Parallel Processors", journal = j-PARALLEL-ALGORITHMS-APPL, volume = "4", number = "3--4", pages = "223--237", month = nov, year = "1994", CODEN = "PAAPEC", DOI = "http://dx.doi.org/10.1080/10637199408915466", ISSN = "1063-7192", ISSN-L = "1026-7689", bibdate = "Fri Jul 11 06:45:41 MDT 2008", bibsource = "http://nic.sanet.sk/ARCHIVES/confer/0043.html; http://www.cs.monash.edu.au/~lloyd/tilde/InterNet/Law/1995.CVP.html; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sics.se/europar95/plagiarism.html; parallelalgorithmsappl.bib", note = "This is a {\em plagiarized\/} article. See \path=http://www.sics.se/europar95/plagiarism.html= for details. The original work from which the material in this paper was stolen is due to Thomas J. Sheffler and Randal E. Bryant, CMU report MCU-CS-92-172.", URL = "http://www.informaworld.com/smpp/content~content=a777314733", acknowledgement = ack-nhfb, } @InProceedings{Patarin:1994:HFA, author = "J. Patarin", title = "How to find and avoid collisions for the knapsack hash function", crossref = "Helleseth:1994:ACE", pages = "305--317", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Patel:1994:AMH, author = "Jignesh M. Patel and Michael J. Carey and Mary K. Vernon", title = "Accurate modeling of the hybrid hash join algorithm", journal = j-SIGMETRICS, volume = "22", number = "1", pages = "56--66", month = may, year = "1994", CODEN = "????", DOI = "http://doi.acm.org/10.1145/183018.183025", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 11:16:44 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; sigmetrics.bib", abstract = "The join of two relations is an important operation in database systems. It occurs frequently in relational queries, and join performance is a significant factor in overall system performance. Cost models for join algorithms are used by query optimizers to choose efficient query execution strategies. This paper presents an efficient analytical model of an important join method, the hybrid hash join algorithm, that captures several key features of the algorithm's performance --- including its intra-operator parallelism, interference between disk reads and writes, caching of disk pages, and placement of data on disk(s). Validation of the model against a detailed simulation of a database system shows that the response time estimates produced by the model are quite accurate.", acknowledgement = ack-nhfb, } @InProceedings{Pippolini:1994:JIH, author = "F. Pippolini", title = "Join Indexes and Hash Algorithms: Two Methods for Join Processing", crossref = "Anonymous:1994:WAM", pages = "9--18", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Poblete:1994:AHS, author = "P. V. Poblete and A. Viola and J. I. Munro", title = "The Analysis of a Hashing Scheme by the Diagonal {Poisson} Transform", journal = j-LECT-NOTES-COMP-SCI, volume = "855", pages = "94--??", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sun Oct 25 10:32:41 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Prasanna:1994:SDP, author = "V. K. Prasanna and C.-L. Wang", title = "Scalable Data Parallel Object Recognition Using Geometric Hashing on the {CM-5}", crossref = "IEEE:1994:PSH", pages = "817--824", year = "1994", bibdate = "Mon Aug 26 10:38:41 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Preneel:1994:CHF, author = "Bart Preneel", title = "Cryptographic hash functions", journal = j-EUR-TRANS-TELECOMM, volume = "5", number = "4", pages = "431--448", year = "1994", CODEN = "ETTTET", ISSN = "1120-3862", bibdate = "Thu Jun 15 12:00:41 1995", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1994:DPD, author = "B. Preneel", title = "Design Principles for Dedicated Hash Functions", crossref = "Anderson:1994:FSE", pages = "71--82", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Preneel:1994:HFB, author = "Bart Preneel and Rene Govaerts and Joos Vandewalle", title = "Hash functions based on block ciphers: a synthetic approach", journal = j-LECT-NOTES-COMP-SCI, volume = "773", pages = "368--378", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Jan 20 16:08:00 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Prenel:1994:CHF, author = "B. Prenel", title = "Cryptographic Hash Functions", journal = j-EUR-TRANS-TELECOMM, volume = "5", number = "4", pages = "431--??", day = "1", month = jul, year = "1994", CODEN = "ETTTET", ISSN = "1120-3862", bibdate = "Sat May 25 15:13:19 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Prodinger:1994:ACP, author = "Helmut Prodinger", title = "An asymptotic comment on a paper by {A. Analyti} and {S. Pramanik}: {``Performance analysis of a main memory multi-directory hashing technique'' [Inform. Process. Lett. {\bf 45} (1993), no. 4, 191--197; MR 93k:68026]}", journal = j-INFO-PROC-LETT, volume = "49", number = "6", pages = "327--328", day = "22", month = mar, year = "1994", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P20", MRnumber = "1 266 958", bibdate = "Sat Apr 11 12:24:19 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Technical Univ of Vienna", affiliationaddress = "Vienna, Austria", classification = "921", journalabr = "Inf Process Lett", keywords = "Information retrieval; Mathematical transformations; Mellin transform; Performance evaluation", } @Article{Rigoutsos:1994:SPS, author = "Isidore Rigoutsos and Andrea Califano", title = "Searching in Parallel for Similar Strings", journal = j-IEEE-COMPUT-SCI-ENG, volume = "1", number = "2", pages = "60--75", month = "Summer", year = "1994", CODEN = "ISCEE4", ISSN = "1070-9924", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Distributed computation, probabilistic indexing and hashing techniques combine to create a novel approach to processing very large biological-sequence databases. Other data-intensive tasks could benefit.", acknowledgement = ack-nhfb, } @InProceedings{Roe:1994:PSC, author = "M. Roe", title = "Performance of Symmetric Ciphers and One-Way Hash Functions", crossref = "Anderson:1994:FSE", pages = "83--89", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Sabourin:1994:CCP, author = "Conrad F. Sabourin", title = "Computational character processing: character coding, input, output, synthesis, ordering, conversion, text compression, encryption, display hashing, literate programming : bibliography", publisher = "Infolingua", address = "Montr{\'e}al, PQ, Canada", pages = "vii + 579", year = "1994", ISBN = "2-921173-18-2", ISBN-13 = "978-2-921173-18-6", LCCN = "????", bibdate = "Tue Mar 03 12:09:08 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Sagonas:1994:XED, author = "Konstantinos Sagonas and Terrance Swift and David S. Warren", title = "{XSB} as an efficient deductive database engine", crossref = "Snodgrass:1994:PAS", pages = "442--453", year = "1994", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/191839/p442-sagonas/p442-sagonas.pdf; http://www.acm.org/pubs/citations/proceedings/mod/191839/p442-sagonas/", abstract = "This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have serious deficiencies when used as database systems. Accordingly, XSB has a fundamental bottom-up extension, introduced through tabling (or memoing)[4], which makes it appropriate as an underlying query engine for deductive database systems. Because it eliminates redundant computation, the tabling extension makes XSB able to compute all modularly stratified datalog programs finitely and with polynomial data complexity. For non-stratified programs, a meta-interpreter with the same properties is provided. In addition XSB significantly extends and improves the indexing capabilities over those of standard Prolog. Finally, its syntactic basis in HiLog [2], lends it flexibility for data modelling. \par The implementation of XSB derives from the WAM [25], the most common Prolog engine. XSB inherits the WAM's efficiency and can take advantage of extensive compiler technology developed for Prolog. As a result, performance comparisons indicate that XSB is significantly faster than other deductive database systems for a wide range of queries and stratified rule sets. XSB is under continuous development, and version 1.3 is available through anonymous ftp.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Design; Performance", subject = "Information Systems --- Database Management --- Systems (H.2.4): {\bf Query processing}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Logic and constraint programming}; Information Systems --- Database Management --- Languages (H.2.3): {\bf Prolog}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Trees}; Data --- Data Storage Representations (E.2): {\bf Hash-table representations}", } @TechReport{Schnorr:1994:BBC, author = "C. P. Schnorr and S. Vaudenay", title = "Black Box Cryptanalysis of Hash Networks based on Multipermutations", number = "TR-94-017", institution = inst-UC-BERKELEY-ICSI, address = inst-UC-BERKELEY-ICSI:adr, pages = "??", month = apr, year = "1994", bibdate = "Fri Jul 22 15:54:56 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Black box cryptanalysis applies to hash algorithms consisting of many small boxes, connected by a known graph structure, so that the boxes can be evaluated forward and backwards by given oracles. We study attacks that work for any choice of the black boxes, i.e., we scrutinize the given graph structure. For example we analyze the graph of the fast Fourier transform (FFT). We present optimal black box inversions of FFT-compression functions and black box constructions of collisions. This determines the minimal depth of FFT-compression networks for collision-resistant hashing. We propose the concept of multipermutation, which is a pair of orthogonal latin squares, as a new cryptographic primitive that generalizes the boxes of the FFT. Our examples of multipermutations are based on the operations circular rotation, bitwise xor, addition and multiplication.", acknowledgement = ack-nhfb, } @Article{Schnorr:1994:PF, author = "C. Schnorr and S. Vaudenay", title = "Parallel {FFT-Hashing}", journal = j-LECT-NOTES-COMP-SCI, volume = "809", pages = "149--??", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon May 13 11:52:14 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Seiden:1994:FSO, author = "Steven S. Seiden and Daniel S. Hirschberg", title = "Finding succinct ordered minimal perfect hash functions", journal = j-INFO-PROC-LETT, volume = "51", number = "6", pages = "283--288", day = "26", month = sep, year = "1994", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P05 (68P20)", MRnumber = "1 294 708", bibdate = "Sat Apr 11 12:24:19 MDT 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Irvine, CA, USA", classification = "721.1; 723.1; 723.2", journalabr = "Inf Process Lett", keywords = "Computational complexity; Data description; Data structures; Ordered minimal perfect hash functions; Perfect hashing; Predefined key set collision; Storage allocation (computer); Table lookup; Unused space", } @Article{Shin:1994:NJA, author = "Dong Keun Shin and Arnold Charles Meltzer", title = "A new join algorithm", journal = j-SIGMOD, volume = "23", number = "4", pages = "13--18", month = dec, year = "1994", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:50 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Commun. Syst. Res. and Dev. Centre, Samsung Electron. Co. Ltd., Seoul, South Korea", classification = "C4250 (Database theory); C6130 (Data handling techniques)", keywords = "Divide and conquer strategy; Hash join algorithm; Join attribute comparisons; Join relational operation; Nested-loop join algorithm; Sort-merge join algorithm; Stack oriented filter technique", thesaurus = "Database theory; Divide and conquer methods; Merging", } @Article{Stallings:1994:SSH, author = "William Stallings", title = "{SHA}: The {Secure Hash Algorithm}", journal = j-DDJ, volume = "19", number = "4", pages = "32, 34", day = "1", month = apr, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 08:52:50 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover database", abstract = "The secure hash algorithm (SHA), based on Ron Rivest's MD4 algorithm and developed by the National Institute of Standards and Technology, can be used in any security application that requires a hash code.", acknowledgement = ack-nhfb, affiliation = "Comp-Comm Consulting, Brewster, MA, USA", classification = "B6120B (Codes); C6120 (File organisation); C6130S (Data security)", keywords = "Digital Signature Standard; Federal information-processing standard; MD4 algorithm; Message digests; National Institute of Standards and Technology; Secure Hash Algorithm; Security application; SHA", thesaurus = "Cryptography; File organisation; Standards", } @Article{Stinson:1994:CTU, author = "D. R. Stinson", title = "Combinatorial Techniques for Universal Hashing", journal = j-J-COMP-SYS-SCI, volume = "48", number = "2", pages = "337--346", day = "1", month = apr, year = "1994", CODEN = "JCSSBM", ISSN = "0022-0000", bibdate = "Sat May 25 15:13:25 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Stinson:1994:UHA, author = "D. R. Stinson", title = "Universal hashing and authentication codes", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "4", number = "4", pages = "369--380", year = "1994", CODEN = "DCCREC", ISSN = "0925-1022 (print), 1573-7586 (electronic)", MRclass = "94A60 (68P20)", MRnumber = "95g:94018", bibdate = "Tue Feb 9 17:57:12 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; MathSciNet database", acknowledgement = ack-nhfb, } @InProceedings{Tillich:1994:GHF, author = "J.-P. Tillich and G. Zemor", title = "Group-theoretic hash functions", crossref = "Cohen:1994:ACF", pages = "90--110", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tillich:1994:HS, author = "J.-P. Tillich and G. Zemor", title = "Hashing with {SL2}", journal = j-LECT-NOTES-COMP-SCI, volume = "839", pages = "40--49", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Sep 15 10:01:31 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1994.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "CRYPTO; cryptology; IACR; IEEE", } @Article{Tsai:1994:GHL, author = "F. C. D. Tsai", title = "Geometric hashing with line features", journal = j-PATTERN-RECOGN, volume = "27", number = "3", pages = "377--??", month = mar, year = "1994", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{vanOorschot:1994:PCS, author = "P. C. {van Oorschot} and M. J. Wiener", title = "Parallel Collision Search with Application to Hash Functions and Discrete Logarithms", crossref = "ACM:1994:CCS", pages = "210--218", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{vanTrung:1994:CCC, author = "T. {van Trung}", title = "A Combinatorial Characterization of Certain Universal Classes of Hash Functions", journal = j-J-COMB-DES, volume = "2", number = "3", pages = "161--??", day = "1", month = may, year = "1994", CODEN = "JDESEU", ISSN = "1063-8539", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Vingralek:1994:DFO, author = "Radek Vingralek and Yuri Breitbart and Gerhard Weikum", title = "Distributed file organization with scalable cost\slash performance", crossref = "Snodgrass:1994:PAS", pages = "253--264", year = "1994", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/191839/p253-vingralek/p253-vingralek.pdf; http://www.acm.org/pubs/citations/proceedings/mod/191839/p253-vingralek/", abstract = "This paper presents a distributed file organization for record-structured, disk-resident files with key-based exact-match access. The file is organized into buckets that are spread across multiple servers, where a server may hold multiple buckets. Client requests are serviced by mapping keys onto buckets and looking up the corresponding server in an address table. Dynamic growth in terms of file size and access load is supported by bucket splits and migration onto other existing or newly acquired servers. \par The significant and challenging problem addressed here is how to achieve scalability so that both the file size and the client throughput can be scaled up by linearly increasing the number of servers and dynamically redistributing data. Unlike previous work with similar objectives, our data redistribution considers explicitly the cost/performance ratio of the system by aiming to minimize the number of servers that are acquired to provide the required performance. A new server is acquired only if the overall server utilization in the system does not drop below a specified threshold. Preliminary simulation results show that the goal of scalability with controlled cost/performance is indeed achieved to a large extent.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Experimentation; Performance", subject = "Information Systems --- Database Management --- Systems (H.2.4): {\bf Distributed databases}; Data --- Files (E.5): {\bf Organization/structure}; Data --- Data Storage Representations (E.2): {\bf Hash-table representations}", } @Article{Wang:1994:SDP, author = "Cho-Li Wang and Viktor K. Prasanna and Hyoung J. Kim and Ashfaq A. Khokhar", title = "Scalable Data Parallel Implementations of Object Recognition Using Geometric Hashing", journal = j-J-PAR-DIST-COMP, volume = "21", number = "1", pages = "96--109", month = apr, year = "1994", CODEN = "JPDCER", DOI = "http://dx.doi.org/10.1006/jpdc.1994.1044", ISSN = "0743-7315 (print), 1096-0848 (electronic)", bibdate = "Thu Mar 9 09:18:54 MST 2000", bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1044/production; http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1044/production/pdf", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and picture processing); C6120 (File organisation)", corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA", keywords = "balancing technique; CM-5; concurrent processing; file organisation; geometric hashing; image recognition; image understanding; load-; MP-1; multiple; object recognition; occluded scenes; parallel algorithms; probes; real time vision systems; scalable data parallel implementations; synchronisation", treatment = "P Practical", } @Book{Witten:1994:MGC, author = "Ian H. Witten and Alistair Moffat and Timothy C. Bell", title = "Managing Gigabytes: Compressing and Indexing Documents and Images", publisher = pub-VNR, address = pub-VNR:adr, pages = "xiv + 429", year = "1994", ISBN = "0-442-01863-0", ISBN-13 = "978-0-442-01863-4", LCCN = "TA1637 .W58 1994", bibdate = "Thu May 12 08:02:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "The software for full-text indexing described in this book, and errata for the book, are available for anonymous ftp from \path=munnari.oz.au= in the directory \path=/pub/mg=.", price = "US\$54.95", acknowledgement = ack-nhfb, } @Article{Wu:1994:AGH, author = "T.-C. Wu and C.-C. Chang", title = "Application of geometric hashing to iconic database retrieval", journal = j-PATTERN-RECOGN-LETT, volume = "15", number = "9", pages = "871--??", day = "1", month = sep, year = "1994", CODEN = "PRLEDG", ISSN = "0167-8655", bibdate = "Sat May 25 15:13:52 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Zemor:1994:HFC, author = "Gilles Z{\'e}mor", title = "Hash functions and {Cayley} graphs", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "4", number = "4", pages = "381--394", year = "1994", CODEN = "DCCREC", ISSN = "0925-1022 (print), 1573-7586 (electronic)", MRclass = "94A60 (05C25)", MRnumber = "96d:94007", bibdate = "Tue Feb 9 17:57:12 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Zhao:1994:DDBa, author = "X. Zhao and R. G. Johnson and N. J. Martin", title = "{DBJ} --- {A} Dynamic Balancing Hash Join algorithm in multiprocessor database systems", journal = j-INFO-SYS, volume = "19", number = "1", pages = "89--100", month = jan, year = "1994", CODEN = "INSYD6", ISSN = "0306-4379", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Zhao:1994:DDBb, author = "X. Zhao and R. G. Johnson and N. J. Martin", title = "{DBJ} --- {A} Dynamic Balancing Hash Join Algorithm in Multiprocessor Database Systems", crossref = "Jarke:1994:ADT", pages = "301--308", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Zhao:1994:DDBc, author = "X. Zhao and R. G. Johnson and N. J. Martin", title = "{DBJ} --- a Dynamic Balancing Hash Join algorithm in multiprocessor database systems", crossref = "Jarke:1994:ADT", pages = "89--100", year = "1994", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Zheng:1994:RSS, author = "Yuliang Zheng and T. Hardjono and J. Seberry", title = "Reusing shares in secret sharing schemes", journal = j-COMP-J, volume = "37", number = "3", pages = "199--205", month = "????", year = "1994", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Centre for Comput. Security Res., Wollongong Univ., NSW, Australia", classcodes = "B6120B (Codes); C6130S (Data security)", classification = "B6120B (Codes); C6130S (Data security)", corpsource = "Centre for Comput. Security Res., Wollongong Univ., NSW, Australia", keywords = "(t w) threshold; (T w) threshold scheme; cryptographically strong pseudo-random functions; Cryptographically strong pseudo-random functions; cryptography; elements; file organisation; random functions; scheme; secret sharing schemes; Secret sharing schemes; shareholders; Shareholders; single string; Single string; threshold; universal hash functions; Universal hash functions", thesaurus = "Cryptography; File organisation; Random functions; Threshold elements", treatment = "P Practical", } @Article{Anonymous:1995:AUC, author = "Anonymous", title = "Algorithms Update: Collisions in {MD4}; More Developments with Keyed Hash Functions; {A} Linear Protocol Failure for {RSA} With Exponent Three", journal = j-CRYPTOBYTES, volume = "1", number = "3", pages = "4--6", month = "Autumn", year = "1995", bibdate = "Tue Oct 20 12:08:21 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "ftp://ftp.rsa.com/pub/cryptobytes/crypto1n3.pdf", acknowledgement = ack-nhfb, } @Manual{Anonymous:1995:FSH, author = "Anonymous", title = "{FIPS} 180-1, Secure Hash Standard", volume = "180-1", organization = "National Institute of Standards and Technology, US Department of Commerce", address = "Washington, DC, USA", pages = "??", month = apr, year = "1995", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", series = "Federal Information Processing Standard (FIPS)", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 17]{Preneel:1997:CHF}, \cite[Ref. 16]{Bellare:1996:MAU}, \cite[Ref. 1]{Dobbertin:1996:SMA}.", } @Article{Anonymous:1995:SHS, author = "Anonymous", title = "Super Hash Serves Up Super Privacy On The Internet", journal = j-COMP-TECH-REV, volume = "15", number = "4", pages = "1--??", month = apr, year = "1995", ISSN = "0278-9647", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Barn:1995:ODP, author = "C. Barn and G. Fecteau and A. Goyal and H.-i. Hsiao and A. Jhingran and S. Padmanabhan and W. Wilson", title = "An overview of {DB2} Parallel Edition", journal = j-SIGMOD, volume = "24", number = "2", pages = "460--462", month = may, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Dec 9 16:02:09 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "IBM Canada Ltd., Toronto, Ont., Canada", classification = "C4250 (Database theory); C5620L (Local area networks); C6110P (Parallel programming); C6120 (File organisation); C6150N (Distributed systems software); C6160B (Distributed databases)", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", keywords = "Cost based parallel query optimizer; Database system; DB2 Parallel Edition; DB2 PE; Hash partitioning strategy; IBM family; Independent database manager; Independent logical database nodes; Logical nodes; Message passing; MPP system; Open DB2 client/server database products; Query optimization; Runtime system; Shared nothing architecture; Storage model; Symmetric multiprocessor; System resources; Table partitioning information", thesaurus = "Client-server systems; Distributed databases; Parallel programming; Query processing; Software reviews; Storage management", xxcrossref = "Anonymous:1995:ASI", } @InProceedings{Bierbrauer:1995:CUH, author = "J. Bierbrauer", title = "{$A^2$-codes} from universal hash classes", crossref = "Guillou:1995:ACE", pages = "311--318", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0921.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0921/09210311.htm; http://link.springer-ny.com/link/service/series/0558/papers/0921/09210311.pdf", acknowledgement = ack-nhfb, } @Article{Blasius:1995:GRR, author = "Arlene Blasius", title = "Generating a Rotation Reduction Perfect Hashing Function", journal = j-MATH-MAG, volume = "68", number = "1", pages = "35--??", day = "1", month = feb, year = "1995", CODEN = "MAMGA8", ISSN = "0025-570X", bibdate = "Sat May 25 15:13:55 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Blustein:1995:IBV, author = "James Blustein", title = "Implementing Bit Vectors In {C}", journal = j-DDJ, volume = "20", number = "8", pages = "42, 44, 46, 96, 98--100", day = "1", month = aug, year = "1995", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:16:52 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Bit vectors provide an efficient means of implementing arrays of Boolean values. James originally implemented bit vectors to hash document signatures and analyze statistics.", acknowledgement = ack-nhfb, affiliation = "Univ. of Western Ontario, London, Ont., Canada", classification = "C1140Z (Other topics in statistics); C4140 (Linear algebra); C6110 (Systems analysis and programming); C6120 (File organisation); C7310 (Mathematics computing)", keywords = "3D matrices; Arrays; Bit vectors; Bloom filter program; Boolean values; Data analysis; Data selection; Document signatures; Hashing; Matrix manipulation routines; Menu system; Portable C implementation; Statistical analysis program; Submatrix copying", thesaurus = "Arrays; C listings; Data structures; File organisation; Matrix algebra; Statistical analysis; Vectors", } @Article{Boukliev:1995:NTL, author = "I. G. Boukliev", title = "New ternary linear codes", journal = j-IEEE-INT-SYMP-INF-THEORY, volume = "????", number = "????", pages = "500--??", month = "????", year = "1995", CODEN = "PISTFZ", ISSN = "0271-4655", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Broadbery:1995:IDE, author = "P. A. Broadbery and T. G{\'o}mez-D{\'\i}az and S. M. Watt", title = "On the Implementation of Dynamic Evaluation", crossref = "Levelt:1995:IPI", pages = "77--84", year = "1995", bibdate = "Thu Mar 12 08:42:30 MST 1998", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/220346/p77-broadbery/", abstract = "Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes we need to produce results for all possible branches in the decision tree, while on other occasions it may be sufficient to compute a single result which satisfies certain properties. This technique finds use in computer algebra where computing the correct result depends on recognising and properly handling special cases of parameters. In previous work, programs using dynamic evaluation have explored all branches of decision trees by repeating the computations prior to decision points. The paper presents two new implementations of dynamic evaluation which avoid recomputing intermediate results. The first approach uses Scheme `continuations' to record the state for resuming program execution. The second implementation uses the Unix `fork' operation to form new processes to explore alternative branches in parallel. These implementations are based on modifications to Lisp- and C-based run-time systems for the Axiom Version 2 extension language (previously known as $A^{\mbox{Hash}}$). This allows the same high-level source code to be compared using the `re-evaluation', the `continuation', and the `fork' implementations.", acknowledgement = ack-nhfb, affiliation = "Numerical Algorithms Group Ltd., Oxford, UK", classification = "C1140E (Game theory); C1160 (Combinatorial mathematics); C6130 (Data handling techniques); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", keywords = "algebraic computation, Dynamic evaluation; algorithms; Axiom Version 2 extension language; C-based run-time systems; Computer algebra; Decision points; Decision tree; High-level source code; ISSAC; languages; Lisp-based run-time systems; Multiple results; Program execution; Re-evaluation; Scheme continuations; State recording; symbolic computation; Unix fork operation", subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", thesaurus = "Decision theory; Symbol manipulation; System monitoring; Trees [mathematics]; Unix", } @Article{Cai:1995:UMD, author = "Jiazhen Cai and R. Paige", title = "Using multiset discrimination to solve language processing problems without hashing", journal = j-THEOR-COMP-SCI, volume = "145", number = "1-2", pages = "189--228", day = "10", month = jul, year = "1995", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:15:15 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, classification = "C4210L (Formal languages and computational linguistics); C6180N (Natural language processing)", corpsource = "Dept. of Comput. Sci., Courant Inst. of Math. Sci., New York, NY, USA", keywords = "basic block optimization; compiler methodology; global optimization; grammar manipulation; grammars; isomorphism problems; language processing problems; lexicographic sorting; multiset discrimination; natural languages; symbol table formation; worst case running time", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Chang:1995:CHE, author = "Ye-In Chang and Chien-I Lee", title = "Climbing Hashing for Expansible Files", journal = j-INFO-SCI, volume = "86", number = "1 / 3", pages = "77--??", day = "1", month = sep, year = "1995", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Charnes:1995:ASH, author = "C. Charnes and J. Pieprzyk", title = "Attacking the {SL2} hashing scheme", journal = j-LECT-NOTES-COMP-SCI, volume = "917", pages = "322--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Chen:1995:ASR, author = "Ming-Syan Chen and Mingling Lo and Philip S. Yu and Honesty C. Young", title = "Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins", journal = j-IEEE-TRANS-KNOWL-DATA-ENG, volume = "7", number = "4", pages = "656--??", day = "1", month = aug, year = "1995", CODEN = "ITKEEH", ISSN = "1041-4347", bibdate = "Sat May 25 15:14:35 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Chen:1995:STP, author = "Tzer-Shyong Chen and Feipei Lai and Rung-Ji Shang", title = "A simple tree pattern matching algorithm for code generator", crossref = "IEEE:1995:PNA", pages = "162--167", month = "", year = "1995", LCCN = "????", bibdate = "Wed Oct 30 05:42:27 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes a simple tree pattern matching algorithm for the code generator of compilers. The intermediate code (Register Transfer Language) is matched with the tree-rewriting rules of the instruction description which describes the target architecture to generate the assembly code. The hashing function is used in our system to transform a tree pattern matching problem into a simple number comparison. Compared with GNU C compiler (gcc), the tree pattern matching time can be reduced by 69\% and the compiler time by 6\%, and the space of the instruction descriptions can be reduced by 4.10 times on DLX and 2.14 on SPARC. The size of table, which is necessary for the code generator, is quite small in our method.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan", classification = "C4240 (Programming and algorithm theory); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", keywords = "Assembly code; Code generator; Compiler generator; Compiler time; DLX; GNU C compiler; Hashing function; Instruction description; Register Transfer Language; SPARC; Tree pattern matching algorithm; Tree pattern matching time; Tree-rewriting rules", thesaurus = "Assembly language; Compiler generators; File organisation; Pattern matching; Tree searching", } @Article{Click:1995:GCM, author = "Cliff Click", title = "Global code motion: global value numbering", journal = j-SIGPLAN, volume = "30", number = "6", pages = "246--257", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p246-click/", abstract = "Optimizing compilers should treat the machine independent optimizations (e.g., conditional constant propagation, global value numbering) and code motion issues separately. Removing the code motion requirements from the machine independent optimizations allows stronger optimizations using simpler algorithms. Preserving a legal schedule is one of the prime sources of complexity in algorithms like PRE (E. Morel and C. Renvoise, 1979) or global congruence finding (B. Alpern et al., 1988). We present a straightforward near linear time algorithm for performing global code motion (GCM). Our GCM algorithm hoists code out of loops and pushes it into more control dependent (and presumably less frequently executed) basic blocks. GCM is not optimal in the sense that it may lengthen some paths; it hoists control dependent code out of loops. This is profitable if the loop executes at least once; frequently it is very profitable. GCM relies only on dependences between instructions; the original schedule order is ignored. GCM moves instructions, but it does not alter the control flow graph (CFG) nor remove redundant code. GCM benefits from CFG shaping (such as splitting control dependent edges, or inserting loop landing pads). GCM allows us to use a simple hash based technique for global value numbering (GVN).", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Lab., Cambridge, MA, USA", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", keywords = "algorithms; CFG; CFG shaping; Code motion issues; Code motion requirements; Complexity; Control dependent code; Control dependent edges; Control flow graph; experimentation; GCM; GCM algorithm; Global code motion; Global value numbering; Legal schedule; Loop landing pads; Machine independent optimizations; Near linear time algorithm; Optimizing compilers; Simple hash based technique", remark = "Published as part of the Proceedings of PLDI'95.", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", thesaurus = "File organisation; Optimising compilers; Programming", } @PhdThesis{Daemen:1995:HFC, author = "Joan Daemen", title = "Hash Function and Cipher Design: Strategies Based on Linear and Differential Cryptanalysis", type = "{Ph.D.} Thesis", school = "Katholieke Universiteit Leuven", address = "Leuven, Belgium", pages = "280", month = mar, year = "1995", bibdate = "Fri Oct 25 16:08:13 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://wwwlib.umi.com/dissertations/fullcit/f548867", abstract = "This thesis contains a new approach to design block ciphers, synchronous and self-synchronizing stream ciphers and cryptographic hash functions. The goal of this approach is the specification of cryptographic schemes that are secure, simple to describe and that can be implemented efficiently on a wide variety of platforms. Key words are simplicity, symmetry and parallelism. An overview of the different types of ciphers, encryption schemes and hash functions is given, the nature of cryptographic security is discussed and some new security-related definitions are presented. The design is mainly guided by the resistance against differential and linear cryptanalysis. The basic mechanisms of these two attacks are investigated and their structure is clarified by adopting a new formalism for their description and analysis. The resistance against differential and linear cryptanalysis is obtained by applying the new wide trail strategy that emphasizes the mechanism of diffusion. The application of this strategy for the different types of ciphers and hash functions leads to a number of new structures and specific designs. A new self-reciprocal block cipher structure is introduced together with a new type of cryptographic component: the stream/hash module. The design of single-bit self-synchronizing stream ciphers is treated and the potential weaknesses of ciphers that make use of arithmetic operations are analyzed. The design approach is supported by a number of new cryptanalytic results.", acknowledgement = ack-nhfb, xxtitle = "Cipher and hash function strategies based on linear and differential cryptanalysis", } @Article{Du:1995:RMQ, author = "Weimin Du and Ming-Chien Shan and Umeshwar Dayal", title = "Reducing multidatabase query response time by tree balancing", journal = j-SIGMOD, volume = "24", number = "2", pages = "293--303", month = may, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:52 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Lab., Palo Alto, CA, USA", classification = "C1180 (Optimisation techniques); C4250 (Database theory); C6160B (Distributed databases)", keywords = "Algorithm; Distributed database; Hash join; Hash joins; Join node; Left deep join trees; Long delay; Multidatabase query response time reduction; Optimization strategy; Query processing; Resource allocation; Sort merge a; Subordinate join node; Tree balancing", thesaurus = "Database theory; Distributed databases; Optimisation; Query processing; Resource allocation", xxcrossref = "Anonymous:1995:ASI", } @Article{Gardarin:1995:OFE, author = "Georges Gardarin and Fernando Machuca and Philippe Pucheral", title = "{OFL}: a functional execution model for object query languages", journal = j-SIGMOD, volume = "24", number = "2", pages = "59--70", month = may, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:52 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "PRISM Lab., Univ. of Versailles/Saint-Quentin, France", classification = "C4250 (Database theory); C6110J (Object-oriented programming); C6140D (High level languages); C6160J (Object-oriented databases)", keywords = "Complex object algebra; Complex object queries; Execution model; Function result memorization; Functional execution model; Functional paradigm; Geographical benchmark; Graph traversals; Hashing tables; Hybrid strategies; Memoization; Multivalued attributes; Object Functional Language; Object manager; Object query languages; OFL; Pipelined traversals; Query compilers; Set oriented traversals", thesaurus = "Functional languages; Object-oriented databases; Object-oriented languages; Query languages; Query processing", xxcrossref = "Anonymous:1995:ASI", } @InProceedings{Geiselmann:1995:NHF, author = "W. Geiselmann", title = "A Note on the Hash Function of {Tillich} and {Zemor}", crossref = "Boyd:1995:CCC", pages = "257--263", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Gerber:1995:IOX, author = "Bob Gerber", title = "{Informix} Online {XPS}", journal = j-SIGMOD, volume = "24", number = "2", pages = "463--463", month = may, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:52 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150N (Distributed systems software); C6160B (Distributed databases)", keywords = "Informix Dynamic Scalable Architecture; Informix Extended Parallel Server; Informix Online XPS; Large SMP systems; Light access methods; Linear performance speedups; Loosely coupled environments; Massively parallel clusters; Online database servers; Online/DSA servers; Open systems spectrum; Parallel database systems; Parallel resource management; Pipelined hash partitioned operators; SMP based high performance parallel data query; Table partitioning; Uniprocessor systems; XPS; XPS multithreaded process groups", thesaurus = "Distributed databases; File servers; Parallel programming; Query processing", xxcrossref = "Anonymous:1995:ASI", } @Article{Gong:1995:CKH, author = "Li Gong", title = "Collisionful keyed hash functions with selectable collisions", journal = j-INFO-PROC-LETT, volume = "55", number = "3", pages = "167--170", day = "11", month = aug, year = "1995", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P20 (94A60)", MRnumber = "1 351 890", bibdate = "Sat Apr 11 12:24:19 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Graefe:1995:FAU, author = "Goetz Graefe and Richard L. Cole", title = "Fast Algorithms for Universal Quantification in large Databases", journal = j-TODS, volume = "20", number = "2", pages = "187--236", month = jun, year = "1995", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; 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/1995-20-2/p187-graefe/p187-graefe.pdf; http://www.acm.org/pubs/citations/journals/tods/1995-20-2/p187-graefe/; http://www.acm.org/pubs/toc/Abstracts/tods/210202.html", abstract = "Universal quantification is not supported directly in most database systems despite the fact that it adds significant power to a system's query processing and inference capabilities, in particular for the analysis of many-to-many relationships and of set-valued attributes. One of the main reasons for this omission has been that universal quantification algorithms and their performance have not been explored for large databases. In this article, we describe and compare three known algorithms and one recently proposed algorithm for relational division, the algebra operator that embodies universal quantification. For each algorithm, we investigate the performance effects of explicit duplicate removal and referential integrity enforcement, variants for inputs larger than memory, and parallel execution strategies. Analytical and experimental performance comparisons illustrate the substantial differences among the algorithms. Moreover, comparisons demonstrate that the recently proposed division algorithm evaluates a universal quantification predicate over two relations as fast as hash (semi-) join evaluates an existential quantification predicate over the same relations. Thus, existential and universal quantification can be supported with equal efficiency by adding the recently proposed algorithm to a query evaluation system. A second result of our study is that universal quantification should be expressed directly in a database query language, because most query optimizers do not recognize the rather indirect formulations available in SQL as relational division and therefore produce very poor evaluation plans for many universal quantification queries.", acknowledgement = ack-nhfb, generalterms = "Algorithms; Experimentation", keywords = "algorithms; experimentation", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf E.5}: Data, FILES. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Data manipulation languages (DML).", } @Article{Gregg:1995:HFI, author = "X. Gregg", title = "Hashing {Forth}: It's a topic discussed so nonchalantly that neophytes hesitate to ask how it works", journal = j-FORTH-DIMENSIONS, volume = "17", number = "4", pages = "13--??", year = "1995", CODEN = "FODMD5", ISSN = "0884-0822", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Grewe:1995:ILM, author = "Lynne Grewe and Avinash C. Kak", title = "Interactive Learning of a Multiple-Attribute Hash Table Classifier for Fast Object Recognition", journal = j-COMP-VIS-IMAGE-UNDERSTANDING, volume = "61", number = "3", pages = "387--416", month = may, year = "1995", CODEN = "CVIUF4", ISSN = "1077-3142 (print), 1090-235X (electronic)", bibdate = "Sat Feb 8 07:08:38 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Purdue Univ", affiliationaddress = "West Lafayette, IN, USA", classification = "723.5; 741.1; 741.2; 921", journalabr = "CVIU Comput Vision Image Understanding", keywords = "Color; Computer vision; Decision theory; Decision trees; Geometry; Hash table; Interactive learning; Learning systems; Multiple attribute classifier; Object recognition; Three dimensional", } @Article{Hagerup:1995:FPP, author = "Torben Hagerup and J{\"o}rg Keller", title = "Fast parallel permutation algorithms", journal = j-PARALLEL-PROCESS-LETT, volume = "5", number = "2", pages = "139--148", month = jun, year = "1995", CODEN = "PPLTEE", ISSN = "0129-6264", bibdate = "Mon Apr 14 10:50:40 MDT 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "Max-Planck-Inst f{\"u}r Informatik", classification = "722.1; 722.4; 723.1; 723.5; 921.6; C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", countrypub = "Singapore", journalabr = "Parallel Process Lett", keywords = "address space; algorithms; computational complexity; EREW PRAM; Fast parallel permutation algorithm; file organisation; Numerical methods; parallel; Parallel algorithms; parallel permutation algorithms; PRAM emulation; prefix; Program processors; Random access storage; Real time systems; rehashing; Shared memory; Storage allocation (computer); summation", treatment = "T Theoretical or Mathematical", } @InProceedings{Hart:1995:SHC, author = "John C. Hart and Wayne O. Cochran and Patrick J. Flynn", title = "Similarity Hashing: {A} computer vision solution to the inverse problem of linear fractals", crossref = "Anonymous:1995:NAF", month = jul, year = "1995", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", } @Article{Hirano:1995:IEH, author = "Yasuhiro Hirano and Tetsuji Satoh and Fumiaki Miura", title = "Improved Extendible Hashing with High Concurrency", journal = j-SYS-COMP-JAPAN, volume = "26", number = "13", pages = "1--??", year = "1995", CODEN = "SCJAEP", ISSN = "0882-1666", bibdate = "Sat May 25 15:14:46 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Itoh:1995:ANS, author = "Toshiya Itoh and Kei Hayashi", title = "Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing", journal = j-IEICE-TRANS-FUND-ELECT, volume = "78", number = "1", pages = "19--??", day = "1", month = jan, year = "1995", CODEN = "IFESEX", ISSN = "0916-8508", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Joux:1995:PAA, author = "A. Joux and L. Granboulan", title = "A practical attack against knapsack based hash functions", crossref = "DeSantis:1995:ACE", pages = "58--66", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kak:1995:ILM, author = "Avinash C. Kak and Lynne Grewe", title = "Interactive Learning of a Multiple-Attribute Hash Table Classifier for Fast Object Recognition", journal = j-COMP-VIS-IMAGE-UNDERSTANDING, volume = "61", number = "3", pages = "387--??", day = "1", month = may, year = "1995", CODEN = "CVIUF4", ISSN = "1077-3142 (print), 1090-235X (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @PhdThesis{Khan:1995:PDH, author = "Zahira S. Khan", title = "Performance of the distributed hash join algorithms in a distributed heterogeneous supercomputing environment", type = "Thesis (Ph.D.)", school = "Temple University", address = "Philadelphia, PA, USA", pages = "xxii + 220", year = "1995", bibdate = "Fri Aug 30 08:01:51 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Algorithms", } @InProceedings{Knudsen:1995:NAA, author = "L. R. Knudsen and X. Lai", title = "New attacks on all double block length hash functions of hash rate 1, including the {parallel-DM}", crossref = "DeSantis:1995:ACE", pages = "410--418", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Krawczyk:1995:NHF, author = "H. Krawczyk", title = "New hash functions for message authentication", crossref = "Guillou:1995:ACE", pages = "301--310", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Li:1995:CKH, author = "G. Li", title = "Collisionful keyed hash functions with selectable collisions", journal = j-INFO-PROC-LETT, volume = "55", number = "3", publisher = "Elsevier Science", pages = "167--170", day = "11", month = aug, year = "1995", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "4", } @Article{Liang:1995:PHF, author = "S. Liang", title = "A perfect Hashing function for exact diagonalization of many-body systems of identical particles", journal = j-COMP-PHYS-COMM, volume = "92", number = "1", pages = "11--??", day = "1", month = nov, year = "1995", CODEN = "CPHCBZ", ISSN = "0010-4655 (print), 1879-2944 (electronic)", bibdate = "Sat May 25 15:15:11 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Lomas:1995:RBH, author = "Mark Lomas and Bruce Christianson", title = "Remote booting in a hostile world: to whom am {I} speaking? (Computer security)", journal = j-COMPUTER, volume = "28", number = "1", pages = "50--54", month = jan, year = "1995", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", bibdate = "Fri Sep 13 14:46:02 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Today's networked computer systems are very vulnerable to attack. The collision-rich hash function described here permits a secure boot across a public network with no security features.", acknowledgement = ack-nhfb, affiliation = "Comput. Lab., Cambridge Univ., UK", classification = "C0310D (Computer installation management); C5620W (Other computer networks); C6130S (Data security); C6150J (Operating systems)", keywords = "Attack; Collision-rich hash function; Cryptographic means; Exhaustive off-line search; Insecure network; Maintenance; Networked computer systems; Operating systems; Reconfiguration; Remote booting; Remote loading; Remotely loaded software; Security; Software products; Stand-alone workstation; Terminal software; Trojan horse; Upgrade distribution; Users; Workstation; Workstation protection; X Window System", thesaurus = "Cryptography; Operating systems [computers]; Wide area networks; Workstations", xxnote = "Check title??", } @Article{Macii:1995:ECP, author = "Enrico Macii", title = "The Effect of Clustering on the Performance of Hashing Algorithms", journal = "Conference proceedings / IEEE Pacific Rim Conference on Communications, Computers and Signal Processing; sponsored by IEEE Victoria Section \ldots{} [et al.]", pages = "149--152", month = may, year = "1995", ISSN = "0893-4266", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Meijer:1995:HFB, author = "A. R. Meijer", title = "Hash functions based on modular squaring", journal = j-TRANS-SAIEE, volume = "86", number = "2", pages = "91--??", year = "1995", CODEN = "TSAEA9", ISSN = "0038-2221", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Miller:1995:RAC, author = "J. W. Miller", title = "Random access from compressed datasets with perfect value hashing", journal = j-IEEE-INT-SYMP-INF-THEORY, pages = "454--??", year = "1995", CODEN = "PISTFZ", ISSN = "0271-4655", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Mittermeir:1995:AVS, author = "R. T. Mittermeir and L. Wuerfl", title = "Abstract Visualization of Software. {A} Basis for a Complex Hash-Key?", journal = j-LECT-NOTES-COMP-SCI, volume = "945", pages = "545--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Myllymaki:1995:DTJ, author = "Jussi Myllymaki and Miron Livny", title = "Disk-tape joins: synchronizing disk and tape access", journal = j-SIGMETRICS, volume = "23", number = "1", pages = "279--290", month = may, year = "1995", CODEN = "????", DOI = "http://doi.acm.org/10.1145/223587.223619", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 11:18:56 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Today large amounts of data are stored on tertiary storage media such as magnetic tapes and optical disks. DBMSs typically operate only on magnetic disks since they know how to maneuver disks and how to optimize accesses on them. Tertiary devices present a problem for DBMSs since these devices have dismountable media and have very different operational characteristics compared to magnetic disks. For instance, most tape drives offer very high capacity at low cost but are accessed sequentially, involve lengthy latencies, and deliver lower bandwidth. Typically, the scope of a DBMS's query optimizer does not include tertiary devices, and the DBMS might not even know how to control and operate upon tertiary-resident data. In a three-level hierarchy of storage devices (main memory, disk, tape), the typical solution is to elevate tape-resident data to disk devices, thus bringing such data into the DBMS' control, and then to perform the required operations on disk. This requires additional space on disk and may not give the lowest response time possible. With this challenge in mind, we studied the trade-offs between memory and disk requirements and the execution time of a join with the help of two well-known join methods. The conventional, disk-based Nested Block Join and Hybrid Hash Join were modified to operate directly on tapes. An experimental implementation of the modified algorithms gave us more insight into how the algorithms perform in practice. Our performance analysis shows that a DBMS desiring to operate on tertiary storage will benefit from special algorithms that operate directly on tape-resident data and take into account and exploit the mismatch in disk and tape characteristics.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", keywords = "concurrent I/O; join methods; tertiary storage", } @InProceedings{Naeslund:1995:UHF, author = "M. Naeslund", title = "Universal hash functions and hard core bits", crossref = "Guillou:1995:ACE", pages = "356--366", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0921.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0921/09210356.htm; http://link.springer-ny.com/link/service/series/0558/papers/0921/09210356.pdf", acknowledgement = ack-nhfb, } @Book{NIST:1995:FPSb, author = "{National Institute of Standards and Technology}", title = "{FIPS PUB 180-1}: Secure Hash Standard", publisher = pub-NIST, address = pub-NIST:adr, day = "17", month = apr, year = "1995", bibdate = "Mon Nov 27 08:37:27 2000", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Supersedes FIPS PUB 180 1993 May 11.", URL = "http://www.itl.nist.gov/fipspubs/fip180-1.htm", abstract = "This standard specifies a Secure Hash Algorithm (SHA-1) which can be used to generate a condensed representation of a message called a message digest. The SHA-1 is required for use with the Digital Signature Algorithm (DSA) as specified in the Digital Signature Standard (DSS) and whenever a secure hash algorithm is required for Federal applications. The SHA-1 is used by both the transmitter and intended receiver of a message in computing and verifying a digital signature.", acknowledgement = ack-nhfb, keywords = "computer security; digital signatures; Federal Information Processing Standard (FIPS); hash algorithm", } @Article{Park:1995:EHA, author = "Jong Soo Park and Ming-Syan Chen and Philip S. Yu", title = "An Effective Hash-Based Algorithm for Mining Association Rules", journal = j-SIGMOD, volume = "24", number = "2", pages = "175--??", day = "1", month = jun, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Park:1995:EHB, author = "Jong Soo Park and Ming-Syan Chen and Philip S. Yu", title = "An effective hash-based algorithm for mining association rules", journal = j-SIGMOD, volume = "24", number = "2", pages = "175--186", month = may, year = "1995", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:52 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", classification = "C6160 (Database management systems (DBMS)); C6170K (Knowledge engineering techniques); C7170 (Marketing computing); C7180 (Retailing and distribution computing)", keywords = "Association rules mining; Candidate set generation; Effective hash-based algorithm; Performance bottleneck; Sales transactions", thesaurus = "Database management systems; Knowledge acquisition; Pattern matching; Retail data processing; Sales management", xxcrossref = "Anonymous:1995:ASI", } @Article{Park:1995:UPR, author = "U. K. Park and H. K. Choi and T. G. Kim", title = "Uniform partitioning of relations using histogram equalization framework: An efficient parallel hash-based join", journal = j-INFO-PROC-LETT, volume = "55", number = "5", pages = "283--??", day = "15", month = sep, year = "1995", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Patarin:1995:CID, author = "J. Patarin", title = "Collisions and inversions for {Damgaard}'s whole hash function", crossref = "Pieprzyk:1995:ACA", pages = "307--321", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Pepper:1995:RSH, author = "P. Pepper and R. Betschko and S. Dick and K. Didrich", title = "Realizing Sets by Hash Tables", journal = j-LECT-NOTES-COMP-SCI, volume = "1009", pages = "58--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Jan 20 16:08:00 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Perrizo:1995:DDV, author = "W. Perrizo and V. N. R. Goli", title = "Dynamic Domain Vector Perfect Hash: {A} Join Method for Dynamic Memory Allocations", journal = j-MICROCOMPUT-APPL, volume = "14", number = "3", pages = "93--??", year = "1995", ISSN = "0820-0750", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1995:MBF, author = "B. Preneel and P. C. {Van Oorschot}", title = "{MDx-MAC} and Building Fast {MACs} from Hash Functions", crossref = "Coppersmith:1995:ACA", pages = "1--14", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Preneel:1995:MMB, author = "B. Preneel and P. C. van Oorschot", title = "{MD-x MAC} and building fast {MACs} from hash functions", crossref = "Coppersmith:1995:ACC", pages = "1--14", year = "1995", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 12]{Bellare:1996:MAU}, \cite[Ref. 19]{Preneel:1997:CHF}.", } @Article{Rigoutsos:1995:BAM, author = "Isidore Rigoutsos and Robert Hummel", title = "A {Bayesian} Approach to Model Matching with Geometric Hashing", journal = j-COMP-VIS-IMAGE-UNDERSTANDING, volume = "62", number = "1", pages = "11--26", month = jul, year = "1995", CODEN = "CVIUF4", ISSN = "1077-3142 (print), 1090-235X (electronic)", bibdate = "Sat Feb 8 07:08:38 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Research Cent", affiliationaddress = "Yorktown Heights, NY, USA", classification = "723.2; 723.3; 723.5; 921; 921.4", journalabr = "CVIU Comput Vision Image Understanding", keywords = "Bayesian approach; Bayesian maximum likelihood framework; Computer simulation; Computer vision; Database systems; Encoding (symbols); Geometric hashing; Geometry; Image analysis; Model matching; Object recognition; Object recognition system; Optimal weight functions; Pattern recognition systems; Performance; Real world gray scale images; Set theory", } @Article{Rijmen:1995:ICD, author = "V. Rijmen and B. Preneel", title = "Improved characteristics for differential cryptanalysis of hash functions based on block ciphers", journal = j-LECT-NOTES-COMP-SCI, volume = "1008", pages = "242--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Roe:1995:PBC, author = "M. Roe", title = "Performance of block ciphers and hash functions --- one year later", journal = j-LECT-NOTES-COMP-SCI, volume = "1008", pages = "359--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Rogaway:1995:BHA, author = "P. Rogaway", title = "Bucket Hashing and its Application to Fast Message Authentication", journal = j-LECT-NOTES-COMP-SCI, volume = "963", pages = "29--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 3 12:45:25 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Russell:1995:NSC, author = "Alexander Russell", title = "Necessary and Sufficient Conditions for Collision-Free Hashing", journal = j-J-CRYPTOLOGY, volume = "8", number = "2", pages = "87--99", month = "Spring", year = "1995", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", MRclass = "94A60 (68Q20)", MRnumber = "95m:94008", bibdate = "Sat Nov 21 16:36:38 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Sabharwal:1995:PHT, author = "C. L. Sabharwal and S. K. Bhatia", title = "Perfect hash table algorithm for image databases using negative associated values", journal = j-PATTERN-RECOGN, volume = "28", number = "7", pages = "1091--??", year = "1995", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", bibdate = "Sat May 25 15:15:50 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @InProceedings{Schnorr:1995:BBC, author = "C. P. Schnorr and S. Vaudenay", title = "Black box cryptanalysis of hash networks based on multipermutations", crossref = "DeSantis:1995:ACE", pages = "47--57", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Stern:1995:IPV, author = "U. Stern and D. L. Dill", title = "Improved probabilistic verification by hash compaction", crossref = "Camurati:1995:CHD", pages = "206--224", year = "1995", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tang:1995:SLH, author = "S. M. Tang and R. Chow Louis", title = "The Study of Letter-Oriented Hashing Schemes", journal = j-J-SYST-SOFTW, volume = "28", number = "2", pages = "157--??", day = "1", month = feb, year = "1995", CODEN = "JSSODM", ISSN = "0164-1212", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Tang:1995:SLO, author = "S. M. Tang and R. Chow Louis", title = "The Study of Letter-Oriented Hashing Schemes", journal = j-J-SYST-SOFTW, volume = "28", number = "2", pages = "157--167", month = feb, year = "1995", CODEN = "JSSODM", ISSN = "0164-1212", bibdate = "Wed Sep 8 09:22:30 MDT 2010", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/01641212; UnCover library database", acknowledgement = ack-nhfb, } @Article{Tout:1995:DLB, author = "W. R. Tout and S. Pramanik", title = "Distributed Load Balancing for Parallel Main Memory Hash Join", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "6", number = "8", pages = "841--??", day = "1", month = aug, year = "1995", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Trono:1995:CTS, author = "John A. Trono", title = "A Comparison of Three Strategies for Computing Letter Oriented, Minimal Perfect Hashing Functions", journal = j-SIGPLAN, volume = "30", number = "4", pages = "29--35", day = "1", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", note = "This paper introduces a simple modification that produces dramatic speedups to the algorithms of Cichelli \cite{Cichelli:1980:MPH} and Cook and Oldehoeft \cite{Cook:1982:LOM}.", acknowledgement = ack-nhfb, } @Article{Ung:1995:UPR, author = "K. P. Ung and K. C. Hwang and G. K. Tag", title = "Uniform partitioning of relations using histogram equalization framework: An efficient parallel hash-based join", journal = j-INFO-PROC-LETT, volume = "55", number = "5", publisher = "Elsevier Science", pages = "283--289", day = "15", month = sep, year = "1995", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "7", } @Article{Yao:1995:MOK, author = "Andrew Chi-Chih Yao", title = "Minimean Optimal Key Arrangements in Hash Tables", journal = j-ALGORITHMICA, volume = "14", number = "5", pages = "409--428", day = "1", month = nov, year = "1995", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68P20 (68P10)", MRnumber = "MR1350135 (96g:68026)", bibdate = "Mon Jan 22 05:36:22 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica14.html#Yao95; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database; UnCover library database", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "Yao95", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Yao95", } @Article{Yen:1995:PHC, author = "I-Ling L. Yen and Farokh B. Bastani", title = "Parallel Hashing: Collision Resolution Strategies and Performance", journal = j-J-PAR-DIST-COMP, volume = "31", number = "2", pages = "190--198", month = dec, year = "1995", CODEN = "JPDCER", DOI = "http://dx.doi.org/10.1006/jpdc.1995.1158", ISSN = "0743-7315 (print), 1096-0848 (electronic)", bibdate = "Thu Mar 9 09:18:58 MST 2000", bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1158/production; http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1158/production/pdf", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA", keywords = "algorithms; collision resolution strategies; collision resolution strategy; communication overheads; data parallel hash; data structures; file organisation; hash tables; hypercube hashing; massively; parallel algorithms; parallel systems; performance of hash; queueing delay", treatment = "T Theoretical or Mathematical", } @Article{Alon:1996:DWB, author = "Noga Alon and Moni Naor", title = "Derandomization, Witnesses for {Boolean} Matrix Multiplication and Construction of Perfect Hash Functions", journal = j-ALGORITHMICA, volume = "16", number = "4--5", pages = "434--449", year = "1996", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68Q25 (68Q20)", MRnumber = "MR1407583 (98f:68119)", bibdate = "Mon Jan 22 05:22:35 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica16.html#AlonN96; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database", fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "AlonN96", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/AlonN96", } @Article{Anderson:1996:TFN, author = "Ross Anderson and Eli Biham", title = "{Tiger}: {A} fast new hash function", journal = j-LECT-NOTES-COMP-SCI, volume = "1039", pages = "89--97", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Feb 08 12:41:43 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/link.asp?id=fx0261047446n136; http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/3-540-60865-6_46; http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1039&spage=89", abstract = "Among those cryptographic hash function which are not based on block ciphers, MD4 and Snefru seemed initially quite attractive for applications requiring fast software hashing. However collisions for Snefru were found in 1990, and recently a collision of MD4 was also found. This casts doubt on how long these functions' variants, such as RIPE-MD, MD5, SHA, SHA1 and Snefru-8, will remain unbroken. Furthermore, all these functions were designed for 32-bit processors, and cannot be implemented efficiently on the new generation of 64-bit processors such as the DEC Alpha. We therefore present a new hash function which we believe to be secure; it is designed to run quickly on 64-bit processors, without being too slow on existing machines.", acknowledgement = ack-nhfb, } @Article{Anonymous:1996:RF, author = "Anonymous", title = "Real Fake", journal = j-WIRED, volume = "4", number = "6", pages = "156--??", day = "1", month = jun, year = "1996", CODEN = "WREDEM", ISSN = "1059-1028", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "To Martin Hash, the blur between reality and illusion isn't a problem --- it's an addiction.", acknowledgement = ack-nhfb, } @Article{Atici:1996:UHM, author = "M. Atici and D. R. Stinson", title = "Universal Hashing and Multiple Authentication", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "16--??", month = "????", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Oct 29 14:12:39 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Bakhtiari:1996:KHF, author = "S. Bakhtiari and R. Safavi-Naini and J. Pieprzyk", title = "Keyed Hash Functions", crossref = "Dawson:1996:CPA", pages = "201--214", year = "1996", bibdate = "Sat Apr 20 17:33:34 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Bakhtiari:1996:PAK, author = "S. Bakhtiari and R. Safavi-Naini and J. Pieprzyk", title = "On password-based authenticated key exchange using collisionful hash functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1172", pages = "299--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Bakhtiari:1996:PBA, author = "S. Bakhtiari and R. Safavi-Naini and J. Pieprzyk", title = "On password-based authenticated key exchange using collisionful hash functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1172", pages = "299--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Bakhtiari:1996:SCH, author = "S. Bakhtiari and R. Safavi-Naini and J. Pieprzyk", title = "On selectable collisionful hash functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1172", pages = "287--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Balakirsky:1996:HDB, author = "V. B. Balakirsky", title = "Hashing of Databases Based on Indirect Observations of {Hamming} Distances", journal = j-IEEE-TRANS-INF-THEORY, volume = "42", number = "2", pages = "664--671", day = "1", month = mar, year = "1996", CODEN = "IETTAW", DOI = "http://dx.doi.org/10.1109/18.485741", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", acknowledgement = ack-nhfb, } @Article{Bellare:1996:KHF, author = "M. Bellare and R. Canetti and H. Krawczyk", title = "Keying Hash Functions for Message Authentication", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "1--15", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Nov 25 07:34:12 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "Full version: http://www.research.ibm.com/security/", acknowledgement = ack-nhfb, } @Article{Bellare:1996:MAU, author = "Mihir Bellare and Ran Canetti and Hugo Krawczyk", title = "Message Authentication Using Hash Functions: the {HMAC} Construction", journal = j-CRYPTOBYTES, volume = "2", number = "1", pages = "12--15", month = "Spring", year = "1996", bibdate = "Tue Oct 20 12:08:21 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "ftp://ftp.rsa.com/pub/cryptobytes/crypto2n1.pdf", acknowledgement = ack-nhfb, } @Article{Bierbrauer:1996:OAR, author = "J{\"u}rgen Bierbrauer and K. Gopalakrishnan and D. R. Stinson", title = "Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds", journal = j-SIAM-J-DISCR-MATH, volume = "9", number = "3", pages = "424--452", month = aug, year = "1996", CODEN = "SJDMEC", ISSN = "0895-4801 (print), 1095-7146 (electronic)", MRclass = "05B15 (90C05 94B65)", MRnumber = "97f:05028", MRreviewer = "Dieter Jungnickel", bibdate = "Thu Apr 9 15:20:35 MDT 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B6120B (Codes); C1180 (Optimisation techniques); C1260 (Information theory)", corpsource = "Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA", keywords = "algorithm derandomization; algorithm theory; authentication codes; binary orthogonal array; codes; combinatorial mathematics; combinatorial structures; correlation-immune functions; cryptography; cryptology; error correction codes; error-correcting codes; linear programming; linear programming bounds; lower bounds; optimal values; orthogonal arrays; perfect local randomizers; resilient functions; universal hashing; upper bounds", language = "English", pubcountry = "USA", treatment = "T Theoretical or Mathematical", } @Article{Binstock:1996:HR, author = "Andrew Binstock", title = "Hashing Rehashed", journal = j-DDJ, volume = "21", number = "4", pages = "24--??", day = "1", month = apr, year = "1996", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; UnCover library database", abstract = "Even tried and tested algorithms can be more efficient. Andrew presents one optimization, then examines the effect of high-performance hardware on hashing.", acknowledgement = ack-nhfb, } @Article{Bosselaers:1996:FHP, author = "A. Bosselaers and R. Govaerts and J. Vandewalle", title = "Fast Hashing on the {Pentium}", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "298--312", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Nov 25 07:34:33 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Cooperman:1996:NSP, author = "Gene Cooperman and Michael Tselman", title = "New Sequential and Parallel Algorithms for Generating High Dimension {Hecke} Algebras using the Condensation Technique", crossref = "LakshmanYN:1996:IPI", pages = "155--160", year = "1996", bibdate = "Thu Mar 12 08:43:16 MST 1998", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/236869/p155-cooperman/", acknowledgement = ack-nhfb, keywords = "algebraic computation; algorithms; ISSAC; languages; SIGNUM; SIGSAM; symbolic computation", subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Hash-table representations.", } @Article{Dietzfelbinger:1996:UHK, author = "M. Dietzfelbinger", title = "Universal Hashing and $k$-wise Independent Random Variables via Integer Arithmetic without Primes", journal = j-LECT-NOTES-COMP-SCI, volume = "1046", pages = "569--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Farach:1996:PHS, author = "M. Farach and S. Muthukrishnan", title = "Perfect Hashing for Strings: Forrealization and Algorithms", journal = j-LECT-NOTES-COMP-SCI, volume = "1075", pages = "130--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Aug 14 09:38:08 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Fateman:1996:SLB, author = "Richard J. Fateman and Mark Hayden", title = "Speeding Up {Lisp-Based} Symbolic Mathematics", journal = j-SIGSAM, volume = "30", number = "1", pages = "25--30", month = mar, year = "1996", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", bibdate = "Fri Feb 8 18:27:04 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classcodes = "C7310 (Mathematics computing); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., California Univ., Berkeley, CA, USA", issue = "115", keywords = "equivalent kernel; expressions; hash tables; LISP; Lisp-based; Lisp-based symbolic mathematics speed-up; Macsyma; Mathematica; mathematics computing; symbol manipulation; symbolic manipulation system; unordered sum representation", treatment = "T Theoretical or Mathematical", } @Article{Fateman:1996:SLS, author = "R. J. Fateman and M. Hayden", title = "Speeding Up {Lisp-Based} Symbolic Mathematics", journal = j-SIGSAM, volume = "30", number = "1", pages = "25--30", month = mar, year = "1996", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", bibdate = "Thu Mar 20 16:02:15 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classcodes = "C7310 (Mathematics computing); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., California Univ., Berkeley, CA, USA", keywords = "equivalent kernel; expressions; hash tables; LISP; Lisp-based; Lisp-based symbolic mathematics speed-up; Macsyma; Mathematica; mathematics computing; symbol manipulation; symbolic manipulation system; unordered sum representation", treatment = "T Theoretical or Mathematical", } @Article{Geiselmann:1996:NHF, author = "W. Geiselmann", title = "A Note on the Hash Function of {Tillich and Zemor}", journal = j-LECT-NOTES-COMP-SCI, volume = "1039", pages = "51--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Gil:1996:TMH, author = "Joseph Gil and Friedhelm Meyer auf der Heide and Avi Wigderson", title = "The Tree Model for Hashing: Lower and Upper Bounds", journal = j-SIAM-J-COMPUT, volume = "25", number = "5", pages = "936--955", month = "????", year = "1996", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "68P10 (68P05 68Q10 68Q22)", MRnumber = "1 408 893", bibdate = "Sat Jan 18 18:03:50 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Halevi:1996:PPC, author = "S. Halevi and S. Micali", title = "Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "201--??", month = "????", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Oct 29 14:12:39 MST 1996", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1109.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1109/11090201.htm; http://link.springer-ny.com/link/service/series/0558/papers/1109/11090201.pdf", acknowledgement = ack-nhfb, } @Article{Harris:1996:JAC, author = "Evan P. Harris and Kotagiri Ramamohanarao", title = "Join Algorithm Costs Revisited", journal = j-VLDB-J, volume = "5", number = "1", pages = "64--84", month = jan, year = "1996", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:36 MDT 2008", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb5.html; http://link.springer.de/link/service/journals/00778/tocs/t6005001.htm; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Electronic edition.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Harris:Evan_P=.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/r/Ramamohanarao:Kotagiri.html; http://link.springer.de/link/service/journals/00778/bibs/6005001/60050064.htm; http://link.springer.de/link/service/journals/00778/papers/6005001/60050064.pdf; http://link.springer.de/link/service/journals/00778/papers/6005001/60050064.ps.gz", abstract = "A method of analysing join algorithms based upon the time required to access, transfer and perform the relevant CPU-based operations on a disk page is proposed. The costs of variations of several of the standard join algorithms, including nested block, sort-merge, GRACE hash and hybrid hash, are presented. For a given total buffer size, the cost of these join algorithms depends on the parts of the buffer allocated for each purpose. For example, when joining two relations using the nested block join algorithm, the amount of buffer space allocated for the outer and inner relations can significantly affect the cost of the join. Analysis of expected and experimental results of various join algorithms show that a combination of the optimal nested block and optimal GRACE hash join algorithms usually provide the greatest cost benefit, unless the relation size is a small multiple of the memory size. Algorithms to quickly determine a buffer allocation producing the minimal cost for each of these algorithms are presented. When the relation size is a small multiple of the amount of main memory available (typically up to three to six times), the hybrid hash join algorithm is preferable.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "join algorithms; minimisation; optimal buffer allocation", } @Article{Helleseth:1996:UHF, author = "T. Helleseth and T. Johansson", title = "Universal Hash Functions from Exponential Sums over Finite Fields and {Galois} Rings", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "31--??", month = "????", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Oct 29 14:12:39 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Keller:1996:FRP, author = "J. Keller", title = "Fast rehashing in {PRAM} emulations", journal = j-THEOR-COMP-SCI, volume = "155", number = "2", pages = "349--363", day = "11", month = mar, year = "1996", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 14:14:47 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany", keywords = "address space distribution; algorithm; computational complexity; data redistribution; fast rehashing; file organisation; hash function; linear hash functions; local storage words; memory access patterns; memory modules; module congestion; network latency; parallel algorithms; parallel machines; PRAM emulations; probability; processors; runtime; shared memory systems; storage allocation; universal hashing", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Khan:1996:PCI, author = "Z. S. Khan and E. Kwatny", title = "Performance comparison of interprocessor communication schemes for a hashing technique on the {Connection Machine}", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "11", number = "4", pages = "189--??", month = "????", year = "1996", CODEN = "CSSEEI", ISSN = "0267-6192", bibdate = "Wed Feb 3 11:14:12 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; OCLC Contents1st database", acknowledgement = ack-nhfb, } @Article{Knudsen:1996:HFB, author = "L. Knudsen and B. Preneel", title = "Hash Functions Based on Block Ciphers and Quaternary Codes", journal = j-LECT-NOTES-COMP-SCI, volume = "1163", pages = "77--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Dec 21 09:47:26 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lamiroy:1996:ROI, author = "B. Lamiroy and P. Gros", title = "Rapid object indexing and recognition using enhanced geometric hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1064", pages = "59--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Wed Aug 14 09:38:08 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lee:1996:DRW, author = "Dik Lun Lee and Liming Ren", title = "Document Ranking on Weight-Partitioned Signature Files", journal = j-TOIS, volume = "14", number = "2", pages = "109--137", month = apr, year = "1996", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:04:41 MST 1999", bibsource = "Compendex database; http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/tois/abstracts/lee.html", abstract = "A signature file organization, called the weight-partitioned signature file, for supporting document ranking is proposed. It employs multiple signature files, each of which corresponds to one term frequency, to represent terms with different term frequencies. Words with the same term frequency in a document are grouped together and hashed into the signature file corresponding to that term frequency. This eliminates the need to record the term frequency explicitly for each word. We investigate the effect of false drops on retrieval effectiveness if they are not eliminated in the search process. We have shown that false drops introduce insignificant degradation on precision and recall when the false-drop probability is below a certain threshold. This is an important result since false-drop elimination could become the bottleneck in systems using fast signature file search techniques. We perform an analytical study on the performance of the weight-partitioned signature file under different search strategies and configurations. An optimal formula is obtained to determine for a fixed total storage overhead the storage to be allocated to each partition in order to minimize the effect of false drops on document ranks. Experiments were performed using a document collection to support the analytical results.", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ", affiliationaddress = "Columbus, OH, USA", classification = "722.1; 723.2; 723.5; 903.3; 922.1", journalabr = "ACM Trans Inf Syst", keywords = "Access method; Computer simulation; Document ranking; Document retrieval; Encoding (symbols); File organization; Information retrieval; Information retrieval systems; Performance; Probability; Storage allocation (computer); Superimposed coding; Text retrieval; Weight partitioned signature files", } @Article{Lindner:1996:DSH, author = "M. P. Lindner", title = "Designing for safe hashing. Implementing efficient dynamic search structures", journal = j-C-PLUS-PLUS-REPORT, volume = "8", number = "10", pages = "36--41", month = nov # "-" # dec, year = "1996", CODEN = "CRPTE7", ISSN = "1040-6042", bibdate = "Tue Mar 25 13:34:48 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classcodes = "C6120 (File organisation); C6110J (Object-oriented programming)", keywords = "abstract data types; C++ code optimization; C++ compiler; C++ language; C++ Standard Template Library; class; constructs; data integrity; data structures; dynamic search structures; efficient; hash-fun class; hash-stream; hashed data; hasher class; hashing function design; indexing; object-; object-oriented design; oriented programming; performance; problems; public domain software; safety; search; software libraries; STL; structures; syntax; table size; type-safety", treatment = "P Practical", } @InProceedings{Linial:1996:NEH, author = "Nathan Linial and Ori Sasson", title = "Non-expansive hashing", crossref = "ACM:1996:PTE", pages = "509--518", year = "1996", bibdate = "Wed Feb 20 18:34:02 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/237814/p509-linial/p509-linial.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/237814/p509-linial/", acknowledgement = ack-nhfb, } @Article{Litwin:1996:LSD, author = "Witold Litwin and Marie-Anna Neimat and Donovan A. Schneider", title = "{LH*} --- a scalable, distributed data structure", journal = j-TODS, volume = "21", number = "4", pages = "480--525", month = dec, year = "1996", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; 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/1996-21-4/p480-litwin/p480-litwin.pdf; http://www.acm.org/pubs/citations/journals/tods/1996-21-4/p480-litwin/", abstract = "We present a scalable distributed data structure called LH*. LH* generalizes Linear Hashing (LH) to distributed RAM and disk files. An LH* file can be created from records with primary keys, or objects with OIDs, provided by any number of distributed and autonomous clients. It does not require a central directory, and grows gracefully, through splits of one bucket at a time, to virtually any number of servers. The number of messages per random insertion is one in general, and three in the worst case, regardless of the file size. The number of messages per key search is two in general, and four in the worst case. The file supports parallel operations, e.g., hash joins and scans. Performing a parallel operation on a file of $M$ buckets costs at most 2 $M$ + 1 messages, and between 1 and $O$ (log 2 $M$) rounds of messages.\par We first describe the basic LH* scheme where a coordinator site manages abucket splits, and splits a bucket every time a collision occurs. We show that the average load factor of an LH* file is 65%-70% regardless of file size, and bucket capacity. We then enhance the scheme with load control, performed at no additional message cost. The average load factor then increases to 80-95%. These values are about that of LH, but the load factor for LH* varies more.\par We nest define LH* schemes without a coordinator. We show that insert and search costs are the same as for the basic scheme. The splitting cost decreases on the average, but becomes more variable, as cascading splits are needed to prevent file overload. Next, we briefly describe two variants of splitting policy, using parallel splits and presplitting that should enhance performance for high-performance applications.\par All together, we show that LH* files can efficiently scale to files that are orders of magnitude larger in size than single-site files. LH* files that reside in main memory may also be much faster than single-site disk files. Finally, LH* files can be more efficient than any distributed file with a centralized directory, or a static parallel or distributed hash file.", acknowledgement = ack-nhfb, generalterms = "Design; Performance; Theory", keywords = "algorithms; data structures; design; distributed access methods; extensible hashing; linear hashing; performance", subject = "{\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf E.1} Data, DATA STRUCTURES. {\bf H.2.1} Information Systems, DATABASE MANAGEMENT, Logical Design", } @Article{Liu:1996:HPS, author = "C. Liu and H. Chen", title = "A Hash Partition Strategy for Distributed Query Processing", journal = j-LECT-NOTES-COMP-SCI, volume = "1057", pages = "373--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lo:1996:SHJ, author = "Ming-Ling Lo and Chinya V. Ravishankar", title = "Spatial Hash-Joins", journal = j-SIGMOD, volume = "25", number = "2", pages = "247--258", month = jun, year = "1996", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", bibdate = "Mon Jan 12 08:45:56 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Majewski:1996:FPH, author = "Bohdan S. Majewski and Nicholas C. Wormald and George Havas and Zbigniew J. Czech", title = "A Family of Perfect Hashing Methods", journal = j-COMP-J, volume = "39", number = "6", pages = "547--554", month = "????", year = "1996", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jul 21 09:54:53 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/Volume_39/Issue_06/Vol39_06.index.html", note = "This paper claims the discovery of order-preserving perfect hashing methods that run in linear time.", URL = "http://www.oup.co.uk/jnls/list/comjnl/hdb/Volume_39/Issue_06/390547.sgm.abs.html; http://www3.oup.co.uk/computer_journal/Volume_39/Issue_06/Vol39_06.body.html#AbstractMajewski", acknowledgement = ack-nhfb, author-2-adr = "Department of Mathematics, University of Melbourne, Parkville, Victoria 3052", author-3-adr = "Department of Computer Science, The University of Queensland, Queensland 4072, Australia", author-4-adr = "Institutes of Computer Science, Silesia University of Technology and Polish Academy of Sciences, Gliwice, Poland 44-100", classcodes = "C6120 (File organisation); C4240C (Computational complexity); C1180 (Optimisation techniques)", corpsource = "Dept. of Comput. Sci. and Software Eng., Newcastle Univ., NSW, Australia", email-1 = "havas@cs.uq.edu.au", keywords = "computational complexity; deterministic function refinement; efficient storage; fast retrieval; file organisation; linear deterministic time; linear random time; memory-; minimisation; minimum constants; optimal hashing functions; order-preserving minimal perfect hash functions; probabilistic computation; probability; r-graph; space-; static sets; time-optimal hashing functions", treatment = "T Theoretical or Mathematical", } @Article{Malhotra:1996:SED, author = "Vishv M. Malhotra and Bala Srinivasan and Santosh Kulkarni", title = "Storage-efficient data structure for large lookup dictionaries", journal = j-INFO-PROC-LETT, volume = "58", number = "4", pages = "201--206", day = "27", month = may, year = "1996", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., Tasmania Univ., Hobart, Tas., Australia", keywords = "data structures; digital decomposition; digital searching; glossaries; hashing; information retrieval; large lookup dictionaries; multiple bit hashing; search trees; storage-efficient data structure; table lookup", treatment = "P Practical", } @Article{MeyeraufderHeide:1996:ESR, author = "F. {Meyer auf der Heide} and C. Scheideler and V. Stemann", title = "Exploiting storage redundancy to speed up randomized shared memory simulations", journal = j-THEOR-COMP-SCI, volume = "162", number = "2", pages = "245--281", day = "20", month = aug, year = "1996", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 14:14:47 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5220P (Parallel architecture); C5440 (Multiprocessing systems); C5640 (Protocols)", corpsource = "Dept. of Comput. Sci., Paderborn Univ., Germany", keywords = "access protocols; distributed memory machines; distributed memory systems; hash functions; memory protocols; n-processor optical crossbar; n-processor PRAM; optical interconnections; parallel access time; parallel machines; random-access storage; randomized shared memory simulations; redundancy; shared memory systems; simple access protocol; static dictionary; storage redundancy", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Nyberg:1996:FAH, author = "K. Nyberg", title = "Fast Accumulated Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1039", pages = "83--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Pescio:1996:AAM, author = "Carlo Pescio", title = "Algorithm Alley: Minimal Perfect Hashing", journal = j-DDJ, volume = "21", number = "7", pages = "101--102, 104, 116--117", month = jul, year = "1996", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Sarkar:2011:TBC, author = "Palash Sarkar", title = "A trade-off between collision probability and key size in universal hashing using polynomials", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "58", number = "3", pages = "271--278", month = mar, year = "2011", CODEN = "DCCREC", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", bibdate = "Mon Sep 5 17:43:20 MDT 2011", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=58&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=58&issue=3&spage=271", acknowledgement = ack-nhfb, } @Article{Shoup:1996:FPS, author = "V. Shoup", title = "On Fast and Provably Secure Message Authentication Based on Universal Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1109", pages = "313--??", month = "????", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Oct 29 14:12:39 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Tsai:1996:PAG, author = "Frank C. D. Tsai", title = "A Probabilistic Approach to Geometric Hashing Using Line Features", journal = j-COMP-VIS-IMAGE-UNDERSTANDING, volume = "63", number = "1", pages = "182--195", month = jan, year = "1996", CODEN = "CVIUF4", ISSN = "1077-3142 (print), 1090-235X (electronic)", bibdate = "Sat Feb 8 07:08:38 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, affiliation = "IBM Zurich Research Lab", affiliationaddress = "Ruschlikon, Switz", classification = "723; 723.2; 723.5; 922.1", journalabr = "CVIU Comput Vision Image Understanding", keywords = "Algorithms; Calculations; Feature extraction; Geometric hashing; Hough transform; Image analysis; Image formation; Image segmentation; Line features; Object recognition; Pattern recognition; Performance; Probability; Spurious signal noise; Statistical behavior", } @Article{Tyma:1996:TJP, author = "Paul Tyma", title = "Tuning {Java} Performance", journal = j-DDJ, volume = "21", number = "4", pages = "52, 55--56, 58, 90", month = apr, year = "1996", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Dec 12 17:19:30 1996", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "723.1; 723.1.1; 723.2; 723.5; 921.5", keywords = "Algorithms; Binary searches; Codes (symbols); Computer aided software engineering; Computer programming languages; Data structures; Encoding (symbols); Hash tables; Inlining; Object oriented programming; Optimization; Performance; Program compilers; Program interpreters; Quick sorts; Software Package Java; Synchronization", } @Article{Viola:1996:ALP, author = "A. Viola and P. V. Poblete", title = "The Analysis of Linear Probing Hashing with Buckets", journal = j-LECT-NOTES-COMP-SCI, volume = "1136", pages = "221--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Dec 21 09:47:26 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Wildner:1996:CAS, author = "U. Wildner", title = "Compiler Assisted Self-checking of Structural Integrity Using Return Address Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1150", pages = "161--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Dec 21 09:47:26 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1997:LHG, author = "Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G{\'a}bor Tardos", title = "Is linear hashing good?", crossref = "ACM:1997:PTN", pages = "465--474", year = "1997", bibdate = "Wed Feb 20 18:34:03 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/258533/p465-alon/p465-alon.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/258533/p465-alon/", acknowledgement = ack-nhfb, } @Manual{ANSI:1997:AXP, author = "{ANSI}", title = "{ANSI X9.30-2:1997}: Public Key Cryptography Using Irreversible Algorithms --- Part 2: The {Secure Hash Algorithm (SHA-1)}", organization = pub-ANSI, address = pub-ANSI:adr, year = "1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://webstore.ansi.org/ansidocstore/product.asp?sku=ANSI+X9%2E30%2D2%3A1997", abstract = "Produces a 160-bit representation of the message, called the message digest, when a message with a bit length less than 2 to 64th power is input. The message digest is used during the generation of a signature for the message. The message digest is computed during the generation of a signature for the message. The SHA-1 is also used to compute a message digest for the received version of the message during the process of verifying the signature. Any change to the message in transit will, with a very high probability, result in a different messages digest, and the signature will fail to verify. The Secure Hash Algorithm (SHA-1) described in this standard is required for use with the Digital Signature Algorithm and may be used whenever a secure hash algorithm is required.", } @Article{Bakhtiari:1997:WGC, author = "S. Bakhtiari and J. Pieprzyk and R. Safavi-Naini", title = "On the Weaknesses of {Gong}'s Collisionful Hash Function", journal = j-J-UCS, volume = "3", number = "3", pages = "185--??", day = "28", month = mar, year = "1997", CODEN = "", ISSN = "0948-6968", bibdate = "Wed May 28 19:32:35 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.iicm.edu/jucs_3_3/hash_function", acknowledgement = ack-nhfb, } @Article{Baraani-Dastjerdi:1997:UCH, author = "A. Baraani-Dastjerdi and J. Pieprzyk and R. Safavi-Naini and J. R. Getta", title = "Using Cryptographic Hash Functions for Discretionary Access Control in Object-Oriented Databases", journal = j-J-UCS, volume = "3", number = "6", pages = "730--??", day = "28", month = jun, year = "1997", CODEN = "", ISSN = "0948-6968", bibdate = "Sat Oct 11 14:56:23 1997", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/jucs.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://medoc.springer.de:8000/jucs_3_6/using_cryptographic_functions_for; internal&sk=05460486", acknowledgement = ack-nhfb, } @Article{Barequet:1997:UGH, author = "Gill Barequet", title = "Using Geometric Hashing To Repair {CAD} Objects", journal = j-IEEE-COMPUT-SCI-ENG, volume = "4", number = "4", pages = "22--28", month = oct # "\slash " # dec, year = "1997", CODEN = "ISCEE4", ISSN = "1070-9924", bibdate = "Sat Jan 9 08:57:23 MST 1999", bibsource = "http://www.computer.org/cse/cs1998; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/cs/books/cs1997/pdf/c4022.pdf; http://www.computer.org/cse/cs1998/c4022abs.htm", acknowledgement = ack-nhfb, } @Article{Bellare:1997:CRH, author = "Mihir Bellare and Phillip Rogaway", title = "Collision-Resistant Hashing: Towards Making {UOWHFs} Practical", journal = j-LECT-NOTES-COMP-SCI, volume = "1294", pages = "470--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:15 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1294.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1294/12940470.htm; http://link.springer-ny.com/link/service/series/0558/papers/1294/12940470.pdf", acknowledgement = ack-nhfb, } @Article{Bellare:1997:NPC, author = "M. Bellare and D. Micciancio", title = "A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost", journal = j-LECT-NOTES-COMP-SCI, volume = "1233", pages = "163--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Bentley:1997:FAS, author = "Jon L. Bentley and Robert Sedgewick", title = "Fast Algorithms for Sorting and Searching Strings", crossref = "ACM:1997:PEA", pages = "360--369", year = "1997", bibdate = "Sat Sep 13 16:06:32 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.cs.princeton.edu/~rs/strings/paper.pdf", abstract = "We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. The sorting algorithm blends Quicksort and radix sort; it is competitive with the best known C sort codes. The searching algorithm blends tries and binary search trees; it is faster than hashing and other commonly used search methods. The basic ideas behind the algorithms date back at least to the 1960s, but their practical utility has been overlooked. We also present extensions to more complex string problems, such as partial-match searching.", acknowledgement = ack-nhfb, affiliation = "Bell Lab", affiliationaddress = "NJ, USA", classification = "723; 723.1; 723.1.1; 903.3; 921.4", conference = "Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms", journalabr = "Proc Annu ACM SIAM Symp Discrete Algorithms", keywords = "Algorithms; C (programming language); Information retrieval; Quicksort algorithms; Radix sort algorithms; Searching algorithms; Sorting; Structured programming; Trees (mathematics)", meetingaddress = "New Orleans, LA, USA", meetingdate = "Jan 5--7 1997", meetingdate2 = "01/05--07/97", sponsor = "ACM-SIAM", } @Article{Bierbrauer:1997:UHG, author = "J{\"u}rgen Bierbrauer", title = "Universal Hashing and Geometric Codes", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "11", number = "3", pages = "207--221", month = jul, year = "1997", CODEN = "DCCREC", ISSN = "0925-1022 (print), 1573-7586 (electronic)", MRclass = "94B27 (68P10 68P25)", MRnumber = "98d:94041", MRreviewer = "Chao Ping Xing", bibdate = "Wed Feb 10 09:30:50 MST 1999", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.wkap.nl/issuetoc.htm/0925-1022+11+3+1997; MathSciNet database", URL = "http://www.wkap.nl/oasis.htm/131331", acknowledgement = ack-nhfb, affiliation = "Michigan Technological Univ", affiliationaddress = "Houghton, USA", journalabr = "Des Codes Cryptography", } @Article{Bosselaers:1997:RCH, author = "Antoon Bosselaers and Hans Dogbbertin and Bart Preneel", title = "The {RIPEMD-160} Cryptographic Hash Function", journal = j-DDJ, volume = "22", number = "1", pages = "24, 26, 28, 78, 80", month = jan, year = "1997", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Dec 02 08:05:58 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Brassard:1997:QCH, author = "Gilles Brassard and Peter H{\o}yer and Alain Tapp", title = "Quantum cryptanalysis of hash and claw-free functions", journal = j-SIGACT, volume = "28", number = "2", pages = "14--19", month = jun, year = "1997", CODEN = "SIGNDM", DOI = "http://dx.doi.org/10.1145/261342.261346", ISSN = "0163-5700 (print), 1943-5827 (electronic)", ISSN-L = "0163-5700", bibdate = "Wed Mar 21 09:45:55 MDT 2012", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/sigact.bib", abstract = "In this note, we give a quantum algorithm that finds collisions in arbitrary $\tau$-to-one functions after only $O(\sqrt[3]{N /\tau})$ expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way.", acknowledgement = ack-nhfb, fjournal = "ACM SIGACT News", } @Article{Canetti:1997:TRR, author = "Ran Canetti", title = "Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information", journal = j-LECT-NOTES-COMP-SCI, volume = "1294", pages = "455--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:15 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1294.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1294/12940455.htm; http://link.springer-ny.com/link/service/series/0558/papers/1294/12940455.pdf", acknowledgement = ack-nhfb, } @Article{Chen:1997:AHF, author = "Ming-Syan Chen and Hui-I Hsiao and Philip S. Yu", title = "On Applying Hash Filters to Improving the Execution of Multi-Join Queries", journal = j-VLDB-J, volume = "6", number = "2", pages = "121--131", month = aug, year = "1997", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:41 MDT 2008", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb6.html; http://link.springer.de/link/service/journals/00778/tocs/t7006002.htm; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; vldbj.bib", note = "Electronic edition.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Chen:Ming=Syan.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Hsiao:Hui=I.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/y/Yu:Philip_S=.html; http://link.springer.de/link/service/journals/00778/bibs/7006002/70060121.htm; http://link.springer.de/link/service/journals/00778/papers/7006002/70060121.pdf; http://link.springer.de/link/service/journals/00778/papers/7006002/70060121.ps.gz", abstract = "In this paper, we explore an approach of interleaving a bushy execution tree with hash filters to improve the execution of multi-join queries. Similar to semi-joins in distributed query processing, hash filters can be applied to eliminate non-matching tuples from joining relations before the execution of a join, thus reducing the join cost. Note that hash filters built in different execution stages of a bushy tree can have different costs and effects. The effect of hash filters is evaluated first. Then, an efficient scheme to determine an effective sequence of hash filters for a bushy execution tree is developed, where hash filters are built and applied based on the join sequence specified in the bushy tree so that not only is the reduction effect optimized but also the cost associated is minimized. Various schemes using hash filters are implemented and evaluated via simulation. It is experimentally shown that the application of hash filters is in general a very powerful means to improve the execution of multi-join queries, and the improvement becomes more prominent as the number of relations in a query increases.", acknowledgement = ack-nhfb, keywords = "bushy trees; hash filters; parallel query processing; sort-merge joins", remark = "Check month: May or August??", } @Article{Cohen:1997:RHF, author = "Jonathan D. Cohen", title = "Recursive Hashing Functions for $n$-Grams", journal = j-TOIS, volume = "15", number = "3", pages = "291--320", month = jul, year = "1997", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:04:41 MST 1999", bibsource = "Compendex database; http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/tois/abstracts/cohen.html", abstract = "Many indexing, retrieval, and comparison methods are based on counting or cataloguing n-grams in streams of symbols. The fastest method of implementing such operations is through the use of hash tables. Rapid hashing of consecutive n-grams is best done using a recursive hash function, in which the hash value of the current n-gram is derived from the hash value of its predecessor. This article generalizes recursive hash functions found in the literature and proposes new methods offering superior performance. Experimental results demonstrate substantial speed improvement over conventional approaches, while retaining near-ideal hash value distribution.", acknowledgement = ack-nhfb, affiliation = "Natl Security Agency", affiliationaddress = "Fort Meade, MD, USA", classification = "721.1; 723.2; 903.1; 903.3", journalabr = "ACM Trans Inf Syst", keywords = "Computational complexity; Data structures; Indexing (of information); Information retrieval; Recursive functions; Recursive hashing functions", } @Article{Czech:1997:PH, author = "Z. J. Czech and G. Havas and B. S. Majewski", title = "Perfect hashing", journal = j-THEOR-COMP-SCI, volume = "182", number = "1-2", pages = "1--43", day = "15", month = aug, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 14:14:47 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Silesia Univ. of Technol., Gliwice, Poland", keywords = "compilers; file organisation; hash functions; hashing; minimal perfect hash functions; operating systems", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Dixon:1997:HPS, author = "Brandon Dixon and John Swallow", title = "High-Performance Sorting Algorithms for the {CRAY T3D} Parallel Computer", journal = j-J-SUPERCOMPUTING, volume = "10", number = "4", pages = "371--395", month = dec, year = "1997", CODEN = "JOSUED", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF00227864", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 6 12:13:06 MDT 2005", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=10&issue=4; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.wkap.nl/issuetoc.htm/0920-8542+10+4+1997", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=10&issue=4&spage=371; http://www.wkap.nl/oasis.htm/134570", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Alabama Univ., Tuscaloosa, AL, USA", keywords = "CRAY T3D parallel computer; distributed memory systems; hash-and-chain sort; high-performance sorting algorithms; parallel algorithms; parallel processing; performance evaluation; randomised algorithms; sorting; sorting performance; Thinking Machines CM-5; toroidal network", pubcountry = "Netherlands", treatment = "A Application; P Practical", } @Article{Gueziec:1997:MIR, author = "Andr{\'e} P. Gu{\'e}ziec and Xavier Pennec and Nicholas Ayache", title = "Medical Image Registration Using Geometric Hashing", journal = j-IEEE-COMPUT-SCI-ENG, volume = "4", number = "4", pages = "29--41", month = oct # "\slash " # dec, year = "1997", CODEN = "ISCEE4", ISSN = "1070-9924", bibdate = "Sat Jan 9 08:57:23 MST 1999", bibsource = "http://www.computer.org/cse/cs1998; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/cs/books/cs1997/pdf/c4029.pdf; http://www.computer.org/cse/cs1998/c4029abs.htm", acknowledgement = ack-nhfb, } @Article{Harari:1997:HHF, author = "S. Harari", title = "{HCC}: {A} Hash Function Using Error Correcting Codes", journal = j-LECT-NOTES-COMP-SCI, volume = "1355", pages = "110--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Apr 28 08:51:33 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Hsiao:1997:PEH, author = "Hui-I Hsiao and Ming-Syan Chen and P. S. Yu", title = "Parallel Execution of Hash Joins in Parallel Databases", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "8", number = "8", pages = "872--883", month = aug, year = "1997", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Fri Nov 6 12:31:15 MST 1998", bibsource = "http://www.computer.org/tpds/td1997/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/td/books/td1997/pdf/l0872.pdf; http://www.computer.org/tpds/td1997/l0872abs.htm", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4250 (Database theory); C6160B (Distributed databases); C6160D (Relational databases)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "IEEE Transactions on Parallel and Distributed Systems", keywords = "allocation tree; bushy execution tree; database Signature Algorithm and may be used whenever a secure theory; distributed databases; hash filters; hash join parallel execution; parallel databases; parallel processing; performance; pipelining; processor allocation; query processing; relational algebra; relational databases; resource allocation; simulation; software performance evaluation; synchronous execution time; tree data structures", treatment = "T Theoretical or Mathematical", } @InProceedings{Indyk:1997:LPH, author = "Piotr Indyk and Rajeev Motwani and Prabhakar Raghavan and Santosh Vempala", title = "Locality-preserving hashing in multidimensional spaces", crossref = "ACM:1997:PTN", pages = "618--625", year = "1997", bibdate = "Wed Feb 20 18:34:03 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/258533/p618-indyk/p618-indyk.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/258533/p618-indyk/", acknowledgement = ack-nhfb, } @Manual{ISO:1997:ITS, author = "{ISO/IEC 10118}", title = "Information technology --- Security techniques --- theory; distributed databases; hash filters; hash join Hash-functions, Part 1: General ({IS}, 1994); Part 2: Hash-functions using an n-bit block cipher algorithm, ({IS}, 1994); Part 3: Dedicated hash-functions ({IS}, 1997); Part 4: Hash-functions using modular arithmetic, ({FCD}, 1997)", organization = pub-ISO, address = pub-ISO:adr, pages = "??", year = "1997", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, referencedin = "Referenced in \cite[Ref. 18]{Preneel:1997:CHF}.", } @Article{Jenkins:1997:AAH, author = "Bob Jenkins", title = "Algorithm Alley: Hash Functions", journal = j-DDJ, volume = "22", number = "9", pages = "107--109, 115--116", month = sep, year = "1997", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Fri Apr 30 10:04:44 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Describes a new hash function which is much better at producing uniform key distributions than others commonly used, yet remains acceptably fast. See \cite{Boyer:1998:AAR} for comparison with a related algorithm.", acknowledgement = ack-nhfb, } @Article{Johansson:1997:BHS, author = "T. Johansson", title = "Bucket Hashing with a Small Key Size", journal = j-LECT-NOTES-COMP-SCI, volume = "1233", pages = "149--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Karger:1997:CHR, author = "David Karger and Eric Lehman and Tom Leighton and Rina Panigrahy and Matthew Levine and Daniel Lewin", title = "Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the {World Wide Web}", crossref = "ACM:1997:PTN", pages = "654--663", year = "1997", bibdate = "Wed Feb 20 18:34:03 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/258533/p654-karger/p654-karger.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/258533/p654-karger/", acknowledgement = ack-nhfb, } @Article{Knudsen:1997:FSH, author = "Lars Ramkilde Knudsen and Bart Preneel", title = "Fast and Secure Hashing Based on Codes", journal = j-LECT-NOTES-COMP-SCI, volume = "1294", pages = "485--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:15 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1294.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1294/12940485.htm; http://link.springer-ny.com/link/service/series/0558/papers/1294/12940485.pdf", acknowledgement = ack-nhfb, } @Article{Mahapatra:1997:SGL, author = "Nihar R. Mahapatra and Shantanu Dutt", title = "Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel {A}* Graph Search", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "8", number = "7", pages = "738--756", month = jul, year = "1997", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Fri Nov 6 12:31:15 MST 1998", bibsource = "http://www.computer.org/tpds/td1997/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/td/books/td1997/pdf/l0738.pdf; http://www.computer.org/tpds/td1997/l0738abs.htm", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C1230 (Artificial intelligence); C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6120 (File organisation)", corpsource = "Dept. of Electr. and Comput. Eng., State Univ. of New York, Buffalo, NY, USA", fjournal = "IEEE Transactions on Parallel and Distributed Systems", keywords = "delays; disjoint processor groups; distributed-memory machines; duplicate pruning; file organisation; hot spots; hot-spot probability; hypercube; interprocessor duplicates; intersubcube communication; load balance; load balancing; local hashing strategies; lower bounds; message delivery; message latency; multiprocessor interconnection networks; nCUBE2 hypercube multicomputer; parallel A* algorithms; parallel A* graph search; parallel algorithms; scalable global strategies; search problems; search-space partitioning scheme; state space; traveling salesman problem; upper bounds", treatment = "A Application; P Practical", } @Article{Poblete:1997:ALL, author = "Patricio V. Poblete and Alfredo Viola and J. Ian Munro", title = "Analyzing the {LCFS} Linear Probing Hashing Algorithm with the Help of Maple", journal = j-MAPLE-TECH-NEWS, volume = "4", number = "1", pages = "8--13", month = "Winter", year = "1997", ISSN = "1061-5733", bibdate = "Wed Jul 23 09:11:50 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Preneel:1997:CHF, author = "Bart Preneel and Antoon Bosselaers and Hans Dobbertin", title = "The Cryptographic Hash Function {RIPEMD-160}", journal = j-CRYPTOBYTES, volume = "3", number = "2", pages = "9--14", month = "Autumn", year = "1997", bibdate = "Tue Oct 20 12:08:21 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "ftp://ftp.rsa.com/pub/cryptobytes/crypto3n2.pdf", acknowledgement = ack-nhfb, } @Article{Preneel:1997:HFM, author = "B. Preneel", title = "Hash Functions and {MAC} Algorithms Based on Block Ciphers", journal = j-LECT-NOTES-COMP-SCI, volume = "1355", pages = "270--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Apr 28 08:51:33 MDT 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1997b.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Preneel:1997:MHF, author = "B. Preneel", title = "{MACs} and Hash Functions: State of the Art", journal = "Information Security Technical Report", volume = "2", number = "2", publisher = "Elsevier Science", pages = "33--43", year = "1997", CODEN = "????", ISSN = "1363-4127", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "11", } @Article{Ramakrishna:1997:EHH, author = "M. V. Ramakrishna and E. Fu and E. Bahcekapili", title = "Efficient hardware hashing functions for high performance computers", journal = j-IEEE-TRANS-COMPUT, volume = "46", number = "12", pages = "1378--1381", month = dec, year = "1997", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/12.641938", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jul 6 10:06:26 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=641938", abstract = "Hashing is critical for high performance computer architecture. Hashing is used extensively in hardware applications, such as page tables, for address translation. Bit extraction and exclusive ORing hashing ``methods'' are two commonly used hashing functions for hardware applications. There is no study of the performance of these functions and no mention anywhere of the practical performance of the hashing functions in comparison with the theoretical performance prediction of hashing schemes. In this paper, we show that, by choosing hashing functions at random from a particular class, called $H_3$, of hashing functions, the analytical performance of hashing can be achieved in practice on real-life data. Our results about the expected worst case performance of hashing are of special significance, as they provide evidence for earlier theoretical predictions", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", } @Article{Raman:1997:KFM, author = "Anand V. Raman", title = "The {Katapayadi} Formula and the Modern Hashing Technique", journal = j-IEEE-ANN-HIST-COMPUT, volume = "19", number = "4", pages = "49--52", month = "", year = "1997", CODEN = "IAHCEX", ISSN = "1058-6180 (print), 1934-1547 (electronic)", ISSN-L = "1058-6180", bibdate = "Fri Nov 01 10:40:59 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Annals of the History of Computing", xxnote = "Check page number overlap with \cite{Shapiro:1997:SDH}.", } @Article{Rigoutsos:1997:GEI, author = "Isidore Rigoutsos and Haim J. Wolfson", title = "{Guest Editors}' Introduction: Geometric Hashing", journal = j-IEEE-COMPUT-SCI-ENG, volume = "4", number = "4", pages = "9--9", month = oct # "\slash " # dec, year = "1997", CODEN = "ISCEE4", ISSN = "1070-9924", bibdate = "Sat Jan 9 08:57:23 MST 1999", bibsource = "http://www.computer.org/cse/cs1998; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/cs/books/cs1997/pdf/c4009.pdf", acknowledgement = ack-nhfb, } @Article{Sabharwal:1997:IDN, author = "C. L. Sabharwal and S. K. Bhatia", title = "Image databases and near-perfect hash table", journal = j-PATTERN-RECOGN, volume = "30", number = "11", publisher = "Elsevier Science", pages = "1867--1876", month = nov, year = "1997", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "10", } @Article{Smith:1997:EHF, author = "Bradley J. Smith and Gregory L. Heileman and Chaouki Abdallah", title = "The exponential hash function", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "2", pages = "3:1--3:??", month = "????", year = "1997", DOI = "http://doi.acm.org/10.1145/264216.264221", ISSN = "1084-6654", bibdate = "Mon Oct 6 16:02:14 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; jea.bib", abstract = "In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter choices are provided for a number of hash functions. We also demonstrate experimentally that exponential hashing essentially matches the performance of a widely-used optimal double hash function for uniform data distributions, and performs significantly better for nonuniform data distributions. We show that exponential hashing exhibits a higher integer Lyapunov exponent and entropy than double hashing for initial data probes, which offers one explanation for its improved performance on nonuniform data distributions.", acknowledgement = ack-nhfb, articleno = "3", keywords = "ADT; chaos; dynamic dictionary; dynamical systems theory; exponential hashing; Lyapunov exponent; number theory", } @Article{Surendro:1997:NRO, author = "K. Surendro and Y. Anzai", title = "Non-rigid Object Recognition Using Principal Component Analysis and Geometric Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1296", pages = "50--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Apr 28 08:51:33 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Taylor:1997:AHN, author = "Stephen Taylor and Nabil Hachem and Stanley Selkow", title = "The average height of a node in the {BANG} abstract directory tree", journal = j-INFO-PROC-LETT, volume = "61", number = "1", pages = "55--61", day = "14", month = jan, year = "1997", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", MRclass = "68P05", MRnumber = "1 439 868", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA", keywords = "abstract data types; abstract logical data structure; average insertion cost; average node height; average search cost; BANG abstract directory tree; BANG file directory; bucket; bucket capacity; file size; growth on data principle; multi-dimensional file structures; multiway tree structure; order constant; perfect hashing; simulation; tree data structures; tree growth; virtual machines", treatment = "T Theoretical or Mathematical", } @Article{Tomasic:1997:DSE, author = "Anthony Tomasic and Luis Gravano and Calvin Lue and Peter Schwarz and Laura Haas", title = "Data Structures for Efficient Broker Implementation", journal = j-TOIS, volume = "15", number = "3", pages = "223--253", month = jul, year = "1997", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:04:41 MST 1999", bibsource = "Compendex database; http://www.acm.org/pubs/tois/toc.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org:80/tois/abstracts/tomasic.html", abstract = "With the profusion of text databases on the Internet, it is becoming increasingly hard to find the most useful databases for a given query. To attack this problem, several existing and proposed systems employ brokers to direct user queries, using a local database of summary information about the available databases. This summary information must effectively distinguish relevant databases and must be compact while allowing efficient access. We offer evidence that one broker, GlOSS, can be effective at locating databases of interest even in a system of hundreds of databases and can examine the performance of accessing the GlOSS summaries for two promising storage methods: the grid file and partitioned hashing. We show that both methods can be tuned to provide good performance for a particular workload (within a broad range of workloads), and we discuss the tradeoffs between the two data structures. As a side effect of our work, we show that grid files are more broadly applicable than previously thought; in particular, we show that by varying the policies used to construct the grid file we can provide good performance for a wide range of workloads even when storing highly skewed data.", acknowledgement = ack-nhfb, affiliation = "INRIA Rocquencourt", affiliationaddress = "Le Chesnay, Fr", classification = "722.1; 722.2; 723.2; 723.3; 903.3", journalabr = "ACM Trans Inf Syst", keywords = "Data storage equipment; Data structures; Distributed database systems; Grid files; Information retrieval; Internet; Partitioned hashing; Query languages; Text databases; User interfaces", } @Article{Varghese:1997:HHT, author = "George Varghese and Anthony Lauck", title = "Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility", journal = j-IEEE-TRANS-NETWORKING, volume = "5", number = "6", pages = "824--834", month = dec, year = "1997", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Tue Jul 27 15:53:14 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/ton/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/citations/journals/ton/1997-5-6/p824-varghese/", acknowledgement = ack-nhfb, keywords = "algorithms; design; measurement; performance; reliability", subject = "{\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", } @Article{Wild:1997:AAB, author = "Fred Wild", title = "Algorithm Alley", journal = j-DDJ, volume = "22", number = "3", pages = "105--??", month = mar, year = "1997", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Fri Mar 7 11:01:56 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Based on string ``internalization'' techniques used in Scheme and LISP, Istring --- the C++ class Fred presents here --- is a hashing mechanism that provides both compact storage and fast equality tests.", acknowledgement = ack-nhfb, } @Article{Wolfson:1997:GHO, author = "Haim J. Wolfson and Isidore Rigoutsos", title = "Geometric Hashing: An Overview", journal = j-IEEE-COMPUT-SCI-ENG, volume = "4", number = "4", pages = "10--21", month = oct # "\slash " # dec, year = "1997", CODEN = "ISCEE4", ISSN = "1070-9924", bibdate = "Sat Jan 9 08:57:23 MST 1999", bibsource = "http://www.computer.org/cse/cs1998; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://dlib.computer.org/cs/books/cs1997/pdf/c4010.pdf; http://www.computer.org/cse/cs1998/c4010abs.htm", acknowledgement = ack-nhfb, } @Article{Yang:1997:HFM, author = "Cheng-Hsing Yang and Chia-Chun Tsai and Jan-Ming Ho and Sao-Jie Chen", title = "Hmap: a fast mapper for {EPGAs} using extended {GBDD} hash tables", journal = j-TODAES, volume = "2", number = "2", pages = "135--150", month = jan, year = "1997", CODEN = "ATASFO", ISSN = "1084-4309 (print), 1557-7309 (electronic)", bibdate = "Fri Jul 27 10:05:33 MDT 2001", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/journals/todaes/1997-2-2/p135-yang/p135-yang.pdf; http://www.acm.org/pubs/citations/journals/todaes/1997-2-2/p135-yang/", abstract = "A fast and efficient algorithm for technology mapping of electrically programmable gate arrays (EPGAs) is proposed. This Hmap algorithm covers the Boolean network with programmed logic modules bottom-up. The covering operation is based on collapsing the fanins of a node to form a bigger supernode such that fewer clusters are needed to be detected. Then Boolean matching is used to detect whether the collapsed supernode can be mapped into a logic module by looking up an extended GBDD hash table. The use of this table look-up matching can shorten the matching time significantly. As shown in the experiments, the average running time of Hmap is 20 times faster than that of MIS-pga2.", acknowledgement = ack-nhfb, generalterms = "Design", subject = "Hardware --- Integrated Circuits --- Design Aids (B.7.2); Hardware --- Integrated Circuits --- Types and Design Styles (B.7.1): {\bf Gate arrays}", } @Article{Yi:1997:NHF, author = "X. Yi and K.-Y. Lam", title = "A new hash function based on block cipher", journal = j-LECT-NOTES-COMP-SCI, volume = "1270", pages = "139--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Aug 26 16:37:43 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Abdukhalikov:1998:SHS, author = "Kanat S. Abdukhalikov and Chul Kim", title = "On the Security of the Hashing Scheme Based on {SL$_2$}", journal = j-LECT-NOTES-COMP-SCI, volume = "1372", pages = "93--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:41 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1372.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1372/13720093.htm; http://link.springer-ny.com/link/service/series/0558/papers/1372/13720093.pdf", acknowledgement = ack-nhfb, } @Article{Aiello:1998:NCS, author = "William Aiello and Stuart Haber and Ramarathnam Venkatesan", title = "New Constructions for Secure Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1372", pages = "150--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:41 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1372.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1372/13720150.htm; http://link.springer-ny.com/link/service/series/0558/papers/1372/13720150.pdf", acknowledgement = ack-nhfb, } @Article{Ang:1998:TLH, author = "C. H. Ang and S. T. Tan and T. C. Tan", title = "Tried Linear Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1538", pages = "86--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:53:24 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1538.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1538/15380086.htm; http://link.springer-ny.com/link/service/series/0558/papers/1538/15380086.pdf", acknowledgement = ack-nhfb, } @Article{Baeza-Yates:1998:ALH, author = "Ricardo A. Baeza-Yates and H{\'e}ctor Soza-Pollman", title = "Analysis of Linear Hashing Revisited", journal = j-NORDIC-J-COMPUT, volume = "5", number = "1", pages = "70--85", month = "Spring", year = "1998", CODEN = "NJCOFR", ISSN = "1236-6064", MRclass = "68P10 (68Q25)", MRnumber = "98m:68048", bibdate = "Fri Nov 13 16:14:15 MST 1998", bibsource = "http://www.cs.helsinki.fi/njc/njc5.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.cs.helsinki.fi/njc/References/baeza-yatess1998:70.html", acknowledgement = ack-nhfb, } @Article{Benzinger:1998:SCB, author = "Mike Benzinger", title = "{STL} Containers Based on Hash Tables", journal = j-CCCUJ, volume = "16", number = "2", pages = "??--??", month = feb, year = "1998", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Tue May 14 18:09:14 MDT 2002", bibsource = "http://www.cuj.com/articles/1998/9802/9802toc.htm?topic=articles; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hash tables offer a nice balance between insertion and lookup times. Too bad they didn't quite make it into the C++ Standard.", acknowledgement = ack-nhfb, } @Article{Blackburn:1998:OLP, author = "S. R. Blackburn and P. R. Wild", title = "Optimal Linear Perfect Hash Families", journal = j-J-COMB-THEORY-A, volume = "83", number = "2", publisher = "Academic Press, 525 B Street, Suite 1900, San Diego, CA, 92101-4495", pages = "233--250", month = aug, year = "1998", CODEN = "JCBTA7", ISSN = "0097-3165", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "18", } @Article{Boyer:1998:AAR, author = "John Boyer", title = "Algorithm Alley: Resizable Data Structures", journal = j-DDJ, volume = "23", number = "1", pages = "115--116, 118, 129", month = jan, year = "1998", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Dec 2 08:43:37 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Discusses some deficiencies of the Java library hash table support, and compares it with his algorithm and that used in the C++ Standard Template Library. Also compares the Jenkins hash function \cite{Jenkins:1997:AAH} with the one proposed in this paper.", abstract = "Resizable data structures are flexible, but array-based structures are fast. John shows you how to get the best of both worlds. Additional resources include: HATs: Hashed Array Trees (Algorithm Alley), by Edward Sitarski, The Fibonacci Heap (Algorithm Alley), by John Boyer, Hashing Rehashed, by Andrew Binstock, Hash Functions (Algorithm Alley), by Bob Jenkins, AA0198.TXT (listings) and AA0198.ZIP (source code).", acknowledgement = ack-nhfb, } @Article{Brassard:1998:QCH, author = "G. Brassard and P. Hoyer and A. Tapp", title = "Quantum Cryptanalysis of Hash and Claw-Free Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1380", pages = "163--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Oct 10 14:40:24 MDT 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1998a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Canetti:1998:POW, author = "Ran Canetti and Daniele Micciancio and Omer Reingold", title = "Perfectly one-way probabilistic hash functions (preliminary version)", crossref = "ACM:1998:PTA", pages = "131--140", year = "1998", bibdate = "Wed Feb 20 18:34:03 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/276698/p131-canetti/p131-canetti.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/276698/p131-canetti/", acknowledgement = ack-nhfb, } @Article{Chu:1998:EHB, author = "K. W. Chu and S. K. Lam and M. H. Wong", title = "An efficient hash-based algorithm for sequence data searching", journal = j-COMP-J, volume = "41", number = "6", pages = "402--415", month = "????", year = "1998", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jul 21 09:55:34 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/Volume_41/Issue_06/Vol41_06.index.html", URL = "http://www3.oup.co.uk/computer_journal/Volume_41/Issue_06/Vol41_06.body.html#AbstractChu", acknowledgement = ack-nhfb, email-1 = "mhwong@cse.cuhk.edu.hk", } @Article{Cohen:1998:GHS, author = "Jonathan D. Cohen", title = "An $n$-gram Hash and Skip Algorithm for Finding Large Numbers of Keywords in Continuous Text Streams", journal = j-SPE, volume = "28", number = "15", pages = "1605--1635", day = "25", month = dec, year = "1998", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", bibdate = "Thu Jul 29 15:12:07 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=10050312; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=10050312&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, } @Article{Cromwell:1998:PBD, author = "Jeff Cromwell", title = "Programmer's Bookshelf: The Dawning of the Age of Multithreading", journal = j-DDJ, volume = "23", number = "9", pages = "127, 129", month = sep, year = "1998", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Aug 05 10:12:23 1998", bibsource = "http://www.ddj.com/ddj/1998/1998_09/index.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "", abstract = "Jeff's focus this month is multithreading, as he examines {\em Multithreading Programming Techniques in Win32}, by Jim Beveridge and R. Wiener, {\em Object-Oriented Multithreading Using C++}, by Cameron and Tracy Hughes, and {\em Multithreading Programming Techniques}, by Shashi Prasad.", acknowledgement = ack-nhfb, } @Article{Czech:1998:QPH, author = "Zbigniew J. Czech", title = "Quasi-perfect hashing", journal = j-COMP-J, volume = "41", number = "6", pages = "??--??", month = "????", year = "1998", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jul 21 09:55:34 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/Volume_41/Issue_06/Vol41_06.index.html", URL = "http://www3.oup.co.uk/computer_journal/Volume_41/Issue_06/Vol41_06.body.html#AbstractCzech", acknowledgement = ack-nhfb, email-1 = "zjc@silesia.pl", } @Article{Daemen:1998:FHS, author = "J. Daemen and C. S. K. Clapp", title = "Fast Hashing and Stream Encryption with {PANAMA}", journal = j-LECT-NOTES-COMP-SCI, volume = "1372", pages = "60--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Apr 28 08:51:33 MDT 1998", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1998a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Daemen:1998:PCF, author = "Joan Daemen and Craig Clapp", title = "The {Panama} Cryptographic Function", journal = j-DDJ, volume = "23", number = "12", pages = "42, 44, 46, 48--49", month = dec, year = "1998", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Nov 4 06:53:48 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.ddj.com/ddj/1998/1998_12/../../../ftp/1998/1998_12/panama.zip", abstract = "Panama, a cryptographic module that can be used both as a cryptographic hash function and stream cipher, is designed to be very efficient in software implementations on 32-bit architectures. Joan and Craig examine Panama's basic design principles and implementation. Additional resources include panama.zip (source code).", acknowledgement = ack-nhfb, } @Article{Damiani:1998:EDH, author = "Ernesto Damiani and Valentino Liberali and Andrea G. B. Tettamanzi", title = "Evolutionary Design of Hashing Function Circuits Using an {FPGA}", journal = j-LECT-NOTES-COMP-SCI, volume = "1478", pages = "36--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:52:53 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1478.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1478/14780036.htm; http://link.springer-ny.com/link/service/series/0558/papers/1478/14780036.pdf", acknowledgement = ack-nhfb, } @Article{Flajolet:1998:ALP, author = "Philippe Flajolet and Patricio V. Poblete and Alfredo Viola", title = "On the Analysis of Linear Probing Hashing", journal = j-ALGORITHMICA, volume = "22", number = "4", pages = "490--515", month = dec, year = "1998", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68P10 (60F05 68W40)", MRnumber = "MR1701625 (2000h:68056)", MRreviewer = "E. M. Reingold", bibdate = "Fri Jan 6 11:38:10 MST 2006", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica22.html#FlajoletPV98; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=22&issue=4; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database", note = "Average-case analysis of algorithms", URL = "http://link.springer.de/link/service/journals/00453/bibs/22n4p490.html; http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=22&issue=4&spage=490", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "FlajoletPV98", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/FlajoletPV98", } @Article{Gil:1998:SFP, author = "Joseph Gil and Yossi Matias", title = "Simple Fast Parallel Hashing by Oblivious Execution", journal = j-SIAM-J-COMPUT, volume = "27", number = "5", pages = "1348--1375", month = oct, year = "1998", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Sat Dec 5 17:26:53 MST 1998", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/27/5; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/29158", acknowledgement = ack-nhfb, } @InProceedings{Graefe:1998:HJH, author = "Goetz Graefe and Ross Bunker and Shaun Cooper", title = "Hash Joins and Hash Teams in {Microsoft SQL} Server", crossref = "Gupta:1998:PTF", pages = "86--97", year = "1998", bibdate = "Fri Jan 12 07:50:36 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb98.html; OCLC Proceedings database", URL = "http://www.vldb.org/dblp/db/conf/vldb/GraefeBC98.html", acknowledgement = ack-nhfb, authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/g/Graefe:Goetz.html; http://www.vldb.org/dblp/db/indices/a-tree/b/Bunker:Ross.html; http://www.vldb.org/dblp/db/indices/a-tree/c/Cooper:Shaun.html", } @Article{Griebel:1998:ASG, author = "M. Griebel", title = "Adaptive Sparse Grid Multilevel Methods for Elliptic {PDEs} Based on Finite Differences", journal = j-COMPUTING, volume = "61", number = "2", pages = "151--179", year = "1998", CODEN = "CMPTA2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", MRclass = "65N06 (65N50)", MRnumber = "99j:65184", MRreviewer = "J. D. P. Donnelly", bibdate = "Fri Oct 15 15:41:44 MDT 1999", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8; MathSciNet database; OCLC Contents1st database", URL = "http://www.springer.at/journals/pdf/3571.pdf; http://www.springer.at/journals/pdf/3815.pdf", acknowledgement = ack-nhfb, classification = "921.1; 921.2; 921.5; 921.6", journalabr = "Comput Vienna New York", keywords = "Adaptive sparse grid multilevel methods; Discretization; Finite difference method; Hash tables; Mathematical programming; Partial differential equations; Tensors", } @Article{Knudsen:1998:AFD, author = "Lars R. Knudsen and Xuejia Lai and Bart Preneel", title = "Attacks on Fast Double Block Length Hash Functions", journal = j-J-CRYPTOLOGY, volume = "11", number = "1", pages = "59--72", month = "Winter", year = "1998", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", MRclass = "94A60", MRnumber = "1 609 477", bibdate = "Sat Nov 21 16:36:38 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/journals/00145/bibs/11n1p59.html; http://link.springer.de/link/service/journals/00145/bibs/11n1p59.pdf; http://link.springer.de/link/service/journals/00145/bibs/11n1p59.tex; http://link.springer.de/link/service/journals/00145/tocs/01101.html", acknowledgement = ack-nhfb, } @Article{Knuth:1998:LPG, author = "Donald E. Knuth", title = "Linear Probing and Graphs", journal = j-ALGORITHMICA, volume = "22", number = "4", pages = "561--568", month = dec, year = "1998", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68P10 (05C85 68R10 68W40)", MRnumber = "MR1701629 (2000j:68037)", bibdate = "Fri Jan 6 11:38:10 MST 2006", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica22.html#Knuth98; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=22&issue=4; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database", note = "Average-case analysis of algorithms", URL = "http://link.springer.de/link/service/journals/00453/bibs/22n4p561.html; http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=22&issue=4&spage=561", abstract = "Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connected graphs in 1977, and Kreweras related the inversions of trees to the so-called ``parking problem'' in 1980. A combination of these three results leads to a surprisingly simple analysis of the behavior of hashing by linear probing, including higher moments of the cost of successful search.", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", keywords = "hashing; inversions; labeled trees; linear probing; parking problem; sparse graphs", oldlabel = "Knuth98", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Knuth98", } @Article{Leppanen:1998:BPS, author = "V. Lepp{\"a}nen", title = "Balanced {PRAM} Simulations via Moving Threads and Hashing", journal = j-J-UCS, volume = "4", number = "8", pages = "675--??", day = "28", month = aug, year = "1998", CODEN = "", ISSN = "0948-6968", bibdate = "Mon Oct 26 09:56:13 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://medoc.springer.de:8000/jucs/jucs_4_8/balanced_pram_simulations_via", acknowledgement = ack-nhfb, } @Article{Mihaljevic:1998:CAB, author = "Miodrag Mihaljevic and Yuliang Zheng and Hideki Imai", title = "A cellular automaton based fast one-way hash function suitable for hardware implementation", journal = j-LECT-NOTES-COMP-SCI, volume = "1431", pages = "217--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:52:22 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1431.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1431/14310217.htm; http://link.springer-ny.com/link/service/series/0558/papers/1431/14310217.pdf", acknowledgement = ack-nhfb, } @Article{Mochizuki:1998:SSA, author = "H. Mochizuki and M. Koyama and M. Shishibori and J.-i. Aoe", title = "A substring search algorithm in extendible hashing", journal = j-INFO-SCI, volume = "108", number = "1", publisher = "Elsevier Science", pages = "13--30", month = jul, year = "1998", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "18", } @Article{Oaks:1998:BSH, author = "Scott Oaks", title = "The Burden of Synchronization: Hashtable vs. HashMap", journal = j-JAVA-REPORT, volume = "3", number = "??", pages = "??--??", month = aug, year = "1998", CODEN = "JREPFI", ISSN = "1086-4660", bibdate = "Sat Dec 26 13:52:53 1998", bibsource = "http://archive.javareport.com/9808/html/from_pages/index.shtml; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The relative performance characteristics of various classes that perform a hashtable lookup and the behavior of those classes in programs with multiple threads.", acknowledgement = ack-nhfb, } @Article{Peyravian:1998:PHV, author = "M. Peyravian and A. Roginsky and A. Kshemkalyani", title = "On Probabilities of Hash Value Matches", journal = j-COMPUT-SECUR, volume = "17", number = "2", publisher = "Elsevier Science", pages = "171--176", month = mar, year = "1998", CODEN = "CPSEDU", ISSN = "0167-4048", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "6", } @Article{Pieprzyk:1998:RSF, author = "Josef Pieprzyk and Cheng Xin Qu", title = "Rotation-Symmetric Functions and Fast Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1438", pages = "169--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:52:27 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1438.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1438/14380169.htm; http://link.springer-ny.com/link/service/series/0558/papers/1438/14380169.pdf", acknowledgement = ack-nhfb, } @Article{Plauger:1998:SCCk, author = "P. J. Plauger", title = "{Standard C/C++}: Hash Tables", journal = j-CCCUJ, volume = "16", number = "11", pages = "10--??", month = nov, year = "1998", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Tue May 14 18:09:18 MDT 2002", bibsource = "http://www.cuj.com/articles/1998/9811/9811toc.htm?topic=articles; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hash tables didn't make it into the C++ Standard, but they're too popular to ignore.", acknowledgement = ack-nhfb, } @Article{Safavi-Naini:1998:MH, author = "Rei Safavi-Naini and Shahram Bakhtiari and Chris Charnes", title = "{MRD} Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "1372", pages = "134--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:51:41 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1372.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1372/13720134.htm; http://link.springer-ny.com/link/service/series/0558/papers/1372/13720134.pdf", acknowledgement = ack-nhfb, } @Article{Shin:1998:NHF, author = "Sang Uk Shin and Kyung Hyune Rhee and Dae Hyun Ryu and Sang Jin Lee", title = "A new hash function based on {MDx}-family and its application to {MAC}", journal = j-LECT-NOTES-COMP-SCI, volume = "1431", pages = "234--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:52:22 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1431.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1431/14310234.htm; http://link.springer-ny.com/link/service/series/0558/papers/1431/14310234.pdf", acknowledgement = ack-nhfb, } @Article{Shintani:1998:MAS, author = "T. Shintani and M. Kitsuregawa", title = "Mining Algorithms for Sequential Patterns in Parallel: Hash Based Approach", journal = j-LECT-NOTES-COMP-SCI, volume = "1394", pages = "283--294", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 14 11:56:12 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1998a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "data mining; knowledge discovery; PAKDD", } @Article{Simon:1998:FCO, author = "Daniel R. Simon", title = "Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?", journal = j-LECT-NOTES-COMP-SCI, volume = "1403", pages = "334--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 5 11:52:03 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1403.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1403/14030334.htm; http://link.springer-ny.com/link/service/series/0558/papers/1403/14030334.pdf", acknowledgement = ack-nhfb, } @Misc{Thomlinson:1998:NBP, author = "Matthew W. Thomlinson and Daniel R. Simon and Bennet Yee", title = "Non-biased pseudo random number generator", howpublished = "United States Patent 5,778,069.", day = "7", month = jul, year = "1998", bibdate = "Tue Dec 27 16:52:07 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http:www.google.com/patents/US5778069", abstract = "A computer-implemented pseudo random number generator includes an input device to assemble multiple classes of bits from multiple sources into an input bit string. The multiple classes of bits include an internal class of bits from at least one source internal to the random number generator, such as a static bit register which maintains the current state of the generator. The input device also gathers one or more external classes of bits from one or more sources external to the random number generator, such as a machine class of bits which relate to operating parameters of the computer and an application class of bits which relate to execution of an application running on the computer. The input device concatenates the three classes of bits into an arbitrary length input bit string. The random number generator also has a hash computing device which computes an m-bit hash value of the input bit string assembled by the input device. The hash computing device computes the hash value using a hashing function, such as SHA (secure hash algorithm), whereby it is computationally infeasible to derive the concatenated input bit string from the output hash value or intentionally bias the output of the hash function. The SHA is a one-way hash that reduces the 512-bit input bit string to a 160-bit hash value. The hash value becomes the initializing seed for the random number generator. A stream generator (i.e., a stream cipher) is coupled to the hash computing device to receive the hash value. The stream generator uses the hash value as the initializing seed to produce an output bit string of random (or pseudo random) bits.", acknowledgement = ack-nhfb, } @Article{Viola:1998:ALP, author = "Alfredo Viola and Patricio V. Poblete", title = "The Analysis of Linear Probing Hashing with Buckets", journal = j-ALGORITHMICA, volume = "21", number = "1", pages = "37--71", month = may, year = "1998", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68Q25 (68P10)", MRnumber = "MR1612215 (2000a:68055)", MRreviewer = "Linda Pagli", bibdate = "Fri Jan 6 11:38:09 MST 2006", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica21.html#ViolaP98; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=21&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; MathSciNet database", note = "Fourth European Symposium on Algorithms (Barcelona, 1996)", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=21&issue=1&spage=37", acknowledgement = ack-nhfb, fjournal = "Algorithmica. An International Journal in Computer Science", oldlabel = "ViolaP98", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/ViolaP98", } @Article{Alon:1999:LHF, author = "Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G{\'a}bor Tardos", title = "Linear hash functions", journal = j-J-ACM, volume = "46", number = "5", pages = "667--683", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1999-46-5/p667-alon/", acknowledgement = ack-nhfb, } @TechReport{Beebe:1999:HTL, author = "Nelson H. F. Beebe", title = "The Hash Table Library", type = "Report", institution = inst-CSC, address = inst-CSC:adr, pages = "10", day = "12", month = mar, year = "1999", bibdate = "Sun Sep 24 11:27:51 2006", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.math.utah.edu/pub/emacs/; http://www.math.utah.edu/pub/emacs/hash-1.00.tar.gz", acknowledgement = ack-nhfb, remark = "Documents a library of functions in GNU Emacs Lisp for dynamic hash tables.", } @Article{Devroye:1999:HSR, author = "Luc Devroye", title = "The Height and Size of Random Hash Trees and Random Pebbled Hash Trees", journal = j-SIAM-J-COMPUT, volume = "28", number = "4", pages = "1215--1224", month = aug, year = "1999", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Sat Jul 17 20:22:13 MDT 1999", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/28/4; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/32617", acknowledgement = ack-nhfb, } @InProceedings{Etzel:1999:SHF, author = "M. Etzel and S. Patel and Z. Ramzan", title = "Square Hash: Fast Message Authentication via Optimized Universal Hash Functions", crossref = "Wiener:1999:ACC", pages = "234--251", year = "1999", bibdate = "Mon Sep 13 12:03:08 MDT 1999", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1666.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1666/16660234.htm; http://link.springer-ny.com/link/service/series/0558/papers/1666/16660234.pdf", acknowledgement = ack-nhfb, keywords = "crypto; cryptology; IACR", } @Article{Gennaro:1999:SHS, author = "R. Gennaro and S. Halevi and T. Rabin", title = "Secure Hash-and-Sign Signatures Without the Random Oracle", journal = j-LECT-NOTES-COMP-SCI, volume = "1592", pages = "123--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Sep 13 16:57:02 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1999a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Gionis:1999:SSH, author = "Aristides Gionis and Piotr Indyk and Rajeev Motwani", title = "Similarity Search in High Dimensions via Hashing", crossref = "Atkinson:1999:PTF", pages = "518--529", year = "1999", bibdate = "Fri Jan 12 07:50:37 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb99.html; OCLC Proceedings database", URL = "http://www.vldb.org/dblp/db/conf/vldb/GionisIM99.html", acknowledgement = ack-nhfb, authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/g/Gionis:Aristides.html; http://www.vldb.org/dblp/db/indices/a-tree/i/Indyk:Piotr.html; http://www.vldb.org/dblp/db/indices/a-tree/m/Motwani:Rajeev.html", } @InProceedings{Graefe:1999:VMJ, author = "Goetz Graefe", title = "The Value of Merge-Join and Hash-Join in {SQL} Server", crossref = "Atkinson:1999:PTF", pages = "250--253", year = "1999", bibdate = "Fri Jan 12 07:50:37 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb99.html; OCLC Proceedings database", URL = "http://www.vldb.org/dblp/db/conf/vldb/Graefe99.html", acknowledgement = ack-nhfb, authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/g/Graefe:Goetz.html", } @Article{Griebel:1999:PMA, author = "M. Griebel and G. Zumbusch", title = "Parallel multigrid in an adaptive {PDE} solver based on hashing and space-filling curves", journal = j-PARALLEL-COMPUTING, volume = "25", number = "7", publisher = "Elsevier Science", pages = "827--843", month = jul, year = "1999", CODEN = "PACOEJ", ISSN = "0167-8191", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "17", } @Article{Hsieh:1999:OWH, author = "T. -M. Hsieh and Y. -S. Yeh and C. -H. Lin and S. -H. Tuan", title = "One-way hash functions with changeable parameters", journal = j-INFO-SCI, volume = "118", number = "1", publisher = "Elsevier Science", pages = "223--239", month = sep, year = "1999", CODEN = "ISIJBC", ISSN = "0020-0255", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "17", } @Article{Karger:1999:WCC, author = "David Karger and Alex Sherman and Andy Berkheimer and Bill Bogstad and Rizwan Dhanidina and Ken Iwamoto and Brian Kim and Luke Matkins and Yoav Yerushalmi", title = "{Web} caching with consistent hashing", journal = j-COMP-NET-AMSTERDAM, volume = "31", number = "11--16", pages = "1203--1213", day = "17", month = may, year = "1999", CODEN = "????", ISSN = "1389-1286", bibdate = "Fri Sep 24 19:43:29 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1999&volume=31&issue=11-16; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.elsevier.com/cas/tree/store/comnet/sub/1999/31/11-16/2181.pdf", acknowledgement = ack-nhfb, } @InProceedings{Kemper:1999:GHT, author = "Alfons Kemper and Donald Kossmann and Christian Wiesner", title = "Generalised Hash Teams for Join and Group-by", crossref = "Atkinson:1999:PTF", pages = "30--41", year = "1999", bibdate = "Fri Jan 12 07:50:37 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb99.html; OCLC Proceedings database", URL = "http://www.vldb.org/dblp/db/conf/vldb/KemperKW99.html", acknowledgement = ack-nhfb, authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/k/Kemper:Alfons.html; http://www.vldb.org/dblp/db/indices/a-tree/k/Kossmann:Donald.html; http://www.vldb.org/dblp/db/indices/a-tree/w/Wiesner:Christian.html", } @InProceedings{Kim:1999:LEO, author = "Jeong Han Kim and D. R. Simon and P. Tetali", title = "Limits on the efficiency of one-way permutation-based hash functions", crossref = "IEEE:1999:ASF", pages = "535--542", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kim:1999:NSP, author = "Sun Kim", title = "A new string-pattern matching algorithm using partitioning and hashing efficiently", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "4", pages = "2:1--2:??", month = "????", year = "1999", DOI = "http://doi.acm.org/10.1145/347792.347803", ISSN = "1084-6654", bibdate = "Mon Oct 6 16:02:52 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; jea.bib", abstract = "In this paper, we present a new string-pattern matching algorithm that partitions the text into segments of the input pattern length and searches for pattern occurrences using a simple hashing scheme. Unlike the well known Boyer--Moore style algorithm, our algorithm does not compute variable shift length, thus providing a conceptually simpler way to search for patterns. Empirical evaluation shows that our algorithm runs significantly faster than Sunday's and Horspool's extensions of the Boyer--Moore algorithm. The notion of the non-occurrence heuristic used in our algorithm, together with a text partitioning scheme, leads to a simplified scheme for searching for pattern occurrences, thus yielding better run time performance.", acknowledgement = ack-nhfb, articleno = "2", } @Article{Li:1999:FJU, author = "Zhe Li and Kenneth A. Ross", title = "Fast Joins Using Join Indices", journal = j-VLDB-J, volume = "8", number = "1", pages = "1--24", month = apr, year = "1999", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:49 MDT 2008", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb8.html; http://link.springer.de/link/service/journals/00778/tocs/t9008001.htm; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Electronic edition.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/l/Li:Zhe.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/r/Ross:Kenneth_A=.html; http://link.springer.de/link/service/journals/00778/bibs/9008001/90080001.htm; http://link.springer.de/link/service/journals/00778/papers/9008001/90080001.pdf", abstract = "Two new algorithms, ``Jive join'' and ``Slam join,'' are proposed for computing the join of two relations using a join index. The algorithms are duals: Jive join range-partitions input relation tuple ids and then processes each partition, while Slam join forms ordered runs of input relation tuple ids and then merges the results. Both algorithms make a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a temporary file, whose size is half that of the join index. Both algorithms require only that the number of blocks in main memory is of the order of the square root of the number of blocks in the smaller relation. By storing intermediate and final join results in a vertically partitioned fashion, our algorithms need to manipulate less data in memory at a given time than other algorithms. The algorithms are resistant to data skew and adaptive to memory fluctuations. Selection conditions can be incorporated into the algorithms. Using a detailed cost model, the algorithms are analyzed and compared with competing algorithms. For large input relations, our algorithms perform significantly better than Valduriez's algorithm, the TID join algorithm, and hash join algorithms. An experimental study is also conducted to validate the analytical results and to demonstrate the performance characteristics of each algorithm in practice.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "decision support systems; query processing", remark = "Check month: April or May??", } @Article{Nevelsteen:1999:SPU, author = "W. Nevelsteen and B. Preneel", title = "Software Performance of Universal Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1592", pages = "24--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Sep 13 16:57:02 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1999a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Pagh:1999:HDE, author = "R. Pagh", title = "Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1663", pages = "49--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Sep 13 16:57:02 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1999b.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Peyravian:1999:HBE, author = "M. Peyravian and A. Roginsky and N. Zunic", title = "Hash-Based Encryption System", journal = j-COMPUT-SECUR, volume = "18", number = "4", publisher = "Elsevier Science", pages = "345--350", year = "1999", CODEN = "CPSEDU", ISSN = "0167-4048", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "6", } @Article{Pieprzyk:1999:RSF, author = "J. Pieprzyk and Ch. Xin Qu", title = "Rotation-Symmetric Functions and Fast Hashing", journal = j-J-UCS, volume = "5", number = "1", pages = "20--31", day = "28", month = jan, year = "1999", CODEN = "????", ISSN = "0948-6968", bibdate = "Thu Oct 12 14:21:58 MDT 2000", bibsource = "http://www.jucs.org/jucs; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.jucs.org/jucs_5_1/rotation_symmetric_functions_and", acknowledgement = ack-nhfb, } @Article{Preneel:1999:SCH, author = "B. Preneel", title = "The State of Cryptographic Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1561", pages = "158--182", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 14 06:09:05 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1999a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "data security; modern cryptology", } @Article{Rogaway:1999:BHA, author = "Phillip Rogaway", title = "Bucket Hashing and Its Application to Fast Message Authentication", journal = j-J-CRYPTOLOGY, volume = "12", number = "2", pages = "91--115", month = "", year = "1999", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", bibdate = "Fri May 21 15:25:04 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/journals/00145/bibs/12n2p91.html; http://link.springer.de/link/service/journals/00145/papers/12n2p91.pdf; http://link.springer.de/link/service/journals/00145/papers/12n2p91.tex", acknowledgement = ack-nhfb, } @Article{Schneier:1999:SAL, author = "Bruce Schneier and John Kelsey", title = "Secure Audit Logs to Support Computer Forensics", journal = j-TISSEC, volume = "2", number = "2", pages = "159--176", month = may, year = "1999", CODEN = "ATISBQ", ISSN = "1094-9224 (print), 1557-7406 (electronic)", bibdate = "Thu Oct 26 11:39:38 MDT 2000", bibsource = "http://www.acm.org/tissec/contents/v2no2.html; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.acm.org/pubs/citations/journals/tissec/1999-2-2/p159-schneier/", abstract = "In many real-world applications, sensitive information must be kept it log files on an untrusted machine. In the event that an attacker captures this machine, we would like to guarantee that he will gain little or no information from the log files and to limit his ability to corrupt the log files. We describe a computationally cheap method for making all log entries generated prior to the logging machine's compromise impossible for the attacker to read, and also impossible to modify or destroy undetectably.", acknowledgement = ack-nhfb, generalterms = "Security", keywords = "audit logs; auditing; authentication; computer forensics; hash chains; intrusion detection", subject = "Computer Systems Organization --- Computer-Communication Networks --- Distributed Systems (C.2.4); Computer Systems Organization --- Computer-Communication Networks (C.2); Computer Systems Organization --- Computer-Communication Networks --- General (C.2.0); Computer Systems Organization --- Computer-Communication Networks --- Network Protocols (C.2.2)", } @Article{Shin:1999:HFM, author = "Sang Uk Shin and Kyung Hyune Rhee and Jae Woo Yoon", title = "Hash Functions and the {MAC} Using All-or-Nothing Property", journal = j-LECT-NOTES-COMP-SCI, volume = "1560", pages = "263--275", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 14 06:09:05 MDT 1999", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1999a.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "PKC; public key cryptography", } @Article{Somervuo:1999:RHA, author = "P. Somervuo", title = "Redundant Hash Addressing of Feature Sequences Using the Self-Organizing Map", journal = "Neural Processing Letters", volume = "10", number = "1", publisher = "Kluwer Academic Publishers, Dordrecht, The Netherlands", pages = "25--34", month = aug, year = "1999", CODEN = "????", ISSN = "1370-4621", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "10", } @Article{Stallings:1999:HAK, author = "William Stallings", title = "The {HMAC} Algorithm: Key hashing for message authentication", journal = j-DDJ, volume = "24", number = "4", pages = "46, 48--49", month = apr, year = "1999", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Mar 3 06:30:11 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.ddj.com/ftp/1999/1999_04/hmac.txt", abstract = "The Message Authentication Code (MAC) is a widely used technique for performing message authentication. HMAC (short for ``keyed-Hashing for Message Authentication''), a variation on the MAC algorithm, has emerged as an Internet standard for a variety of applications. Additional resources include hmac.txt (listings).", acknowledgement = ack-nhfb, } @Article{Torres:1999:SIS, author = "Marco A. Torres and Susumu Kuroyanagi and Akira Iwata", title = "The {Self-Indexed Search Algorithm}: {A} bit-level approach to minimal perfect hashing", journal = j-INFO-PROC-LETT, volume = "69", number = "5", pages = "253--258", day = "12", month = mar, year = "1999", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Sat Jul 17 18:05:47 MDT 1999", bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Book{Witten:1999:MGC, author = "Ian H. Witten and Alistair Moffat and Timothy C. Bell", title = "Managing Gigabytes: Compressing and Indexing Documents and Images", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adr, edition = "Second", pages = "xxxi + 519", year = "1999", ISBN = "1-55860-570-3", ISBN-13 = "978-1-55860-570-1", LCCN = "TA1637 .W58 1994", bibdate = "Thu May 12 08:02:54 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", price = "US\$54.95", URL = "ftp://ftp.math.utah.edu/pub/mg/; ftp://ftp.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz; ftp://munnari.oz.au:/pub/mg; http://www.cs.mu.oz.au/mg/; http://www.cs.mu.oz.au/~alistair/arith_coder/; http://www.math.utah.edu/pub/mg/; http://www.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz; http://www.mkp.com/books_catalog/1-55860-570-3.asp", acknowledgement = ack-nhfb, } @InProceedings{Bosselaers:19xx:EFH, author = "A. Bosselaers", booktitle = "????", title = "Even faster hashing on the {Pentium}", publisher = "????", address = "????", pages = "????", year = "19xx", bibdate = "Fri Nov 20 15:54:39 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Presented at the rump session of Eurocrypt'97, Konstanz, Germany, May 12-15, 1997, and updated on November 13, 1997.", URL = "ftp://ftp.esat.kuleuven.ac.be/pub/COSIC/bosselae/pentiumplus.ps.gz", acknowledgement = ack-nhfb, } @Article{Irby:19xx:MRH, author = "Thomas C. Irby", title = "Minimal Retrieval Hash Codes", journal = "Proceedings of the Texas Conference on Computing Systems", volume = "??", number = "??", pages = "8.1--8.5", month = "????", year = "19xx", CODEN = "PTCSDR", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Comput Soc. Long Beach, Ca.", abstract = "A method is described for providing a minimal number of retrieval probes for a specific set of hash table entries using a specific hash code. The technique is useful only for static or near static sets of data where the expected retrieval accesses greatly outnumber insertions. An assembler operation code table is used as an example which illustrates the usefulness of the method. Comparisons with other hashing techniques and with the binary search algorithm indicates that the initial cost of forming a minimal retrieval hash table can be offset by the resulting reduced retrieval costs.", acknowledgement = ack-nhfb, classification = "723; 901", conference = "Proc Tex Conf Comput Syst 7th", keywords = "codes, symbolic; information science --- Information Retrieval", meetingaddress = "Houston, TX, USA", meetingdate = "Oct 31--Nov 1 1978", meetingdate2 = "10/31--11/01/78", } @TechReport{Jain:19xx:CHS, author = "Raj Jain", title = "A Comparison of Hashing Schemes for Address Lookup in Computer Networks", number = "DEC-TR-566", institution = "Digital Equipment Corporation", pages = "??", year = "19xx", bibdate = "Thu Jul 21 08:52:19 1994", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "jain%erlang.dec@decwrl.dec.com", abstract = "The trend toward networks becoming larger and faster, and addresses increasing in size, has impelled a need to explore alternatives for fast address recognition. Hashing is one such alternative which can help minimize the address search time in adapters, bridges, routers, gateways, and name servers. Using a trace of address references, we compared the efficiency of several different hashing functions and found that the cyclic redundancy checking (CRC) polynomials provide excellent hashing functions. For software implementation, Fletcher checksum provides a good hashing function. Straightforward folding of address octets using the exclusive-or operation is also a good hashing function. For some applications, bit extraction from the address can be used.", acknowledgement = ack-nhfb, } @Article{Larson:19xx:LHP, author = "Per Ake Larson", title = "Linear Hashing with Partial Expansions", journal = "Very Large Data Bases, International Conference on Very Large Data Bases", volume = "??", number = "??", pages = "224--232", month = "????", year = "19xx", CODEN = "VLDBDP", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "ACM (Order n 471800). Baltimore, Md.", abstract = "A new method for organizing dynamic files is presented and its performance is analyzed. The scheme is a generalization of W. Litwin's linear (virtual) hashing. The amount of storage space allocated to the file grows and shrinks in a simple fashion according to the number of records actually stored in the file. The storage utilization is controlled and constantly kept equal to a threshold selected by the user. Because no index or other form of access table is used, retrieval of a record requires only one access in most cases. The analysis reveals that an average search length in the range 1.1--1.2 accesses can easily be achieved, even for storage utilizations as high as 85--90 per cent.", acknowledgement = ack-nhfb, classification = "723", conference = "Very Large Data Bases Int Conf Very Large Data Bases 6th", keywords = "data base systems", meetingaddress = "Montreal, Can", meetingdate = "Oct 1--3 1980", meetingdate2 = "10/01--03/80", } @Article{Litwin:19xx:LHN, author = "Witold Litwin", title = "Linear Hashing: a New Tool for File and Table Addressing", journal = "Very Large Data Bases, International Conference on Very Large Data Bases", volume = "??", number = "??", pages = "212--223", month = "????", year = "19xx", CODEN = "VLDBDP", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "ACM (Order number 471800). Baltimore, Md.", abstract = "Linear hashing is a hashing in which the address space may grow or shrink dynamically. A file or a table may then support any number of insertions or deletions without access or memory load performance deterioration. A record in the file is, in general, found in one access, while the load may stay practically constant up to 90\%. A record in a table is found in a mean of 1.7 accesses, while the load is constantly 80\%. No other algorithms attaining such a performance are known.", acknowledgement = ack-nhfb, classification = "723", conference = "Very Large Data Bases Int Conf Very Large Data Bases 6th", keywords = "data base systems", meetingaddress = "Montreal, Can", meetingdate = "Oct 1--3 1980", meetingdate2 = "10/01--03/80", } @Article{Litwin:19xx:VHD, author = "Witold Litwin", title = "Virtual Hashing: a Dynamically Changing Hashing", journal = "IEEE Cement Industry Technical Conference (Paper)", volume = "??", number = "??", pages = "517--523", month = "????", year = "19xx", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "IEEE Comput Soc. Long Beach, Ca.", abstract = "A new type of hashing, called virtual hashing, is proposed. In contrast to any known hashing, a virtual hashing may modify its hashing function. Such changes may be performed when collisions arise. A virtual hashing may then find in one disk access a record such that several accesses would be needed if the function initially chosen for the file was used.", acknowledgement = ack-nhfb, classification = "723", conference = "Int Conf on Very Large Data Bases, 4th, Proc", keywords = "computer programming", meetingaddress = "W Berlin, W Ger", meetingdate = "Sep 13--15 1978", meetingdate2 = "09/13--15/78", } @Article{Martin:19xx:ETJ, author = "T. P. Martin and P. A. Larson", title = "An Evaluation of Three Join Algorithms for a Shared-Memory Multiprocessor Environment", journal = "???", volume = "??", number = "??", pages = "????--????", year = "19xx", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Sort-Merge Hashed Loops Hybrid Hash", } @Article{Blackburn:2000:PHF, author = "S. R. Blackburn", title = "Perfect Hash Families: Probabilistic Methods and Explicit Constructions", journal = j-J-COMB-THEORY-A, volume = "92", number = "1", publisher = "Academic Press, 525 B Street, Suite 1900, San Diego, CA, 92101-4495", pages = "54--60", month = oct, year = "2000", CODEN = "JCBTA7", ISSN = "0097-3165", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "7", } @Article{Claussen:2000:EES, author = "J. Claussen and A. Kemper and D. Kossmann and C. Wiesner", title = "Exploiting early sorting and early partitioning for decision support query processing", journal = j-VLDB-J, volume = "9", number = "3", pages = "190--213", month = dec, year = "2000", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:54 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Decision support queries typically involve several joins, a grouping with aggregation, and/or sorting of the result tuples. We propose two new classes of query evaluation algorithms that can be used to speed up the execution of such queries. The algorithms are based on (1) {\em early sorting\/} and (2) {\em early partitioning\/} --- or a combination of both. The idea is to push the sorting and/or the partitioning to the leaves, i.e., the base relations, of the query evaluation plans (QEPs) and thereby avoid sorting or partitioning large intermediate results generated by the joins. Both early sorting and early partitioning are used in combination with hash-based algorithms for evaluating the join(s) and the grouping. To enable early sorting, the sort order generated at an early stage of the QEP is retained through an arbitrary number of so-called {\em order-preserving hash joins}. To make early partitioning applicable to a large class of decision support queries, we generalize the so-called hash teams proposed by Graefe et al. [GBC98]. Hash teams allow to perform several hash-based operations (join and grouping) on the same attribute in one pass without repartitioning intermediate results. Our generalization consists of indirectly partitioning the input data. Indirect partitioning means partitioning the input data on an attribute that is not directly needed for the next hash-based operation, and it involves the construction of bitmaps to approximate the partitioning for the attribute that is needed in the next hash-based operation. Our performance experiments show that such QEPs based on {\em early sorting, early partitioning}, or both in combination perform significantly better than conventional strategies for many common classes of decision support queries.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "decision support systems; early sorting and partitioning; hash joins and hash teams; performance evaluation; query processing and optimization", } @InProceedings{Coron:2000:ESF, author = "Jean-S{\'e}bastien Coron", title = "On the Exact Security of Full Domain Hash", crossref = "Bellare:2000:ACC", pages = "229--??", year = "2000", bibdate = "Fri Feb 1 09:16:56 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800229.htm; http://link.springer-ny.com/link/service/series/0558/papers/1880/18800229.pdf", acknowledgement = ack-nhfb, keywords = "Crypto '2000; cryptography", } @Article{Czumaj:2000:CRH, author = "Artur Czumaj and Friedhelm Meyer auf der Heide and Volker Stemann", title = "Contention Resolution in Hashing Based Shared Memory Simulations", journal = j-SIAM-J-COMPUT, volume = "29", number = "5", pages = "1703--1739", month = oct, year = "2000", CODEN = "SMJCAT", DOI = "http://dx.doi.org/10.1137/S009753979529564X", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Fri Oct 27 06:28:34 MDT 2000", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/29/5; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/29564", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", } @Article{Jiang:2000:CSM, author = "J. -H. Jiang and C. -C. Chang and T. -S. Chen", title = "A compact sparse matrix representation using random hash functions", journal = j-DATA-KNOWLEDGE-ENG, volume = "32", number = "1", publisher = "Elsevier Science", pages = "29--49", month = jan, year = "2000", CODEN = "DKENEW", ISSN = "0169-023X", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "21", } @InProceedings{Lever:2000:LKH, author = "Chuck Lever", title = "{Linux} Kernel Hash Table Behavior: Analysis and Improvements", crossref = "USENIX:2000:PAL", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.usenix.org/publications/library/proceedings/als2000/lever.html", acknowledgement = ack-nhfb, } @Article{Liang:2000:OMD, author = "Weifa Liang and Maria E. Orlowska and Jeffrey X. Yu", title = "Optimizing Multiple Dimensional Queries Simultaneously in Multidimensional Databases", journal = j-VLDB-J, volume = "8", number = "3--4", pages = "319--338", month = feb, year = "2000", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:51 MDT 2008", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb8.html; http://link.springer.de/link/service/journals/00778/tocs/t0008003.htm; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Electronic edition.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/l/Liang:Weifa.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/o/Orlowska:Maria_E=.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/y/Yu:Jeffrey_X=.html; http://link.springer.de/link/service/journals/00778/bibs/0008003/00080319.htm; http://link.springer.de/link/service/journals/00778/papers/0008003/00080319.pdf", abstract = "Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $O(n^\epsilon)$ times the optimal, where $n$ is the number of queries and $\epsilon$ is a fixed constant with $0 < \epsilon \leq 1$. We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is $n$ times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "data warehousing; MDDBs; multiple dimensional query optimization; OLAP; query modeling", } @Article{Madria:2000:MLT, author = "S. K. Madria and M. A. Tubaishat and B. Bhargava", title = "Multi-level transaction model for semantic concurrency control in linear hash structures", journal = j-INFO-SOFTWARE-TECH, volume = "42", number = "7", publisher = "Elsevier Science", pages = "445--464", day = "1", month = may, year = "2000", CODEN = "ISOTE7", ISSN = "0950-5849", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "20", } @Article{Manegold:2000:ODA, author = "Stefan Manegold and Peter A. Boncz and Martin L. Kersten", title = "Optimizing database architecture for the new bottleneck: memory access", journal = j-VLDB-J, volume = "9", number = "3", pages = "231--246", month = dec, year = "2000", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:50:54 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In the past decade, advances in the speed of commodity CPUs have far out-paced advances in memory latency. Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. In this article, we use a simple scan test to show the severe impact of this bottleneck. The insights gained are translated into guidelines for database architecture, in terms of both data structures and algorithms. We discuss how vertically fragmented data structures optimize cache performance on sequential data access. We then focus on equi-join, typically a random-access operation, and introduce radix algorithms for partitioned hash-join. The performance of these algorithms is quantified using a detailed analytical model that incorporates memory access cost. Experiments that validate this model were performed on the Monet database system. We obtained exact statistics on events such as TLB misses and L1 and L2 cache misses by using hardware performance counters found in modern CPUs. Using our cost model, we show how the carefully tuned memory access pattern of our radix algorithms makes them perform well, which is confirmed by experimental results.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "decomposed storage model; implementation techniques; join algorithms; main-memory databases; memory access optimization; query processing", } @Article{Mochizuki:2000:ERA, author = "H. Mochizuki and Y. Hayashi", title = "An Efficient Retrieval Algorithm of Compound Words Using Extendible Hashing", journal = j-INT-J-COMP-PROC-ORIENTAL-LANG, volume = "13", number = "1", pages = "15--??", year = "2000", CODEN = "????", ISSN = "0219-4279", bibdate = "Mon Feb 25 07:03:34 MST 2002", bibsource = "http://ejournals.wspc.com.sg/ijcpol/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Processing of Oriental Languages (IJCPOL)", } @Article{Shoup:2000:CTU, author = "Victor Shoup", title = "A Composition Theorem for Universal One-Way Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "1807", pages = "445--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Feb 1 09:16:29 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070445.htm; http://link.springer-ny.com/link/service/series/0558/papers/1807/18070445.pdf", acknowledgement = ack-nhfb, } @Article{Shoup:2000:UHF, author = "Victor Shoup", title = "Using Hash Functions as a Hedge against Chosen Ciphertext Attack", journal = j-LECT-NOTES-COMP-SCI, volume = "1807", pages = "275--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Feb 1 09:16:29 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070275.htm; http://link.springer-ny.com/link/service/series/0558/papers/1807/18070275.pdf", acknowledgement = ack-nhfb, } @InProceedings{Steinwandt:2000:WHS, author = "Rainer Steinwandt and Markus Grassl and Willi Geiselmann and Thomas Beth", title = "Weaknesses in the $\mathrm{SL}_2(\bbb{F}_{2^n})$ Hashing Scheme", crossref = "Bellare:2000:ACC", pages = "287--299", year = "2000", bibdate = "Fri Feb 1 09:16:56 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800287.htm; http://link.springer-ny.com/link/service/series/0558/papers/1880/18800287.pdf", acknowledgement = ack-nhfb, keywords = "Crypto '2000; cryptography", } @InProceedings{Vckovski:2000:MTS, author = "Andrej Vckovski and Jason Brazile", title = "A Multi-Threaded Server for Shared Hash Table Access", crossref = "USENIX:2000:PUT", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://db.usenix.org/publications/library/proceedings/tcl2k/vckovski.html", acknowledgement = ack-nhfb, } @Article{Wagner:2000:CYL, author = "David Wagner", booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)", title = "Cryptanalysis of the {Yi-Lam} hash", journal = j-LECT-NOTES-COMP-SCI, volume = "1976", pages = "483--488", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", MRclass = "94A60", MRnumber = "2002h:94071", bibdate = "Sat Oct 26 10:21:29 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", } @Article{Wagner:2000:PSU, author = "David Wagner and Ian Goldberg", title = "Proofs of Security for the {Unix} Password Hashing Algorithm", journal = j-LECT-NOTES-COMP-SCI, volume = "1976", pages = "560--572", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Fri Feb 1 09:17:24 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760560.htm; http://link.springer-ny.com/link/service/series/0558/papers/1976/19760560.pdf", acknowledgement = ack-nhfb, } @Article{Willard:2000:ECG, author = "Dan E. Willard", title = "Examining Computational Geometry, {Van Emde Boas} Trees, and Hashing from the Perspective of the Fusion Tree", journal = j-SIAM-J-COMPUT, volume = "29", number = "3", pages = "1030--1049", month = jun, year = "2000", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Sat Jan 22 13:21:38 MST 2000", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/29/3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/32242", acknowledgement = ack-nhfb, } @Article{Wu:2000:LSH, author = "Kun-Lung Wu and Philip S. Yu", title = "Latency-sensitive hashing for collaborative {Web} caching", journal = j-COMP-NET-AMSTERDAM, volume = "33", number = "1--6", pages = "633--644", month = jun, year = "2000", CODEN = "????", ISSN = "1389-1286", bibdate = "Sat Oct 21 17:37:23 MDT 2000", bibsource = "http://www.elsevier.com/locate/issn/13891286; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.elsevier.nl/gej-ng/10/15/22/48/25/69/abstract.html; http://www.elsevier.nl/gej-ng/10/15/22/48/25/69/article.pdf; http://www9.org/w9cdrom/301/301.html", acknowledgement = ack-nhfb, } @Article{Yen:2000:WOW, author = "Sung-Ming Yen and Yuliang Zheng", title = "Weighted One-Way Hash Chain and Its Applications", journal = j-LECT-NOTES-COMP-SCI, volume = "1975", pages = "135--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:08:57 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750135.htm; http://link.springer-ny.com/link/service/series/0558/papers/1975/19750135.pdf", acknowledgement = ack-nhfb, } @Article{Bellare:2001:OCH, author = "Mihir Bellare and Alexandra Boldyreva and Lars Knudsen and Chanathip Namprempre", title = "Online Ciphers and the Hash-{CBC} Construction", journal = j-LECT-NOTES-COMP-SCI, volume = "2139", pages = "292--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:05:41 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390292.htm; http://link.springer-ny.com/link/service/series/0558/papers/2139/21390292.pdf", acknowledgement = ack-nhfb, } @Article{Christophi:2001:DSR, author = "C. A. Christophi and H. M. Mahmoud", title = "Distribution of the size of random hash trees, pebbled hash trees and {N}-trees", journal = "Statistics and Probability Letters", volume = "53", number = "3", publisher = "Elsevier Science", pages = "277--282", day = "15", month = jun, year = "2001", CODEN = "????", ISSN = "0167-7152 (print), 1879-2103 (electronic)", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "6", } @Article{Dietzfelbinger:2001:SMP, author = "Martin Dietzfelbinger and Torben Hagerup", title = "Simple Minimal Perfect Hashing in Less Space", journal = j-LECT-NOTES-COMP-SCI, volume = "2161", pages = "109--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:06:04 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2161.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2161/21610109.htm; http://link.springer-ny.com/link/service/series/0558/papers/2161/21610109.pdf", acknowledgement = ack-nhfb, } @Article{Domingo-Ferrer:2001:MAR, author = "J. Domingo-Ferrer", title = "Mobile Agent Route Protection through Hash-Based Mechanisms", journal = j-LECT-NOTES-COMP-SCI, volume = "2247", pages = "17--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:07:31 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470017.htm; http://link.springer-ny.com/link/service/series/0558/papers/2247/22470017.pdf", acknowledgement = ack-nhfb, } @Article{Galli:2001:THO, author = "N. Galli and B. Seybold and K. Simon", title = "Tetris-Hashing or optimal table compression", journal = j-DISCRETE-APPL-MATH, volume = "110", number = "1", publisher = "Elsevier Science", pages = "41--58", day = "1", month = jun, year = "2001", CODEN = "DAMADU", ISSN = "0166-218X", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "18", } @Article{Gettys:2001:AAG, author = "Thomas Gettys", title = "Algorithm Alley: Generating Perfect Hash Functions", journal = j-DDJ, volume = "26", number = "2", pages = "151, 153, 155", month = feb, year = "2001", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Feb 15 12:14:41 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.ddj.com/ftp/2001/2001_02/aa0201.txt", abstract = "Thomas presents an efficient hash technique guaranteed to generate a perfect hash function for an arbitrary set of numeric search keys. Additional resources include aa0201.txt (listings).", acknowledgement = ack-nhfb, } @Article{Goi:2001:IHF, author = "B.-M. Goi and M. U. Siddiqi and H.-T. Chuah", title = "Incremental Hash Function Based on Pair Chaining {\&} Modular Arithmetic Combining", journal = j-LECT-NOTES-COMP-SCI, volume = "2247", pages = "50--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:07:31 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470050.htm; http://link.springer-ny.com/link/service/series/0558/papers/2247/22470050.pdf", acknowledgement = ack-nhfb, } @Article{Hagerup:2001:EMP, author = "Torben Hagerup and Torsten Tholey", title = "Efficient Minimal Perfect Hashing in Nearly Minimal Space", journal = j-LECT-NOTES-COMP-SCI, volume = "2010", pages = "317--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:28 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2010.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2010/20100317.htm; http://link.springer-ny.com/link/service/series/0558/papers/2010/20100317.pdf", acknowledgement = ack-nhfb, } @Article{Hernandez:2001:DTR, author = "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a Sierra and Arturo Ribagorda and Benjam{\'\i}n Ramos and J. C. Mex-Perera", title = "Distinguishing {TEA} from a Random Permutation: Reduced Round Versions of {TEA} Do Not Have the {SAC} or Do Not Generate Random Numbers", journal = j-LECT-NOTES-COMP-SCI, volume = "2260", pages = "374--377", year = "2001", CODEN = "LNCSD9", DOI = "http://dx.doi.org/10.1007/3-540-45325-3_34", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Feb 01 16:50:09 2012", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm; http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600374.htm; http://link.springer-ny.com/link/service/series/0558/papers/2260/22600374.pdf", abstract = "In this paper the authors present a statistical test for testing the strict avalanche criterion (SAC), a property that cryptographic primitives such as block ciphers and hash functions must have. Random permutations should also behave as good random number generators when, given any initial input, its output is considered part of a pseudorandom stream and then used as an input block to produce more output bits. Using these two ideal properties, we construct a test framework for cryptographic primitives that is shown at work on the block cipher TEA. In this way, we are able to distinguish reduced round versions of it from a random permutation.", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Hernandez:2002:GCT, author = "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a Sierra and Pedro Isasi and Arturo Ribagorda", title = "Genetic Cryptoanalysis of Two Rounds {TEA}", journal = j-LECT-NOTES-COMP-SCI, volume = "2331", pages = "1024--1031", year = "2002", CODEN = "LNCSD9", DOI = "http://dx.doi.org/10.1007/3-540-47789-6_108", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Feb 01 16:44:05 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.springerlink.com/content/0pa8nj982jewn9ev/", abstract = "Distinguishing the output of a cryptographic primitive such as a block cipher or a hash function from the output of a random mapping seriously affects the credibility of the primitive security, and defeats it for many cryptographic applications. However, this is usually a quite difficult task. In a previous work [1], a new cryptoanalytic technique was presented and proved useful in distinguishing a block cipher from a random permutation in a completely automatic way. This technique is based in the selection of the worst input patterns for the block cipher with the aid of genetic algorithms. The objective is to find which input patters generate a significant deviation of the observed output from the output we would expect from a random permutation. In [1], this technique was applied to the case of the block cipher TEA with 1 round. The much harder problem of breaking TEA with 2 rounds is successfully solved in this paper, where an efficient distinguisher is also presented.", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", remark = "ICCS 2002", } @Article{Indyk:2001:SAM, author = "P. Indyk", title = "A Small Approximately Min-Wise Independent Family of Hash Functions", journal = j-J-ALG, volume = "38", number = "1", publisher = "Academic Press, 525 B Street, Suite 1900, San Diego, CA, 92101-4495", pages = "84--90", month = jan, year = "2001", CODEN = "JOALDV", ISSN = "0196-6774", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "7", } @Article{Kaliski:2001:HFF, author = "Burton S. {Kaliski Jr.}", title = "On Hash Function Firewalls in Signature Schemes", journal = j-LECT-NOTES-COMP-SCI, volume = "2271", pages = "1--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:09:06 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710001.htm; http://link.springer-ny.com/link/service/series/0558/papers/2271/22710001.pdf", acknowledgement = ack-nhfb, } @Article{Kiltz:2001:PPS, author = "Eike Kiltz", title = "A Primitive for Proving the Security of Every Bit and About Universal Hash Functions {\&} Hard Core Bits", journal = j-LECT-NOTES-COMP-SCI, volume = "2138", pages = "388--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:05:40 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2138.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2138/21380388.htm; http://link.springer-ny.com/link/service/series/0558/papers/2138/21380388.pdf", acknowledgement = ack-nhfb, } @Article{Krovetz:2001:FUH, author = "Ted Krovetz and Phillip Rogaway", title = "Fast Universal Hashing with Small Keys and No Preprocessing: The {PolyR} Construction", journal = j-LECT-NOTES-COMP-SCI, volume = "2015", pages = "73--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:33 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150073.htm; http://link.springer-ny.com/link/service/series/0558/papers/2015/20150073.pdf", acknowledgement = ack-nhfb, } @InProceedings{Lin:2001:EHM, author = "Shu Lin and M. Tamer {\"O}zsu and Vincent Oria and Raymond T. Ng", title = "An Extendible Hash for Multi-Precision Similarity Querying of Image Databases", crossref = "Apers:2001:PTS", pages = "221--230", year = "2001", bibdate = "Thu Feb 21 17:51:12 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb2001.html", URL = "http://www.vldb.org/conf/2001/P221.pdf", acknowledgement = ack-nhfb, authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/l/Lin:Shu.html; http://www.vldb.org/dblp/db/indices/a-tree/=/=Ouml=zsu:M=_Tamer.html; http://www.vldb.org/dblp/db/indices/a-tree/o/Oria:Vincent.html; http://www.vldb.org/dblp/db/indices/a-tree/n/Ng:Raymond_T=.html", remark = "link", } @Article{Madria:2001:FCC, author = "S. Kumar Madria and S. N. Maheshwari and B. Chandra", title = "Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and {I/O} automata", journal = j-DATA-KNOWLEDGE-ENG, volume = "37", number = "2", publisher = "Elsevier Science", pages = "139--176", month = may, year = "2001", CODEN = "DKENEW", ISSN = "0169-023X", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "38", } @Article{Mihcak:2001:PAH, author = "M. K{\i}van{\c{c}} M{\i}h{\c{c}}ak and Ramarathnam Venkatesan", title = "A Perceptual Audio Hashing Algorithm: {A} Tool for Robust Audio Identification and Information Hiding", journal = j-LECT-NOTES-COMP-SCI, volume = "2137", pages = "51--65", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:05:39 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370051.htm; http://link.springer-ny.com/link/service/series/0558/papers/2137/21370051.pdf", acknowledgement = ack-nhfb, } @Article{Mironov:2001:HFM, author = "Ilya Mironov", title = "Hash Functions: From {Merkle-Damg{\aa}rd} to {Shoup}", journal = j-LECT-NOTES-COMP-SCI, volume = "2045", pages = "166--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:04:02 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450166.htm; http://link.springer-ny.com/link/service/series/0558/papers/2045/20450166.pdf", acknowledgement = ack-nhfb, } @Article{Pagh:2001:CH, author = "Rasmus Pagh and Flemming Friche Rodler", title = "Cuckoo Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "2161", pages = "121--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:06:04 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2161.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2161/21610121.htm; http://link.springer-ny.com/link/service/series/0558/papers/2161/21610121.pdf", acknowledgement = ack-nhfb, } @InProceedings{Pagh:2001:CPC, author = "Rasmus Pagh", title = "On the cell probe complexity of membership and perfect hashing", crossref = "ACM:2001:PAA", pages = "425--432", year = "2001", bibdate = "Wed Feb 20 18:37:27 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Park:2001:VNH, author = "Nan Kyoung Park and Joon Ho Hwang and Pil Joong Lee", title = "{HAS-V}: {A} New Hash Function with Variable Output Length", journal = j-LECT-NOTES-COMP-SCI, volume = "2012", pages = "202--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:30 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120202.htm; http://link.springer-ny.com/link/service/series/0558/papers/2012/20120202.pdf", acknowledgement = ack-nhfb, } @Misc{Rijmen:2001:WHF, author = "Vincent Rijmen and Paulo S. L. M. Barreto", title = "The {WHIRLPOOL} Hash Function", howpublished = "World-Wide Web document", year = "2001", bibdate = "Tue Jul 26 18:45:41 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://paginas.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html; http://planeta.terra.com.br/informatica/paulobarreto/whirlpool.zip", abstract = "WHIRLPOOL is a hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto that operates on messages less than 2256 bits in length, and produces a message digest of 512 bits.\par WHIRLPOOL has been selected for the NESSIE portfolio of cryptographic primitives. The International Organization for Standardization (ISO) has decided to include the final version of WHIRLPOOL in the revised ISO/IEC 10118-3:2003(E) standard.", acknowledgement = ack-nhfb, } @Article{Sara:2001:SCT, author = "Radim {\v{S}}{\'a}ra and Daniel Smutek and Petr Sucharda andt{\v{S}}t{\'e}p{\'a}n Sva{\v{c}}ina", title = "Systematic Construction of Texture Features for {Hashimoto}'s Lymphocytic Thyroiditis Recognition from Sonographic Images", journal = j-LECT-NOTES-COMP-SCI, volume = "2101", pages = "339--348", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:05:01 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2101.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2101/21010339.htm; http://link.springer-ny.com/link/service/series/0558/papers/2101/21010339.pdf", acknowledgement = ack-nhfb, } @Article{Sarkar:2001:PAE, author = "P. Sarkar and P. J. Schellenberg", title = "A Parallel Algorithm for Extending Cryptographic Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "2247", pages = "40--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:07:31 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470040.htm; http://link.springer-ny.com/link/service/series/0558/papers/2247/22470040.pdf", acknowledgement = ack-nhfb, } @Article{Scharinger:2001:ASK, author = "Josef Scharinger", title = "Application of Signed {Kolmogorov} Hashes to Provide Integrity and Authenticity in {Web}-Based Software Distribution", journal = j-LECT-NOTES-COMP-SCI, volume = "2178", pages = "257--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:08:59 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2178.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2178/21780257.htm; http://link.springer-ny.com/link/service/series/0558/papers/2178/21780257.pdf", acknowledgement = ack-nhfb, } @Article{Scharinger:2001:CDD, author = "J. Scharinger", title = "Construction of Data Dependent Chaotic Permutation Hashes to Ensure Communications Integrity", journal = j-LECT-NOTES-COMP-SCI, volume = "2094", pages = "196--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:04:54 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2094.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2094/20940196.htm; http://link.springer-ny.com/link/service/series/0558/papers/2094/20940196.pdf", acknowledgement = ack-nhfb, } @Article{Song:2001:HMO, author = "Zhexuan Song and Nick Roussopoulos", title = "Hashing Moving Objects", journal = j-LECT-NOTES-COMP-SCI, volume = "1987", pages = "161--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:07 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1987.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1987/19870161.htm; http://link.springer-ny.com/link/service/series/0558/papers/1987/19870161.pdf", acknowledgement = ack-nhfb, } @Article{Stanca:2001:HAC, author = "Marian Stanca and Stamatis Vassiliadis and Sorin Cotofana and Henk Corporaal", title = "Hashed Addressed Caches for Embedded Pointer Based Codes (Research Note)", journal = j-LECT-NOTES-COMP-SCI, volume = "1900", pages = "965--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:02:44 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1900.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1900/19000965.htm; http://link.springer-ny.com/link/service/series/0558/papers/1900/19000965.pdf", acknowledgement = ack-nhfb, } @Article{Suzuki:2001:ESB, author = "Koutarou Suzuki and Kunio Kobayashi and Hikaru Morita", title = "Efficient Sealed-Bid Auction Using Hash Chain", journal = j-LECT-NOTES-COMP-SCI, volume = "2015", pages = "183--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:33 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150183.htm; http://link.springer-ny.com/link/service/series/0558/papers/2015/20150183.pdf", acknowledgement = ack-nhfb, } @Article{Vitter:2001:EMA, author = "Jeffrey Scott Vitter", title = "External memory algorithms and data structures: dealing with {\bf massive data}", journal = j-COMP-SURV, volume = "33", number = "2", pages = "209--271", month = jun, year = "2001", CODEN = "CMSVAN", DOI = "http://doi.acm.org/10.1145/384192.384193", ISSN = "0360-0300 (print), 1557-7341 (electronic)", bibdate = "Thu Jun 19 10:16:06 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Data sets in large applications are often too massive to fit completely inside the computers internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs. We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory. For the batched problem of sorting and related problems such as permuting and fast Fourier transform, the key paradigms include distribution and merging. The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however, disk striping can be nonoptimal with respect to I/O, so to gain further improvements we discuss distribution and merging techniques for using the disks independently. We also consider useful techniques for batched EM problems involving matrices (such as matrix multiplication and transposition), geometric data (such as finding intersections and constructing convex hulls), and graphs (such as list ranking, connected components, topological sorting, and shortest paths). In the online domain, canonical EM applications include dictionary lookup and range searching. The two important classes of indexed data structures are based upon extendible hashing and B-trees. The paradigms of filtering and bootstrapping provide a convenient means in online data structures to make effective use of the data accessed from disk. We also reexamine some of the above EM problems in slightly different settings, such as when the data items are moving, when the data items are variable-length (e.g., text strings), or when the allocated amount of internal memory can change dynamically. Programming tools and environments are available for simplifying the EM programming task. During the course of the survey, we report on some experiments in the domain of spatial databases using the TPIE system (transparent parallel I/O programming environment). The newly developed EM algorithms and data structures that incorporate the paradigms we discuss are significantly faster than methods currently used in practice.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", keywords = "B-tree; batched; block; disk; dynamic; extendible hashing; external memory; hierarchical memory; I/O; multidimensional access methods; multilevel memory; online; out-of-core; secondary storage; sorting", } @Article{Wang:2001:ECP, author = "H. Wang and C. Xing", title = "Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields", journal = j-J-COMB-THEORY-A, volume = "93", number = "1", publisher = "Academic Press, 525 B Street, Suite 1900, San Diego, CA, 92101-4495", pages = "112--124", month = jan, year = "2001", CODEN = "JCBTA7", ISSN = "0097-3165", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "13", } @Article{Woelfel:2001:NBO, author = "Philipp Woelfel", title = "New Bounds on the {OBDD}-Size of Integer Multiplication via Universal Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "2010", pages = "563--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:28 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2010.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2010/20100563.htm; http://link.springer-ny.com/link/service/series/0558/papers/2010/20100563.pdf", acknowledgement = ack-nhfb, } @Article{Young:2001:HRS, author = "Adam Young and Moti Yung", title = "Hash to the Rescue: Space Minimization for {PKI} Directories", journal = j-LECT-NOTES-COMP-SCI, volume = "2015", pages = "235--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Feb 2 13:03:33 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150235.htm; http://link.springer-ny.com/link/service/series/0558/papers/2015/20150235.pdf", acknowledgement = ack-nhfb, } @Article{Zobel:2001:MHT, author = "Justin Zobel and Steffen Heinz and Hugh E. Williams", title = "In-memory hash tables for accumulating text vocabularies", journal = j-INFO-PROC-LETT, volume = "80", number = "6", publisher = "Elsevier Science", pages = "271--277", day = "31", month = dec, year = "2001", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.elsevier.com/gej-ng/10/23/20/84/37/27/abstract.html", acknowledgement = ack-nhfb, pagecount = "7", } @InProceedings{Black:2002:BBA, author = "John Black and Phillip Rogaway and Thomas Shrimpton", title = "Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from {PGV}", crossref = "Yung:2002:ACC", pages = "320--335", year = "2002", bibdate = "Tue Apr 4 09:52:50 2006", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420320.htm; http://link.springer.de/link/service/series/0558/papers/2442/24420320.pdf", acknowledgement = ack-nhfb, keywords = "Crypto '2002; cryptography", } @InProceedings{Coron:2002:SPP, author = "Jean-S{\'e}bastien Coron", title = "Security Proof for Partial-Domain Hash Signature Schemes", crossref = "Yung:2002:ACC", pages = "613--626", year = "2002", bibdate = "Tue Apr 4 09:52:50 2006", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420613.htm; http://link.springer.de/link/service/series/0558/papers/2442/24420613.pdf", acknowledgement = ack-nhfb, keywords = "Crypto '2002; cryptography", } @Article{Cramer:2002:UHP, author = "Ronald Cramer and Victor Shoup", title = "Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption", journal = j-LECT-NOTES-COMP-SCI, volume = "2332", pages = "45--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:09:37 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320045.htm; http://link.springer-ny.com/link/service/series/0558/papers/2332/23320045.pdf", acknowledgement = ack-nhfb, } @Article{Desmet:2002:IHC, author = "V. Desmet and B. Goeman and K. De Bosschere", title = "Independent Hashing as Confidence Mechanism for Value Predictors in Microprocessors", journal = j-LECT-NOTES-COMP-SCI, volume = "2400", pages = "458--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:10:14 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2400.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2400/24000458.htm; http://link.springer-ny.com/link/service/series/0558/papers/2400/24000458.pdf", acknowledgement = ack-nhfb, } @Article{Dolev:2002:NPH, author = "Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas", title = "Neighborhood Preserving Hashing and Approximate Queries", journal = j-SIAM-J-DISCR-MATH, volume = "15", number = "1", pages = "73--85", year = "2002", CODEN = "SJDMEC", DOI = "http://dx.doi.org/10.1137/S089548019731809X", ISSN = "0895-4801 (print), 1095-7146 (electronic)", ISSN-L = "0895-4801", bibdate = "Sat Feb 23 12:51:31 MST 2002", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/15/1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/31809", acknowledgement = ack-nhfb, } @TechReport{Filiol:2002:NST, author = "Eric Filiol", title = "A New Statistical Testing for Symmetric Ciphers and Hash Functions", institution = "ESAT --- Virology and Cryptology Lab", address = "B.P. 18 35998 Rennes, FRANCE", pages = "14", day = "23", month = jul, year = "2002", bibdate = "Mon Sep 16 06:46:47 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "Cryptology ePrint Archive, Report 2002/099.", URL = "http://eprint.iacr.org/2002/099/", abstract = "This paper presents a new, powerful statistical testing of symmetric ciphers and hash functions which allowed us to detect biases in both of these systems where previously known tests failed. We first give a complete characterization of the Algebraic Normal Form (ANF) of random Boolean functions by means of the M{\"o}bius transform. Then we built a new testing based on the comparison between the structure of the different Boolean functions Algebraic Normal Forms characterizing symmetric ciphers and hash functions and those of purely random Boolean functions. Detailed testing results on several cryptosystems are presented. As a main result we show that AES, DES Snow and Lili-128 fail all or part of the tests and thus present strong biases.", acknowledgement = ack-nhfb, keywords = "Boolean function; statistical testing; symmetric cipher; randomness; hash function; M{\"o}bius transform; Walsh Transform", } @Manual{FIPS:2002:KHM, author = "{FIPS}", title = "The {Keyed-Hash Message Authentication Code (HMAC)}", volume = "198", organization = pub-NIST, address = pub-NIST:adr, pages = "vii + 13", day = "6", month = mar, year = "2002", bibdate = "Thu Aug 18 07:16:02 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", series = "FIPS PUB", URL = "http://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf", acknowledgement = ack-nhfb, keywords = "computer security; cryptography; HMAC; MAC", } @Manual{FIPS:2002:SHS, author = "{FIPS}", title = "{Secure Hash Standard}", volume = "180-2", organization = pub-NIST, address = pub-NIST:adr, pages = "iv + 79", day = "1", month = aug, year = "2002", bibdate = "Thu Aug 18 07:16:02 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", series = "FIPS PUB", URL = "http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf", acknowledgement = ack-nhfb, keywords = "computer security; cryptography", } @Article{Grembowski:2002:CAH, author = "Tim Grembowski and Roar Lien and Kris Gaj and Nghi Nguyen and Peter Bellows and Jaroslav Flidr and Tom Lehman and Brian Schott", title = "Comparative Analysis of the Hardware Implementations of Hash Functions {SHA}-1 and {SHA}-512", journal = j-LECT-NOTES-COMP-SCI, volume = "2433", pages = "75--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:10:26 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330075.htm; http://link.springer-ny.com/link/service/series/0558/papers/2433/24330075.pdf", acknowledgement = ack-nhfb, } @Article{Han:2002:CMV, author = "Daewan Han and Sangwoo Park and Seongtaek Chee", title = "Cryptanalysis of the Modified Version of the Hash Function Proposed at {PKC'98}", journal = j-LECT-NOTES-COMP-SCI, volume = "2365", pages = "252--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:09:52 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650252.htm; http://link.springer-ny.com/link/service/series/0558/papers/2365/23650252.pdf", acknowledgement = ack-nhfb, } @Article{Holt:2002:MAR, author = "John D. Holt and Soon M. Chung", title = "Mining association rules using inverted hashing and pruning", journal = j-INFO-PROC-LETT, volume = "83", number = "4", pages = "211--220", day = "31", month = aug, year = "2002", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Mon Jan 26 08:44:29 MST 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, } @Article{Jovanov:2002:ANO, author = "E. Jovanov and V. Milutinovic and A. R. Hurson", title = "Acceleration of nonnumeric operations using hardware support for the {Ordered Table Hashing} algorithms", journal = j-IEEE-TRANS-COMPUT, volume = "51", number = "9", pages = "1026--1040", month = sep, year = "2002", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/TC.2002.1032623", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Jul 5 09:41:57 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1032623", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", } @Article{Lee:2002:RUA, author = "Cheng-Chi Lee and Li-Hua Li and Min-Shiang Hwang", title = "A remote user authentication scheme using hash functions", journal = j-OPER-SYS-REV, volume = "36", number = "4", pages = "23--29", month = oct, year = "2002", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:53 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Li:2002:RBA, author = "T. Li and R. Bhargava and L. K. John", title = "Rehashable {BTB}: An Adaptive Branch Target Buffer to Improve the Target Predictability of {Java} Code", journal = j-LECT-NOTES-COMP-SCI, volume = "2552", pages = "597--608", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Feb 11 05:32:25 MST 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, } @Article{Lipmaa:2002:OHT, author = "Helger Lipmaa", title = "On Optimal Hash Tree Traversal for Interval Time-Stamping", journal = j-LECT-NOTES-COMP-SCI, volume = "2433", pages = "357--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:10:26 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330357.htm; http://link.springer-ny.com/link/service/series/0558/papers/2433/24330357.pdf", acknowledgement = ack-nhfb, } @InProceedings{Luo:2002:SHR, author = "Gang Luo and Curt J. Ellmann and Peter J. Haas and Jeffrey F. Naughton", title = "A scalable hash ripple join algorithm", crossref = "Franklin:2002:PAS", pages = "252--262", year = "2002", bibdate = "Fri Oct 31 08:03:02 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lynch:2002:ADA, author = "Nancy Lynch and Dahlia Malkhi and David Ratajczak", title = "Atomic Data Access in Distributed Hash Tables", journal = j-LECT-NOTES-COMP-SCI, volume = "2429", pages = "295--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Nov 30 20:57:21 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2429.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2429/24290295.htm; http://link.springer.de/link/service/series/0558/papers/2429/24290295.pdf", acknowledgement = ack-nhfb, } @InProceedings{Malard:2002:DDH, author = "J. M. Malard and R. D. Stewart", title = "Distributed Dynamic Hash Tables Using {IBM LAPI}", crossref = "IEEE:2002:STI", pages = "??--??", year = "2002", bibdate = "Wed Nov 26 07:34:20 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.sc-2002.org/paperpdfs/pap.pap247.pdf", abstract = "An asynchronous communication library for accessing and managing dynamic hash tables over a network of Symmetric Multiprocessors (SMP) is presented. A blocking factor is shown experimentally to reduce the variance of the wall clock time. It is also shown that remote accesses to a distributed hash table can be as effective and scalable as the one-sided operations of the low-level communication middleware on an IBM SP.", acknowledgement = ack-nhfb, } @InProceedings{Micciancio:2002:ICH, author = "Daniele Micciancio", title = "Improved cryptographic hash functions with worst-case\slash average-case connection", crossref = "ACM:2002:PTF", pages = "609--618", year = "2002", bibdate = "Tue Jan 13 06:21:05 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Mihcak:2002:NIG, author = "M. Kivan{\c{c}} Mih{\c{c}}ak and Ramarathnam Venkatesan", title = "New Iterative Geometric Methods for Robust Perceptual Image Hashing", journal = j-LECT-NOTES-COMP-SCI, volume = "2320", pages = "13--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:09:30 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2320.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2320/23200013.htm; http://link.springer-ny.com/link/service/series/0558/papers/2320/23200013.pdf", acknowledgement = ack-nhfb, } @Article{Mitzenmacher:2002:GHT, author = "Michael Mitzenmacher", title = "Good Hash Tables and Multiple Hash Functions", journal = j-DDJ, volume = "27", number = "5", pages = "28, 30--32", month = may, year = "2002", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Apr 4 06:46:15 MST 2002", bibsource = "http://www.ddj.com/articles/2002/0205/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.ddj.com/ftp/2002/2002_05/hash.txt", abstract = "Michael's multiple hash method produces good hash tables for applications ranging from employee databases to Internet routers. Additional resources include hash.txt (listings).", acknowledgement = ack-nhfb, } @Article{Mukherjee:2002:ECV, author = "R. Mukherjee and J. Jain and K. Takayama and J. A. Abraham and D. S. Fussell and M. Fujita", title = "Efficient Combinational Verification Using Overlapping Local {BDDs} and a Hash Table", journal = j-FORM-METHODS-SYST-DES, volume = "21", number = "1", publisher = "Kluwer Academic Publishers, Boston, U.S.A", pages = "95--101", month = jul, year = "2002", CODEN = "FMSDE6", ISSN = "0925-9856", bibdate = "Thu Nov 7 20:59:16 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, pagecount = "7", } @Article{Nakajima:2002:PAP, author = "Junko Nakajima and Mitsuru Matsui", title = "Performance Analysis and Parallel Implementation of Dedicated Hash Functions", journal = j-LECT-NOTES-COMP-SCI, volume = "2332", pages = "165--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Tue Sep 10 19:09:37 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320165.htm; http://link.springer-ny.com/link/service/series/0558/papers/2332/23320165.pdf", acknowledgement = ack-nhfb, } @TechReport{Quinlan:2002:VNA, author = "Sean Quinlan and Sean Dorward", title = "{Venti}: a new approach to archival storage", institution = inst-CSRC, address = inst-CSRC:adr, pages = "13", day = "2", month = may, year = "2002", bibdate = "Tue Nov 29 10:06:07 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://plan9.bell-labs.com/sys/doc/venti/venti.pdf", abstract = "This paper describes a network storage system, called Venti, intended for archival data. In this system, a unique hash of a block's contents acts as the block identifier for read and write operations. This approach enforces a write-once policy, preventing accidental or malicious destruction of data. In addition, duplicate copies of a block can be coalesced, reducing the consumption of storage and simplifying the implementation of clients. Venti is a building block for constructing a variety of storage applications such as logical backup, physical backup, and snapshot file systems.\par We have built a prototype of the system and present some preliminary performance results. The system uses magnetic disks as the storage technology, resulting in an access time for archival data that is comparable to non-archival data. The feasibility of the write-once model for storage is demonstrated using data from over a decade's use of two Plan 9 file systems.", acknowledgement = ack-nhfb, } @Manual{Silverstein:2002:JIS, author = "Alan Silverstein", title = "{Judy IV} Shop Manual", organization = "Hewlett--Packard Corporation", address = "????", edition = "", day = "5", month = aug, year = "2002", bibdate = "Tue Mar 21 09:28:54 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://judy.sourceforge.net/; http://judy.sourceforge.net/doc/shop_interm.pdf", abstract = "Judy is a programming library that provides a relatively simple interface (API) for array-like storage of word or string indexes with optional mapping of indexes to single-word values. (``Optional'' means Judy1 does not, and JudyL and JudySL do; see below.) Functions are provided to insert, delete, and retrieve indexes; search for neighbor indexes (present or absent) in sorted order; count valid indexes in any range (subexpanse) or locate an index by its position (count); and free entire arrays. So what's special about that? Judy arrays are remarkably fast, space-efficient, and simple to use. No initialization, configuration, or tuning is required or even possible, yet Judy works well over a wide dynamic range from zero to billions of indexes, over a wide variety of types of data sets --- sequential, clustered, periodic, random.", acknowledgement = ack-nhfb, keywords = "hash table", } @Article{Sit:2002:SCP, author = "Emil Sit and Robert Morris", title = "Security Considerations for Peer-to-Peer Distributed Hash Tables", journal = j-LECT-NOTES-COMP-SCI, volume = "2429", pages = "261--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Sat Nov 30 20:57:21 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2429.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2429/24290261.htm; http://link.springer.de/link/service/series/0558/papers/2429/24290261.pdf", acknowledgement = ack-nhfb, } @Manual{Sun:2002:BJP, author = "{Sun Microsystems}", title = "{BigDecimal (Java 2 Platform SE v1.4.0)}", organization = "Sun Microsystems", address = "Mountain View, CA, USA", pages = "17", year = "2002", bibdate = "Fri Nov 28 11:16:16 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://java.sun/com/products", abstract = "Immutable, arbitrary-precision signed decimal numbers. A BigDecimal consists of an arbitrary precision integer unscaled value and a non-negative 32-bit integer scale, which represents the number of digits to the right of the decimal point. The number represented by the BigDecimal is $(\mbox{unscaledValue} / 10^{\mbox{scale}})$. BigDecimal provides operations for basic arithmetic, scale manipulation, comparison, hashing, and format conversion.", acknowledgement = ack-nhfb, keywords = "decimal floating-point arithmetic", } @Article{Taniar:2002:PSH, author = "David Taniar and J. Wenny Rahayu", title = "Parallel Sort-Hash Object-Oriented Collection Join Algorithms for Shared-Memory Machines", journal = j-PARALLEL-ALGORITHMS-APPL, volume = "17", number = "2", pages = "85--126", month = "????", year = "2002", CODEN = "PAAPEC", DOI = "http://dx.doi.org/10.1080/10637190208941435", ISSN = "1063-7192", ISSN-L = "1026-7689", bibdate = "Fri Jul 11 06:45:45 MDT 2008", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; parallelalgorithmsappl.bib", URL = "http://www.informaworld.com/smpp/content~content=a777924083", acknowledgement = ack-nhfb, ZMnumber = "01808643", } @Article{Tubaishat:2002:PEL, author = "Malik Ayed Tubaishat and Sanjay Kumar Madria and Bharat Bhargava", title = "Performance evaluation of linear hash structure model in a nested transaction environment", journal = j-J-SYST-SOFTW, volume = "63", number = "3", pages = "219--239", day = "15", month = sep, year = "2002", CODEN = "JSSODM", ISSN = "0164-1212", bibdate = "Sat Oct 25 07:14:09 MDT 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Wu:2002:CRH, author = "K-L Wu and P. S. Yu", title = "Controlled replication for hash routing-based {Web} caching", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "17", number = "4/5", pages = "??--??", month = jul # "\slash " # sep, year = "2002", CODEN = "CSSEEI", ISSN = "0267-6192", bibdate = "Sat Jan 03 19:15:31 2004", bibsource = "http://www.crlpublishing.co.uk/cssecont02.htm; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @PhdThesis{Aamodt:2003:CSP, author = "Ken S. Aamodt", title = "A cryptographically secure pseudorandom number generator", type = "{Ph.D.} thesis", school = "Purdue University", address = "West Lafayette, IN, USA", pages = "147", month = dec, year = "2003", ISBN = "0-542-33216-7", ISBN-13 = "978-0-542-33216-6", bibdate = "Thu Jan 19 17:01:34 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://catalog.lib.purdue.edu/Find/Record/1380784; http://search.proquest.com/docview/305316022?accountid=14677", abstract = "We investigate a cryptographically secure pseudorandom number generator based on a Linear Feedback Shift Register (LFSR). The statistical properties of the generator are examined, as well as its resistance to cryptographic analysis. LFSRs are known to produce bit streams that have excellent statistical properties. However, they can be predicted by monitoring their outputs briefly. Many approaches have been tried to modify an LFSR output to preserve its statistical properties but make it unpredictable. These techniques work in a `stream-wise' manner; for each bit output from the LFSR, one bit is output from the composite generator. All of these approaches have fallen to cryptanalysis. The technique used in this project processes the output of an LFSR with a hash function, converting blocks of M bits into smaller blocks of N bits. Since the hash function maps many input blocks into any given output block, there is no way of determining the LFSR state by knowing the value of an output block. The resulting generator was analyzed using standard statistical tests for randomness, such as chi-square tests on the distribution of blocks of bits, autocovariance of the output bit stream, and the Marsaglia `Die-Hard Battery' of statistical tests. The Lempel-Ziv data-compression algorithm was used on the output stream to try to discover any structure. In addition, a cryptographic analysis technique, the Berlekamp-Massey algorithm, was used to determine the difficulty of predicting the generator's output.", acknowledgement = ack-nhfb, advisor = "Mark R. Bell", } @Article{Devroye:2003:CHF, author = "Luc Devroye and Pat Morin", title = "Cuckoo hashing: {Further} analysis", journal = j-INFO-PROC-LETT, volume = "86", number = "4", pages = "215--219", day = "31", month = may, year = "2003", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Mon Jan 26 08:44:31 MST 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, } @InProceedings{Dietzfelbinger:2003:ARG, author = "Martin Dietzfelbinger and Philipp Woelfel", title = "Almost random graphs with simple hash functions", crossref = "ACM:2003:PTF", pages = "629--638", year = "2003", bibdate = "Tue Jan 13 06:21:07 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Helmer:2003:PSF, author = "Sven Helmer and Guido Moerkotte", title = "A performance study of four index structures for set-valued attributes of low cardinality", journal = j-VLDB-J, volume = "12", number = "3", pages = "244--261", month = oct, year = "2003", CODEN = "VLDBFR", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00778-003-0106-0", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:51:07 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structures (sequential signature files, signature trees, extendible signature hashing, and inverted files) for a fast retrieval of sets with low cardinality. We compared the index structures by implementing them and subjecting them to extensive experiments, investigating the influence of query set size, database size, domain size, and data distribution (synthetic and real). The results of the experiments clearly indicate that inverted files exhibit the best overall behavior of all tested index structures.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "access methods; database management systems; index structures; physical design; set-valued attributes", } @Article{Hsu:2003:NCS, author = "Ching-Hung Hsu and Ming-Chih Lai", title = "A new cipher scheme based on one-way hash function and {IDEA}", journal = j-J-DISCR-MATH-SCI-CRYPTO, volume = "7", number = "1", pages = "111--120", year = "2003", CODEN = "????", ISSN = "0972-0529", ISSN-L = "0972-0529", MRclass = "94A60", MRnumber = "2063309", bibdate = "Thu Feb 16 15:41:55 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib", acknowledgement = ack-nhfb, ajournal = "J. Discr. Math. Sci. Crypto.", fjournal = "Journal of Discrete Mathematical Sciences and Cryptography", } @Article{Ku:2003:WLL, author = "Wei-Chi Ku and Chien-Ming Chen and Hui-Lung Lee", title = "Weaknesses of {Lee--Li--Hwang}'s hash-based password authentication scheme", journal = j-OPER-SYS-REV, volume = "37", number = "4", pages = "19--25", month = oct, year = "2003", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:53 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Leifer:2003:GAS, author = "James J. Leifer and Gilles Peskine and Peter Sewell and Keith Wansbrough", title = "Global abstraction-safe marshalling with hash types", journal = j-SIGPLAN, volume = "38", number = "9", pages = "87--98", month = sep, year = "2003", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Oct 11 12:45:06 MDT 2003", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Martini:2003:DHM, author = "Paul M. Martini and Walter A. Burkhard", title = "Double Hashing with Multiple Passbits", journal = j-INT-J-FOUND-COMP-SCI, volume = "14", number = "6", pages = "1165--??", month = dec, year = "2003", CODEN = "IFCSEN", ISSN = "0129-0541", bibdate = "Thu Jan 6 06:10:32 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{McNichol:2003:HTM, author = "Tom McNichol", title = "How two math geeks with a lava lamp and a webcam are about to unleash chaos on the {Internet}", journal = "Wired", volume = "11", number = "8", pages = "??--??", month = aug, year = "2003", bibdate = "Sat Aug 23 07:53:02 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.lavarnd.org; http://www.wired.com/wired/archive/11.08/random.html", acknowledgement = ack-nhfb, keywords = "lavarand (US Patent 5,732,138: Method for seeding a pseudo-random number generator with a cryptographic hash of a digitization of a chaotic system); LavaRnd", } @InProceedings{Ostlin:2003:UHC, author = "Anna Ostlin and Rasmus Pagh", title = "Uniform hashing in constant time and linear space", crossref = "ACM:2003:PTF", pages = "622--628", year = "2003", bibdate = "Tue Jan 13 06:21:07 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Tang:2003:EDL, author = "Hong Tang and Tao Yang", title = "An Efficient Data Location Protocol for Self-organizing Storage Clusters", crossref = "ACM:2003:SII", pages = "??--??", year = "2003", bibdate = "Wed Nov 26 07:34:20 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.sc-conference.org/sc2003/inter_cal/inter_cal_detail.php?eventid=10686#0; http://www.sc-conference.org/sc2003/paperpdfs/pap299.pdf", abstract = "Component additions and failures are common for large-scale storage clusters in production environments. To improve availability and manageability, we investigate and compare data location schemes for a large self-organizing storage cluster that can quickly adapt to the additions or departures of storage nodes. We further present an efficient location scheme that differentiates between small and large file blocks for reduced management overhead compared to uniform strategies. In our protocol, small blocks, which are typically in large quantities, are placed through consistent hashing. Large blocks, much fewer in practice, are placed through a usage-based policy, and their locations are tracked by Bloom filters. The proposed scheme results in improved storage utilization even with non-uniform cluster nodes. To achieve high scalability and fault resilience, this protocol is fully distributed, relies only on soft states, and supports data replication. We demonstrate the effectiveness and efficiency of this protocol through trace-driven simulation.", acknowledgement = ack-nhfb, } @InProceedings{Whiting:2003:MPH, author = "Douglas L. Whiting and Michael J. Sabin", title = "{Montgomery} Prime Hashing for Message Authentication", crossref = "Joye:2003:TCC", pages = "50--67", year = "2003", bibdate = "Tue Apr 4 18:46:22 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "cryptology; Topics in Cryptology CT-RSA 2003", } @Article{Wiley:2003:DHT, author = "Brandon Wiley", title = "Distributed hash tables, {Part I}", journal = j-LINUX-J, volume = "2003", number = "114", pages = "7--7", month = oct, year = "2003", bibdate = "Sat Dec 24 17:45:50 MST 2005", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @InProceedings{Wu:2003:HHS, author = "Changxun Wu and Randal Burns", title = "Handling Heterogeneity in Shared-Disk File Systems", crossref = "ACM:2003:SII", pages = "??--??", year = "2003", bibdate = "Wed Nov 26 07:34:20 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.sc-conference.org/sc2003/inter_cal/inter_cal_detail.php?eventid=10686#1; http://www.sc-conference.org/sc2003/paperpdfs/pap132.pdf", abstract = "We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server provisioning. It balances file metadata workload by moving file sets among cluster server nodes. It also responds to changing server resources that arise from failure and recovery and dynamically adding or removing servers. The system is adaptive and self-managing. It operates without any a-priori knowledge of workload properties or the capabilities of the servers. Rather, it continuously tunes load placement using a technique called adaptive, non-uniform (ANU) randomization. ANU randomization realizes the scalability and metadata reduction benefits of hash-based, randomized placement techniques. It also avoids hashing's drawbacks: load skew, inability to cope with heterogeneity, and lack of tunability. Simulation results show that our load-management algorithm performs comparably to a prescient algorithm.", acknowledgement = ack-nhfb, } @InProceedings{Cai:2004:PPR, author = "Min Cai and Ann Chervenak and Martin Frank", title = "A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table", crossref = "ACM:2004:SHP", pages = "56--56", year = "2004", bibdate = "Tue Dec 27 07:57:20 MST 2005", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Devroye:2004:WCR, author = "Luc Devroye and Pat Morin and Alfredo Viola", title = "On Worst-Case {Robin Hood} Hashing", journal = j-SIAM-J-COMPUT, volume = "33", number = "4", pages = "923--936", month = aug, year = "2004", CODEN = "SMJCAT", DOI = "http://dx.doi.org/10.1137/S0097539702403372", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Sat Apr 16 10:19:24 MDT 2005", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/33/4; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/40337", acknowledgement = ack-nhfb, } @Article{Ganguly:2004:TSE, author = "Sumit Ganguly and Minos Garofalakis and Rajeev Rastogi", title = "Tracking set-expression cardinalities over continuous update streams", journal = j-VLDB-J, volume = "13", number = "4", pages = "354--369", month = dec, year = "2004", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:51:12 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "There is growing interest in algorithms for processing and querying continuous data streams (i.e., data seen only once in a fixed order) with limited memory resources. In its most general form, a data stream is actually an update stream, i.e., comprising data-item deletions as well as insertions. Such massive update streams arise naturally in several application domains (e.g., monitoring of large IP network installations or processing of retail-chain transactions). Estimating the cardinality of set expressions defined over several (possibly distributed) update streams is perhaps one of the most fundamental query classes of interest; as an example, such a query may ask ``what is the number of distinct IP source addresses seen in passing packets from both router $R_1$ and $R_2$ but not router $R_3$?''. Earlier work only addressed very restricted forms of this problem, focusing solely on the special case of insert-only streams and specific operators (e.g., union). In this paper, we propose the first space-efficient algorithmic solution for estimating the cardinality of full-fledged set expressions over general update streams. Our estimation algorithms are probabilistic in nature and rely on a novel, hash-based synopsis data structure, termed ''2-level hash sketch''. We demonstrate how our 2-level hash sketch synopses can be used to provide low-error, high-confidence estimates for the cardinality of set expressions (including operators such as set union, intersection, and difference) over continuous update streams, using only space that is significantly sublinear in the sizes of the streaming input (multi-)sets. Furthermore, our estimators never require rescanning or resampling of past stream items, regardless of the number of deletions in the stream. We also present lower bounds for the problem, demonstrating that the space usage of our estimation algorithms is within small factors of the optimal. Finally, we propose an optimized, time-efficient stream synopsis (based on 2-level hash sketches) that provides similar, strong accuracy-space guarantees while requiring only guaranteed logarithmic maintenance time per update, thus making our methods applicable for truly rapid-rate data streams. Our results from an empirical study of our synopsis and estimation techniques verify the effectiveness of our approach.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "approximate query processing; data streams; data synopses; randomized algorithms; set expressions", } @Article{Hao:2004:ARF, author = "Fang Hao and Murali Kodialam and T. V. Lakshman", title = "{ACCEL-RATE}: a faster mechanism for memory efficient per-flow traffic estimation", journal = j-SIGMETRICS, volume = "32", number = "1", pages = "155--166", month = jun, year = "2004", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1005686.1005707", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:21:18 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Per-flow network traffic measurement is an important component of network traffic management, network performance assessment, and detection of anomalous network events such as incipient DoS attacks. In [1], the authors developed a mechanism called RATE where the focus was on developing a memory efficient scheme for estimating per-flow traffic rates to a specified level of accuracy. The time taken by RATE to estimate the per-flow rates is a function of the specified estimation accuracy and this time is acceptable for several applications. However some applications, such as quickly detecting worm related activity or the tracking of transient traffic, demand faster estimation times. The main contribution of this paper is a new scheme called ACCEL-RATE that, for a specified level of accuracy, can achieve orders of magnitude decrease in per-flow rate estimation times. It achieves this by using a hashing scheme to split the incoming traffic into several sub-streams, estimating the per-flow traffic rates in each of the substreams and then relating it back to the original per-flow traffic rates. We show both theoretically and experimentally that the estimation time of ACCEL-RATE is at least one to two orders of magnitude lower than RATE without any significant increase in the memory size.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", } @InProceedings{Hsiao:2004:FCP, author = "Chun-Yuan Hsiao and Leonid Reyzin", title = "Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?", crossref = "Franklin:2004:ACC", pages = "92--??", year = "2004", bibdate = "Tue Apr 04 07:53:49 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Crypto '2004; cryptography", } @Book{ISO:2004:IIIb, author = "{ISO}", title = "{ISO\slash IEC} 10118-3:2004: Information technology --- Security techniques --- Hash-functions --- Part 3: Dedicated hash-functions", publisher = pub-ISO, address = pub-ISO:adr, pages = "94", month = feb, year = "2004", bibdate = "Tue Feb 07 07:44:15 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.iso.org/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=39876", abstract = "ISO/IEC 10118-3:2004 specifies the following seven dedicated hash-functions, i.e., specially-designed hash-functions:\par \begin{itemize} \item the first hash-function (RIPEMD-160) in Clause 7 provides hash-codes of lengths up to 160 bits; \item the second hash-function (RIPEMD-128) in Clause 8 provides hash-codes of lengths up to 128 bits; \item the third hash-function (SHA-1) in Clause 9 provides hash-codes of lengths up to 160 bits; \item the fourth hash-function (SHA-256) in Clause 10 provides hash-codes of lengths up to 256 bits; \item the fifth hash-function (SHA-512) in Clause 11 provides hash-codes of lengths up to 512 bits; \item the sixth hash-function (SHA-384) in Clause 12 provides hash-codes of a fixed length, 384 bits; and \item the seventh hash-function (WHIRLPOOL) in Clause 13 provides hash-codes of lengths up to 512 bits. \end{itemize} For each of these dedicated hash-functions, ISO/IEC 10118-3:2004 specifies a round-function that consists of a sequence of sub-functions, a padding method, initializing values, parameters, constants, and an object identifier as normative information, and also specifies several computation examples as informative information.", acknowledgement = ack-nhfb, xxISBN = "????", xxLCCN = "", } @InProceedings{Joux:2004:MIH, author = "Antoine Joux", title = "Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions", crossref = "Franklin:2004:ACC", pages = "306--??", year = "2004", bibdate = "Tue Apr 04 07:53:49 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Crypto '2004; cryptography", } @Article{Ku:2004:HBS, author = "Wei-Chi Ku", title = "A hash-based strong-password authentication scheme without using {Smart Cards}", journal = j-OPER-SYS-REV, volume = "38", number = "1", pages = "29--34", month = jan, year = "2004", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:37 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lee:2004:CUA, author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo", title = "Cryptanalysis of a user authentication scheme using hash functions", journal = j-OPER-SYS-REV, volume = "38", number = "1", pages = "24--28", month = jan, year = "2004", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:37 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lee:2004:IAK, author = "Narn-Yih Lee and Chien-Nan Wu", title = "Improved authentication key exchange protocol without using one-way hash function", journal = j-OPER-SYS-REV, volume = "38", number = "2", pages = "85--92", month = apr, year = "2004", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:43 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Leung:2004:LPD, author = "Hing Leung and Viktor Podolskiy", title = "The limitedness problem on distance automata: {Hashiguchi}'s method revisited", journal = j-THEOR-COMP-SCI, volume = "310", number = "1--3", pages = "147--158", day = "1", month = jan, year = "2004", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Feb 9 08:35:35 MST 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/03043975", acknowledgement = ack-nhfb, } @Article{Muehlbacher:2004:FHT, author = "Joerg R. Muehlbacher", title = "Full Hash Table Search using Primitive Roots of the Prime Residue Group {$Z/p$}", journal = j-J-UCS, volume = "10", number = "9", pages = "1239--1249", day = "28", month = sep, year = "2004", CODEN = "????", ISSN = "0948-6968", bibdate = "Wed Jul 6 08:14:47 MDT 2005", bibsource = "http://www.jucs.org/jucs; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.jucs.org/jucs_10_9/full_hash_table_search", abstract = "After a brief introduction to hash-coding (scatter storage) and discussion of methods described in the literature, it is shown that for hash tables of length $p > 2$, prime, the primitive roots $r$ of the cyclic group $Z/p$ of prime residues $\mod p$ can be used for a simple collision strategy $q(p,i) = r^i \bmod p$ for $fi(k) = f0(k) + q(p,i) \bmod p$. It is similar to the strategy which uses quadratic residues $q(p,i) = i^2 \bmod p$ in avoiding secondary clustering, but reaches all table positions for probing. A table of $n$ primes for typical table lengths and their primitive roots is added. In cases where $r = 2^j$ is such a primitive root, the collision strategy can be implemented simply by repeated shifts to the left (by $j$ places in all).\par To make the paper self-contained and easy to read, the relevant definitions and the theorems used from the Theory of Numbers are included in the paper.", acknowledgement = ack-nhfb, keywords = "collision strategy; cyclic group mod p; full table scatter storage techniques; hash tables; primitive roots of the prime residue group mod p", } @Article{Siegel:2004:UCE, author = "Alan Siegel", title = "On Universal Classes of Extremely Random Constant-Time Hash Functions", journal = j-SIAM-J-COMPUT, volume = "33", number = "3", pages = "505--543", month = jun, year = "2004", CODEN = "SMJCAT", DOI = "http://dx.doi.org/10.1137/S0097539701386216", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Sat Apr 16 10:19:21 MDT 2005", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/33/3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/38621", acknowledgement = ack-nhfb, } @Article{Tang:2004:AHR, author = "Xueyan Tang and Samuel T. Chanson", title = "Adaptive hash routing for a cluster of client-side {Web} proxies", journal = j-J-PAR-DIST-COMP, volume = "64", number = "10", pages = "1168--1184", month = oct, year = "2004", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Dec 4 15:15:10 MST 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/07437315", acknowledgement = ack-nhfb, } @Misc{Wang:2004:CHF, author = "Xiaoyun Wang and Dengguo Feng and Xuejia Lai and Hongbo Yu", title = "Collisions for Hash Functions {MD4}, {MD5}, {HAVAL-128} and {RIPEMD}", howpublished = "Cryptology ePrint Archive, Report 2004/199", pages = "4", year = "2004", bibdate = "Wed Sep 15 14:58:12 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://eprint.iacr.org/2004/199.pdf; http://www.tcs.hut.fi/~mjos/md5/", acknowledgement = ack-nhfb, remark = "From the paper: ``\ldots{} MD5(M,N) = MD5(M',N'). On IBM P690, it takes about one hour to find such M and M', after that, it takes only 15 seconds to 5 minutes to find N$_i$ and N'$_i$, so that (M,N$_i$) and (M',N'$_i$) will produce the same hash same value. Moreover, our attack works for any given initial value.'' Markku-Juhani O. Saarinen comments (in the second URL): ``This clearly shows that the resistance of MD5 against collision attacks is significantly lower than $2^{64}$ indicated by its 128-bit digest. Since the attack allows free selection of IV, these attacks mean that MD5 should not be used for any serious cryptographic purpose.''", } @Article{Yoon:2004:SUA, author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo", title = "A secure user authentication scheme using hash functions", journal = j-OPER-SYS-REV, volume = "38", number = "2", pages = "62--68", month = apr, year = "2004", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:43 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Manual{ANSI:2005:AXP, author = "{ANSI}", title = "{ANSI X9.62:2005}: Public Key Cryptography for the Financial Services Industry, The {Elliptic Curve Digital Signature Algorithm (ECDSA)}", organization = pub-ANSI, address = pub-ANSI:adr, year = "2005", bibdate = "Thu Mar 22 11:17:32 2007", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://csrc.nist.gov/encryption/dss/ecdsa/NISTReCur.pdf; http://webstore.ansi.org/ansidocstore/product.asp?sku=ANSI+X9%2E62%3A2005", abstract = "This Standard defines methods for digital signature (signature) generation and verification for the protection of messages and data using the Elliptic Curve Digital Signature Algorithm (ECDSA). ECDSA is the elliptic curve analogue of the Digital Signature Algorithm (ANS X9.30). The ECDSA shall be used in conjunction with an approved hash function, as specified in X9 Registry Item 00003, Secure Hash Standard (SHS). The hash functions approved at the time of publication of this document are SHA-1 (see note), SHA-224, SHA-256, SHA-384 and SHA-512. This ECDSA Standard provides methods and criteria for the generation of public and private keys that are required by the ECDSA and the procedural controls required for the secure use of the algorithm with these keys. This ECDSA Standard also provides methods and criteria for the generation of elliptic curve domain parameters that are required by the ECDSA and the procedural controls required for the secure use of the algorithm with these domain parameters.", acknowledgement = ack-nhfb, } @Article{Balakirsky:2005:HDU, author = "Vladimir B. Balakirsky", title = "Hashing of Databases with the Use of Metric Properties of the {Hamming} Space", journal = j-COMP-J, volume = "48", number = "1", pages = "4--16", month = jan, year = "2005", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Jun 28 17:48:35 MDT 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/bxh059.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/pdf/bxh059.pdf", acknowledgement = ack-nhfb, } @Article{Burkhard:2005:DHP, author = "Walter A. Burkhard", title = "Double hashing with passbits", journal = j-INFO-PROC-LETT, volume = "96", number = "5", pages = "162--166", day = "16", month = dec, year = "2005", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Mar 31 18:41:05 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", } @Article{Castro:2005:NRG, author = "Julio C{\'e}sar Hern{\'a}ndez Castro and Pedro Isasi Vi{\~n}uela", title = "New results on the genetic cryptanalysis of {TEA} and reduced-round versions of {XTEA}", journal = j-NEW-GEN-COMP, volume = "23", number = "3", pages = "233--243", year = "2005", CODEN = "NGCOE5", DOI = "http://dx.doi.org/10.1007/BF03037657", ISSN = "0288-3635 (print), 1882-7055 (electronic)", ISSN-L = "0288-3635", bibdate = "Wed Feb 01 16:35:39 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.springerlink.com/content/e018uh040400kh87/", abstract = "Recently, a quick and simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented and proved useful by the authors. In this paper, this cryptanalytic attack (named genetic cryptanalysis after its use of genetic algorithms) is shown to be successful when applied over reduced-round versions of the block cipher XTEA. Efficient distinguishers for XTEA are proposed for up to 4 cycles (8 rounds). Additionally, a variant of this genetic attack is also introduced, and their results over the block cipher TEA presented, which are the most powerful published to date.", acknowledgement = ack-nhfb, fjournal = "New Generation Computing", keywords = "block ciphers; cryptanalysis; distinguishers; TEA; XTEA", } @Article{Chang:2005:PHS, author = "Chin-Chen Chang and Chih-Yang Lin", title = "Perfect Hashing Schemes for Mining Association Rules", journal = j-COMP-J, volume = "48", number = "2", pages = "168--179", month = mar, year = "2005", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Jun 28 17:48:36 MDT 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_02/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_02/bxh074.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_02/pdf/bxh074.pdf", acknowledgement = ack-nhfb, } @InProceedings{Coron:2005:MDR, author = "Jean-S{\'e}bastien Coron and Yevgeniy Dodis and C{\'e}cile Malinaud and Prashant Puniya", title = "{Merkle--Damg{\aa}rd} Revisited: How to Construct a Hash Function", crossref = "Shoup:2005:ACH", pages = "430--??", year = "2005", DOI = "http://dx.doi.org/10.1007/11535218_26", bibdate = "Mon Apr 3 09:26:13 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Crypto '2005; cryptography", } @InProceedings{Dodis:2005:GIF, author = "Yevgeniy Dodis and Roberto Oliveira and Krzysztof Pietrzak", title = "On the Generic Insecurity of the Full Domain Hash", crossref = "Shoup:2005:ACH", pages = "449--??", year = "2005", DOI = "http://dx.doi.org/10.1007/11535218_27", bibdate = "Mon Apr 3 09:26:13 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Crypto '2005; cryptography", } @InProceedings{Gebhardt:2005:NPV, author = "M. Gebhardt and G. Illies and W. Schindler", booktitle = "{NIST Cryptographic Hash Workshop 2005}", title = "A Note on the Practical Value of Single Hash Function Collisions for Special File Formats", publisher = "????", address = "????", pages = "??--??", year = "2005", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Apr 03 08:43:05 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "18 slides + 15-page paper.", URL = "http://csrc.nist.gov/pki/HashWorkshop/2005/Oct31_Presentations/Illies_NIST_05.pdf", abstract = "We investigate Merkle-Damgard hash functions and different file formats. Our goal is to construct many meaningful hash collisions with given semantic contents from one single abstract collision. We show that this is not only possible for PostScript ([DL1], [DL2]) but also for PDF, TIFF and MS Word 97. Our results suggest that this property might be typical for higher file formats.", acknowledgement = ack-nhfb, remark = "The authors show explicit construction of PostScript, PDF, TIFF, and Word 97 documents with identical hash functions but different contents", } @Article{Gutmann:2005:WHC, author = "P. Gutmann and D. Naccache and C. C. Palmer", title = "When hashes collide [applied cryptography]", journal = j-IEEE-SEC-PRIV, volume = "3", number = "3", pages = "68--71", month = may # "/" # jun, year = "2005", CODEN = "????", ISSN = "1540-7993 (print), 1558-4046 (electronic)", bibdate = "Tue Jul 26 18:29:12 MDT 2005", bibsource = "http://ieeexplore.ieee.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://ieeexplore.ieee.org/iel5/8013/31002/01439506.pdf; http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=31002&arnumber=1439506&count=20&index=13", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Hsiao:2005:TMD, author = "Hung-Chang Hsiao and Chung-Ta King and Chia-Wei Wang", title = "{TYPHOON}: mobile distributed hash tables", journal = j-J-PAR-DIST-COMP, volume = "65", number = "2", pages = "191--206", month = feb, year = "2005", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Fri Jul 11 20:32:33 MDT 2008", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/07437315; jpardistcomp.bib", acknowledgement = ack-nhfb, } @Article{Ioannidis:2005:ADS, author = "Ioannis Ioannidis and Ananth Grama and Mikhail Atallah", title = "Adaptive data structures for {IP} lookups", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "10", pages = "1.1:1--1.1:??", month = "????", year = "2005", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1064546.1064548", ISSN = "1084-6654", bibdate = "Mon Oct 6 16:05:40 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The problem of efficient data structures for IP lookups has been well studied in the literature. Techniques such as LC tries and extensible hashing are commonly used. In this paper, we address the problem of generalizing LC tries, based on traces of past lookups, to provide performance guarantees for memory suboptimal structures. As a specific example, if a memory-optimal (LC) trie takes 6 MB and the total memory at the router is 8 MB, how should the trie be modified to make best use of the 2 MB of excess memory? We present a greedy algorithm for this problem and prove that, if for the optimal data structure there are $b$ fewer memory accesses on average for each lookup compared with the original trie, the solution produced by the greedy algorithm will have at least 9 \times $b$ /11 fewer memory accesses on average (compared to the original trie). An efficient implementation of this algorithm presents significant additional challenges. We describe an implementation with a time complexity of $O(\xi(d) n \log n)$ and a space complexity of $O(n)$, where $n$ is the number of nodes of the trie and $d$ its depth. The depth of a trie is fixed for a given version of the Internet protocol and is typically $O(\log n)$. In this case, $\xi(d) = O(\log^2 n)$. We also demonstrate experimentally the performance and scalability of the algorithm on actual routing data.", acknowledgement = ack-nhfb, articleno = "1.1", keywords = "IP lookups; level compression", } @InProceedings{Ishai:2005:SCC, author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky", title = "Sufficient Conditions for Collision-Resistant Hashing", crossref = "Kilian:2005:TCS", pages = "445--??", year = "2005", bibdate = "Tue Apr 4 19:15:40 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Theory of cryptography (TCC 2005)", } @Article{Janson:2005:IDL, author = "Svante Janson", title = "Individual displacements for linear probing hashing with different insertion policies", journal = j-TALG, volume = "1", number = "2", pages = "177--213", month = oct, year = "2005", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1103963.1103964", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Tue Dec 13 18:19:56 MST 2005", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We study the distribution of the individual displacements in hashing with linear probing for three different versions: First Come, Last Come and Robin Hood. Asymptotic distributions and their moments are found when the size of the hash table tends to infinity with the proportion of occupied cells converging to some $\alpha$, $0 < \alpha < 1$. (In the case of Last Come, the results are more complicated and less complete than in the other cases.) We also show, using the diagonal Poisson transform studied by Poblete, Viola and Munro, that exact expressions for finite $m$ and $n$ can be obtained from the limits as $m,n \rightarrow \infty$. We end with some results, conjectures and questions about the shape of the limit distributions. These have some relevance for computer applications.", acknowledgement = ack-nhfb, } @Article{Kaps:2005:ESU, author = "J.-P. Kaps and K. Yuksel and B. Sunar", title = "Energy scalable universal hashing", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "12", pages = "1484--1495", month = dec, year = "2005", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/TC.2005.195", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 16:17:19 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1524931", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", } @Article{Ku:2005:WYR, author = "Wei-Chi Ku and Min-Hung Chiang and Shen-Tien Chang", title = "Weaknesses of {Yoon--Ryu--Yoo}'s hash-based password authentication scheme", journal = j-OPER-SYS-REV, volume = "39", number = "1", pages = "85--89", month = jan, year = "2005", CODEN = "OSRED8", ISSN = "0163-5980", bibdate = "Sat Aug 26 08:55:38 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Lin:2005:GPW, author = "Iuon-Chang Lin and Min-Shiang Hwang and Chin-Chen Chang", title = "The General Pay-Word: {A} Micro-payment Scheme Based on $n$-dimension One-way Hash Chain", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "36", number = "1", pages = "53--67", month = jul, year = "2005", CODEN = "DCCREC", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10623-003-1162-6", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", bibdate = "Tue Jul 5 09:05:57 MDT 2005", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=36&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=36&issue=1&spage=53", acknowledgement = ack-nhfb, } @InProceedings{Macchetti:2005:QPH, author = "Marco Macchetti and Luigi Dadda", title = "Quasi-Pipelined Hash Circuits", crossref = "Montuschi:2005:PIS", pages = "??--??", year = "2005", bibdate = "Wed Jun 22 07:02:55 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://arith17.polito.it/final/paper-149.pdf", abstract = "Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on the class of dedicated hash functions, whose general construction is presented; the peculiar arrangement of sequential and combinational units makes the application of pipelining techniques to these constructions not trivial. We formalize here an optimization technique called quasipipelining, whose goal is to optimize the critical path and thus to increase the clock frequency in dedicated hardware implementations. The SHA-2 algorithm has been previously examined by Dadda et al., with specific versions of quasipipelining; here, a full generalization of the technique is presented, along with application to the SHA-1 algorithm. Quasi-pipelining could be as well applied to future hashing algorithms, provided they are designed along the same lines as those of the SHA family.", acknowledgement = ack-nhfb, keywords = "ARITH-17", pagecount = "8", } @Article{Safavi-naini:2005:MH, author = "R. Safavi-naini and C. Charnes", title = "{MRD} Hashing", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "37", number = "2", pages = "229--242", month = nov, year = "2005", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-004-3988-y", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "11T99; 94B60", bibdate = "Wed Jul 9 09:31:12 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=37&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=37&issue=2&spage=229", acknowledgement = ack-nhfb, keywords = "Galois fields; hashing functions; MRD codes", } @Article{Sklavos:2005:ISH, author = "N. Sklavos and O. Koufopavlou", title = "Implementation of the {SHA-2} Hash Family Standard Using {FPGAs}", journal = j-J-SUPERCOMPUTING, volume = "31", number = "3", pages = "227--248", month = mar, year = "2005", CODEN = "JOSUED", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s11227-005-0086-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 6 10:36:20 MDT 2005", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=31&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=31&issue=3&spage=227", acknowledgement = ack-nhfb, } @Article{Soomro:2005:DDH, author = "H. K. Soomro and S. A. A. Shah and A. A. G. Shaikh", title = "Development of Dynamic Hashing Key Generation Method for {Java} Based {Sindhi} Programming Environment", journal = "Mehran University Research Journal of Engineering and Technology", volume = "24", number = "2", pages = "125--130", year = "2005", CODEN = "????", ISSN = "0254-7821", bibdate = "Mon May 16 14:02:00 MDT 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta database", acknowledgement = ack-nhfb, } @Article{Tang:2005:LTO, author = "Chunqiang Tang and Melissa J. Buco and Rong N. Chang and Sandhya Dwarkadas and Laura Z. Luan and Edward So and Christopher Ward", title = "Low traffic overlay networks with large routing tables", journal = j-SIGMETRICS, volume = "33", number = "1", pages = "14--25", month = jun, year = "2005", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1071690.1064216", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:21:27 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The routing tables of Distributed Hash Tables (DHTs) can vary from size $O(1)$ to $O(n)$. Currently, what is lacking is an analytic framework to suggest the optimal routing table size for a given workload. This paper (1) compares DHTs with $O(1)$ to $O(n)$ routing tables and identifies some good design points; and (2) proposes protocols to realize the potential of those good design points. We use total traffic as the uniform metric to compare heterogeneous DHTs and emphasize the balance between maintenance cost and lookup cost. Assuming a node on average processes 1,000 or more lookups during its entire lifetime, our analysis shows that large routing tables actually lead to both low traffic and low lookup hops. These good design points translate into one-hop routing for systems of medium size and two-hop routing for large systems. Existing one-hop or two-hop protocols are based on a hierarchy. We instead demonstrate that it is possible to achieve completely decentralized one-hop or two-hop routing, i.e., without giving up being peer-to-peer. We propose 1h-Calot for one-hop routing and 2h-Calot for two-hop routing. Assuming a moderate lookup rate, compared with DHTs that use $O(\log n)$ routing tables, 1h-Calot and 2h-Calot save traffic by up to 70\% while resolving lookups in one or two hops as opposed to $O(\log n)$ hops.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", keywords = "distributed hash table; overlay network; peer-to-peer system", } @Article{Vandierendonck:2005:XBH, author = "H. Vandierendonck and K. {De Bosschere}", title = "{XOR}-based hash functions", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "7", pages = "800--812", month = jul, year = "2005", CODEN = "ITCOB4", DOI = "http://dx.doi.org/10.1109/TC.2005.122", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 16:17:17 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1432664", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", } @Article{Viola:2005:EDI, author = "Alfredo Viola", title = "Exact distribution of individual displacements in linear probing hashing", journal = j-TALG, volume = "1", number = "2", pages = "214--242", month = oct, year = "2005", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1103963.1103965", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Tue Dec 13 18:19:56 MST 2005", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When a table of size $m$ has $n$ elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed $m$ and $n$ are found as well as when the table is $\alpha$-full, and $\alpha$ strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived.", acknowledgement = ack-nhfb, } @InProceedings{Wang:2005:ECS, author = "Xiaoyun Wang and Hongbo Yu and Yiqun Lisa Yin", title = "Efficient Collision Search Attacks on {SHA-0}", crossref = "Shoup:2005:ACH", journal = j-LECT-NOTES-COMP-SCI, volume = "3621", pages = "1--??", year = "2005", CODEN = "LNCSD9", DOI = "http://dx.doi.org/10.1007/11535218_1", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Apr 3 08:32:34 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than $2^{39}$ hash operations.", acknowledgement = ack-nhfb, keywords = "Collision search attacks; Crypto '2005; cryptography; Hash functions; SHA-0; SHA-1", } @InProceedings{Wang:2005:ECSa, author = "Xiaoyun Wang and Hongbo Yu and Yiqun Lisa Yin", title = "Efficient Collision Search Attacks on {SHA-0}", crossref = "Shoup:2005:ACH", pages = "1--??", year = "2005", DOI = "http://dx.doi.org/10.1007/11535218_1", bibdate = "Mon Apr 3 08:32:34 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than $2^{39}$ hash operations.", acknowledgement = ack-nhfb, keywords = "Collision search attacks; Crypto '2005; cryptography; Hash functions; SHA-0; SHA-1", } @TechReport{Wang:2005:FCFa, author = "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu", title = "Finding Collisions in the Full {SHA-1}", type = "Technical report", institution = "Shandong University", address = "Shandong, China", day = "22", month = jun, year = "2005", bibdate = "Fri Jul 15 14:04:29 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://cryptome.org/wang_sha1_v2.zip", abstract = "In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than $2^{69}$ hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the $2^{80}$ theoretical bound.", acknowledgement = ack-nhfb, } @Article{Wang:2005:FCFb, author = "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu", title = "Finding Collisions in the Full {SHA-1}", journal = j-LECT-NOTES-COMP-SCI, volume = "3621", pages = "17--??", year = "2005", CODEN = "LNCSD9", DOI = "http://dx.doi.org/10.1007/11535218_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", bibdate = "Mon Apr 3 08:32:34 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than $2^{69}$ hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the $2^{80}$ theoretical bound.", acknowledgement = ack-nhfb, keywords = "Collision search attacks; Hash functions; SHA-0; SHA-1.", } @Article{Wang:2005:VCA, author = "Shiuh-Jeng Wang", title = "Vowel-consonant addressing mode on hashing for {English} letter-oriented keys", journal = j-J-DISCR-MATH-SCI-CRYPTO, volume = "8", number = "1", pages = "1--25", year = "2005", CODEN = "????", ISSN = "0972-0529", ISSN-L = "0972-0529", MRclass = "68P20 (68P10)", MRnumber = "2147720 (2005m:68059)", bibdate = "Thu Feb 16 16:28:50 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Discrete Mathematical Sciences and Cryptography", } @Misc{Yang:2005:TFN, author = "JiXian Yang", title = "{TWOBLOCK}: {A} Fast New Hash Function", pages = "7", year = "2005", bibdate = "Thu Sep 22 08:14:45 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", note = "World-Wide Web document.", URL = "http://yjxonline.hostrocket.com/Hash2005.pdf", abstract = "In this paper, the author studies the fast cryptographic hash function. This work suggests a different notion with respect to the traditional hash functions, MD5, SHA-1, and Whirlpool. The notion of block cipher based hash function is abandoned. According to the flexibility of attack, it shows how this hash function is no longer vulnerable to the known collision attacks. Finally, the author proves that the TWOBLOCK output bit value problem is NP-hard.", acknowledgement = ack-nhfb, keywords = "Block cipher; Collision; Design principle; Fast; Flexibility of attack; Hash function; NP-hard; Provable security; Two block", } @Article{Yao:2005:HBL, author = "D. Yao and Cyrus Shahabi and Per-{\AA}ke Larson", title = "Hash-based labeling techniques for storage scaling", journal = j-VLDB-J, volume = "14", number = "2", pages = "222--237", month = apr, year = "2005", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:51:15 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; vldbj.bib", abstract = "Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of data objects across multiple storage devices of a storage pool, our optimization objective is to redistribute a minimum number of objects after scaling the pool. In addition, a uniform distribution, and hence a balanced load, should be ensured after redistribution. Moreover, the redistributed objects should be retrieved efficiently during the normal mode of operation: in one I/O access and with low complexity computation. To achieve this, we propose an algorithm called random disk labeling (RDL), based on double hashing, where storage can be added or removed without any increase in complexity. We compare RDL with other proposed techniques and demonstrate its effectiveness through experimentation.", acknowledgement = ack-nhfb, keywords = "load balancing; random data placement; scalable storage systems", } @Article{Zhang:2005:ILL, author = "Hui Zhang and Ashish Goel and Ramesh Govindan", title = "Improving lookup latency in distributed hash table systems using random sampling", journal = j-IEEE-TRANS-NETWORKING, volume = "13", number = "5", pages = "1121--1134", month = oct, year = "2005", CODEN = "IEANEP", DOI = "http://dx.doi.org/10.1109/TNET.2005.857106", ISSN = "1063-6692", bibdate = "Fri Dec 30 06:01:37 MST 2005", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and file systems to application-layer multicast. DHT systems essentially build an overlay network, but a path on the overlay between any two nodes can be significantly different from the unicast path between those two nodes on the underlying network. As such, the lookup latency in these systems can be quite high and can adversely impact the performance of applications built on top of such systems. In this paper, we discuss a random sampling technique that incrementally improves lookup latency in DHT systems. Our sampling can be implemented using information gleaned from lookups traversing the overlay network. For this reason, we call our approach lookup-parasitic random sampling (LPRS). LPRS converges quickly, and requires relatively few modifications to existing DHT systems. For idealized versions of DHT systems like Chord, Tapestry, and Pastry, we analytically prove that LPRS can result in lookup latencies proportional to the average unicast latency of the network, provided the underlying physical topology has a power-law latency expansion. We then validate this analysis by implementing LPRS in the Chord simulator. Our simulations reveal that LPRS-Chord exhibits a qualitatively better latency scaling behavior relative to unmodified Chord. The overhead of LPRS is one sample per lookup hop in the worst case. Finally, we provide evidence which suggests that the Internet router-level topology resembles power-law latency expansion. This finding implies that LPRS has significant practical applicability as a general latency reduction technique for many DHT systems. This finding is also of independent interest since it might inform the design of latency-sensitive topology models for the Internet.", acknowledgement = ack-nhfb, } @Article{Zhang:2005:ISS, author = "Jianhong Zhang and Yumin Wang", title = "An improved signature scheme without using one-way {Hash} functions", journal = j-APPL-MATH-COMP, volume = "170", number = "2", pages = "905--908", day = "15", month = nov, year = "2005", CODEN = "AMHCBQ", ISSN = "0096-3003 (print), 1873-5649 (electronic)", bibdate = "Sat Jul 12 09:02:50 MDT 2008", bibsource = "applmathcomput2005.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00963003", acknowledgement = ack-nhfb, } @Article{Agarwal:2006:AGA, author = "R. C. Agarwal and K. Gupta and S. Jain and S. Amalapurapu", title = "An approximation to the greedy algorithm for differential compression", journal = j-IBM-JRD, volume = "50", number = "1", pages = "149--??", month = jan, year = "2006", CODEN = "IBMJAE", DOI = "http://dx.doi.org/", ISSN = "0018-8646 (print), 2151-8556 (electronic)", bibdate = "Fri Feb 9 20:16:31 MST 2007", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/rd/501/agarwal.html", abstract = "We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. The term ``differential compression'' refers to encoding a file (a version file) as a set of changes with respect to another file (a reference file). Previous differential compression algorithms can be shown empirically to run in linear time, but they have certain drawbacks; namely, they do not find the best matches for every offset of the version file. Our algorithm, hsadelta (hash suffix array delta), finds the best matches for every offset of the version file, with respect to a certain granularity and above a certain length threshold. The algorithm has two variations depending on how we choose the block size. We show that if the block size is kept fixed, the compression performance of the algorithm is similar to that of the greedy algorithm, without the associated expensive space and time requirements. If the block size is varied linearly with the reference file size, the algorithm can run in linear time and constant space. We also show empirically that the algorithm performs better than other state-of-the-art differential compression algorithms in terms of compression and is comparable in speed.", acknowledgement = ack-nhfb, ordernumber = "G322-0246-00", } @Article{Burr:2006:CHS, author = "William E. Burr", title = "Cryptographic Hash Standards: Where Do We Go from Here?", journal = j-IEEE-SEC-PRIV, volume = "4", number = "2", pages = "88--91", month = mar # "\slash " # apr, year = "2006", CODEN = "????", DOI = "http://dx.doi.org/10.1109/MSP.2006.37", ISSN = "1540-7993 (print), 1558-4046 (electronic)", bibdate = "Mon Apr 3 07:36:16 MDT 2006", bibsource = "http://computer.org/security/sp2006/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Denielou:2006:APS, author = "Pierre-Malo Deni{\'e}lou and James J. Leifer", title = "Abstraction preservation and subtyping in distributed languages", journal = j-SIGPLAN, volume = "41", number = "9", pages = "286--297", month = sep, year = "2006", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1160074.1159841", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:46:22 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In most programming languages, type abstraction is guaranteed by syntactic scoping in a single program, but is not preserved by marshalling during distributed communication. A solution is to generate hash types at compile time that consist of a fingerprint of the source code implementing the data type. These hash types can be tupled with a marshalled value and compared efficiently at unmarshall time to guarantee abstraction safety. In this paper, we extend a core calculus of ML-like modules, functions, distributed communication, and hash types, to integrate structural subtyping, user-declared subtyping between abstract types, and bounded existential types. Our semantics makes two contributions: (1) the explicit tracking of the interaction between abstraction boundaries and subtyping; (2) support for user-declared module upgrades with propagation of the resulting subhashing relation throughout the network during communication. We prove type preservation, progress, determinacy, and erasure for our system.", acknowledgement = ack-nhfb, keywords = "module systems; programming language semantics; serialisation and distributed computation; subtyping; type theory", } @Article{Estan:2006:BAC, author = "Cristian Estan and George Varghese and Michael Fisk", title = "Bitmap algorithms for counting active flows on high-speed links", journal = j-IEEE-TRANS-NETWORKING, volume = "14", number = "5", pages = "925--937", month = oct, year = "2006", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:52:20 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting can be used to detect DoS attacks and port scans and to solve measurement problems. Counting is especially hard when processing must be done within a packet arrival time (8 ns at OC-768 speeds) and, hence, may perform only a small number of accesses to limited, fast memory. A naive solution that maintains a hash table requires several megabytes because the number of flows can be above a million. By contrast, our new probabilistic algorithms use little memory and are fast. The reduction in memory is particularly important for applications that run multiple concurrent counting instances. For example, we replaced the port-scan detection component of the popular intrusion detection system Snort with one of our new algorithms. This reduced memory usage on a ten minute trace from 50 to 5.6 MB while maintaining a 99.77\% probability of alarming on a scan within 6s of when the large-memory algorithm would. The best known prior algorithm (probabilistic counting) takes four times more memory on port scan detection and eight times more on a measurement application. This is possible because our algorithms can be customized to take advantage of special features such as a large number of instances that have very small counts or prior knowledge of the likely range of the count.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "counting distinct elements; traffic measurements", } @Article{Gennaro:2006:FPB, author = "Rosario Gennaro and Yehuda Lindell", title = "A framework for password-based authenticated key exchange", journal = j-TISSEC, volume = "9", number = "2", pages = "181--234", month = may, year = "2006", CODEN = "ATISBQ", DOI = "http://doi.acm.org/10.1145/1151414.1151418", ISSN = "1094-9224 (print), 1557-7406 (electronic)", bibdate = "Sat Aug 26 08:10:38 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this paper, we present a general framework for password-based authenticated key exchange protocols, in the common reference string model. Our protocol is actually an abstraction of the key exchange protocol of Katz et al. and is based on the recently introduced notion of smooth projective hashing by Cramer and Shoup. We gain a number of benefits from this abstraction. First, we obtain a modular protocol that can be described using just three high-level cryptographic tools. This allows a simple and intuitive understanding of its security. Second, our proof of security is significantly simpler and more modular. Third, we are able to derive analogs to the Katz et al. protocol under additional cryptographic assumptions. Specifically, in addition to the DDH assumption used by Katz et al., we obtain protocols under both the quadratic and N-residuosity assumptions. In order to achieve this, we construct new smooth projective hash functions.", acknowledgement = ack-nhfb, } @Article{Hasan:2006:CSE, author = "Jahangir Hasan and Srihari Cadambi and Venkatta Jakkula and Srimat Chakradhar", title = "{Chisel}: {A} Storage-efficient, Collision-free Hash-based Network Processing Architecture", journal = j-COMP-ARCH-NEWS, volume = "34", number = "2", pages = "203--215", year = "2006", CODEN = "CANED2", ISSN = "0163-5964 (print), 1943-5851 (electronic)", bibdate = "Mon Aug 21 15:00:05 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Kakarountas:2006:HSF, author = "Athanasios P. Kakarountas and Haralambos Michail and Athanasios Milidonis and Costas E. Goutis and George Theodoridis", title = "High-Speed {FPGA} Implementation of Secure Hash Algorithm for {IPSec} and {VPN} Applications", journal = j-J-SUPERCOMPUTING, volume = "37", number = "2", pages = "179--195", month = aug, year = "2006", CODEN = "JOSUED", DOI = "http://dx.doi.org/10.1007/s11227-006-5682-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 9 17:32:28 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=37&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib; jsuper.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=37&issue=2&spage=179", acknowledgement = ack-nhfb, keywords = "FPGA; hardware implementation; hash function; high-speed performance; Security", } @Article{Krovetz:2006:VUH, author = "Ted Krovetz and Phillip Rogaway", title = "Variationally universal hashing", journal = j-INFO-PROC-LETT, volume = "100", number = "1", pages = "36--39", day = "16", month = oct, year = "2006", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Mar 31 15:52:27 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", } @Article{Landau:2006:FMH, author = "Susan Landau", title = "Find Me a Hash", journal = j-NAMS, volume = "53", number = "3", pages = "330--332", month = mar, year = "2006", CODEN = "AMNOAN", ISSN = "0002-9920 (print), 1088-9477 (electronic)", bibdate = "Wed Mar 01 15:20:33 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.ams.org/notices/200603/fea-landau.pdf", abstract = "Hash functions are easy-to-compute compression functions that are used as compact representations, or digital fingerprints, of data and to provide message integrity. Some hash functions in current use have been shown to be vulnerable. The author argues that their replacements should be based on a mathematical theory, which has yet to be created.", acknowledgement = ack-nhfb, } @Article{Lefebvre:2006:PSH, author = "Sylvain Lefebvre and Hugues Hoppe", title = "Perfect spatial hashing", journal = j-TOG, volume = "25", number = "3", pages = "579--588", month = jul, year = "2006", CODEN = "ATGRDF", ISSN = "0730-0301 (print), 1557-7368 (electronic)", bibdate = "Wed Aug 23 10:02:03 MDT 2006", bibsource = "http://www.acm.org/pubs/contents/journals/tog/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Li:2006:FSS, author = "Kang Li and Zhenyu Zhong", title = "Fast statistical spam filter by approximate classifications", journal = j-SIGMETRICS, volume = "34", number = "1", pages = "347--358", month = jun, year = "2006", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1140277.1140317", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:21:37 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Statistical-based Bayesian filters have become a popular and important defense against spam. However, despite their effectiveness, their greater processing overhead can prevent them from scaling well for enterprise-level mail servers. For example, the dictionary lookups that are characteristic of this approach are limited by the memory access rate, therefore relatively insensitive to increases in CPU speed. We address this scaling issue by proposing an acceleration technique that speeds up Bayesian filters based on approximate classification. The approximation uses two methods: hash-based lookup and lossy encoding. Lookup approximation is based on the popular Bloom filter data structure with an extension to support value retrieval. Lossy encoding is used to further compress the data structure. While both methods introduce additional errors to a strict Bayesian approach, we show how the errors can be both minimized and biased toward a false negative classification. We demonstrate a 6x speedup over two well-known spam filters (bogofilter and qsf) while achieving an identical false positive rate and similar false negative rate to the original filters.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", keywords = "approximation; Bayesian filter; bloom filter; SPAM", } @Article{Liu:2006:ECS, author = "Lihua Liu and Hao Shen", title = "Explicit constructions of separating hash families from algebraic curves over finite fields", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "41", number = "2", pages = "221--233", month = nov, year = "2006", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-006-9004-y", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "05D05; 05D40", bibdate = "Wed Jul 9 09:34:12 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=41&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=41&issue=2&spage=221", acknowledgement = ack-nhfb, keywords = "Algebraic curve; Frameproof (FP) code; Identifiable parent property (IPP) code; Secure frameproof (SFP) code; Separating hash family; Strong separating hash family", } @Article{Long:2006:GCA, author = "Shoulun Long and Josef Pieprzyk and Huaxiong Wang and Duncan S. Wong", title = "Generalised Cumulative Arrays in Secret Sharing", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "40", number = "2", pages = "191--209", month = aug, year = "2006", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-006-0007-5", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", bibdate = "Wed Jul 9 09:33:16 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=40&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=40&issue=2&spage=191", acknowledgement = ack-nhfb, keywords = "Cumulative array; Perfect hash family; Secret sharing", } @Misc{Mueller:2006:SMG, author = "Maik Mueller and Michael Freidrich and Klaus Kiefer and Ralf Miko and Juergen Schneider", title = "System and method for generating pseudo-random numbers", howpublished = "United States Patent 7,894,602.", day = "31", month = mar, year = "2006", bibdate = "Tue Dec 27 16:54:57 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http:www.google.com/patents/US7894602", abstract = "A process and system for generating a pseudo-random number is presented. Input data having entropy is gathered in an Entropy Pool and transformed once by a cryptographic hash function. The transformed data forms the internal state of the pseudo-random number generator. The generator forms the output by applying a second cryptographic hash function to this internal state. Finally, the generator updates the internal state by inputting the current internal state and data from the Entropy Pool into a third cryptographic hash function. The output of the third hash function forms the new internal state of the pseudo-random number generator.", acknowledgement = ack-nhfb, } @InProceedings{Nguyen:2006:MDH, author = "Quan Son Nguyen", title = "Multi-Dimensional Hash Chains and Application to Micropayment Schemes", crossref = "Ytrehus:2006:LFN", pages = "218--228", year = "2006", bibdate = "Tue Jun 28 08:19:10 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Rechberger:2006:NCW, author = "Christian Rechberger and Vincent Rijmen and Nicolas Sklavos", title = "The {NIST Cryptographic Workshop on Hash Functions}", journal = j-IEEE-SEC-PRIV, volume = "4", number = "1", pages = "54--56", month = jan # "\slash " # feb, year = "2006", CODEN = "????", DOI = "http://dx.doi.org/10.1109/MSP.2006.26", ISSN = "1540-7993 (print), 1558-4046 (electronic)", bibdate = "Thu Feb 9 18:53:31 MST 2006", bibsource = "http://ieeexplore.ieee.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://ieeexplore.ieee.org/iel5/8013/33481/01588827.pdf; http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33481&arnumber=1588827; http://www.csrc.nist.gov/pki/HashWorkshop/", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", remark = "October 31--November 1, 2005 Gaithersburg, MD, USA. Second workshop August 24--25, 2006, Santa Barbara, CA, USA.", } @Article{Safavi-Naini:2006:SSS, author = "Rei Safavi-Naini and Huaxiong Wang", title = "Secret sharing schemes with partial broadcast channels", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "41", number = "1", pages = "5--22", month = oct, year = "2006", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-006-0027-1", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "94A62; 94A17; 68P30", bibdate = "Wed Jul 9 09:33:35 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=41&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=41&issue=1&spage=5", acknowledgement = ack-nhfb, keywords = "Cover-free family; Partial broadcast; Perfect hash-family; Secret sharing", } @Article{Shalev:2006:SOL, author = "Ori Shalev and Nir Shavit", title = "Split-ordered lists: {Lock-free} extensible hash tables", journal = j-J-ACM, volume = "53", number = "3", pages = "379--405", month = may, year = "2006", CODEN = "JACOAH", DOI = "http://doi.acm.org/10.1145/1147954.1147958", ISSN = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations with an expected O(1) cost. It consists of very simple code, easily implementable using only load, store, and compare-and-swap operations. The new mathematical structure at the core of our algorithm is recursive split-ordering, a way of ordering elements in a linked list so that they can be repeatedly ``split'' using a single compare-and-swap operation. Metaphorically speaking, our algorithm differs from prior known algorithms in that extensibility is derived by ``moving the buckets among the items'' rather than ``the items among the buckets.'' Though lock-free algorithms are expected to work best in multiprogrammed environments, empirical tests we conducted on a large shared memory multiprocessor show that even in non-multiprogrammed environments, the new algorithm performs as well as the most efficient known lock-based resizable hash-table algorithm, and in high load cases it significantly outperforms it.", acknowledgement = ack-nhfb, } @Article{Stallings:2006:WSH, author = "William Stallings", title = "The {Whirlpool} Secure Hash Function", journal = j-CRYPTOLOGIA, volume = "30", number = "1", pages = "55--67", month = jan, year = "2006", CODEN = "CRYPE6", DOI = "http://dx.doi.org/10.1080/01611190500380090", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibdate = "Mon Jun 30 12:02:14 MDT 2008", bibsource = "cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.informaworld.com/smpp/content~content=a741992009~db=all~order=page", acknowledgement = ack-nhfb, romanvolume = "XXX", } @Book{Stamp:2006:ISP, author = "Mark Stamp", title = "Information security: principles and practice", publisher = pub-WILEY-INTERSCIENCE, address = pub-WILEY-INTERSCIENCE:adr, pages = "xxi + 390", year = "2006", ISBN = "0-471-73848-4 (cloth)", ISBN-13 = "978-0-471-73848-0 (cloth)", LCCN = "QA76.9.A25 S69 2006", bibdate = "Sat May 14 10:14:47 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/enhancements/fy0645/2005005152-b.html; http://www.loc.gov/catdir/enhancements/fy0645/2005005152-d.html; http://www.loc.gov/catdir/toc/ecip058/2005005152.html", acknowledgement = ack-nhfb, subject = "Computer security", tableofcontents = "Preface \\ About The Author \\ Acknowledgments \\ 1. Introduction \\ 1.1 The Cast of Characters \\ 1.2 Alice's Online Bank \\ 1.2.1 Confidentiality, Integrity and \\ 1.2.2 Beyond CIA \\ 1.3 About This Book \\ 1.3.1 Cryptography \\ 1.3.2 Access Control \\ 1.3.3 Protocols \\ 1.3.4 Software \\ 1.4 The People Problem \\ 1.5 Theory and Practice \\ 1.6 Problems \\ I. CRYPTO \\ 2. Crypto Basics \\ 2.1 Introduction \\ 2.2 How to Speak Crypto \\ 2.3 Classic Crypto \\ 2.3.1 Simple Substitution Cipher \\ 2.3.2 Cryptanalysis of a Simple Substitution \\ 2.3.3 Definition of Secure \\ 2.3.4 Double Transposition Cipher \\ 2.3.5 One-time Pad \\ 2.3.6 Project VENONA \\ 2.3.7 Codebook Cipher \\ 2.3.8 Ciphers of the Election of 1876 \\ 2.4 Modern Crypto History \\ 2.5 A Taxonomy of Cryptography \\ 2.6 A Taxonomy of Cryptanalysis \\ 2.7 Summary \\ 2.8 Problems \\ 3. Symmetric Key Crypto \\ 3.1 Introduction \\ 3.2 Stream Ciphers \\ 3.2.1 A 5/1.3.2.2 RC 4.3.3 Block Ciphers \\ 3.3.1 Feistel Cipher \\ 3.3.2 DES \\ 3.3.3 Triple DES \\ 3.3.4 AES \\ 3.3.5 Three More Block Ciphers \\ 3.3.6 TEA \\ 3.3.7 Block Cipher Modes \\ 3.4 Integrity \\ 3.5 Summary \\ 3.6 Problems \\ 4. Public Key Crypto \\ 4.1 Introduction \\ 4.2 Knapsack \\ 4.3 RSA \\ 4.3.1 RSA Example \\ 4.3.2 Repeated Squaring \\ 4.3.3 Speeding Up RSA \\ 4.4 Diffie-Hellman \\ 4.5 Elliptic Curve Cryptography \\ 4.5.1 Elliptic Curve Math \\ 4.5.2 ECC Diffie-Hellman \\ 4.6 Public Key Notation \\ 4.7 Uses for Public Key Crypto \\ 4.7.1 Confidentiality in the Real World \\ 4.7.2 Signatures and Non-repudiation \\ 4.7.3 Confidentiality and Non-repudiation \\ 4.8 Public Key Infrastructure \\ 4.9 Summary \\ 4.10 Problems \\ 5. Hash Functions and Other Topics \\ 5.1 What is a Hash Function? \\ 5.2 The Birthday Problem \\ 5.3 Non-cryptographic Hashes \\ 5.4 Tiger Hash \\ 5.5 HMAC \\ 5.6 Uses of Hash Functions \\ 5.6.1 Online Bids \\ 5.6.2 Spam Reduction \\ 5.7 Other Crypto-Related Topics \\ 5.7.1 Secret Sharing.Key Escrow \\ 5.7.2 Random Numbers. Texas Hold 'em Poker. Generating Random Bits \\ 5.7.3 Information Hiding \\ 5.8 Summary \\ 5.9 Problems \\ 6. Advanced Cryptanalysis \\ 6.1 Introduction \\ 6.2 Linear and Differential Cryptanalysis \\ 6.2.1 Quick Review of DES \\ 6.2.2 ???", } @Article{Stinson:2006:SOT, author = "D. R. Stinson", title = "Some Observations on the Theory of Cryptographic Hash Functions", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "38", number = "2", pages = "259--277", month = feb, year = "2006", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-005-6344-y", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "94A60", bibdate = "Wed Jul 9 09:32:06 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=38&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=38&issue=2&spage=259", acknowledgement = ack-nhfb, keywords = "collision; hash family; hash function; preimage", } @Article{Suganya:2006:LRK, author = "A. Suganya and N. Vijayarangan", title = "{Landau--Ramanujan} keyed hash functions for message authentication", journal = j-J-DISCR-MATH-SCI-CRYPTO, volume = "9", number = "1", pages = "1--8", year = "2006", CODEN = "????", ISSN = "0972-0529", ISSN-L = "0972-0529", MRclass = "94A60 (68P25)", MRnumber = "2233935 (2006m:94075)", bibdate = "Thu Feb 16 16:28:50 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Discrete Mathematical Sciences and Cryptography", } @Article{Trono:2006:OTL, author = "John A. Trono", title = "Optimal Table Lookup for Reserved Words in {Ada}", journal = j-SIGADA-LETTERS, volume = "26", number = "1", pages = "25--30", month = apr, year = "2006", CODEN = "AALEE5", ISSN = "0736-721X", bibdate = "Thu May 18 10:15:38 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, keywords = "Cichelli; minimal perfect hash functions (MPHF)", } @Article{Woelfel:2006:CMO, author = "Philipp Woelfel", title = "A construction method for optimally universal hash families and its consequences for the existence of {RBIBDs}", journal = j-THEOR-COMP-SCI, volume = "363", number = "1", pages = "76--84", day = "25", month = oct, year = "2006", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Tue Mar 29 08:55:19 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/03043975", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", } @Article{Xu:2006:TNH, author = "Zhiyong Xu and Laxmi Bhuyan and Yiming Hu", title = "{Tulip}: {A} New Hash Based Cooperative {Web} Caching Architecture", journal = j-J-SUPERCOMPUTING, volume = "35", number = "3", pages = "301--320", month = mar, year = "2006", CODEN = "JOSUED", DOI = "http://dx.doi.org/10.1007/s11227-006-4671-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 9 17:32:27 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=35&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib; jsuper.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=35&issue=3&spage=301", acknowledgement = ack-nhfb, } @Article{Zhang:2006:CFS, author = "Cheng Zhang and Bhupesh Bansal and Paulo S. Branicio and Rajiv K. Kalia and Aiichiro Nakano and Ashish Sharma and Priya Vashishta", title = "Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks", journal = j-COMP-PHYS-COMM, volume = "175", number = "5", pages = "339--347", day = "1", month = sep, year = "2006", CODEN = "CPHCBZ", ISSN = "0010-4655 (print), 1879-2944 (electronic)", ISSN-L = "0010-4655", bibdate = "Mon Feb 13 23:42:08 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00104655", URL = "http://www.sciencedirect.com/science/article/pii/S0010465506002311", acknowledgement = ack-nhfb, fjournal = "Computer Physics Communications", } @Article{Aspnes:2007:SG, author = "James Aspnes and Gauri Shah", title = "Skip graphs", journal = j-TALG, volume = "3", number = "4", pages = "37:1--37:??", month = nov, year = "2007", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1290672.1290674", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Mon Jun 16 11:55:31 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, simple and straightforward algorithms can be used to construct a skip graph, insert new nodes into it, search it, and detect and repair errors within it introduced due to node failures.", acknowledgement = ack-nhfb, articleno = "37", keywords = "overlay networks; Peer-to-peer; skip lists", } @Manual{Barker:2007:RRN, author = "Elaine Barker and John Kelsey", title = "Recommendation for random number generation using deterministic random bit generators (revised)", type = "{NIST} Special Publication", number = "800-90", organization = pub-NIST, address = pub-NIST:adr, pages = "viii + 124", month = mar, year = "2007", bibdate = "Tue Apr 19 13:35:20 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://csrc.nist.gov/publications/nistpubs/800-90/SP800-90revised_March2007.pdf", abstract = "This Recommendation specifies mechanisms for the generation of random bits using deterministic methods. The methods provided are based on either hash functions, block cipher algorithms or number theoretic problems.", acknowledgement = ack-nhfb, keywords = "deterministic random bit generator (DRBG); entropy; hash function; random number generator", } @Article{Barwick:2007:SAL, author = "Susan G. Barwick and Wen-Ai Jackson", title = "A sequence approach to linear perfect hash families", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "45", number = "1", pages = "95--121", month = oct, year = "2007", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-007-9091-4", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "11T71", bibdate = "Wed Jul 9 09:35:28 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=45&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=45&issue=1&spage=95", acknowledgement = ack-nhfb, keywords = "Constructions; Cryptography; Perfect hash family; Sequences", } @Article{Bohm:2007:FRA, author = "Klemens B{\"o}hm and Erik Buchmann", title = "Free riding-aware forwarding in {Content-Addressable Networks}", journal = j-VLDB-J, volume = "16", number = "4", pages = "463--482", month = oct, year = "2007", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:51:25 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Research on P2P data structures has tacitly assumed that peers readily participate in the work, i.e., are cooperative. But such participation is voluntary, and free riding is the dominant strategy. This article describes a protocol that renders free riding unattractive, for one particular P2P data structure. The protocol is based on feedback that adjacent nodes exchange. This induces transitive logical networks of nodes that rule out uncooperative peers. The protocol uses proofs of work to deter free riding. To show that cooperative behavior dominates, we have come up with a cost model that quantifies the overall cost of peers, depending on their degree of cooperativeness and many other parameters. The cost model tells us that we can achieve a good discrimination against peers that are less cooperative, with moderate additional cost for cooperative peers. Extensive experiments confirm the validity of our approach.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", keywords = "distributed hashtables; free riding; incentives; peer-to-peer; reputation", } @Article{Bradford:2007:PSC, author = "Phillip G. Bradford and Michael N. Katehakis", title = "A Probabilistic Study on Combinatorial Expanders and Hashing", journal = j-SIAM-J-COMPUT, volume = "37", number = "1", pages = "83--111", month = "????", year = "2007", CODEN = "SMJCAT", DOI = "", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Tue May 18 08:21:43 MDT 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/37/1; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Chen:2007:IHJ, author = "Shimin Chen and Anastassia Ailamaki and Phillip B. Gibbons and Todd C. Mowry", title = "Improving hash join performance through prefetching", journal = j-TODS, volume = "32", number = "3", pages = "17:1--17:??", month = aug, year = "2007", CODEN = "ATDSD3", DOI = "http://doi.acm.org/10.1145/1272743.1272747", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jun 12 16:37:57 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; http://www.math.utah.edu/pub/tex/bib/hash.bib; tods.bib", abstract = "Hash join algorithms suffer from extensive CPU cache stalls. This article shows that the standard hash join algorithm for disk-oriented databases (i.e., GRACE) spends over 80\% of its user time stalled on CPU cache misses, and explores the use of CPU cache prefetching to improve its cache performance. Applying prefetching to hash joins is complicated by the data dependencies, multiple code paths, and inherent randomness of hashing. We present two techniques, group prefetching and software-pipelined prefetching, that overcome these complications. These schemes achieve 1.29--4.04X speedups for the join phase and 1.37--3.49X speedups for the partition phase over GRACE and simple prefetching approaches. Moreover, compared with previous cache-aware approaches (i.e., cache partitioning), the schemes are at least 36\% faster on large relations and do not require exclusive use of the CPU cache to be effective. Finally, comparing the elapsed real times when disk I/Os are in the picture, our cache prefetching schemes achieve 1.12--1.84X speedups for the join phase and 1.06--1.60X speedups for the partition phase over the GRACE hash join algorithm.", acknowledgement = ack-nhfb, articleno = "17", keywords = "CPU cache performance; CPU cache prefetching; group prefetching; Hash join; software-pipelined prefetching", } @Article{Chen:2007:TPB, author = "Hsiang-Yang Chen and Ting-Wei Hou and Chun-Liang Lin", title = "Tamper-proofing basis path by using oblivious hashing on {Java}", journal = j-SIGPLAN, volume = "42", number = "2", pages = "9--16", month = feb, year = "2007", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1241761.1241762", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:55:01 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; sigplan2000.bib", abstract = "Java programs are often downloaded (distributed) to unknown environments, so protect Java code from malicious modification is an important issue. This paper presents a tamper-proofing software technology on basis paths for stack-machine based languages, such as Java, by improving Oblivious Hashing. Our approach is based on a new dynamic stack-tracing approach which inserts hash instructions to monitor the top of the stack to check whether the program running has been tampered with or not. A user can choose one or more methods in a class to tamper-proof program. The protective codes are added to basic blocks at the bytecode level. We developed a new approach to protect constants and variables by alternative hashing functions. The overhead is proportional to the number of Load and Push instructions to be protected.", acknowledgement = ack-nhfb, keywords = "basis paths; Java; oblivious hashing; tamper-proofing", } @Article{Durand:2007:SPP, author = "Arnaud Durand and Clemens Lautemann and Malika More", title = "A simple proof of the polylog counting ability of first-order logic: guest column", journal = j-SIGACT, volume = "38", number = "4", pages = "40--45", month = dec, year = "2007", CODEN = "SIGNDM", DOI = "http://dx.doi.org/10.1145/1345189.1345199", ISSN = "0163-5700 (print), 1943-5827 (electronic)", ISSN-L = "0163-5700", bibdate = "Wed Mar 21 18:30:29 MDT 2012", bibsource = "DBLP; ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib; http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#DurandLM07; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/sigact.bib", URL = "http://doi.acm.org/10.1145/1345189.1345199", abstract = "The counting ability of weak formalisms (e.g., determining the number of 1's in a string of length $N$) is of interest as a measure of their expressive power, and also resorts to complexity-theoretic motivations: the more we can count the closer we get to real computing power. The question was investigated in several papers in complexity theory and in weak arithmetic around 1985. In each case, the considered formalism (AC$^0$-circuits, first-order logic, $\Delta_0$) was shown to be able to count up to a polylogarithmic number. An essential part of the proofs is the construction of a 1--1 mapping from a small subset of $\{0, \ldots{}, N - 1\}$ into a small initial segment. In each case the expressibility of this mapping depends on some strong argument (group-theoretic device or prime number theorem) or intricate construction. We present a coding device based on a collision-free hashing technique, leading to a completely elementary proof.", acknowledgement = ack-nhfb, fjournal = "ACM SIGACT News", } @Article{Ghodsi:2007:ESB, author = "Ali Ghodsi and Seif Haridi and Hakim Weatherspoon", title = "Exploiting the synergy between gossiping and structured overlays", journal = j-OPER-SYS-REV, volume = "41", number = "5", pages = "61--66", month = oct, year = "2007", CODEN = "OSRED8", DOI = "http://doi.acm.org/10.1145/1317379.1317389", ISSN = "0163-5980", bibdate = "Fri Jun 20 17:18:11 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes.", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", keywords = "distributed hash tables; gossip-based algorithms; structured overlay networks", } @InProceedings{Haitner:2007:SHC, author = "Iftach Haitner and Omer Reingold", title = "Statistically-hiding commitment from any one-way function", crossref = "ACM:2007:SPA", pages = "1--10", year = "2007", DOI = "http://doi.acm.org/10.1145/1250790.1250792", bibdate = "Fri Jun 20 18:28:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We give a construction of statistically-hiding commitment schemes (ones where the hiding property holds information theoretically), based on the minimal cryptographic assumption that one-way functions exist. Our construction employs two-phase commitment schemes, recently constructed by Nguyen, Ong and Vadhan (FOCS '06), and universal one-way hash functions introduced and constructed by Naor and Yung (STOC '89) and Rompel (STOC '90).", acknowledgement = ack-nhfb, keywords = "cryptography; one-way functions; statistically hiding and computationally binding commitment", } @Article{Hao:2007:BHA, author = "Fang Hao and Murali Kodialam and T. V. Lakshman", title = "Building high accuracy {Bloom} filters using partitioned hashing", journal = j-SIGMETRICS, volume = "35", number = "1", pages = "277--288", month = jun, year = "2007", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1254882.1254916", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:42:48 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; sigmetrics.bib", abstract = "The growing importance of operations such as packet-content inspection, packet classification based on non-IP headers, maintaining flow-state, etc. has led to increased interest in the networking applications of Bloom filters. This is because Bloom filters provide a relatively easy method for hardware implementation of set-membership queries. However, the tradeoff is that Bloom filters only provide a probabilistic test and membership queries can result in false positives. Ideally, we would like this false positive probability to be very low. The main contribution of this paper is a method for significantly reducing this false positive probability in comparison to existing schemes. This is done by developing a {\em partitioned hashing\/} method which results in a choice of hash functions that set far fewer bits in the Bloom filter bit vector than would be the case otherwise. This lower fill factor of the bit vector translates to a much lower false positive probability. We show experimentally that this improved choice can result in as much as a ten-fold increase in accuracy over standard Bloom filters. We also show that the scheme performs much better than other proposed schemes for improving Bloom filters.", acknowledgement = ack-nhfb, keywords = "bloom filter; hashing", } @Article{Hendricks:2007:LOB, author = "James Hendricks and Gregory R. Ganger and Michael K. Reiter", title = "Low-overhead {Byzantine} fault-tolerant storage", journal = j-OPER-SYS-REV, volume = "41", number = "6", pages = "73--86", month = dec, year = "2007", CODEN = "OSRED8", DOI = "http://doi.acm.org/10.1145/1294261.1294269", ISSN = "0163-5980", bibdate = "Fri Jun 20 17:18:34 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper presents an erasure-coded Byzantine fault-tolerant block storage protocol that is nearly as efficient as protocols that tolerate only crashes. Previous Byzantine fault-tolerant block storage protocols have either relied upon replication, which is inefficient for large blocks of data when tolerating multiple faults, or a combination of additional servers, extra computation, and versioned storage. To avoid these expensive techniques, our protocol employs novel mechanisms to optimize for the common case when faults and concurrency are rare. In the common case, a write operation completes in two rounds of communication and a read completes in one round. The protocol requires a short checksum comprised of cryptographic hashes and homomorphic fingerprints. It achieves throughput within 10\% of the crash-tolerant protocol for writes and reads in failure-free runs when configured to tolerate up to 6 faulty servers and any number of faulty clients.", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", keywords = "Byzantine fault-tolerant storage", } @Article{Herbert:2007:WHP, author = "Andrew Herbert", title = "What happened to {Pastry}", journal = j-OPER-SYS-REV, volume = "41", number = "2", pages = "10--16", month = apr, year = "2007", CODEN = "OSRED8", DOI = "http://doi.acm.org/10.1145/1243418.1243421", ISSN = "0163-5980", bibdate = "Fri Jun 20 17:16:02 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper describes how Microsoft Research goes about the process of technology transfer, using the experience of transferring the MS Pastry Distributed Hash Table and its applications as an example.", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", keywords = "technology transfer", } @Article{Holt:2007:PMA, author = "John D. Holt and Soon M. Chung", title = "Parallel mining of association rules from text databases", journal = j-J-SUPERCOMPUTING, volume = "39", number = "3", pages = "273--299", month = mar, year = "2007", CODEN = "JOSUED", DOI = "http://dx.doi.org/10.1007/s11227-006-0008-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 9 17:32:30 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=39&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=39&issue=3&spage=273", acknowledgement = ack-nhfb, keywords = "Cluster computing; Inverted hashing and pruning; Multipass; Parallel association rule mining; Scalability; Text retrieval", } @Article{King:2007:CRP, author = "Valerie King and Scott Lewis and Jared Saia and Maxwell Young", title = "Choosing a Random Peer in Chord", journal = j-ALGORITHMICA, volume = "49", number = "2", pages = "147--169", month = oct, year = "2007", CODEN = "ALGOEJ", DOI = "http://dx.doi.org/10.1007/s00453-007-9029-2", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", bibdate = "Wed Jul 9 22:25:04 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=49&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=49&issue=2&spage=147", acknowledgement = ack-nhfb, keywords = "Attack-resistance; Chord; Data collection; Distributed algorithms; Distributed Hash table; Peer-to-peer; Randomized algorithms", } @Article{Laccetti:2007:BFA, author = "G. Laccetti and G. Schmid", title = "Brute force attacks on hash functions", journal = j-J-DISCR-MATH-SCI-CRYPTO, volume = "10", number = "3", pages = "439--460", month = jun, year = "2007", CODEN = "????", ISSN = "0972-0529", ISSN-L = "0972-0529", MRclass = "94A60", MRnumber = "2347281 (2008g:94033)", bibdate = "Thu Feb 16 09:25:23 MST 2012", bibsource = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072; http://www.iospress.nl/journal/journal-of-discrete-mathematical-sciences-and-cryptography/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib", URL = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072&volume=10&issue_id=03", acknowledgement = ack-nhfb, ajournal = "J. Discr. Math. Sci. Crypto.", fjournal = "Journal of Discrete Mathematical Sciences and Cryptography", } @Article{Lu:2007:MPC, author = "Haibin Lu and Sartaj Sahni", title = "{$O(\log W)$} multidimensional packet classification", journal = j-IEEE-TRANS-NETWORKING, volume = "15", number = "2", pages = "462--472", month = apr, year = "2007", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:54:43 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We use a collection of hash tables to represent a multidimensional packet classification table. These hash tables are derived from a trie-representation of the multidimensional classifier. The height of this trie is $O(W)$, where $W$ is the sum of the maximum possible length, in bits, of each of the fields of a filter. The leaves at level $i$ of the trie together with markers for some of the leaves at levels $j$ such that $j > i$ are stored in a hash table $H_i$. The placement of markers is such that a binary search of the $H_i$'s successfully locates the highest-priority filter that matches any given packet. The number of hash tables equals the trie height, $O(W)$. Hence, a packet may be classified by performing $O(\log W)$ hash-table lookups. So the expected lookup-complexity of our data structure for multidimensional packet classification is $O(\log W)$. Our proposed scheme affords a memory advantage over the $O(\log W)$ 1-D scheme of Waldvogel et al. For multidimensional packet classification, our proposed scheme provides both a time and memory advantage over the extended grid-of-tries scheme of Baboescu et al.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "binary search on levels; expected complexity; multidimensional packet classification", } @Article{Mazeika:2007:ESA, author = "Arturas Mazeika and Michael H. B{\"o}hlen and Nick Koudas and Divesh Srivastava", title = "Estimating the selectivity of approximate string queries", journal = j-TODS, volume = "32", number = "2", pages = "12:1--12:??", month = jun, year = "2007", CODEN = "ATDSD3", DOI = "http://doi.acm.org/10.1145/1242524.1242529", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Thu Jun 12 16:37:09 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Approximate queries on string data are important due to the prevalence of such data in databases and various conventions and errors in string data. We present the VSol estimator, a novel technique for estimating the selectivity of approximate string queries. The VSol estimator is based on inverse strings and makes the performance of the selectivity estimator independent of the number of strings. To get inverse strings we decompose all database strings into overlapping substrings of length q (q-grams) and then associate each q-gram with its inverse string: the IDs of all strings that contain the q-gram. We use signatures to compress inverse strings, and clustering to group similar signatures.\par We study our technique analytically and experimentally. The space complexity of our estimator only depends on the number of neighborhoods in the database and the desired estimation error. The time to estimate the selectivity is independent of the number of database strings and linear with respect to the length of query string. We give a detailed empirical performance evaluation of our solution for synthetic and real-world datasets. We show that VSol is effective for large skewed databases of short strings.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Database Systems", keywords = "Inverse strings; min-wise hash signatures; q-grams", } @Article{Naor:2007:NAP, author = "Moni Naor and Udi Wieder", title = "Novel architectures for {P2P} applications: {The} continuous-discrete approach", journal = j-TALG, volume = "3", number = "3", pages = "34:1--34:??", month = aug, year = "2007", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1273340.1273350", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Mon Jun 16 11:55:11 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of this approach by suggesting two new P2P architectures and various algorithms for them. The first serves as a DHT (distributed hash table) and the other is a dynamic expander network. The DHT network, which we call Distance Halving, allows logarithmic routing and load while preserving constant degrees. It offers an optimal tradeoff between degree and path length in the sense that degree d guarantees a path length of $O(\log d n)$. Another advantage over previous constructions is its relative simplicity. A major new contribution of this construction is a dynamic caching technique that maintains low load and storage, even under the occurrence of hot spots. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against random Byzantine faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worse parameters. Therefore, we expect that more distributed data structures could be designed and implemented in a dynamic environment.", acknowledgement = ack-nhfb, articleno = "34", keywords = "Peer-to-peer networks; routing", } @InProceedings{Pagh:2007:LPC, author = "Anna Pagh and Rasmus Pagh and Milan Ruzic", title = "Linear probing with constant independence", crossref = "ACM:2007:SPA", pages = "318--327", year = "2007", DOI = "http://doi.acm.org/10.1145/1250790.1250839", bibdate = "Fri Jun 20 18:28:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analyses rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free access to a truly random hash function. Already Carter and Wegman, in their seminal paper on universal hashing, raised the question of extending their analysis to linear probing.\par However, we show in this paper that linear probing using a pairwise independent family may have expected logarithmic cost per operation. On the positive side, we show that 5-wise independence is enough to ensure constant expected time per operation. This resolves the question of finding a space and time efficient hash function that provably ensures good performance for linear probing.", acknowledgement = ack-nhfb, keywords = "hashing; linear probing", } @Article{Raman:2007:SID, author = "Rajeev Raman and Venkatesh Raman and Srinivasa Rao Satti", title = "Succinct indexable dictionaries with applications to encoding $k$-ary trees, prefix sums and multisets", journal = j-TALG, volume = "3", number = "4", pages = "43:1--43:??", month = nov, year = "2007", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1290672.1290680", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Mon Jun 16 11:55:31 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We consider the indexable dictionary problem, which consists of storing a set $S \subseteq \{0, \ldots , m - 1\}$ for some integer $m$ while supporting the operations of $\rank(x)$, which returns the number of elements in $S$ that are less than $x$ if $x \in S$, and $-1$ otherwise; and $\select(i)$, which returns the $i$th smallest element in $S$. We give a data structure that supports both operations in $O(1)$ time on the RAM model and requires $B(n,m) + o(n) + O(\lg \lg m)$ bits to store a set of size $n$, where $B(n, m) = \lfloor \lg (m / n)\rfloor$ is the minimum number of bits required to store any $n$-element subset from a universe of size $m$. Previous dictionaries taking this space only supported (yes/no) membership queries in $O (1)$ time. In the cell probe model we can remove the $O (\lg \lg m)$ additive term in the space bound, answering a question raised by Fich and Miltersen [1995] and Pagh [2001].\par We present extensions and applications of our indexable dictionary data structure, including:\par --- an information-theoretically optimal representation of a $k$-ary cardinal tree that supports standard operations in constant time;\par --- a representation of a multiset of size $n$ from $\{0, \ldots , m - 1\}$ in $B(n, m + n) + o(n)$ bits that supports (appropriate generalizations of) rank and select operations in constant time; and $+ O(\lg \lg m)$\par --- a representation of a sequence of $n$ nonnegative integers summing up to $m$ in $B(n, m + n) + o(n)$ bits that supports prefix sum queries in constant time.", acknowledgement = ack-nhfb, articleno = "43", keywords = "Dictionaries; multisets; perfect hashing; prefix sums; sets; succinct data structures; tries", } @Article{Ramaswamy:2007:HSP, author = "Ramaswamy Ramaswamy and Tilman Wolf", title = "High-speed prefix-preserving {IP} address anonymization for passive measurement systems", journal = j-IEEE-TRANS-NETWORKING, volume = "15", number = "1", pages = "26--39", month = feb, year = "2007", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:53:54 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Passive network measurement and packet header trace collection are vital tools for network operation and research. To protect a user's privacy, it is necessary to anonymize header fields, particularly IP addresses. To preserve the correlation between IP addresses, prefix-preserving anonymization has been proposed. The limitations of this approach for a high-performance measurement system are the need for complex cryptographic computations and potentially large amounts of memory. We propose a new prefix-preserving anonymization algorithm, top-hash subtree-replicated anonymization (TSA), that features three novel improvements: precomputation, replicated subtrees, and top hashing. TSA makes anonymization practical to be implemented on network processors or dedicated logic at Gigabit rates. The performance of TSA is compared with a conventional cryptography based prefix-preserving anonymization scheme which utilizes caching. TSA performs better as it requires no online cryptographic computation and a small number of memory lookups per packet. Our analytic comparison of the susceptibility to attacks between conventional anonymization and our approach shows that TSA performs better for small scale attacks and comparably for medium scale attacks. The processing cost for TSA is reduced by two orders of magnitude and the memory requirements are a few Megabytes. The ability to tune the memory requirements and security level makes TSA ideal for a broad range of network systems with different capabilities.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "anonymization; network measurement; privacy", } @Article{Roman:2007:SCP, author = "Rodrigo Roman and Cristina Alcaraz and Javier Lopez", title = "A survey of cryptographic primitives and implementations for hardware-constrained sensor network nodes", journal = "Mobile Networks and Applications", volume = "12", number = "4", pages = "231--244", month = aug, year = "2007", CODEN = "????", DOI = "http://dx.doi.org/10.1007/s11036-007-0024-2", ISSN = "1383-469X", bibdate = "Thu Apr 21 10:25:26 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In a wireless sensor network environment, a sensor node is extremely constrained in terms of hardware due to factors such as maximizing lifetime and minimizing physical size and overall cost. Nevertheless, these nodes must be able to run cryptographic operations based on primitives such as hash functions, symmetric encryption and public key cryptography in order to allow the creation of secure services. Our objective in this paper is to survey how the existing research-based and commercial-based sensor nodes are suitable for this purpose, analyzing how the hardware can influence the provision of the primitives and how software implementations tackles the task of implementing instances of those primitives. As a result, it will be possible to evaluate the influence of provision of security in the protocols and applications\slash scenarios where sensors can be used.", acknowledgement = ack-nhfb, keywords = "cryptography, hardware, sensor networks", } @Article{Ronnblom:2007:HEA, author = "Johan R{\"o}nnblom", title = "High-error approximate dictionary search using estimate hash comparisons", journal = j-SPE, volume = "37", number = "10", pages = "1047--1059", month = aug, year = "2007", CODEN = "SPEXBL", DOI = "http://dx.doi.org/10.1002/spe.797", ISSN = "0038-0644 (print), 1097-024X (electronic)", bibdate = "Wed Oct 17 18:33:16 MDT 2007", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www3.interscience.wiley.com/journalfinder.html", abstract = "A method for finding all matches in a pre-processed dictionary for a query string $q$ and with at most $k$ differences is presented. A very fast constant-time estimate using hashes is presented. A tree structure is used to minimize the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99\% of the full comparisons for 40\% error rates and dictionaries of up to four million words. The tree is found to be efficient up to a 50\% error rate.", acknowledgement = ack-nhfb, onlinedate = "19 Dec 2006", } @Article{Schweller:2007:RSE, author = "Robert Schweller and Zhichun Li and Yan Chen and Yan Gao and Ashish Gupta and Yin Zhang and Peter A. Dinda and Ming-Yang Kao and Gokhan Memik", title = "Reversible sketches: enabling monitoring and analysis over high-speed data streams", journal = j-IEEE-TRANS-NETWORKING, volume = "15", number = "5", pages = "1059--1072", month = oct, year = "2007", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:57:26 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive which can be extended to construct many aggregate queries. The recently proposed sketches are among the very few that can detect heavy changes online for high speed links, and thus support various aggregate queries in both temporal and spatial domains. However, it does not preserve the keys (e.g., source IP address) of flows, making it difficult to reconstruct the desired set of anomalous keys.\par To address this challenge, we propose the reversible sketch data structure along with reverse hashing algorithms to infer the keys of culprit flows. There are two phases. The first operates online, recording the packet stream in a compact representation with negligible extra memory and few extra memory accesses. Our prototype single FPGA board implementation can achieve a throughput of over 16 Gb/s for 40-byte packet streams (the worst case). The second phase identifies heavy changes and their keys from the representation in nearly real time. We evaluate our scheme using traces from large edge routers with OC-12 or higher links. Both the analytical and experimental results show that we are able to achieve online traffic monitoring and accurate change/intrusion detection over massive data streams on high speed links, all in a manner that scales to large key space size. To the best of our knowledge, our system is the first to achieve these properties simultaneously.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", } @Article{Shankar:2007:DAI, author = "Ajeet Shankar and Rastislav Bod{\'\i}k", title = "{DITTO}: automatic incrementalization of data structure invariant checks (in {Java)}", journal = j-SIGPLAN, volume = "42", number = "6", pages = "310--319", month = jun, year = "2007", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1250734.1250770", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:55:30 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present DITTO, an automatic incrementalizer for dynamic, side-effect-free data structure invariant checks. Incrementalization speeds up the execution of a check by reusing its previous executions, checking the invariant anew only the changed parts of the data structure. DITTO exploits properties specific to the domain of invariant checks to automate and simplify the process without restricting what mutations the program can perform. Our incrementalizer works for modern imperative languages such as Java and C\#. It can incrementalize,for example, verification of red-black tree properties and the consistency of the hash code in a hash table bucket. Our source-to-source implementation for Java is automatic, portable, and efficient. DITTO provides speedups on data structures with as few as 100 elements; on larger data structures, its speedups are characteristic of non-automatic incrementalizers: roughly 5-fold at 5,000 elements,and growing linearly with data structure size.", acknowledgement = ack-nhfb, keywords = "automatic; data structure invariants; dynamic optimization; incrementalization; optimistic memoization; program analysis", } @Article{Tseng:2007:DHS, author = "Kuo-Kun Tseng and Ying-Dar Lin and Tsern-Huei Lee and Yuan-Cheng Lai", title = "Deterministic high-speed root-hashing automaton matching coprocessor for embedded network processor", journal = j-COMP-ARCH-NEWS, volume = "35", number = "3", pages = "36--43", month = jun, year = "2007", CODEN = "CANED2", DOI = "http://doi.acm.org/10.1145/1294313.1294314", ISSN = "0163-5964 (print), 1943-5851 (electronic)", bibdate = "Tue Jun 17 11:48:27 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; sigarch.bib", abstract = "While string matching plays an important role in deep packet inspection applications, its software algorithms are insufficient to meet the demands of high-speed performance. Accordingly, we were motivated to propose fast and deterministic performance root-hashing automaton matching (RHAM) coprocessor for embedded network processor. Although automaton algorithms are robust with deterministic matching time, there is still plenty of room for improvement of their average-case performance. The proposed RHAM employs novel root-hashing technique to accelerate automaton matching. In our experiment, RHAM is implemented in a prevalent automaton algorithm, Aho--Corasick (AC) which is often used in many packet inspection applications. Compared to the original AC, RHAM only requires extra vector size in 48 Kbytes for root-hashing, and has about 900\% and 420\% outperformance for 20,000 URLs and 10,000 virus patterns respectively. Implementation of RHAM FPGA can perform at the rate of 12.6 Gbps with the pattern amount in 34,215 bytes. This is superior to all previous matching hardware in terms of throughput and pattern set.", acknowledgement = ack-nhfb, keywords = "coprocessor; finite automaton; hashing; packet inspection; string matching", } @Article{Vaswani:2007:PPP, author = "Kapil Vaswani and Aditya V. Nori and Trishul M. Chilimbi", title = "Preferential path profiling: compactly numbering interesting paths", journal = j-SIGPLAN, volume = "42", number = "1", pages = "351--362", month = jan, year = "2007", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1190216.1190268", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:53:14 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This has limited their use in practice despite demonstrations of their advantages over edge profiles for a wide variety of applications. We present a new algorithm called preferential path profiling (PPP), that reduces the overhead of path profiling. PPP leverages the observation that most consumers of path profiles are only interested in a subset of all program paths. PPP achieves low overhead by separating interesting paths from other paths and assigning a set of unique and compact numbers to these interesting paths. We draw a parallel between arithmetic coding and path numbering, and use this connection to prove an optimality result for the compactness of path numbering produced by PPP. This compact path numbering enables our PPP implementation to record path information in an array instead of a hash table. Our experimental results indicate that PPP reduces the runtime overhead of profiling paths exercised by the largest (ref) inputs of the SPEC CPU2000 benchmarks from 50\% on average (maximum of 132\%) to 15\% on average (maximum of 26\%) as compared to a state-of-the-art path profiler.", acknowledgement = ack-nhfb, keywords = "arithmetic coding; dynamic analysis; preferential paths; profiling", } @Article{Wang:2007:BTS, author = "Chia-Wei Wang and Hung-Chang Hsiao and Wen-Hung Sun and Chung-Ta King and Ming-Tsung Sun", title = "Building a tuple space on structured peer-to-peer networks", journal = j-J-SUPERCOMPUTING, volume = "40", number = "3", pages = "213--227", month = jun, year = "2007", CODEN = "JOSUED", DOI = "http://dx.doi.org/10.1007/s11227-006-0026-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 9 17:32:31 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=40&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=40&issue=3&spage=213", acknowledgement = ack-nhfb, keywords = "Distributed hash table; Game; Peer-to-peer; Tuple space", } @Article{Wang:2007:LBP, author = "Xiaoming Wang and Dmitri Loguinov", title = "Load-balancing performance of consistent hashing: asymptotic analysis of random node join", journal = j-IEEE-TRANS-NETWORKING, volume = "15", number = "4", pages = "892--905", month = aug, year = "2007", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:56:37 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; ieeetransnetworking.bib", abstract = "Balancing of structured peer-to-peer graphs, including their zone sizes, has recently become an important topic of distributed hash table (DHT) research. To bring analytical understanding into the various peer-join mechanisms based on consistent hashing, we study how zone-balancing decisions made during the initial sampling of the peer space affect the resulting zone sizes and derive several asymptotic bounds for the maximum and minimum zone sizes that hold with high probability. Several of our results contradict those of prior work and shed new light on the theoretical performance limitations of consistent hashing. We use simulations to verify our models and compare the performance of the various methods using the example of recently proposed de Bruijn DHTs.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "asymptotic bounds; balls-into-bins; consistent hashing; load balancing; peer-to-peer (P2P)", } @Article{Wu:2007:ASO, author = "Di Wu and Ye Tian and Kam Wing Ng", title = "An analytical study on optimizing the lookup performance of distributed hash table systems under churn", journal = j-CCPE, volume = "19", number = "4", pages = "543--569", day = "25", month = mar, year = "2007", CODEN = "CCPEBO", DOI = "http://dx.doi.org/10.1002/cpe.1152", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:11 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; http://www.math.utah.edu/pub/tex/bib/ccpe.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, onlinedate = "9 Jan 2007", } @Article{Zhang:2007:BHR, author = "Zheng Zhang and Qiao Lian and Shiding Lin and Wei Chen and Yu Chen and Chao Jin", title = "{BitVault}: a highly reliable distributed data retention platform", journal = j-OPER-SYS-REV, volume = "41", number = "2", pages = "27--36", month = apr, year = "2007", CODEN = "OSRED8", DOI = "http://doi.acm.org/10.1145/1243418.1243423", ISSN = "0163-5980", bibdate = "Fri Jun 20 17:16:02 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "This paper summarizes our experience designing and implementing BitVault: a content-addressable retention platform for large volumes of reference data -- seldom-changing information that needs to be retained for a long time. BitVault uses `smart bricks' as the building block to lower the hardware cost. The challenges are to keep management costs low in a system that scales from one brick to tens of thousands, to ensure reliability, and to deliver a simple design. Our design incorporates peer-to-peer (P2P) technologies for self-managing and self-healing and uses massively parallel repair to reduce system vulnerability to data loss. The simplicity of the architecture relies on an eventually reliable membership service provided by a perfect one-hop distributed hash table (DHT). Its object-driven repair model yields last-replica recall guarantee independent of the failure scenario. So long as the last copy of a data object remains in the system, that data can be retrieved and its replication degree can be restored. A prototype has been implemented. Theoretical analysis, simulations and experiments have been conducted to validate the design of BitVault.", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", } @Article{Adams:2008:ENE, author = "Michael D. Adams and R. Kent Dybvig", title = "Efficient nondestructive equality checking for trees and graphs", journal = j-SIGPLAN, volume = "43", number = "9", pages = "179--188", month = sep, year = "2008", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1411203.1411230", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 23 17:31:25 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The Revised$^6$ Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equivalence or union-find algorithm, these algorithms usually require an additional pointer to be stored in each object, are not suitable for multithreaded code due to their destructive nature, and may be unacceptably slow for the small acyclic values that are the most likely inputs to the predicate.\par This paper presents a variant of the union-find algorithm for equal? that addresses these issues. It performs well on large and small, cyclic and acyclic inputs by interleaving a low-overhead algorithm that terminates only for acyclic inputs with a more general algorithm that handles cyclic inputs. The algorithm terminates for all inputs while never being more than a small factor slower than whichever of the acyclic or union-find algorithms would have been faster. Several intermediate algorithms are also presented, each of which might be suitable for use in a particular application, though only the final algorithm is suitable for use in a library procedure, like equal?, that must work acceptably well for all inputs.", acknowledgement = ack-nhfb, keywords = "dfa equivalence; eq hash tables; equality; scheme; union-find", } @Article{Andoni:2008:NOH, author = "Alexandr Andoni and Piotr Indyk", title = "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions", journal = j-CACM, volume = "51", number = "1", pages = "117--122", month = jan, year = "2008", CODEN = "CACMA2", DOI = "http://doi.acm.org/10.1145/1327452.1327494", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Mon Jun 16 18:34:57 MDT 2008", bibsource = "cacm2000.bib; http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.", acknowledgement = ack-nhfb, } @Article{Burr:2008:NHC, author = "William E. Burr", title = "A New Hash Competition", journal = j-IEEE-SEC-PRIV, volume = "6", number = "3", pages = "60--62", month = may # "\slash " # jun, year = "2008", CODEN = "????", DOI = "http://dx.doi.org/10.1109/MSP.2008.55", ISSN = "1540-7993 (print), 1558-4046 (electronic)", bibdate = "Thu Jul 3 12:03:38 MDT 2008", bibsource = "http://computer.org/security/sp2003/; http://www.math.utah.edu/pub/tex/bib/hash.bib; ieeesecpriv.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Chen:2008:IRS, author = "Guihai Chen and Tongqing Qiu and Fan Wu", title = "Insight into redundancy schemes in {DHTs}", journal = j-J-SUPERCOMPUTING, volume = "43", number = "2", pages = "183--198", month = feb, year = "2008", CODEN = "JOSUED", DOI = "http://dx.doi.org/10.1007/s11227-007-0126-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 9 17:32:33 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=43&issue=2; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=43&issue=2&spage=183", acknowledgement = ack-nhfb, keywords = "Distributed hash table; Erasure coding; Peer-to-peer; Redundancy; Replication", } @Article{Das:2008:DHS, author = "Saumitra M. Das and Himabindu Pucha and Y. Charlie Hu", title = "Distributed Hashing for Scalable Multicast in Wireless Ad Hoc Networks", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "19", number = "3", pages = "347--362", month = mar, year = "2008", CODEN = "ITDSEO", DOI = "http://dx.doi.org/10.1109/TPDS.2007.70731", ISSN = "1045-9219 (print), 1558-2183 (electronic)", bibdate = "Thu Jul 3 12:40:59 MDT 2008", bibsource = "http://www.computer.org/tpds/td2008/; http://www.math.utah.edu/pub/tex/bib/hash.bib; ieeetranspardistsys.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", } @Article{Dietzfelbinger:2008:DIB, author = "Martin Dietzfelbinger and Martin H{\"u}hne and Christoph Weidling", title = "A dictionary implementation based on dynamic perfect hashing", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "12", pages = "1.11:1--1.11:??", month = jun, year = "2008", CODEN = "????", DOI = "http://dx.doi.org/10.1145/1370596.1370602", ISSN = "1084-6654", bibdate = "Mon Oct 6 16:17:58 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; jea.bib", abstract = "We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is ``dynamic perfect hashing'' as described by Dietzfelbinger et al. ({\em SIAM J. Computing 23}, 1994, pp. 738--761), an extension of the storage scheme proposed by Fredman et al. ({\em J. ACM\/} 31, 1984, pp. 538--544). At the top level, a hash function is used to partition the keys to be stored into several sets. On the second level, there is a perfect hash function for each of these sets. This technique guarantees $O(1)$ worst-case time for lookup and expected $O(1)$ amortized time for insertion and deletion, while only linear space is required. We study the practical performance of dynamic perfect hashing and describe improvements of the basic scheme. The focus is on the choice of the hash function (both for integer and string keys), on the efficiency of rehashing, on the handling of small buckets, and on the space requirements of the implementation.", acknowledgement = ack-nhfb, articleno = "1.11", keywords = "data structures; dictionaries; dynamic hashing; hash functions; implementation", } @Article{Ducournau:2008:PHA, author = "Roland Ducournau", title = "Perfect hashing as an almost perfect subtype test", journal = j-TOPLAS, volume = "30", number = "6", pages = "33:1--33:56", month = oct, year = "2008", CODEN = "ATPSDT", DOI = "http://doi.acm.org/10.1145/1391956.1391960", ISSN = "0164-0925 (print), 1558-4593 (electronic)", bibdate = "Sat Nov 1 20:05:05 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/toplas/; http://www.math.utah.edu/pub/tex/bib/hash.bib; toplas.bib", abstract = "Subtype tests are an important issue in the implementation of object-oriented programming languages. Many techniques have been proposed, but none of them perfectly fulfills the five requirements that we have identified: constant-time, linear-space, multiple inheritance, dynamic loading and inlining. In this article, we propose a subtyping test implementation that involves a combination of usual hashtables and Cohen's display, which is a well-known technique for single inheritance hierarchies. This novel approach is based on {\em perfect hashing}, that is, an optimized and truly constant-time variant of hashing that applies to {\em immutable\/} hashtables. We show that the resulting technique closely meets all five requirements. Furthermore, in the framework of Java-like languages --- characterized by single inheritance of classes and multiple subtyping of interfaces --- perfect hashing also applies to method invocation when the receiver is typed by an interface. The proposed technique is compared to some alternatives, including the proposal by Palacz and Vitek [2003]. Time-efficiency is assessed at the cycle level in the framework of Driesen's pseudo-code and the linear-space criterion is validated by statistical simulation on benchmarks consisting of large-scale class hierarchies.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Programming Languages and Systems", keywords = "Casting; coloring; downcast; dynamic loading; interfaces; method tables; multiple inheritance; multiple subtyping; perfect hashing; single inheritance; subtype test; virtual function tables", } @InProceedings{Fortnow:2008:IIC, author = "Lance Fortnow and Rahul Santhanam", title = "Infeasibility of instance compression and succinct {PCPs} for {NP}", crossref = "ACM:2008:SPA", pages = "133--142", year = "2008", DOI = "http://doi.acm.org/10.1145/1374376.1374398", bibdate = "Fri Jun 20 18:31:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "The OR-SAT problem asks, given Boolean formulae $\Phi$_1, \ldots{}, $\Phi$_m$ each of size at most $n$, whether at least one of the $\Phi$_i$'s is satisfiable. We show that there is no reduction from OR-SAT to any set A where the length of the output is bounded by a polynomial in $n$, unless NP $\subseteq$ coNP/poly, and the Polynomial-Time Hierarchy collapses. This result settles an open problem proposed by Bodlaender et. al. [4] and Harnik and Naor [15] and has a number of implications. A number of parametric NP problems, including Satisfiability, Clique, Dominating Set and Integer Programming, are not instance compressible or polynomially kernelizable unless NP $\subseteq$ coNP/poly. Satisfiability does not have PCPs of size polynomial in the number of variables unless NP $\subseteq$ coNP/poly. An approach of Harnik and Naor to constructing collision-resistant hash functions from one-way functions is unlikely to be viable in its present form. (Buhrman-Hitchcock) There are no subexponential-size hard sets for NP unless NP is in co-NP/poly. We also study probabilistic variants of compression, and show various results about and connections between these variants. To this end, we introduce a new strong derandomization hypothesis, the Oracle Derandomization Hypothesis, and discuss how it relates to traditional derandomization assumptions.", acknowledgement = ack-nhfb, keywords = "cryptography; instance compression; parameterized complexity; polynomial hierarchy; succinct PCPs", } @Article{Garcia:2008:SCC, author = "Flavio D. Garcia and Peter van Rossum", title = "Sound and complete computational interpretation of symbolic hashes in the standard model", journal = j-THEOR-COMP-SCI, volume = "394", number = "1--2", pages = "112--133", day = "31", month = mar, year = "2008", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Mar 28 21:49:13 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/03043975", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", } @InProceedings{Gentry:2008:THL, author = "Craig Gentry and Chris Peikert and Vinod Vaikuntanathan", title = "Trapdoors for hard lattices and new cryptographic constructions", crossref = "ACM:2008:SPA", pages = "197--206", year = "2008", DOI = "http://doi.acm.org/10.1145/1374376.1374407", bibdate = "Fri Jun 20 18:31:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We show how to construct a variety of `trapdoor' cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the shortest nonzero vector to within certain polynomial factors). Our contributions include a new notion of trapdoor function with preimage sampling, simple and efficient `hash-and-sign' digital signature schemes, and identity-based encryption. A core technical component of our constructions is an efficient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a discrete Gaussian probability distribution whose standard deviation is essentially the length of the longest Gram--Schmidt vector of the basis. A crucial security property is that the output distribution of the algorithm is oblivious to the particular geometry of the given basis.", acknowledgement = ack-nhfb, keywords = "lattice-based cryptography; trapdoor functions", } @InProceedings{Gollapudi:2008:PTM, author = "Sreenivas Gollapudi and Rina Panigrahy", title = "The power of two min-hashes for similarity search among hierarchical data objects", crossref = "Lenzerini:2008:PTS", pages = "211--220", year = "2008", DOI = "http://doi.acm.org/10.1145/1376916.1376946", bibdate = "Fri Jun 20 14:17:29 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; pods.bib", abstract = "In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled trees denoting a set of elements at the leaves organized in a hierarchy. Such representations are richer alternatives to a set. For example, a document can be represented as a hierarchy of sets wherein chapters, sections, and paragraphs represent different levels in the hierarchy. Such a representation is richer than viewing the document simply as a set of words. We measure distance between trees using the best possible super-imposition that minimizes the number of mismatched leaf labels. Our distance measure is equivalent to an Earth Mover's Distance measure since the leaf-labeled trees of height one can be viewed as sets and can be recursively extended to trees of larger height by viewing them as set of sets. We compute sketches of arbitrary weighted trees and analyze them in the context of locality-sensitive hashing (LSH) where the probability of two sketches matching is high when two trees are similar and low when the two trees are far under the given distance measure. Specifically, we compute sketches of such trees by propagating min-hash computations up the tree. Furthermore, we show that propagating one min-hash results in poor sketch properties while propagating two min-hashes results in good sketches.", acknowledgement = ack-nhfb, keywords = "earth movers distance; locality sensitive hashing; similarity", } @Article{Gong:2008:SIA, author = "Zheng Gong and Xuejia Lai and Kefei Chen", title = "A synthetic indifferentiability analysis of some block-cipher-based hash functions", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "48", number = "3", pages = "293--305", month = sep, year = "2008", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-008-9208-4", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "68W40; 68Q25", bibdate = "Wed Jul 9 09:37:25 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=48&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=48&issue=3&spage=293", acknowledgement = ack-nhfb, keywords = "Block-cipher-based hash function; Indifferentiability; Provable security", } @Article{Hadjieleftheriou:2008:HSS, author = "Marios Hadjieleftheriou and Xiaohui Yu and Nick Koudas and Divesh Srivastava", title = "Hashed samples: selectivity estimators for set similarity selection queries", journal = j-PROC-VLDB-ENDOWMENT, volume = "1", number = "1", pages = "201--212", month = aug, year = "2008", CODEN = "????", DOI = "http://dx.doi.org/10.1145/1453856.1453883", ISSN = "2150-8097", bibdate = "Fri May 13 14:54:36 MDT 2011", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", } @InProceedings{Ishai:2008:CCC, author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky and Amit Sahai", title = "Cryptography with constant computational overhead", crossref = "ACM:2008:SPA", pages = "433--442", year = "2008", DOI = "http://doi.acm.org/10.1145/1374376.1374438", bibdate = "Fri Jun 20 18:31:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Current constructions of cryptographic primitives typically involve a large multiplicative computational overhead that grows with the desired level of security. We explore the possibility of implementing basic cryptographic primitives, such as encryption, authentication, signatures, and secure two-party computation, while incurring only a constant computational overhead compared to insecure implementations of the same tasks. Here we make the usual security requirement that the advantage of any polynomial-time attacker must be negligible in the input length.\par We obtain affirmative answers to this question for most central cryptographic primitives under plausible, albeit sometimes nonstandard, intractability assumptions. We start by showing that pairwise-independent hash functions can be computed by linear-size circuits, disproving a conjecture of Mansour, Nisan, and Tiwari (STOC 1990). This construction does not rely on any unproven assumptions and is of independent interest. Our hash functions can be used to construct message authentication schemes with constant overhead from any one-way function. Under an intractability assumption that generalizes a previous assumption of Alekhnovich (FOCS 2003), we get (public and private key) encryption schemes with constant overhead. Using an exponentially strong version of the previous assumption, we get signature schemes of similar complexity. Assuming the existence of pseudorandom generators in NC $z$ with polynomial stretch together with the existence of an (arbitrary) oblivious transfer protocol, we get similar results for the seemingly very complex task of secure two-party computation. More concretely, we get general protocols for secure two-party computation in the semi-honest model in which the two parties can be implemented by circuits whose size is a constant multiple of the size $s$ of the circuit to be evaluated. In the malicious model, we get protocols whose communication complexity is a constant multiple of $s$ and whose computational complexity is slightly super-linear in $s$. For natural relaxations of security in the malicious model that are still meaningful in practice, we can also keep the computational complexity linear in $s$. These results extend to the case of a constant number of parties, where an arbitrary subset of the parties can be corrupted.\par Our protocols rely on non-black-box techniques, and suggest the intriguing possibility that the ultimate efficiency in this area of cryptography can be obtained via such techniques.", acknowledgement = ack-nhfb, keywords = "constant computational overhead; cryptography; universal hashing", } @Article{Janson:2008:IDH, author = "Svante Janson", title = "Individual Displacements in Hashing with Coalesced Chains", journal = j-COMBIN-PROBAB-COMPUT, volume = "17", number = "6", pages = "799--814", month = "????", year = "2008", CODEN = "CPCOFG", DOI = "http://dx.doi.org/10.1017/S0963548308009395", ISSN = "0963-5483 (print), 1469-2163 (electronic)", ISSN-L = "0963-5483", bibdate = "Thu Sep 29 08:04:35 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, ajournal = "Combin. Probab. Comput.", fjournal = "Combinatorics, Probability and Computing", onlinedate = "06 October 2008", } @Article{Jensen:2008:OEM, author = "Morten Skaarup Jensen and Rasmus Pagh", title = "Optimality in External Memory Hashing", journal = j-ALGORITHMICA, volume = "52", number = "3", pages = "403--411", month = nov, year = "2008", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", bibdate = "Sat Sep 11 10:17:03 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=52&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=52&issue=3&spage=403", acknowledgement = ack-nhfb, } @Article{Kencl:2008:ALS, author = "Lukas Kencl and Jean-Yves Le Boudec", title = "Adaptive load sharing for network processors", journal = j-IEEE-TRANS-NETWORKING, volume = "16", number = "2", pages = "293--306", month = apr, year = "2008", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 10:00:46 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming traffic is scheduled to multiple processors based on a deterministic mapping. The mapping formula is derived from the robust hash routing (also known as the highest random weight--HRW) scheme, introduced in K. W. Ross, IEEE Network, 11(6), 1997, and D. G. Thaler et al., IEEE Trans. Networking, 6(1), 1998. No state information on individual flow mapping has to be stored, but for each packet, a mapping function is computed over an identifier vector, a predefined set of fields in the packet. An adaptive extension to the HRW scheme is provided to cope with biased traffic patterns. We prove that our adaptation possesses the minimal disruption property with respect to the mapping and exploit that property to minimize the probability of flow reordering. Simulation results indicate that the scheme achieves significant improvements in processor utilization. A higher number of router interfaces can thus be supported with the same amount of processing power.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "computer networks; feedback control; load balancing; load sharing; packet processing; router architecture", } @Article{Kirsch:2008:SSH, author = "Adam Kirsch and Michael Mitzenmacher", title = "Simple summaries for hashing with choices", journal = j-IEEE-TRANS-NETWORKING, volume = "16", number = "1", pages = "218--231", month = feb, year = "2008", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Thu Jun 19 09:59:54 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib; ieeetransnetworking.bib", abstract = "In a multiple-choice hashing scheme, each item is stored in one of $\geq 2$ possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in the maximum load of the buckets. However, a lookup may now require examining each of the $d$ locations. For applications where this cost is undesirable, Song et al. propose keeping a summary that allows one to determine which of the $d$ locations is appropriate for each item, where the summary may allow false positives for items not in hash table. We propose alternative, simple constructions of such summaries that use less space for both the summary and the underlying hash table. Moreover, our constructions are easily analyzable and tunable.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "hash tables; router architecture; table lookup", } @Article{Korf:2008:LTD, author = "Richard E. Korf", title = "Linear-time disk-based implicit graph search", journal = j-J-ACM, volume = "55", number = "6", pages = "26:1--26:40", month = dec, year = "2008", CODEN = "JACOAH", DOI = "http://doi.acm.org/10.1145/1455248.1455250", ISSN = "0004-5411", bibdate = "Tue Dec 23 12:10:55 MST 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Many search algorithms are limited by the amount of memory available. Magnetic disk storage is over two orders of magnitude cheaper than semiconductor memory, and individual disks can hold up to a terabyte. We augment memory with magnetic disks to perform brute-force and heuristic searches that are orders of magnitude larger than any previous such searches. The main difficulty is detecting duplicate nodes, which is normally done with a hash table. Due to long disk latencies, however, randomly accessed hash tables are infeasible on disk, and are replaced by a mechanism we call delayed duplicate detection. In contrast to previous work, we perform delayed duplicate detection without sorting, which runs in time linear in the number of nodes in practice. Using this technique, we performed the first complete breadth-first searches of the 2 \times 7, 3 \times 5, 4 \× 4, and 2 \times 8 sliding-tile Puzzles, verifying the radius of the 4 \times 4 puzzle and determining the radius of the others. We also performed the first complete breadth-first searches of the four-peg Towers of Hanoi problem with up to 22 discs, discovering a surprising anomaly regarding the radii of these problems. In addition, we performed the first heuristic searches of the four-peg Towers of Hanoi problem with up to 31 discs, verifying a conjectured optimal solution length to these problems. We also performed partial breadth-first searches of Rubik's Cube to depth ten in the face-turn metric, and depth eleven in the quarter-turn metric, confirming previous results.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "Journal of the Association for Computing Machinery", keywords = "External memory; magnetic disk storage; permutation encodings; Rubik's Cube; sliding-tile puzzles; Towers of Hanoi", } @Article{Liu:2008:GBK, author = "Donggang Liu and Peng Ning and Wenliang Du", title = "Group-based key predistribution for wireless sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "11:1--11:??", month = mar, year = "2008", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1340771.1340777", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected locations and discovered locations to help the predistribution of the keying materials. However, in many cases, it is very difficult to deploy sensor nodes at their expected locations or guarantee the correct location discovery at sensor nodes in hostile environments. In this article, a group-based deployment model is developed to improve key predistribution. In this model, sensor nodes are only required to be deployed in groups. The critical observation in the article is that the sensor nodes in the same group are usually close to each other after deployment. This deployment model is practical; it greatly simplifies the deployment of sensor nodes, while still providing an opportunity to improve key predistribution. Specifically, the article presents a novel framework for improving key predistribution using the group-based deployment knowledge. This framework does not require the knowledge of the sensors' expected or discovered locations and is thus suitable for applications where it is difficult to deploy the sensor nodes at their expected locations or correctly estimate the sensors' locations after deployment. To seek practical key predistribution schemes, the article presents two efficient instantiations of this framework, a hash key-based scheme and a polynomial-based scheme. The evaluation shows that these two schemes are efficient and effective for pairwise key establishment in sensor networks; they can achieve much better performance than the previous key predistribution schemes when the sensor nodes are deployed in groups.", acknowledgement = ack-nhfb, articleno = "11", keywords = "group-based deployment; key predistribution; pairwise key establishment; security; sensor networks", } @Article{Lu:2008:CBN, author = "Yi Lu and Andrea Montanari and Balaji Prabhakar and Sarang Dharmapurikar and Abdul Kabbani", title = "Counter braids: a novel counter architecture for per-flow measurement", journal = j-SIGMETRICS, volume = "36", number = "1", pages = "121--132", month = jun, year = "2008", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1375457.1375472", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:43:29 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g., 40 Gbps). A naive algorithm needs an infeasible amount of SRAM to store both the counters and a flow-to-counter association rule, so that arriving packets can update corresponding counters at link speed. This has made accurate per-flow measurement complex and expensive, and motivated approximate methods that detect and measure only the large flows.\par This paper revisits the problem of accurate per-flow measurement. We present a counter architecture, called Counter Braids, inspired by sparse random graph codes. In a nutshell, Counter Braids `compresses while counting'. It solves the central problems (counter space and flow-to-counter association) of per-flow measurement by `braiding' a hierarchy of counters with random graphs. Braiding results in drastic space reduction by sharing counters among flows; and using random graphs generated on-the-fly with hash functions avoids the storage of flow-to-counter association.\par The Counter Braids architecture is optimal (albeit with a complex decoder) as it achieves the maximum compression rate asymptotically. For implementation, we present a low-complexity message passing decoding algorithm, which can recover flow sizes with essentially zero error. Evaluation on Internet traces demonstrates that almost all flow sizes are recovered exactly with only a few bits of counter space per flow.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", keywords = "message passing algorithms; network measurement; statistic counters", } @Article{Martirosyan:2008:ECP, author = "Sosina Martirosyan and Tran van Trung", title = "Explicit constructions for perfect hash families", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "46", number = "1", pages = "97--112", month = jan, year = "2008", CODEN = "DCCREC", DOI = "http://dx.doi.org/10.1007/s10623-007-9138-6", ISSN = "0925-1022 (print), 1573-7586 (electronic)", ISSN-L = "0925-1022", MRclass = "05B05", bibdate = "Wed Jul 9 09:36:06 MDT 2008", bibsource = "designscodescryptogr.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=46&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=46&issue=1&spage=97", acknowledgement = ack-nhfb, keywords = "Combinatorial method; Explicit construction; Perfect hash family", } @Article{Mathew:2008:JBH, author = "S. Mathew and K. P. Jacob", title = "{JERIM-320}: a 320-bit hash function with dual applications --- a statistical analysis", journal = j-J-DISCR-MATH-SCI-CRYPTO, volume = "11", number = "4", pages = "471--482", month = aug, year = "2008", CODEN = "????", ISSN = "0972-0529", ISSN-L = "0972-0529", bibdate = "Thu Feb 16 09:25:23 MST 2012", bibsource = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072; http://www.iospress.nl/journal/journal-of-discrete-mathematical-sciences-and-cryptography/; http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib", URL = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072&volume=11&issue_id=04", acknowledgement = ack-nhfb, ajournal = "J. Discr. Math. Sci. Crypto.", fjournal = "Journal of Discrete Mathematical Sciences and Cryptography", } @Article{Motwani:2008:LBL, author = "Rajeev Motwani and Assaf Naor and Rina Panigrahy", title = "Lower Bounds on Locality Sensitive Hashing", journal = j-SIAM-J-DISCR-MATH, volume = "21", number = "4", pages = "930--935", month = "????", year = "2008", CODEN = "SJDMEC", DOI = "http://dx.doi.org/10.1137/050646858", ISSN = "0895-4801 (print), 1095-7146 (electronic)", ISSN-L = "0895-4801", bibdate = "Tue May 18 21:37:04 MDT 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/21/4; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Discrete Mathematics", } @Article{Nanevski:2008:YDT, author = "Aleksandar Nanevski and Greg Morrisett and Avraham Shinnar and Paul Govereau and Lars Birkedal", title = "{Ynot}: dependent types for imperative programs", journal = j-SIGPLAN, volume = "43", number = "9", pages = "229--240", month = sep, year = "2008", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1411204.1411237", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 23 17:31:25 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with {\em side-effects}. Coq already includes a powerful functional language that supports dependent types, but that language is limited to pure, total functions. The key contribution of our extension, which we call Ynot, is the added support for computations that may have effects such as non-termination, accessing a mutable store, and throwing/catching exceptions.\par The axioms of Ynot form a small trusted computing base which has been formally justified in our previous work on Hoare Type Theory (HTT). We show how these axioms can be combined with the powerful type and abstraction mechanisms of Coq to build higher-level reasoning mechanisms which in turn can be used to build realistic, verified software components. To substantiate this claim, we describe here a representative series of modules that implement imperative finite maps, including support for a higher-order (effectful) iterator. The implementations range from simple (e.g., association lists) to complex (e.g., hash tables) but share a common interface which abstracts the implementation details and ensures that the modules properly implement the finite map abstraction.", acknowledgement = ack-nhfb, keywords = "Hoare logic; monads; separation logic; type theory", } @Article{Narayanan:2008:DAQ, author = "Dushyanth Narayanan and Austin Donnelly and Richard Mortier and Antony Rowstron", title = "Delay aware querying with {Seaweed}", journal = j-VLDB-J, volume = "17", number = "2", pages = "315--331", month = mar, year = "2008", CODEN = "VLDBFR", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Mon Jun 23 10:51:27 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystem-based network management are characterized by data stored on large numbers of endsystems, with frequent local updates and relatively infrequent global one-shot queries. The challenges are scale ($10^3$ to $10^9$ endsystems) and endsystem unavailability. In such large systems, a significant fraction of endsystems and their data will be unavailable at any given time. Existing methods to provide high data availability despite endsystem unavailability involve centralizing, redistributing or replicating the data. At large scale these methods are not scalable. We advocate a design that trades query delay for completeness, incrementally returning results as endsystems become available. We also introduce the idea of completeness prediction, which provides the user with explicit feedback about this delay/completeness trade-off. Completeness prediction is based on replication of compact data summaries and availability models. This metadata is orders of magnitude smaller than the data. Seaweed is a scalable query infrastructure supporting incremental results, online in-network aggregation and completeness prediction. It is built on a distributed hash table (DHT) but unlike previous DHT based approaches it does not redistribute data across the network. It exploits the DHT infrastructure for failure-resilient metadata replication, query dissemination, and result aggregation. We analytically compare Seaweed's scalability against other approaches and also evaluate the Seaweed prototype running on a large-scale network simulator driven by real-world traces.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", } @Article{Pagh:2008:UHC, author = "Anna Pagh and Rasmus Pagh", title = "Uniform Hashing in Constant Time and Optimal Space", journal = j-SIAM-J-COMPUT, volume = "38", number = "1", pages = "85--96", month = "????", year = "2008", CODEN = "SMJCAT", DOI = "", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Tue May 18 08:21:55 MDT 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/38/1; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", } @Article{Pavlou:2008:FAD, author = "Kyriacos E. Pavlou and Richard T. Snodgrass", title = "Forensic analysis of database tampering", journal = j-TODS, volume = "33", number = "4", pages = "30:1--30:??", month = nov, year = "2008", CODEN = "ATDSD3", DOI = "http://doi.acm.org/10.1145/1412331.1412342", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Tue Dec 23 11:45:08 MST 2008", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Regulations and societal expectations have recently expressed the need to mediate access to valuable databases, even by insiders. One approach is tamper detection via cryptographic hashing. This article shows how to determine when the tampering occurred, what data was tampered with, and perhaps, ultimately, who did the tampering, via forensic analysis. We present four successively more sophisticated forensic analysis algorithms: the Monochromatic, RGBY, Tiled Bitmap, and a3D algorithms, and characterize their ``forensic cost'' under worst-case, best-case, and average-case assumptions on the distribution of corruption sites. A lower bound on forensic cost is derived, with RGBY and a3D being shown optimal for a large number of corruptions. We also provide validated cost formul{\ae} for these algorithms and recommendations for the circumstances in which each algorithm is indicated.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Database Systems", keywords = "a3D algorithm; compliant records; forensic analysis algorithm; forensic cost; Monochromatic algorithm; Polychromatic algorithm; RGBY algorithm; Tiled Bitmap algorithm", } @InProceedings{Peikert:2008:LTF, author = "Chris Peikert and Brent Waters", title = "Lossy trapdoor functions and their applications", crossref = "ACM:2008:SPA", pages = "187--196", year = "2008", DOI = "http://doi.acm.org/10.1145/1374376.1374406", bibdate = "Fri Jun 20 18:31:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We propose a new general primitive called lossy trapdoor functions (lossy TDFs), and realize it under a variety of different number theoretic assumptions, including hardness of the decisional Diffie--Hellman (DDH) problem and the worst-case hardness of lattice problems.\par Using lossy TDFs, we develop a new approach for constructing several important cryptographic primitives, including (injective) trapdoor functions, collision-resistant hash functions, oblivious transfer, and chosen ciphertext-secure cryptosystems. All of the constructions are simple, efficient, and black-box.\par These results resolve some long-standing open problems in cryptography. They give the first known injective trapdoor functions based on problems not directly related to integer factorization, and provide the first known CCA-secure cryptosystem based solely on the worst-case complexity of lattice problems.", acknowledgement = ack-nhfb, keywords = "public key encryption; trapdoor functions", } @Article{Rechberger:2008:NRN, author = "C. Rechberger and V. Rijmen", title = "New Results on {NMAC\slash HMAC} when Instantiated with Popular Hash Functions", journal = j-J-UCS, volume = "14", number = "3", pages = "347--376", month = "????", year = "2008", CODEN = "????", ISSN = "0948-6968", bibdate = "Thu Jul 10 06:41:41 MDT 2008", bibsource = "http://www.jucs.org/jucs; http://www.math.utah.edu/pub/tex/bib/hash.bib; jucs.bib", URL = "http://www.jucs.org/jucs_14_3/new_results_on_nmac", acknowledgement = ack-nhfb, keywords = "cryptography", } @Article{Ruzic:2008:UDD, author = "Milan Ru{\v{z}}i{\'c}", title = "Uniform deterministic dictionaries", journal = j-TALG, volume = "4", number = "1", pages = "1:1--1:??", month = mar, year = "2008", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1328911.1328912", ISSN = "1549-6325 (print), 1549-6333 (electronic)", bibdate = "Mon Jun 16 11:56:15 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting ``good'' hash functions. The main motivation is realization of deterministic dictionaries with fast lookups and reasonably fast updates. The model of computation is the Word RAM, and it is assumed that the machine word-size matches the size of keys in bits. Many of the modern solutions to the dictionary problem are weakly nonuniform, that is, they require a number of constants to be computed at ``compile time'' for the stated time bounds to hold. The currently fastest deterministic dictionary uses constants not known to be computable in polynomial time. In contrast, our dictionaries do not require any special constants or instructions, and running times are independent of word (and key) length. Our family of dynamic dictionaries achieves a performance of the following type: lookups in time $O(t)$ and updates in amortized time $O(n^{1/t})$, for an appropriate parameter function $t$. Update procedures require division, whereas searching uses multiplication only.", acknowledgement = ack-nhfb, articleno = "1", keywords = "Deterministic algorithms; perfect hashing", } @Article{Shen:2008:HBP, author = "Haiying Shen and Cheng-Zhong Xu", title = "Hash-based proximity clustering for efficient load balancing in heterogeneous {DHT} networks", journal = j-J-PAR-DIST-COMP, volume = "68", number = "5", pages = "686--702", month = may, year = "2008", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Fri Jul 11 20:32:36 MDT 2008", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/07437315; jpardistcomp.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", } @Article{Sung:2008:LSI, author = "Minho Sung and Jun Xu and Jun Li and Li Li", title = "Large-scale {IP} traceback in high-speed {Internet}: practical techniques and information-theoretic foundation", journal = j-IEEE-TRANS-NETWORKING, volume = "16", number = "6", pages = "1253--1266", month = dec, year = "2008", CODEN = "IEANEP", DOI = "http://dx.doi.org/10.1109/TNET.2007.911427", ISSN = "1063-6692", bibdate = "Fri Mar 6 16:31:04 MST 2009", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Tracing attack packets to their sources, known as IP traceback, is an important step to counter distributed denial-of-service (DDoS) attacks. In this paper, we propose a novel packet logging based (i.e., hash-based) traceback scheme that requires an order of magnitude smaller processing and storage cost than the hash-based scheme proposed by Snoeren et al. [1], thereby being able to scalable to much higher link speed (e.g., OC-768). The base-line idea of our approach is to sample and log a small percentage (e.g., 3.3\%) of packets. The challenge of this low sampling rate is that much more sophisticated techniques need to be used for traceback. Our solution is to construct the attack tree using the correlation between the attack packets sampled by neighboring routers. The scheme using naive independent random sampling does not perform well due to the low correlation between the packets sampled by neighboring routers. We invent a sampling scheme that improves this correlation and the overall efficiency significantly. Another major contribution of this work is that we introduce a novel information-theoretic framework for our traceback scheme to answer important questions on system parameter tuning and the fundamental tradeoff between the resource used for traceback and the traceback accuracy. Simulation results based on real-world network topologies (e.g., Skitter) match very well with results from the information-theoretic analysis. The simulation results also demonstrate that our traceback scheme can achieve high accuracy, and scale very well to a large number of attackers (e.g., 5000+).", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "distributed denial-of-service attacks; information theory; IP traceback; network security", } @Article{Urvoy:2008:TWS, author = "Tanguy Urvoy and Emmanuel Chauveau and Pascal Filoche and Thomas Lavergne", title = "Tracking {Web} spam with {HTML} style similarities", journal = j-TWEB, volume = "2", number = "1", pages = "3:1--3:??", month = feb, year = "2008", CODEN = "????", DOI = "http://doi.acm.org/10.1145/1326561.1326564", ISSN = "1559-1131", bibdate = "Fri Apr 24 18:17:25 MDT 2009", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Automatically generated content is ubiquitous in the web: dynamic sites built using the three-tier paradigm are good examples (e.g., commercial sites, blogs and other sites edited using web authoring software), as well as less legitimate spamdexing attempts (e.g., link farms, faked directories).\par Those pages built using the same generating method (template or script) share a common ``look and feel'' that is not easily detected by common text classification methods, but is more related to stylometry.\par In this work we study and compare several HTML style similarity measures based on both textual and extra-textual features in HTML source code. We also propose a flexible algorithm to cluster a large collection of documents according to these measures. Since the proposed algorithm is based on locality sensitive hashing (LSH), we first review this technique.\par We then describe how to use the HTML style similarity clusters to pinpoint dubious pages and enhance the quality of spam classifiers. We present an evaluation of our algorithm on the WEBSPAM-UK2006 dataset.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on the Web (TWEB)", keywords = "Clustering; document similarity; search engine spam; stylometry; templates identification", } @Article{Wang:2008:HBS, author = "Hongzhi Wang and Jianzhong Li and Jizhou Luo and Hong Gao", title = "Hash-base subgraph query processing method for graph-structured {XML} documents", journal = j-PROC-VLDB-ENDOWMENT, volume = "1", number = "1", pages = "478--489", month = aug, year = "2008", CODEN = "????", DOI = "http://dx.doi.org/10.1145/1453856.1453909", ISSN = "2150-8097", bibdate = "Fri May 13 14:54:36 MDT 2011", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", } @Article{Zee:2008:FFV, author = "Karen Zee and Viktor Kuncak and Martin Rinard", title = "Full functional verification of linked data structures", journal = j-SIGPLAN, volume = "43", number = "6", pages = "349--361", month = jun, year = "2008", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1379022.1375624", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 11:04:53 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables. Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data structure implementations (with the exception of properties involving execution time and/or memory consumption). Given that the desired correctness properties include intractable constructs such as quantifiers, transitive closure, and lambda abstraction, it is a challenge to successfully prove the generated verification conditions.\par Our Jahob verification system uses integrated reasoning to split each verification condition into a conjunction of simpler subformulas, then apply a diverse collection of specialized decision procedures, first-order theorem provers, and, in the worst case, interactive theorem provers to prove each subformula. Techniques such as replacing complex subformulas with stronger but simpler alternatives, exploiting structure inherently present in the verification conditions, and, when necessary, inserting verified lemmas and proof hints into the imperative source code make it possible to seamlessly integrate all of the specialized decision procedures and theorem provers into a single powerful integrated reasoning system. By appropriately applying multiple proof techniques to discharge different subformulas, this reasoning system can effectively prove the complex and challenging verification conditions that arise in this context.", acknowledgement = ack-nhfb, keywords = "data structure; decision procedure; Java; theorem prover; verification", } @Article{Zhou:2008:RTS, author = "Kun Zhou and Zhong Ren and Stephen Lin and Hujun Bao and Baining Guo and Heung-Yeung Shum", title = "Real-time smoke rendering using compensated ray marching", journal = j-TOG, volume = "27", number = "3", pages = "36:1--36:??", month = aug, year = "2008", CODEN = "ATGRDF", DOI = "http://doi.acm.org/10.1145/1399504.1360635", ISSN = "0730-0301 (print), 1557-7368 (electronic)", bibdate = "Tue Aug 12 13:40:36 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/tog/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We present a real-time algorithm called {\em compensated ray marching\/} for rendering of smoke under dynamic low-frequency environment lighting. Our approach is based on a decomposition of the input smoke animation, represented as a sequence of volumetric density fields, into a set of radial basis functions (RBFs) and a sequence of residual fields. To expedite rendering, the source radiance distribution within the smoke is computed from only the low-frequency RBF approximation of the density fields, since the high-frequency residuals have little impact on global illumination under low-frequency environment lighting. Furthermore, in computing source radiances the contributions from single and multiple scattering are evaluated at only the RBF centers and then approximated at other points in the volume using an RBF-based interpolation. A slice-based integration of these source radiances along each view ray is then performed to render the final image. The high-frequency residual fields, which are a critical component in the local appearance of smoke, are compensated back into the radiance integral during this ray march to generate images of high detail.\par The runtime algorithm, which includes both light transfer simulation and ray marching, can be easily implemented on the GPU, and thus allows for real-time manipulation of viewpoint and lighting, as well as interactive editing of smoke attributes such as extinction cross section, scattering albedo, and phase function. Only moderate preprocessing time and storage is needed. This approach provides the first method for real-time smoke rendering that includes single and multiple scattering while generating results comparable in quality to offline algorithms like ray tracing.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Graphics", keywords = "environment lighting; multiple scattering; participating media; perfect hashing; single scattering", } @Article{Agrawal:2009:HBN, author = "Banit Agrawal and Timothy Sherwood", title = "High-bandwidth network memory system through virtual pipelines", journal = j-IEEE-TRANS-NETWORKING, volume = "17", number = "4", pages = "1029--1041", month = aug, year = "2009", CODEN = "IEANEP", DOI = "http://dx.doi.org/10.1109/TNET.2008.2008646", ISSN = "1063-6692", bibdate = "Tue Sep 22 12:40:59 MDT 2009", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "As network bandwidth increases, designing an effective memory system for network processors becomes a significant challenge. The size of the routing tables, the complexity of the packet classification rules, and the amount of packet buffering required all continue to grow at a staggering rate. Simply relying on large, fast SRAMs alone is not likely to be scalable or cost-effective. Instead, trends point to the use of low-cost commodity DRAM devices as a means to deliver the worst-case memory performance that network data-plane algorithms demand. While DRAMs can deliver a great deal of throughput, the problem is that memory banking significantly complicates the worst-case analysis, and specialized algorithms are needed to ensure that specific types of access patterns are conflict-free.\par We introduce virtually pipelined memory, an architectural technique that efficiently supports high bandwidth, uniform latency memory accesses, and high-confidence throughput even under adversarial conditions. Virtual pipelining provides a simple-to-analyze programming model of a deep pipeline (deterministic latencies) with a completely different physical implementation (a memory system with banks and probabilistic mapping). This allows designers to effectively decouple the analysis of their algorithms and data structures from the analysis of the memory buses and banks. Unlike specialized hardware customized for a specific data-plane algorithm, our system makes no assumption about the memory access patterns. We present a mathematical argument for our system's ability to provably provide bandwidth with high confidence and demonstrate its functionality and area overhead through a synthesizable design. We further show that, even though our scheme is general purpose to support new applications such as packet reassembly, it outperforms the state-of-the-art in specialized packet buffering architectures.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "bank conflicts; DRAM; mean time to stall; memory; memory controller; MTS; network; packet buffering; packet reassembly; universal hashing; virtual pipeline; VPNM", } @Article{Ahn:2009:SLD, author = "Joon Ahn and Bhaskar Krishnamachari", title = "Scaling laws for data-centric storage and querying in wireless sensor networks", journal = j-IEEE-TRANS-NETWORKING, volume = "17", number = "4", pages = "1242--1255", month = aug, year = "2009", CODEN = "IEANEP", DOI = "http://dx.doi.org/10.1109/TNET.2008.2009220", ISSN = "1063-6692", bibdate = "Tue Sep 22 12:40:59 MDT 2009", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We use a constrained optimization framework to derive scaling laws for data-centric storage and querying in wireless sensor networks. We consider both unstructured sensor networks, which use blind sequential search for querying, and structured sensor networks, which use efficient hash-based querying. We find that the scalability of a sensor network's performance depends upon whether the increase in energy and storage resources with more nodes is outweighed by the concomitant application-specific increase in event and query loads. We derive conditions that determine: 1) whether the energy requirement per node grows without bound with the network size for a fixed-duration deployment, 2) whether there exists a maximum network size that can be operated for a specified duration on a fixed energy budget, and 3) whether the network lifetime increases or decreases with the size of the network for a fixed energy budget. An interesting finding of this work is that three-dimensional (3D) uniform deployments are inherently more scalable than two-dimensional (2D) uniform deployments, which in turn are more scalable than one-dimensional (1D) uniform deployments.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", keywords = "energy efficiency; modeling; performance analysis; querying; scalability; wireless sensor networks", } @Article{Alcantara:2009:RTP, author = "Dan A. Alcantara and Andrei Sharf and Fatemeh Abbasinejad and Shubhabrata Sengupta and Michael Mitzenmacher and John D. Owens and Nina Amenta", title = "Real-time parallel hashing on the {GPU}", journal = j-TOG, volume = "28", number = "5", pages = "154:1--154:9", month = dec, year = "2009", CODEN = "ATGRDF", DOI = "http://doi.acm.org/10.1145/1618452.1618500", ISSN = "0730-0301 (print), 1557-7368 (electronic)", bibdate = "Mon Mar 15 09:01:55 MDT 2010", bibsource = "http://www.acm.org/pubs/contents/journals/tog/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "We demonstrate an efficient data-parallel algorithm for building large hash tables of millions of elements in real-time. We consider two parallel algorithms for the construction: a classical sparse perfect hashing approach, and cuckoo hashing, which packs elements densely by allowing an element to be stored in one of multiple possible locations. Our construction is a hybrid approach that uses both algorithms. We measure the construction time, access time, and memory usage of our implementations and demonstrate real-time performance on large datasets: for 5 million key-value pairs, we construct a hash table in 35.7 ms using 1.42 times as much memory as the input data itself, and we can access all the elements in that hash table in 15.3 ms. For comparison, sorting the same data requires 36.6 ms, but accessing all the elements via binary search requires 79.5 ms. Furthermore, we show how our hashing methods can be applied to two graphics applications: 3D surface intersection for moving data and geometric hashing for image matching.", acknowledgement = ack-nhfb, articleno = "154", fjournal = "ACM Transactions on Graphics", keywords = "cuckoo hashing; GPU computing; hash tables; parallel data structures; parallel hash tables", } @TechReport{Atighehchi:2009:EPA, author = "K{\'e}vin Atighehchi and Adriana Enache and Traian Muntean and Gabriel Risterucci", title = "An Efficient Parallel Algorithm for {Skein} Hash Functions", type = "Report", institution = "ERISCS Research Group, Universit{\'e} de la M{\'e}diterran{\'e}e", address = "Parc Scientifique de Luminy-Marseille, France", pages = "11", day = "30", month = sep, year = "2009", bibdate = "Sat Dec 10 15:35:59 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Aumasson:2009:CHF, author = "Jean-Philippe Aumasson", title = "Cryptanalysis of a Hash Function Based on Norm Form Equations", journal = j-CRYPTOLOGIA, volume = "33", number = "1", pages = "12--15", year = "2009", CODEN = "CRYPE6", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibdate = "Tue Aug 31 11:44:06 MDT 2010", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.tandf.co.uk/journals/titles/01611194.asp", acknowledgement = ack-nhfb, } @Article{Black:2009:IHE, author = "J. Black and M. Cochran and T. Shrimpton", title = "On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions", journal = j-J-CRYPTOLOGY, volume = "22", number = "3", pages = "311--329", month = jul, year = "2009", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", bibdate = "Wed Aug 25 09:39:02 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0933-2790&volume=22&issue=3; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0933-2790&volume=22&issue=3&spage=311", acknowledgement = ack-nhfb, } @Article{Brass:2009:UHF, author = "Peter Brass", title = "Universal hash functions for an infinite universe and hash trees", journal = j-INFO-PROC-LETT, volume = "109", number = "10", pages = "461--462", day = "30", month = apr, year = "2009", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", bibdate = "Thu Mar 31 15:53:29 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", } @InCollection{Buchmann:2009:HBD, author = "Johannes Buchmann and Erik Dahmen and Michael Szydlo", title = "Hash-based Digital Signature Schemes", crossref = "Bernstein:2009:PQC", pages = "35--94", year = "2009", bibdate = "Thu Apr 21 17:17:18 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, } @Article{Charles:2009:CHF, author = "Denis X. Charles and Kristin E. Lauter and Eyal Z. Goren", title = "Cryptographic Hash Functions from Expander Graphs", journal = j-J-CRYPTOLOGY, volume = "22", number = "1", pages = "93--113", month = jan, year = "2009", CODEN = "JOCREQ", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", bibdate = "Wed Aug 25 09:38:59 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0933-2790&volume=22&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0933-2790&volume=22&issue=1&spage=93", acknowledgement = ack-nhfb, } @Article{Choi:2009:SPC, author = "Lynn Choi and Hyogon Kim and Sunil Kim and Moon Hae Kim", title = "Scalable packet classification through rulebase partitioning using the maximum entropy hashing", journal = j-IEEE-TRANS-NETWORKING, volume = "17", number = "6", pages = "1926--1935", month = dec, year = "2009", CODEN = "IEANEP", ISSN = "1063-6692", bibdate = "Mon Mar 15 18:25:46 MDT 2010", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", } @Article{Coetser:2009:REH, author = "Wikus Coetser and Derrick G. Kourie and Bruce W. Watson", title = "On Regular Expression Hashing to Reduce {FA} Size", journal = j-INT-J-FOUND-COMP-SCI, volume = "20", number = "6", pages = "1069--1086", month = dec, year = "2009", CODEN = "IFCSEN", DOI = "http://dx.doi.org/10.1142/S0129054109007042", ISSN = "0129-0541", bibdate = "Tue Aug 31 07:37:14 MDT 2010", bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml; http://www.math.utah.edu/pub/tex/bib/hash.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Foundations of Computer Science (IJFCS)", } @Article{Colbourn:2009:LHF, author = "Charles J. Colbourn and Alan C. H. Ling", title = "Linear hash families and forbidden configurations", journal = j-DESIGNS-CODES-CRYPTOGR, volume = "52", number = "1", pages = "25--55", month = jul, year = "2009", CODEN = "DCCREC", ISSN = "0925-1022 (print), 1573-7586 (electronic)", bibdate = "Mon Sep 6 16:00:50 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=52&issue=1; http://www.math.utah.edu/pub/tex/bib/hash.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=52&issue=1&spage=25", acknowledgement = ack-nhfb, } @Article{Cormode:2009:FFI, author = "Graham Cormode and Marios Hadjieleftheriou", title = "Finding the frequent items in streams of data", journal = j-CACM, volume = "52", number = "10", pages = "97--105", month = oct, year = "2009", CODEN = "CACMA2", DOI = "http://doi.acm.org/10.1145/1562764.1562789", ISSN = "0001-0782 (print), 1557-7317 (electronic)", bibdate = "Fri Oct 23 15:01:50 MDT 2009", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Many data generation processes can be modeled as {\em data streams.\/} They produce huge numbers of pieces of data, each of which is simple in isolation, but which taken together lead to a complex whole. For example, the sequence of queries posed to an Internet search engine can be thought of as a stream, as can the collection of transactions across all branches of a supermarket chain. In aggregate, this data can arrive at enormous rates, easily in the realm of hundreds of gigabytes per day or higher. While this data may be archived and indexed within a data warehouse, it is also important to process the data 'as it happens,' to provide up to the minute analysis and statistics on current trends. Methods to achieve this must be quick to respond to each new piece of information, and use resources which are very small when compared to the total quantity of data.\par These applications and others like them have led to the formulation of the so-called 'streaming model.' In this abstraction, algorithms take only a single pass over their input, and must accurately compute various functions while using resources (space and time per item) that are strictly sublinear in the size of the input---ideally, polynomial in the logarithm of the input size. The output must be produced at the end of the stream, or when queried on the prefix of the stream that has been observed so far. (Other variations ask for the output to be maintained continuously in the presence of updates, or on a 'sliding window' of only the most recent updates.) Some problems are simple in this model: for example, given a stream of transactions, finding the mean and standard deviation of the bill totals can be accomplished by retaining a few 'sufficient statistics' (sum of all values, sum of squared values, etc.). Others can be shown to require a large amount of information to be stored, such as determining whether a particular search query has already appeared anywhere within a large stream of queries. Determining which problems can be solved effectively within this model remains an active research area.\par The {\em frequent items problem\/} (also known as the {\em heavy hitters problem\/}) is one of the most heavily studied questions in data streams. The problem is popular due to its simplicity to state, and its intuitive interest and value. It is important both in itself, and as a subroutine within more advanced data stream computations. Informally, given a sequence of items, the problem is simply to find those items which occur most frequently. Typically, this is formalized as finding all items whose frequency exceeds a specified fraction of the total number of items. This is shown in Figure 1. Variations arise when the items are given weights, and further when these weights can also be negative.\par This abstract problem captures a wide variety of settings. The items can represent packets on the Internet, and the weights are the size of the packets. Then the frequent items represent the most popular destinations, or the heaviest bandwidth users (depending on how the items are extracted from the flow identifiers). This knowledge can help in optimizing routing decisions, for in-network caching, and for planning where to add new capacity. Or, the items can represent queries made to an Internet search engine, and the frequent items are now the (currently) popular terms. These are not simply hypothetical examples, but genuine cases where algorithms for this problem have been applied by large corporations: AT\&T and Google, respectively. Given the size of the data (which is being generated at high speed), it is important to find algorithms which are capable of processing each new update very quickly, without blocking. It also helps if the working space of the algorithm is very small, so that the analysis can happen over many different groups in parallel, and because small structures are likely to have better cache behavior and hence further help increase the throughput.\par Obtaining efficient and scalable solutions to the frequent items problem is also important since many streaming applications need to find frequent items as a subroutine of another, more complex computation. Most directly, mining frequent {\em itemsets\/} inherently builds on finding frequent {\em items\/} as a basic building block. Finding the entropy of a stream requires learning the most frequent items in order to directly compute their contribution to the entropy, and remove their contribution before approximating the entropy of the residual stream. The HSS (Hierarchical Sampling from Sketches) technique uses hashing to derive multiple substreams, the frequent elements of which are extracted to estimate the frequency moments of the stream. The frequent items problem is also related to the recently popular area of Compressed Sensing.\par Other work solves generalized versions of frequent items problems by building on algorithms for the 'vanilla' version of the problem. Several techniques for finding the frequent items in a 'sliding window' of recent updates (instead of all updates) operate by keeping track of the frequent items in many sub-windows. In the 'heavy hitters distinct' problem, with applications to detecting network scanning attacks, the count of an item is the number of {\em distinct\/} pairs containing that item paired with a secondary item. It is typically solved extending a frequent items algorithm with distinct counting algorithms. Frequent items have also been applied to models of probabilistic streaming data, and within faster 'skipping' techniques.\par Thus the problem is an important one to understand and study in order to produce efficient streaming implementations. It remains an active area, with many new research contributions produced every year on the core problem and its variations. Due to the amount of work on this problem, it is easy to miss out some important references or fail to appreciate the properties of certain algorithms. There are several cases where algorithms first published in the 1980s have been 'rediscovered' two decades later; existing work is sometimes claimed to be incapable of a certain guarantee, which in truth it can provide with only minor modifications; and experimental evaluations do not always compare against the most suitable methods.\par In this paper, we present the main ideas in this area, by describing some of the most significant algorithms for the core problem of finding frequent items using common notation and terminology. In doing so, we also present the historical development of these algorithms. Studying these algorithms is instructive, as they are relatively simple, but can be shown to provide formal guarantees on the quality of their output as a function of an accuracy parameter {\epsilon}. We also provide baseline implementations of many of these algorithms against which future algorithms can be compared, and on top of which algorithms for different problems can be built. We perform experimental evaluation of the algorithms over a variety of data sets to indicate their performance in practice. From this, we are able to identify clear distinctions among the algorithms that are not apparent from their theoretical analysis alone.", acknowledgement = ack-nhfb, } @Article{Ducournau:2009:EAO, author = "Roland Ducournau and Flor{\'e}al Morandat and Jean Privat", title = "Empirical assessment of object-oriented implementations with multiple inheritance and static typing", journal = j-SIGPLAN, volume = "44", number = "10", pages = "41--60", month = oct, year = "2009", CODEN = "SINODQ", DOI = "http://doi.acm.org/10.1145/1639949.1640093", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Jun 21 18:01:56 MDT 2010", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Object-oriented languages involve a threefold tradeoff between runtime efficiency, expressiveness (multiple inheritance), and modularity, i.e., open-world assumption (OWA). Runtime efficiency is conditioned by both the {\em implementation technique\/} and {\em compilation scheme}. The former specifies the data structures that support method invocation, attribute access and subtype testing. The latter consists of the production line of an executable from the source code. Many implementation techniques have been proposed and several compilation schemes can be considered from fully global compilation under the closed-world assumption (CWA) to separate compilation with dynamic loading under the OWA, with midway solution