Skip to main content

Collaborative Cache Based on Path Scores

  • Conference paper
  • 1138 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4831))

Abstract

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 algorithm without additional messages. Our simulation experiments show that considering redundancy scores can drastically reduce distributed query execution costs.

This work was funded by the French national research grant ACI MD SemWeb.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Bonifati, A., Cobena, G., Manolescu, I., Milo, T.: Dynamic XML Documents with Distribution and Replication. In: SIGMOD, pp. 527–538 (2003)

    Google Scholar 

  2. Amiri, K., Park, S., Tewari, R., Padmanabhan, S.: DBProxy: A dynamic data cache for Web applications.. In: ICDE, pp. 821–831 (2003)

    Google Scholar 

  3. Bestavros, A., Jin, S.: Popularity-Aware Greedy Dual-Size Web Proxy Caching Algorithms. In: ICDCS. Proc. Intl. Conf. on Distributed Computing Systems, pp. 254–261 (2000)

    Google Scholar 

  4. Bornhövd, C., Altinel, M., Krishnamurthy, S., Mohan, C., Pirahesh, H., Reinwald, B.: DBCache: Middle-tier Database Caching for Highly Scalable e-Business Architectures. In: SIGMOD, p. 662 (2003)

    Google Scholar 

  5. Cao, P., Irani, S.: Cost-Aware WWW Proxy Caching Algorithms. In: USENIX Symposium on Internet Technologies and Systems (1997)

    Google Scholar 

  6. Chen, L., Rundensteiner, E.A.: ACE-XQ: A CachE-aware XQuery Answering System. In: WebDB. Proc. Intl. Workshop on the Web and Databases, pp. 31–36 (June 2002)

    Google Scholar 

  7. Constantin, C., Amann, B., Gross-Amblard, D.: A Link-Based Ranking Model for Services. In: CoopIS. Proc. Intl. Conf. on Cooperative Information Systems (2006)

    Google Scholar 

  8. Gribble, S.D., Halevy, A.Y., Ives, Z.G., Rodrig, M., Suciu, D.: What Can Database Do for Peer-to-Peer?. In: WebDB. Proc. Intl. Workshop on the Web and Databases, pp. 31–36 (2001)

    Google Scholar 

  9. Iyer, S., Rowstron, A.I.T., Druschel, P.: Squirrel: a Decentralized Peer-to-Peer Web Cache. In: ACM Intl. Symp. on Principles of Distributed Computing (PODC), pp. 213–222 (2002)

    Google Scholar 

  10. Jin, S., Bestavros, A.: GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams. Computer Communications 24(2), 174–183 (2001)

    Article  Google Scholar 

  11. Kalnis, P., Ng, W.S., Ooi, B.C., Papadias, D., Tan, K.-L.: An Adaptive Peer-to-Peer Network for Distributed Caching of OLAP Results. In: SIGMOD, pp. 480–497 (2002)

    Google Scholar 

  12. Korupolu, M.R., Dahlin, M.: Coordinated Placement and Replacement for Large-Scale Distributed Caches. TKDE 14(6), 1317–1329 (2002)

    Google Scholar 

  13. Ng, W.S., Ooi, B.C., Tan, K.-L., Zhou, A.: PeerDB: A P2P-based System for Distributed Data Sharing. In: ICDE, pp. 633–644 (2003)

    Google Scholar 

  14. Olston, C., Widom, J.: Best-Effort Cache Synchronization with Source Cooperation. In: SIGMOD, pp. 73–84 (2002)

    Google Scholar 

  15. Podlipnig, S., Böszörményi, L.: A survey of web cache replacement strategies. ACM Comput. Surv. 35(4), 374–398 (2003)

    Article  Google Scholar 

  16. Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability (February 2001), http://www.cs.cmu.edu/~kunwadee/research/p2p/gnutella.html

  17. Tsoumakos, D., Roussopoulos, N.: An Adaptive Probabilistic Replication Method for Unstructured P2P Networks. In: CoopIS. Proc. Intl. Conf. on Cooperative Information Systems, pp. 480–497 (2006)

    Google Scholar 

  18. Xiao, L., Zhang, X., Andrzejak, A., Chen, S.: Building a Large and Efficient Hybrid Peer-to-Peer Internet Caching System. TKDE 16(6), 754–769 (2004)

    Google Scholar 

  19. Young, N.E.: On-line caching as cache size varies. In: SODA. Proc. of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 241–250 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Boualem Benatallah Fabio Casati Dimitrios Georgakopoulos Claudio Bartolini Wasim Sadiq Claude Godart

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amann, B., Constantin, C. (2007). Collaborative Cache Based on Path Scores. In: Benatallah, B., Casati, F., Georgakopoulos, D., Bartolini, C., Sadiq, W., Godart, C. (eds) Web Information Systems Engineering – WISE 2007. WISE 2007. Lecture Notes in Computer Science, vol 4831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76993-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76993-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76992-7

  • Online ISBN: 978-3-540-76993-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics