James K. Mullin

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