Divergence caching in client-server architectures
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 131-139
- https://doi.org/10.1109/pdis.1994.331723
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Replication and mobilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A competitive dynamic data replication algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The case for controlled inconsistency in replicated dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data replication for mobile computersPublished by Association for Computing Machinery (ACM) ,1994
- Data caching tradeoffs in client-server DBMS architecturesPublished by Association for Computing Machinery (ACM) ,1991
- Coda: a highly available file system for a distributed workstation environmentIEEE Transactions on Computers, 1990
- Memory coherence in shared virtual memory systemsACM Transactions on Computer Systems, 1989
- Competitive snoopy cachingAlgorithmica, 1988
- Caching Hints in Distributed SystemsIEEE Transactions on Software Engineering, 1987
- A snapshot differential refresh algorithmACM SIGMOD Record, 1986