Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
A shared, segmented memory system for an object-oriented database
ACM Transactions on Information Systems (TOIS)
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Principles of distributed database systems
Principles of distributed database systems
Distributed and Parallel Databases
A comprehensive approach to horizontal class fragmentation in a distributed object based system
Distributed and Parallel Databases
Database Design
A Vertical Partitioning Algorithm for Relational Databases
Proceedings of the Third International Conference on Data Engineering
An Integrated Approach to Database Design
Proceedings of the NYU Symposium on Data Base Design Techniques I: Requirements and Logical Structures
A Framework for Class Partitioning in Object-Oriented Databases
Distributed and Parallel Databases
Distributed temporal video DBMS using vertical class partitioning technique
Distributed multimedia databases
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Distributed and Parallel Databases
An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
Towards a Theory Revision Approach for the Vertical Fragmentation of Object Oriented Databases
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Measuring the Performance of Database Object Horizontal Fragmentation Schemes
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Cost-driven vertical class partitioning for methods in object oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
A Distribution Design Methodology for Object DBMS
Distributed and Parallel Databases
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
A high-performance computing method for data allocation in distributed database systems
The Journal of Supercomputing
Distribution design for higher-order data models
Data & Knowledge Engineering
Workshop on multimedia information retrieval on The many faces of multimedia semantics
Query Optimisation as Part of Distribution Design for Complex Value Databases
Proceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII
Towards a novel approach to multimedia data mixed fragmentation
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
A uniform approach for selecting views and indexes in a data warehouse
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Towards multimedia fragmentation
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Scalable store of java objects using range partitioning
CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
A synchronized design technique for efficient data distribution
Computers in Human Behavior
Hi-index | 0.00 |
Processing costs in distributed environments is most oftendominated by the network communications required for interprocesscommunication. It is well known from distributed relational databasedesign research that careful placement ofdata “near” the users orprocessors where it is used is mandatory or system performance will suffer greatly. Data placement in relational database systems iscomparatively simple because the data is flat, structured, and passive.Objects are characterized by an inheritance hierarchy (other hierarchiescould also be considered including, class composition and execution),unstructured (possibly dynamic data), and contain a behavioralcomponent that defines how the “data” is accessed by encapsulatingit within the object per se. Algorithms currently exist for fragmentingrelations, but the fragmentation and allocation of objects is still a relatively untouched field of study.Similar to relations, objects can be fragmented both horizontally andvertically. Vertical fragmentation must minimize application execution time by splitting a class so that all class attributes and methodsfrequently accessed together are grouped together into a single fragment.This paper adopts a classification of classes into four main models, andcontributes by proposing algorithms for vertically fragmenting thefour realizable class models consisting of simple or complex attributes combined with simple or complex methods. Vertical fragmentation entailssplitting classes into a set of “smaller” equivalent classes (actually fragments of the class‘ extent) that can later beplaced precisely where they are used.Our approach consists of grouping into a fragment, all attributes andmethods of the class frequently accessed together by applicationsrunning on either this class, its subclasses, its containing classesor its complex method classes.