Query-driven horizontal class partitioning for object-oriented databases
Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes.
Unable to display preview. Download preview PDF.
- 1.L. Bellatreche, K. Karlapalem, and G. K. Basak. Horizontal class partitioning for queries in object oriented databases. Technical Report HKUST-CS98-6, 1998.Google Scholar
- 3.S. Ceri, M. Negri, and G. Pelagatti. Horizontal data partitioning in database design. Proceedings of the ACM SIGMOD International Conference on Management of Data. SIGPLAN Notices, pages 128–136, 1982.Google Scholar
- 5.G. Gardarin, J.-R. Gruser, and Z.-H. Tang. A cost model for clustered object-oriented databases. VLDB, pages 323–334, 1995.Google Scholar
- 6.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
- 7.S.B. Navathe, K. Karlapalem, and M. Ra. A mixed partitioning methodology for distributed database design. Journal of Computer and Software Engineering, 3(4):395–426, 1995.Google Scholar
- 8.M. T. özsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.Google Scholar