Ellis, C. Concurrency in Linear Hashing. ACM Transactions on Database Systems, vol. 12, No. 2, Jun. 1987, pp. 195-217.* |
R. Fagin, J. Nievergelt, N. Pippenger, and H.R. Strong, “Extendible Hashing—A Fast Access Method for Dynamic Files,” ACM Transactions on Database Systems, 1979, Issues 3,4, pp. 315-344. |
G.N.N. Martin, “Spiral Storage: Incrementally Augmentable Hash Addressed Storage,” IBM Technical Disclosure Bulletin, Mar. 1982, vol. 24, No. 10, pp. 4946-4949. |
J.K. Mullin, “Spiral Storage: Efficient Dynamic Hashing with Constant Performance,” The Computer Journal, 1985, vol. 28, No. 3, pp. 330-334. |
Per-Ake Larson, “Dynamic Hashing,” BIT 18, (1978), pp. 184-201. |
Per-Ake Larson, Dynamic Hash Tables, Communications of the ACM, Apr. 1988, vol. 31, No. 4, pp. 446-457. |
W. Litwin, “Linear Hashing: A New Tool for File and Table Addressing,” Proceedings of the 6thConference on Very Large Databases, 1981, pp. 212-223. |
Robert Morris, “Scatter Storage Techniques,” Communications of the ACM, Jan. 1968, vol. 11, No. 1, pp. 38-44. |
Knuth, Donald E., “The Art of Computer Programming,” Second Edition, 1998, Addison-Wesley, pp. 513-558. |