Partitioned data objects in distributed databases

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.

[1]  Rafael Alonso,et al.  Data caching issues in an information retrieval system , 1990, TODS.

[2]  Alexander Thomasian,et al.  Token allocation in distributed systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[3]  Hector Garcia-Molina,et al.  The Demarcation Protocol: A Technique for Maintaining Linear Arithmetic Constraints in Distributed Database Systems , 1992, EDBT.

[4]  Akhil Kumar.  An analysis of borrowing policies for escrow transactions in a replicated data environment , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[5]  Lui Sha,et al.  Modular Concurrency Control and Failure Recovery , 1988, IEEE Trans. Computers.

[6]  Panos K. Chrysanthis,et al.  ACTA: a framework for specifying and reasoning about transaction structure and behavior , 1990, SIGMOD '90.

[7]  Gustavo Alonso,et al.  A Unified Approach to Concurrency Control and Transaction Recovery (Extended Abstract) , 1994, EDBT.

[8]  Vassos Hadzilacos,et al.  A theory of reliability in database systems , 1988, JACM.

[9]  Hans-Jörg Schek,et al.  Towards a unified theory of concurrency control and recovery , 1993, PODS.

[10]  Arthur J. Bernstein,et al.  High Throughput Escrow Algorithms for Replicated Databases , 1992, VLDB.

[11]  Gérard Roucairol,et al.  On the distribution of an assertion , 1982, PODC '82.

[12]  Abraham Silberschatz,et al.  Data-valued partitioning and virtual messages (extended abstract) , 1990, PODS.

[13]  Patrick E. O'Neil,et al.  The Escrow transactional method , 1986, TODS.

[14]  Michael Stonebraker,et al.  Semantics based transaction management techniques for replicated data , 1988, SIGMOD '88.

[15]  Abraham Silberschatz,et al.  Data-valued partitioning and virtual messages (extended abstract) , 1990, PODS '90.