Disk allocation methods using error correcting codes

摘要: The problem of declustering, that is, how to distribute a binary Cartesian product file on multiple disks maximize the parallelism for partial match queries, is examined. files appear as result some secondary key access methods. For case, reduced grouping 2/sup n/ strings n bits in m groups unsimilar strings. It proposed be grouped such these group forms an error correcting code (ECC). This construction guarantees given will have large Hamming distances, i.e., they differ many bit positions. Intuitively, this should good declustering. authors describe build declustering scheme using ECC, and prove theorem gives necessary condition method optimal. Analytical results show superior older heuristics, it very close theoretical (nontight) bound. >