Abstract

Data can be fragmanted and replicated in a distributed database. However, in a distributed relational database, the fragmentation does not have to be restricted to a vertical or horizontal partitioning, it can be a combination of the two. Six kinds of fragmentation have been identified, and in this paper, we present a characterization of the canonical form called unbiased. Besides presenting a formal treatment of the problem, we also show that some valid designs may have to be rejected if the integrity constraints on the database are unknown or inexpressible.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call