Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files
Issue No. 12 - December (2002 vol. 13)
<p><b>Abstract</b>—A <it>multidimensional file</it> is one whose data are characterized by several attributes, each specified in a given domain. A <it>partial match query</it> on a multidimensional file extracts all data whose attributes match the values of one or more attributes specified in the query. The <it>disk allocation</it> problem of a multidimensional file <tmath>\big. F\bigr.</tmath> on a database system with multiple disks accessible in parallel is the problem of distributing <tmath>\big. F\bigr.</tmath> among the disks such that the data qualifying for each partial match query are distributed as evenly as possible among the disks of the system. We propose an optimal solution to this problem for multidimensional files with pairwise prime domains based on a large and flexible class of maximum distance separable codes, namely, <it>the redundant residue codes</it>. We also introduce a new family of residue codes, called the <it>redundant nonpairwise prime residue codes</it>, to deal with files whose attribute domains are nonpairwise prime.</p>
Nonuniform multidimensional file, partial match query, strictly optimal disk allocation, redundant pairwise-prime residue code, redundant nonpairwise prime residue code.
S. K. Das and C. M. Pinotti, "Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 1211-1219, 2002.