Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
A Vertical Partitioning Algorithm for Relational Databases
Proceedings of the Third International Conference on Data Engineering
A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
Vertical fragmentation in distributed object database systems with complex attributes and methods
DEXA '96 Proceedings of the 7th International Workshop on Database and Expert Systems Applications
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Distribution design for higher-order data models
Data & Knowledge Engineering
The use of cluster analysis in physical data base design
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
A Heuristic Approach to Fragmentation Incorporating Query Information
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
A heuristic approach to cost-efficient derived horizontal fragmentation of complex value databases
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
A Heuristic Approach to Fragmentation Incorporating Query Information
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
Cost-based fragmentation for distributed complex value databases
ER'07 Proceedings of the 26th international conference on Conceptual modeling
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Vertical fragmentation of XML data warehouses using frequent path sets
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Minimizing roundtrip response time in distributed databases with vertical fragmentation
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
Fragmentation and allocation are database distribution design techniques used to improve the system performance by increasing data localisation and reducing data transportation costs between different network sites. Often fragmentation and allocation are considered separately, disregarding that they are using the same input information to achieve the same objective. Vertical fragmentation is often considered a complicated problem, because the huge number of alternatives make it nearly impossible to obtain an optimal solution. Therefore, many researchers seek for heuristic solutions, among which affinity-based vertical fragmentation approaches form a main stream in the literature. However, using attribute affinities to perform fragmentation can not really reflect the local needs of data at each site. Therefore it is not guaranteed that the remote data transportation costs can be reduced. This paper addresses vertical fragmentation and allocation simultaneously in the context of the relational data model. The core of the paper is a heuristic approach to vertical fragmentation, which uses a cost model and is targeted at globally minimising these costs. Further, based on the proposed vertical fragmentation, an integrated methodology is proposed by applying vertical and horizontal fragmentation simultaneously to produce mixed fragmentation schemata.