This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Common Properties of Some Multiattribute File Systems
March 1979 (vol. 5 no. 2)
pp. 160-174
W.C. Lin, Rex Company, Olivette Agent
This paper results from an attempt to unify several different file system design theories. We define a term "partial match pattern" and show that in order to produce file systems optimal with respect to partial match patterns, both the multikey hashing (MKH) method [16] and the multidimensional directory (MDD) method [11] must be in such a form that the number of subdivisions is the same for all domains of keys. We show the conditions for the string homomorphism hashing (SHH) method [15], the MKH method, and the MDD method to be equivalent to one another. We define the so-called Cartesian product files and show that if all records are present, the records in a Cartesian product file form a shortest spanning path in which the Hamming distance between every pair of consecutive records is 1. Thus the SHH method, the MKH method, the MDD method, and the multikey sorting (MKS) method [10] are linked together. Finally, we show that for both partial and best match queries, the file systems exhibit a common characteristic: similar records are grouped together.
Index Terms:
symbolic error correcting codes, Best match, clustering, multidimensional directory, multikey hashing, multikey sorting, partial match, partial match pattern, shortest spanning path, string homomorphism hashing
Citation:
W.C. Lin, R.C.T. Lee, H.C. Du, "Common Properties of Some Multiattribute File Systems," IEEE Transactions on Software Engineering, vol. 5, no. 2, pp. 160-174, March 1979, doi:10.1109/TSE.1979.234172
Usage of this product signifies your acceptance of the Terms of Use.