Skip to main content

Removing the Redundancy from Distributed Semantic Web Data

  • Conference paper
Database and Expert Systems Applications (DEXA 2010)

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

Included in the following conference series:

Abstract

Peer-to-peer databases have proven to be an effective way for sharing data. However, distributed knowledge management in P2P databases brings a variety of non-trivial challenges along with its benefits. Such challenges include determining the right content provider(s) and removing the duplicate data transfer if a relatively larger portion of data is redundant and is made available in distributed providers. The aim of this paper is to address data redundancy removal problem such that excessive bandwidth usage due to in-network duplicate data transfer can be minimized. We provide analytical and experimental evaluation of our schemes in terms of the number and size of the packets that flow in the network while keeping confidence level of results high.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Broder, A., Mitzenmacher, M.: Network applications of bloom filter: A survey. Internet Mathematics I(4), 485–509 (2003)

    MathSciNet  Google Scholar 

  2. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. IEEE Transactions on Networks 8(3) (2000)

    Google Scholar 

  3. Fontijn, W., Boncz, P.: Ambientdb: P2p data management middleware for ambient intelligence. In: PERCOMW’04, USA (2004)

    Google Scholar 

  4. Haase, P., Siebes, R., Harmelen, F.: Peer selection in peer-to-peer networks with semantic topologies. In: International Conference on Semantics of a Networked World: Semantics for Grid Databases (2004)

    Google Scholar 

  5. Iqbal, A., Ott, M., Seneviratne, A.: Resource selection from distributed semantic web stores. In: Int. Conf. on Data and Knowledge Engineering (2010)

    Google Scholar 

  6. Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better bloom filter. In: European Symposium on Algorithms (2006)

    Google Scholar 

  7. Sartiani, C., Manghi, P., Ghelli, G., Conforti, G.: Xpeer: A self-organizing xml p2p database system. In: Workshop on P2P and Databases (2004)

    Google Scholar 

  8. Si, L., Callan, J.: Relevant document distribution estimation method for resource selection (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iqbal, A.A., Ott, M., Seneviratne, A. (2010). Removing the Redundancy from Distributed Semantic Web Data. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15364-8_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15364-8_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15363-1

  • Online ISBN: 978-3-642-15364-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics