 | 1993 |
|---|
| 15 |       | James K. Mullin:
Estimating the size of a relational join.
Inf. Syst. 18(3): 189-196 (1993) |
| 1991 |
|---|
| 14 | | James K. Mullin:
A Caution on Universal Classes of Hash Functions.
Inf. Process. Lett. 37(5): 247-256 (1991) |
| 1990 |
|---|
| 13 |  | James K. Mullin:
Optimal Semijoins for Distributed Database Systems.
IEEE Trans. Software Eng. 16(5): 558-560 (1990) |
| 12 | | James K. Mullin,
Daniel J. Margoliash:
A Tale of Three Spelling Checkers.
Softw., Pract. Exper. 20(6): 625-630 (1990) |
| 1987 |
|---|
| 11 | | James K. Mullin:
Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters.
Comput. J. 30(4): 343-348 (1987) |
| 1985 |
|---|
| 10 | | James K. Mullin:
Spiral Storage: Efficient Dynamic Hashing with Constant Performance.
Comput. J. 28(3): 330-334 (1985) |
| 1984 |
|---|
| 9 | | James K. Mullin:
Unified Dynamic Hashing.
VLDB 1984: 473-480 |
| 1983 |
|---|
| 8 | | James K. Mullin:
A Second Look at Bloom Filters.
Commun. ACM 26(8): 570-571 (1983) |
| 1982 |
|---|
| 7 | | James K. Mullin:
Interfacing criteria for recognition logic used with a context post-processor.
Pattern Recognition 15(3): 271-273 (1982) |
| 1981 |
|---|
| 6 | | James K. Mullin:
Tightly Controlled Linear Hashing without Separate Overflow Storage.
BIT 21(4): 390-400 (1981) |
| 5 | | James K. Mullin:
Change Area B-Trees: A Technique to Aid Error Recovery.
Comput. J. 24(4): 367-373 (1981) |
| 1974 |
|---|
| 4 | | James K. Mullin,
G. F. Stuart:
Optimum Blocking Factors for a Mix of Sequentially Processed Jobs.
Comput. J. 17(3): 224-228 (1974) |
| 1972 |
|---|
| 3 | | James K. Mullin:
An Improved Index Sequential Access Method Using Hashed Overflow.
Commun. ACM 15(5): 301-307 (1972) |
| 1971 |
|---|
| 2 | | James K. Mullin:
Retrieval-Update Speed Tradeoffs Using Combined Indices.
Commun. ACM 14(12): 775-776 (1971) |
| 1970 |
|---|
| 1 | | J. W. Dempsey,
James K. Mullin:
Problems of Building a Hybrid Data Definition Facility.
SIGFIDET Workshop 1970: 174-187 |
