Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Object-oriented concepts, databases, and applications
Object-oriented concepts, databases, and applications
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A general framework for the optimization of object-oriented queries
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Introduction to object-oriented databases
Introduction to object-oriented databases
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Optimization of object queries containing encapsulated methods
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Distributed and Parallel Databases
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Distributed Object Based Design: Vertical Fragmentation of Classes
Distributed and Parallel Databases
A Framework for Class Partitioning in Object-Oriented Databases
Distributed and Parallel Databases
Approximating block accesses in database organizations
Communications of the ACM
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
Query Optimization and Execution Plan Generation in Object-Oriented Data Management Systems
IEEE Transactions on Knowledge and Data Engineering
An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases
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)
Vertical class partitioning and complex object retrieval in object oriented databases
Vertical class partitioning and complex object retrieval in object oriented databases
An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
A vertical partitioning algorithm for distributed multimedia databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
DYMOND: an active system for dynamic vertical partitioning of multimedia databases
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Hi-index | 0.00 |
Abstract.In object-oriented databases (OODBs), a method encapsulated in a class typically accesses a few, but not all the instance variables defined in the class. It may thus be preferable to vertically partition the class for reducing irrelevant data (instance variables) accessed by the methods. Our prior work has shown that vertical class partitioning can result in a substantial decrease in the total number of disk accesses incurred for executing a set of applications, but coming up with an optimal vertical class partitioning scheme is a hard problem. In this paper, we present two algorithms for deriving optimal and near-optimal vertical class partitioning schemes. The cost-driven algorithm provides the optimal vertical class partitioning schemes by enumerating, exhaustively, all the schemes and calculating the number of disk accesses required to execute a given set of applications. For this, a cost model for executing a set of methods in an OODB system is developed. Since exhaustive enumeration is costly and only works for classes with a small number of instance variables, a hill-climbing heuristic algorithm (HCHA) is developed, which takes the solution provided by the affinity-based algorithm and improves it, thereby further reducing the total number of disk accesses incurred. We show that the HCHA algorithm provides a reasonable near-optimal vertical class partitioning scheme for executing a given set of applications.