ISSN:
1573-7578
Keywords:
Partitioned data
;
distributed databases
;
concurrency control
;
recovery
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract In many distributed databases “locality of reference” is crucial to achieve acceptable performance. However, the purpose of data distribution is to spread the data among several remote sites. One way to solve this contradiction is to use partitioned data techniques. Instead of accessing the entire data, a site works on a fraction that is made locally available, thereby increasing the site's autonomy. We present a theory of partitioned data that formalizes the concept and establishes the basis to develop a correctness criterion and a concurrency control protocol for partitioned databases. Set-serializability is proposed as a correctness criterion and we suggest an implementation that integrates partitioned and non-partitioned data. To complete this study, the policies required in a real implementation are also analyzed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01263655
Permalink
