A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems

1. P.M.G. Apers, “Data allocation in distributed database system,” ACMTransactions on Database Systems, vol. 13, no. 4, pp. 263–304, 1988.

   Google Scholar 

2. S.R. Arora and A. Gallo, “Optimization of static loading and sizing of multilevel memory systems,” Journal of ACM, vol. 20, no. 2, pp. 307–319, 1973.

   Google Scholar 

3. K. Barker and S. Bhar, “Using simulated annealing to place class fragments in distributed objectbase systems,” (under revision for) Journal of Heuristics, Kluwer Academic Publishers.

4. L. Bellatreche, K. Karlapalem, and Q. Li, “Complex methods and clas allocation in distributed object oriented databases,” in The Fifth International Conference on Object Oriented Information Systems, 1998.

5. S. Bhar, “Allocation of class fragments in distributed objectbase systems,” Ph. D. Dissertation, Department of Computer Science, University of Manitoba: Winnipeg, 1996, p. 124.

   Google Scholar 

6. J.P. Buzen, Queuing Network Models of Multiprogramming, Harvard University: Cambridge, MA, 1971.

   Google Scholar 

7. R.G. Casey, “Allocation of copies of a file in an information network,” in Proceedings of AFIPS Spring Joint Computer Conference, 1972.

8. S. Ceri, S. Navathe, and S. Wiederhold, “Distribution design of logical database schemas,” IEEE Transactions on Software Engineering, vol. SE-9, 1983.

9. S. Ceri and G. Pelagatti, Distributed Databases: Principles and Systems, McGraw Hill: New York, pp. 68–90, 1984.

   Google Scholar 

10. K.M. Chandy and J.E. Hewes, “File allocation in distributed systems,” in International Symposium on Computer Performance Modeling, Measurement and Evaluation, 1976.

11. P.P.-S. Chen, “Optimal file allocation in multilevel storage systems,” in Proceedings of AFIPS National Computer Conference, 1973.

12. P.P.-S. Chen and J. Akoka, “Optimal design of distributed information systems,” IEEE Transactions on Computers, vol. C-29, no. 12, pp. 1068–1080, 1980.

    Google Scholar 

13. G.-M. Chiu and C.S. Raghavendra, “A model for optimal database allocation in distributed computer systems,” IEEE Computer, pp. 827–833, 1990.

14. W.W. Chu “Optimal file allocation in multiple computer system,” IEEE Transactions on Computers, vol. C18, no. 10, pp. 885–889, 1969.

    Google Scholar 

15. B. Ciciani, D.M. Dias, and P.S. Yu, “Analysis of replication in distributed database systems,” IEEETransactions on Knowledge and Data Engineering, vol. 2, no. 2, pp. 247–261, 1990.

    Google Scholar 

16. D.W. Cornell and P.S. Yu, “On optimal site assignment for relations in the distributed database environment,” IEEE Transactions on Computers, vol. 15, no. 8, pp. 1004–1009, 1989.

    Google Scholar 

17. L.W. Dowdyand D.V. Foster, “Comparative models of the file assignment problem,”ACMComputing Surveys, vol. 14, pp. 287–313, 1982.

    Google Scholar 

18. K.P. Eswaran, “Placement of records in a file and file allocation in a computer network,” in Proceedings of IFIP Congress, North-Holland: Amsterdam, 1974.

19. C.I. Ezeife and K. Barker, “Distributed object-based design: Vertical fragmentation of classes,” Distributed database systems: An International Journal, Kluwer Academic Publishers, vol. 6, no. 4, pp. 317–350, 1998.

    Google Scholar 

20. C.I. Ezeife and K. Barker, “Comprehensive approach to horizontal class fragmentation in a distributed object based system,” International Journal of Distributed and Parallel Databases, Kluwer Academic Publishers, vol. 2, 1995.

21. M.L. Fisher and D.S. Hochbaum, “Database location in computer networks,” Journal of the ACM, vol. 27, no. 4, pp. 718–735, 1980.

    Google Scholar 

