Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Distributed Object Based Design: Vertical Fragmentation of Classes
Distributed and Parallel Databases
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
A Vertical Partitioning Algorithm for Relational Databases
Proceedings of the Third International Conference on Data Engineering
A Cost Model for Clustered Object-Oriented Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Cost-Driven Evaluation of Vertical Class Partitioning in Object-Oriented Databases
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Partitioning schemes for object oriented databases
RIDE '95 Proceedings of the 5th International Workshop on Research Issues in Data Engineering-Distributed Object Management (RIDE-DOM'95)
Method-induced partitioning schemes for object-oriented databases
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Cost-driven vertical class partitioning for methods in object oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
Cost-driven vertical class partitioning for methods in object oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
DYMOND: an active system for dynamic vertical partitioning of multimedia databases
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.00 |
Vertical partitioning is a design technique for reducing the number of disk accesses to execute a given set of queries by minimizing the number of irrelevant instance variables accessed. This is accomplished by grouping the frequently accessed instance variables as vertical class fragments. The complexity of object-oriented database models due to subclass hierarchy and class composition hierarchy complicates the definition and representation of vertical partitioning of the classes, which makes the problem of vertical partitioning in OODBs very challenging. In this paper, we develop a comprehensive analytical cost model for processing of queries on vertically partitioned OODB classes. A set of analytical evaluation results is presented to show the effect of vertical partitioning, and to study the trade-off between the projection ratio versus selectivity factor vis-a-vis sequential versus index access. Furthermore, an empirical experimental prototype supporting vertical class partitioning has been implemented on a commercial OODB tool kit to validate our analytical cost model.