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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Learning Algorithms for Keyphrase Extraction
Information Retrieval
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
MINERVA: collaborative P2P search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concept Index for Document Retrieval with Peer-to-Peer Network
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
AlvisP2P: scalable peer-to-peer text retrieval in a structured P2P network
Proceedings of the VLDB Endowment
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Discovering Missing Background Knowledge in Ontology Matching
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Web Semantics: Science, Services and Agents on the World Wide Web
Encoding classifications into lightweight ontologies
Journal on data semantics VIII
From web directories to ontologies: natural language processing challenges
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Semantic matching: algorithms and implementation
Journal on data semantics IX
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Formalizing the get-specific document classification algorithm
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
Hi-index | 0.00 |
Classifications are trees where links between nodes codify the fact that a node lower in the hierarchy describes a topic (and contains documents about this topic) which is more specific than the topic of the node one level above. In turn, multiple classifications can be connected by semantic links which represent mappings among them and which can be computed, e.g. by ontology matching. In this paper, we describe how these two types of links can be used to define a semantic overlay network which can cover any number of peers and which can be flooded to perform a semantic search on documents, i.e. to perform semantic flooding. We have evaluated our approach by simulating networks of 10, 100, 1,000 and 10,000 peers containing classifications which are fragments of the DMoz web directory. The results are promising and show that, in our approach, only a relatively small number of peers needs to be queried in order to achieve high accuracy.