Complex Methods and Class Allocation in Distributed OODBSs
In a distributed object-oriented database system (DODBS), queries which invoke methods executing at different sites and access different classes need to be executed very efficiently. Therefore, the methods invoked and classes accessed by the queries need to be allocated to sites so as to reduce the data transfer cost in processing a given set of queries. The methods and class allocation(MCA) problem needs to take into consideration complex interdependencies among queries, methods and classes. In this paper, we develop a comprehensive cost model for total data transfer incurred in processing a given set of queries by incorporating the dependencies among the queries, methods and classes. Further, we develop an iterative approach to generate near-optimal solution for the combined MCA problems by using the above cost model. In this approach, we start with an initial class allocation(CA) which is used for method allocation(MA), which in turn is used for CA, and so on. We stop this iterative MCA when there is no further reduction in total data transfer cost incurred in processing the given set of queries. We also present the results of experiments conducted to evaluate the effectiveness of our approach by comparing the results with exhaustive enumeration solution (which guarantees the optimal solution).
KeywordsMigration Shipping Lution Encapsulation Alloca
Unable to display preview. Download preview PDF.
- P. M. G. Apers . Data allocation in distributed database systems. ACM Transactions on database systems, 13(3):263–304,1988. Google Scholar
- M. Atkinson, F. Bancilhon, F. DeWitt, K. Dettrich, D. Maier, and S. Zdonik. The object database system manifesto, in Proceeding of the first International Conference on Deductive, Object-Oriented Databases, pages 40–57, 1989.Google Scholar
- E.Bertino, M. Negri, G. Pelagatti, and L. Sbattella. Object-oriented query-languages: The notion and the issues. IEEE Transactions on Knowledge and Data Engineering, 4(3):223–237,1992. Google Scholar
- S Bhar and K Barker. Static allocation in distributed objectbase systems: A graphical approach, in Proceedings of the 6th International Conference on Information System and Data Management, CISMOD’95, Lecture Notes in Computer Science 1006, pages 92–114, November 1995. Google Scholar
- P.P.-S.Chen.Optimal file allocation in multilevel storage systems, in Proceedings of AFIPS National Computer Conference, Volume 42, pages 277–282, 1973. Google Scholar
- D. W.Cornell and P. S. Yu. An optimal site assignment for relations in the distributed database environment.IEEE Transactions on Computers, 15(8):1004–1009, August 1989.Google Scholar
- K. P. Eswaran. Placement of records in a file and file allocation in a computer network. Information Processing, pages 304–307, 1974. Google Scholar
- R. Jain. The Art of Computer Systems Performance Analysis. Willy Professional Computing, 1991.Google Scholar
- K. Karlapalem, Q. Li, and S. Vieweg. Method induced partitioning schemes in object-oriented databases, in 16th International Conference on Distributed Computing System (ICDCS ’96), Hong Kong, pages 377–384, May 1996.Google Scholar
- K. Karlapalem, S.B. Navathe, and M. M. A. Morsi. Issues in distributed design of object-oriented databases. In Distributed Object Management, pages 148–165. Morgan Kaufman Publishers Inc., 1994.Google Scholar
- K.Karlapalem and N. M Pun. Query driven data allocation algorithms for distributed database systems, in 8th International Conference on Database and Expert Systems Applications (DEXA ’97), Toulouse, Lecture Notes in Computer Science 1308, pages 347–356, September 1997. Google Scholar
- C. V. Ramamoorthy and B. Wah. The placement of relations on a distributed relational database, in Proceedings of the firsth International Conference on Distributed Computing Systems, pages 642–649, September Oct 1979.Google Scholar