James K. Mullin

Publication Activity (10 Years)

Years Active: 1970-1993
Publications (10 Years): 0

Publications

James K. Mullin
Estimating the size of a relational join. Inf. Syst. 18 (3) (1993)
James K. Mullin
Hash Functions for Hash-based Join Methods. Comput. J. 35 (Additional-Papers) (1992)
James K. Mullin
A Caution on Universal Classes of Hash Functions. Inf. Process. Lett. 37 (5) (1991)
James K. Mullin, Daniel J. Margoliash
A Tale of Three Spelling Checkers. Softw. Pract. Exp. 20 (6) (1990)
James K. Mullin
Optimal Semijoins for Distributed Database Systems. IEEE Trans. Software Eng. 16 (5) (1990)
James K. Mullin
Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters. Comput. J. 30 (4) (1987)
James K. Mullin
Spiral Storage: Efficient Dynamic Hashing with Constant Performance. Comput. J. 28 (3) (1985)
James K. Mullin
Unified Dynamic Hashing. VLDB (1984)
James K. Mullin
A Second Look at Bloom Filters. Commun. ACM 26 (8) (1983)
James K. Mullin
Interfacing criteria for recognition logic used with a context post-processor. Pattern Recognit. 15 (3) (1982)
James K. Mullin
Reliable Indexing Using Unreliable Recognition Devices. IEEE Trans. Pattern Anal. Mach. Intell. 3 (3) (1981)
James K. Mullin
Tightly Controlled Linear Hashing without Separate Overflow Storage. BIT 21 (4) (1981)
James K. Mullin
Change Area B-Trees: A Technique to Aid Error Recovery. Comput. J. 24 (4) (1981)
James K. Mullin, G. F. Stuart
Optimum Blocking Factors for a Mix of Sequentially Processed Jobs. Comput. J. 17 (3) (1974)
Ross T. Newkirk, James K. Mullin
Simulated demand in large-scale batch processor acquisitions: Role and justification. ANSS (1974)
James K. Mullin
An Improved Index Sequential Access Method Using Hashed Overflow. Commun. ACM 15 (5) (1972)
James K. Mullin
Retrieval-Update Speed Tradeoffs Using Combined Indices. Commun. ACM 14 (12) (1971)
J. W. Dempsey, James K. Mullin
Problems of Building a Hybrid Data Definition Facility. SIGFIDET Workshop (1970)