Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A fine-grained replacement strategy for XML query cache
Proceedings of the 4th international workshop on Web information and data management
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Cache-and-query for wide area sensor databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Distributed Evaluation of Network Directory Queries
IEEE Transactions on Knowledge and Data Engineering
XPath lookup queries in P2P networks
Proceedings of the 6th annual ACM international workshop on Web information and data management
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A framework for using materialized XPath views in XML query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient processing of XPath queries with structured overlay networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Semantic caching for pervasive grids
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Cache sémantique pour grilles pervasives
Proceedings of the 5th French-Speaking Conference on Mobility and Ubiquity Computing
Multiple query scheduling for distributed semantic caches
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Cooperative caching versus proactive replication for location dependent request patterns
Journal of Network and Computer Applications
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
ViP2P: efficient XML management in DHT networks
ICWE'12 Proceedings of the 12th international conference on Web Engineering
Cooperative database caching within cloud environments
AIMS'12 Proceedings of the 6th IFIP WG 6.6 international autonomous infrastructure, management, and security conference on Dependable Networks and Services
Optimized data management for e-learning in the clouds towards Cloodle
Proceedings of the Fourth Symposium on Information and Communication Technology
Hi-index | 0.00 |
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharing cache content among a number of peers. To facilitate sharing, a distributed prefix-based index is built based on the queries whose results are cached. In the loosely-coupled sharing approach, each peer stores in its local cache results of its own queries and just publishes the associated queries to the index. In the tightly-coupled approach, each peer is assigned a specific part of the query space and stores in its local cache the results of the corresponding queries. Both approaches result in a dynamic organization of content that evolves over time based on the query load, the number of peers and the overall storage available. We present a number of associated design choices such as using a DHT for distributing the prefix-based index and a proactive cache replacement policy. We also report on a number of experiments that show the benefits of cooperative caching and highlight the pros and cons of loosely and tightly coupled cache sharing.