This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files
December 2002 (vol. 13 no. 12)
pp. 1211-1219

Abstract—A multidimensional file is one whose data are characterized by several attributes, each specified in a given domain. A partial match query on a multidimensional file extracts all data whose attributes match the values of one or more attributes specified in the query. The disk allocation problem of a multidimensional file \big. F\bigr. on a database system with multiple disks accessible in parallel is the problem of distributing \big. F\bigr. 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, the redundant residue codes. We also introduce a new family of residue codes, called the redundant nonpairwise prime residue codes, to deal with files whose attribute domains are nonpairwise prime.

[1] K.A.S. Abdel-Ghaffar and A. El Abbadi, “Optimal Disk Allocation for Partial Match Queries,” ACM Trans. Database Systems, vol. 18, no. 1, pp. 132-156, Mar. 1993.
[2] F. Barsi and P. Maestrini, “Error Correcting Properties of Redundant Residue Number Systems,” IEEE Trans. Computers, vol. 22, pp. 307-315, 1973.
[3] F. Barsi and P. Maestrini, “Error Codes in Residue Number Systems with Non-Pairwise-Prime Moduli,” Information and Control, vol. 46, no. 1, pp. 16-25, July 1980.
[4] S.K. Das and M.C. Pinotti, “An Optimal Disk Allocation Strategy for Partial Match Query of Non-Uniform Cartesian Product Files,” Proc. IEEE Int'l Parallel Processing Symp., pp. 550-554, Apr. 1999.
[5] H.C. Du and J.S. Sobolewski, “Disk Allocation for Cartesian Product Files,” ACM Trans. Database Systems, vol. 7, no. 1, pp. 82-101, Mar. 1982.
[6] M.F. Fang, R.C.T. Lee, and C.C. Chang, “The Idea of De-Clustering and its Applications,” Proc. 12th Int'l Conf. Very Large Databases, pp. 181-188, Aug. 1986.
[7] C. Faloutsos and D. Metaxas, “Disk Allocation Methods Using Error Correcting Codes,” IEEE Trans. Computers, vol. 40, no. 8, pp. 907-913, Aug. 1991.
[8] M.H. Kim and S. Pramanik, “Optimal File Distribution for Partial Match Retrieval,” Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 173-182, 1988.
[9] H. Khrisna, K. Lin, and J. Sun, “A Coding Theory Approach to Error Control in Redundant Residue Number SystemsPart I: Theory and Single Correction,” IEEE Trans. Circuits and Systems, II, vol. 39, no. 1, pp. 8-17, Jan. 1992.
[10] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Parts I and II. New York: North-Holland, 1977.
[11] O. Ore, “The General Chinese Remainder Theorem,” Am. Math. Monthly, pp. 365-370, 1952.

Index Terms:
Nonuniform multidimensional file, partial match query, strictly optimal disk allocation, redundant pairwise-prime residue code, redundant nonpairwise prime residue code.
Citation:
Sajal K. Das, Cristina M. Pinotti, "Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multidimensional Files," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 12, pp. 1211-1219, Dec. 2002, doi:10.1109/TPDS.2002.1158260
Usage of this product signifies your acceptance of the Terms of Use.