Divergence caching in client-server architectures

Proposes a new mechanism, divergence caching, for reducing access and communication charges in accessing online database servers. The objective is achieved by allowing tolerant read requests, namely requests that can be satisfied by out-of-date data. We propose two algorithms based on divergence caching-static and dynamic. The first is appropriate when the access pattern to an object in the database is fixed and known, and the latter is appropriate in other cases. We analyze these algorithms in the worst case and the expected case.<<ETX>>

[1]  Hamid Pirahesh,et al.  A snapshot differential refresh algorithm , 1986, SIGMOD '86.

[2]  Douglas B. Terry.  Caching Hints in Distributed Systems , 1987, IEEE Transactions on Software Engineering.

[3]  Rafael Alonso,et al.  Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems , 1988, EDBT.

[4]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

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

[6]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[7]  Hector Garcia-Molina,et al.  The case for controlled inconsistency in replicated data , 1990, [1990] Proceedings. Workshop on the Management of Replicated Data.

[8]  Miron Livny,et al.  Data caching tradeoffs in client-server DBMS architectures , 1991, SIGMOD '91.

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

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

[11]  Ouri Wolfson,et al.  A competitive dynamic data replication algorithm , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[12]  A. Prasad Sistla,et al.  Data replication for mobile computers , 1994, SIGMOD '94.