Removing the redundancy from distributed semantic web data

Authors:
Ahmad Ali Iqbal;Maximilian Ott;Aruna Seneviratne
Affiliations:
School of EE&T, University of New South Wales, Australia and National Information and Communication Technology Australia;National Information and Communication Technology Australia;School of EE&T, University of New South Wales, Australia and National Information and Communication Technology Australia
Venue:
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Year:
2010

Citing 6
Cited 1

Summary cache: a scalable wide-area web cache sharing protocol

IEEE/ACM Transactions on Networking (TON)
Relevant document distribution estimation method for resource selection

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
AmbientDB: P2P Data Management Middleware for Ambient Intelligence

PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Less hashing, same performance: building a better bloom filter

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Resource Selection from Distributed Semantic Web Stores

NSS '10 Proceedings of the 2010 Fourth International Conference on Network and System Security
XPeer: a self-organizing XML P2P database system

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Is comprehension useful for mobile semantic search engines?

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

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.