A dynamic hashing method is presented for structuring files with multiple attribute keys. the method is essentially the multidimensional analogue of linear hashing developed by Litwin an Larson Given a record of d attribute keys the scheme called multidimensional digital hashing applies the linear hashing technique independently to each of the attributes to derive d integer values these values form a d-tuple coordinate address of the home page of the record a functions equivalent to the element allocation function of a d-dimensional extendible array of linear varying order and computable in time O(d) is used to map the d-tuple page address into a linear address space algorithms for insertions, deletions and the processing of partial-match and range queries are presented.