PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Meghini C., Thanos C. The complexity of operations on a fragmented relation. In: ACM Transactions on Database Systems, vol. 16 (1) pp. 56 - 87. ACM, 1991.
 
 
Abstract
(English)
Data fragmentation is an important aspect of distributed database design, in which portions of relations, tailored to the specific needs of local applications, are defined to be further allocated to the sites of the computer network supporting the database system. In this paper we present a theory of fragmentation with overlapping fragments to study the complexity of the problems involved in checking the completeness of a fragmentation schema and in querying and updating a fragmented relation. We analyze these problems from the complexity viewpoint and present sound and complete algorithms for their solution.
Subject Completeness of fragmentation schemas
NP-hardness
Query optimitazion
Relation fragmentation
Updates
Algorithms
Complexity
H.2.4 Database Management : Systems


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional