On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An adaptive peer-to-peer network for distributed caching of OLAP results
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Best-effort cache synchronization with source cooperation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Coordinated Placement and Replacement for Large-Scale Distributed Caches
IEEE Transactions on Knowledge and Data Engineering
Popularity-Aware Greedy Dual-Size Web Proxy Caching Algorithms
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
DBCache: middle-tier database caching for highly scalable e-business architectures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Building a Large and Efficient Hybrid Peer-to-Peer Internet Caching System
IEEE Transactions on Knowledge and Data Engineering
A link-based ranking model for services
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
An adaptive probabilistic replication method for unstructured p2p networks
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Usage-based ranking of distributed XML data
Proceedings of the 2008 ACM symposium on Applied computing
| Hi-index | 0.00 |
Large-scale distributed data integration systems have to deal with important query processing costs which are essentially due to the high communication overload between data peers. Caching techniques can drastically reduce processing and communication cost.We propose a new distributed caching strategy that reduces redundant caching decisions of individual peers. We estimate cache redundancy by a distributed algorithmwithout additionalmessages. Our simulation experiments show that considering redundancy scores can drastically reduce distributed query execution costs.