Zobrazeno 1 - 10
of 19
pro vyhledávání: '"James K. Mullin"'
Autor:
James K. Mullin
Publikováno v:
Information Systems. 18:189-196
This paper shows how to esimtate the size of the natural join of two relations. Such an estimate is valuable in query optimization as joins constitute the bulk of the work required in answering multi-relation queries. The final optimized strategy can
Autor:
James K. Mullin
Publikováno v:
Information Processing Letters. 37:247-256
Universal classes of hash functions of the form ((A × Key + B) mod P) mod Size, where A, B, and P (a prime greater than A and B) are constants and Size is the number of hash addresses, have come into common use. Theory and practical tests have shown
Autor:
James K. Mullin
Publikováno v:
The Computer Journal. 30:343-348
Autor:
Ian D.M. Smith, Francis R. Handforth, James K. Mullin, Barbara Jennings, Neil H. McAlister, J.H. Toogood
Publikováno v:
Computers and Biomedical Research. 7:496-512
Several small, independent FORTRAN programs, written for interactive use on a time-sharing PDP-10 computer, perform statistical calculations and display functions associated with the analysis of data obtained in clinical trials of the efficacy of exp
Autor:
James K. Mullin, Ross T. Newkirk
Publikováno v:
ANSS
The authors present this paper in the context of a successful acquisition of a multi user large scale batch processing system. They discuss the role of simulated demand (a) in determining basic system requirements, (b) as the major part of system spe
Autor:
James K. Mullin
Publikováno v:
The Computer Journal. 24:367-373
Autor:
James K. Mullin
Publikováno v:
The Computer Journal. 28:330-334
Autor:
James K. Mullin
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. :347-350
A new method is described and tested for using an unreliable character recognition device to produce a reliable index for a collection of documents. All highly likely substitution errors of the recognition device are handled by transforming character
Autor:
James K. Mullin, G. F. Stuart
Publikováno v:
The Computer Journal. 17:224-228
Autor:
James K. Mullin
Publikováno v:
BIT. 21:390-400
A hashing method is presented where 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 st