This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Allocating Fragments in Distributed Databases
July 2005 (vol. 16 no. 7)
pp. 577-585
Syam Menon, IEEE

Abstract—For a distributed database system to function efficiently, the fragments of the database need to be located judiciously at various sites across the relevant communications network. The problem of allocating these fragments to the most appropriate sites is a difficult one to solve, however, with most approaches available relying on heuristic techniques. Optimal approaches are usually based on mathematical programming, and formulations available for this problem are based on the linearization of nonlinear binary integer programs and have been observed to be ineffective except on very small problems. This paper presents new integer programming formulations for the nonredundant version of the fragment allocation problem. This formulation is extended to address problems which have both storage and processing capacity constraints; the approach is observed to be particularly effective in the presence of capacity restrictions. Extensive computational tests conducted over a variety of parameter values indicate that the reformulations are very effective even on relatively large problems, thereby reducing the need for heuristic approaches.

[1] S. Abiteboul, A. Bonifati, G. Cobéna, I. Manolescu, and T. Milo, “Dynamic XML Documents with Distribution and Replication,” Proc. 2003 ACM SIGMOD Int'l Conf. Management of Data, pp. 527-538, 2003.
[2] S. Agrawal, V. Narasayya, and B. Yang, “Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design,” Proc. 2004 ACM SIGMOD Int'l Conf. Management of Data, pp. 359-370, 2004.
[3] P. Apers, “Data Allocation in Distributed Databases,” ACM Trans. Database Systems, vol. 13, no. 3, pp. 263-304, Sept. 1988.
[4] J. Bremer and M. Gertz, “On Distributing XML Repositories,” Proc. Sixth Int'l Workshop Web and Databases (WebDB 2003), June 2003.
[5] S. Buchholz and T. Buchholz, “Replica Placement in Adaptive Content Distribution Networks,” Proc. 2004 ACM Symp. Applied Computing, pp. 1705-1710, 2004.
[6] S. Ceri, S. Navathe, and G. Weiderhold, “Distribution Design of Logical Database Schemas,” IEEE Trans. Software Eng., vol. 9, pp. 487-563, 1983.
[7] A. Chaturvedi, A. Choubey, and J. Roan, “Scheduling the Allocation of Data Fragments in a Distributed Database Environment: A Machine Learning Approach,” IEEE Trans. Eng. Management, vol. 41, no. 2, pp. 194-207, 1994.
[8] A. Chin, “Incremental Data Allocation and Reallocation in Distributed Database Systems,” Data Warehousing and Web Eng., S. Becker, ed., chapter 7, IRM Press, pp. 137-160, 2002.
[9] G. Chiu and C. Raghavendra, “A Model for Optimal Database Allocation in Distributed Computing Systems,” Proc. IEEE INFOCOM 1990, vol. 3, pp. 827-833, June 1990.
[10] S. Cook, J. Pachl, and I. Pressman, “The Optimal Location of Replicas in a Network Using a READ-ONE-WRITE-ALL Policy,” Distributed Computing, vol. 15, no. 1, pp. 57-66, 2002.
[11] A. Corcoran and J. Hale, “A Genetic Algorithm for Fragment Allocation in a Distributed Database System,” Proc. 1994 ACM Symp. Applied Computing, pp. 247-250, 1994.
[12] F. Glover, “Improved Linear Integer Programming Formulations of Nonlinear Integer Programs,” Management Science, vol. 22, no. 4, pp. 455-460, Dec. 1975.
[13] F. Glover and E. Woolsey, “Converting a 0-1 Polynomial Programming Problem into a 0-1 Linear Program,” Operations Research, vol. 22, pp. 180-182, 1974.
[14] Y. Huang and J. Chen, “Fragment Allocation in Distributed Database Design,” J. Information Science and Eng., vol. 17, pp. 491-506, 2001.
[15] ILOG, Inc., Gentilly, France, ILOG CPLEX 7.5 User's Manual, 2001.
[16] K. Karlaplem and N. Pun, “Query-Driven Data Allocation Algorithms for Distributed Database Systems,” Proc. Eighth Int'l Conf. Database and Expert Systems Applications (DEXA '97), pp. 347-356, Sept. 1997.
[17] M. Karlsson and C. Karamanolis, “Choosing Replica Placement Heuristics for Wide-Area Systems,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 350-359, Mar. 2004.
[18] B. Kemme and G. Alonso, “A New Approach to Developing and Implementing Eager Database Replication Protocols,” ACM Trans. Database Systems, vol. 25, no. 3, pp. 333-379, 2000.
[19] W. Lin and B. Veeravalli, “An Adaptive Object Allocation and Replication Algorithm in Distributed Databases,” Proc. 23rd Int'l Conf. Distributed Computing Systems Workshops (ICDCSW '03), pp. 132-137, 2003.
[20] S. March and S. Rho, “Allocating Data and Operations to Nodes in Distributed Database Design,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 2, pp. 305-317, 1995.
[21] A. Mei, L. Mancini, and S. Jajodia, “Secure Dynamic Fragment and Replica Allocation in Large-Scale Distributed File Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 9, pp. 885-896, Sept. 2003.
[22] S. Navathe, S. Ceri, G. Weiderhold, and J. Dou, “Vertical Partitioning Algorithms for Database Design,” ACM Trans. Database Systems, vol. 9, no. 4, pp. 680-710, Dec. 1984.
[23] M. Özsu and P. Valduriez, Principles of Distributed Database Systems, Englewood Cliffs, N.J.: Prentice Hall, second ed. 1999.
[24] S. Ram and R. Marsten, “A Model for Database Allocation Incorporating a Concurrency Control Mechanism,” IEEE Trans. Knowledge and Data Eng., vol. 3, no. 3, pp. 389-395, 1991.
[25] S. Ram and S. Narasimhan, “Database Allocation in a Distributed Environment: Incorporating a Concurrency Control Mechanism and Queuing Costs,” Management Science, vol. 40, no. 8, pp. 969-983, 1994.
[26] R. Sarathy, B. Shetty, and A. Sen, “A Constrained Nonlinear 0-1 Program for Data Allocation,” European J. Operational Research, vol. 102, pp. 626-647, 1997.
[27] D. Shin and K. Irani, “Fragmenting Relations Horizontally Using a Knowledge-Based Approach,” IEEE Trans. Software Eng., vol. 17, pp. 872-883, Sept. 1991.
[28] T. Stöhr, H. Märtens, and R. Rahm, “Multi-Dimensional Database Allocation for Parallel Data Warehouses,” Proc. 26th Int'l Conf. Very Large Data Bases, pp. 273-284, 2000.
[29] A. Tamhankar and S. Ram, “Database Fragmentation and Allocation: An Integrated Methodology and Case Study,” IEEE Trans. Systems, Man and Cybernetics— Part A, vol. 28, no. 3, May 1998.
[30] O. Wolfson, S. Jajodia, and Y. Huang, “An Adaptive Data Replication Algorithm,” ACM Trans. Database Systems, vol. 22, no. 2, pp. 255-314, 1997.
[31] L. Zhuo, C. Wang, and F. Lau, “Document Replication and Distribution in Extensible Geographically Distributed Web Server,” J. Parallel and Distributed Computing, vol. 63, no. 10, pp. 927-944, 2003.

Index Terms:
Distributed databases, nonredundant allocation, reformulation.
Citation:
Syam Menon, "Allocating Fragments in Distributed Databases," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 7, pp. 577-585, July 2005, doi:10.1109/TPDS.2005.77
Usage of this product signifies your acceptance of the Terms of Use.