Replicated Data Management in Mobile Environments: Anything New Under the Sun?

1 Replicated Data Management in Mobile Environments: Anything New Under the Sun? Daniel Barbar a-Mill a a and Hector Garcia-Molina b a M.I.T.L. 2 Research Way, Princeton, N.J. 08540. USA b Stanford University Department of Computer Science Stanford, CA 94305. USA The mobile wireless computing environment of the future will contain large numbers of low powered palmtop machines. In a mobile environment it is important to have dynamic replicated data management algorithms that allow for instance copies to migrate from one site to another or for new copies to be generated. In this paper we show that such dynamic algorithms can be obtained simply by letting transaction update the directory that specifies sites holding copies. Thus we argue that no fundamentally new algorithms are needed to cope with mobility. However, exisiting algorithms may have to be "tuned" for a mobile environment, and we discuss what this may entail. 1. Introduction The mobile wireless computing environment of the future [13] will contain large numbers of low powered palmtop machines, querying databases over wireless channels. The units will often be disconnected due to power limitations, inaccessible communication channels, or as units move between different cells. The ability to replicate data objects in such an environment will be essential. Object copies are the key to high data availability: when a unit is disconnected it can continue to process objects stored locally. At the same time, replicated data can improve performance: a copy at a nearby or less congested site can be accessed. Thus, we expect copies to be common both on mobile units as well as on the servers they interact with; these copies will be dynamically created, updated, and destroyed in the course of the system's operation. There are two fundamental problems related to replicated data in a mobile environment: How to manage the replicated data, providing the levels of consistency, durability and availability needed. How to loc

[1]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[2]  Michael Hammer,et al.  Reliability mechanisms for SDD-1: a system for distributed databases , 1980, TODS.

[3]  Hector Garcia-Molina,et al.  How Expensive is Data Replication? An Example , 1982, ICDCS.

[4]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[5]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[6]  Alfred Z. Spector,et al.  An algorithm, for replicated directories , 1983, PODC '83.

[7]  Michael Stonebraker,et al.  A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.

[8]  Amr El Abbadi,et al.  Availability in partitioned replicated databases , 1985, PODS.

[9]  Walter A. Burkhard,et al.  Consistency and recovery control for replicated files , 1985, SOSP '85.

[10]  Jehan-François Pâris,et al.  Voting with Witnesses: A Constistency Scheme for Replicated Files , 1986, ICDCS.

[11]  Hector Garcia-Molina,et al.  Achieving High Availability in Distributed Databases , 1987, ICDE.

[12]  H. Garcia-Molina,et al.  Reliable distributed database management , 1987, Proceedings of the IEEE.

[13]  Maurice Herlihy,et al.  Dynamic quorum adjustment for partitioned data , 1987, TODS.

[14]  Sushil Jajodia,et al.  Dynamic voting , 1987, SIGMOD '87.

[15]  Sushil Jajodia,et al.  Enhancements to the Voting Algorithm , 1987, VLDB.

[16]  Sushil Jajodia,et al.  Integrating static and dynamic voting protocols to enhance file availability , 1988, Proceedings. Fourth International Conference on Data Engineering.

[17]  Henry F. Korth,et al.  Formal model of correctness without serializabilty , 1988, SIGMOD '88.

[18]  Susan B. Davidson.  Replicated data and partition failures , 1990 .

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

[20]  Calton Pu,et al.  An analysis of replica control , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

[21]  Sushil Jajodia,et al.  Distributed algorithms for dynamic replication of data , 1992, PODS.

[22]  Tomasz Imielinski,et al.  Querying in Highly Mobile Distributed Environments , 1992, VLDB.

[23]  Tomasz Imielinski,et al.  Replication and mobility , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

[24]  Donald D. Chamberlin,et al.  Dynamic Data Distribution (D3) in a Shared-Nothing Multiprocessor Data Store , 1992, VLDB.

[25]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.