Removing the Redundancy from Distributed Semantic Web Data

  • Ahmad Ali Iqbal
  • Maximilian Ott
  • Aruna Seneviratne
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6261)


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.


Resource Description Framework Average Response Time Resource Selection Information Receiver False Positive Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Broder, A., Mitzenmacher, M.: Network applications of bloom filter: A survey. Internet Mathematics I(4), 485–509 (2003)MathSciNetGoogle Scholar
  2. 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. 3.
    Fontijn, W., Boncz, P.: Ambientdb: P2p data management middleware for ambient intelligence. In: PERCOMW’04, USA (2004)Google Scholar
  4. 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. 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. 6.
    Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better bloom filter. In: European Symposium on Algorithms (2006)Google Scholar
  7. 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. 8.
    Si, L., Callan, J.: Relevant document distribution estimation method for resource selection (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ahmad Ali Iqbal
    • 1
    • 2
  • Maximilian Ott
    • 2
  • Aruna Seneviratne
    • 1
    • 2
  1. 1.School of EE&TUniversity of New South Wales (UNSW)Australia
  2. 2.National Information and Communication Technology Australia (NICTA) 

Personalised recommendations