22. D.V. Foster and J.C. Browne, “File assignment in memory hierarchies,” in Proceedings of Modeling and Performance Evaluation of Computer Systems, 1976.

23. D.V. Foster, L.W. Dowdy, and J.E. Ames, “File assignment in a computer network,” Computer Networks, vol. 5, pp. 341–349, 1981.

    Google Scholar 

24. B. Gavish and O.R. Liu-Sheng, “Dynamic file migration in distributed computer systems,” Communications of the ACM, vol. 33, no. 2, pp. 773–793, 1990.

    Google Scholar 

25. B. Gavish and H. Pirkul, “Computer and database location in distributed computer systems,” IEEETransactions on Computers, vol. C-35, no. 7, pp. 583–590, 1986.

    Google Scholar 

26. S. Ghandeharizadeh et al., “Object placement in parallel object oriented database systems,” in Technical Report, University of Southern California, Los Angeles, California, 1993.

    Google Scholar 

27. S. Ghandeharizadeh and D. Wilhite, “Placement of objects in parallel object-based systems,” in Proceedings of 10th IEEE International Conference on Data Engineering, 1994.

28. D. Ghosh, I. Murthy, and A. Moffett, “File allocation problem: Comparison of models with worst case and average communication delays,” Operations Research, vol. 40, no. 6, pp. 1074–1085, 1992.

    Google Scholar 

29. P.H. Hughes and G. Moe, “A structural approach to computer performance analysis,” in Proceedings of AFIPS Spring Joint Computer Conference, 1973.

30. K.B. Irani and N.G. Khabbaz, “A methodology for the design of communication networks and the distribution of data in distributed supercomputer systems,” IEEE Transactions on Computers, vol. C-31, no. 5, pp. 419–434, 1982.

    Google Scholar 

31. L.G. Jones, D.V. Foster, and P.D. Krolak, “A goal programming formulation used in the file assignment problem,” in Proceedings of R. J. Duffin Conference, 1978.

32. K. Karlapalem, S.B. Navathe, and M. Morsi, “Issues in distributed design of object-oriented databases,” in International Workshop on Distributed Object Management, 1992.

33. B.W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell System Technical Journal, pp. 291–307, 1970.

34. L. Kleinrock, Queuing Systems: Computer Applications, vol. 2, Wiley: New York, 1976.

    Google Scholar 

35. L.J. Laning and M.S. Leonard, “File allocation in a distributed computer communication network,” IEEE Transactions on Computers, vol. C-32, no. 3, 1983.

36. K.D. Levin and H.L. Morgan, “Optimal program and data locations in computer networks,” Communications of the ACM, vol. 20, no. 5, pp. 315–321, 1977.

    Google Scholar 

37. M.H. MacDougall, Simulating Computer Systems: Techniques and Tools, The MIT Press, Cambridge, MA, 1989.

    Google Scholar 

38. S. Mahmoud and J.S. Riordon, “Optimal allocation of resources in distributed information networks,” ACM Transactions on Database Systems, vol. 1, no. 1, 1976.

39. M.T. Ozsu and P. Valduriez,Principles of Distributed Database Systems, Prentice Hall: Englewood Cliff, NJ, pp. 136–144, 1991.

    Google Scholar 

40. W.F. Piepmeier, “Optimal balancing of I/O requests to disks,” Communications of ACM, vol. 18, no. 9, pp. 524–527, 1975.

    Google Scholar 

41. C.V. Ramamoorthy and K.M. Chandy, “Optimization of memory hierarchies in multiprogrammed systems,” Journal of ACM, vol. 17, no. 3, pp. 426–445, 1970.

    Google Scholar 

42. D. Sacca and G. Wiederhold, “Database partitioning in a cluster of processors,” in Proceedings of 9th International Conference on Very Large Databases, 1983.

43. B.J. Wah, “File placement on distributed computer systems,” IEEE Computer, pp. 23–32, 1984.

44. C.T. Yu et al., “File allocation in distributed databases with interaction between files,” in Proceedings of the 9th International Conference on Very Large Database, 1983.

Download references