The University of Southampton
University of Southampton Institutional Repository

A Semantic Search Algorithm for Peer-to-Peer Open Hypermedia Systems

A Semantic Search Algorithm for Peer-to-Peer Open Hypermedia Systems
A Semantic Search Algorithm for Peer-to-Peer Open Hypermedia Systems
We consider a collaborative application scenario in Open Hypermedia Systems. We describe a semantic search algorithm to discover semantically equivalent or related resources across distributed link databases, otherwise known as linkbases. Our approach differs from traditional crawler based search mechanisms because it relies on clustering of semantically related entities. It creates clusters of related semantic entities to expedite the search for resources in a random network. It uses a distance-vector based heuristic to guide the search. Our results confirm that the algorithm yields high search efficiency in collaborative environments where the change in content published by each participant is rapid and random.
open hypermedia, peer-to-peer, search mechanism, simulation
43-54
Zhou, J
0260c404-9f19-40d6-b577-e241dd0c1ab9
Dialani, V
b3a67fa7-6383-4490-851a-90e41f089f7c
De Roure, D
02879140-3508-4db9-a7f4-d114421375da
Hall, W
11f7f8db-854c-4481-b1ae-721a51d8790c
Zhou, J
0260c404-9f19-40d6-b577-e241dd0c1ab9
Dialani, V
b3a67fa7-6383-4490-851a-90e41f089f7c
De Roure, D
02879140-3508-4db9-a7f4-d114421375da
Hall, W
11f7f8db-854c-4481-b1ae-721a51d8790c

Zhou, J, Dialani, V, De Roure, D and Hall, W (2003) A Semantic Search Algorithm for Peer-to-Peer Open Hypermedia Systems. The First Workshop on Semantics in Peer-to-Peer and Grid Computing, Hungary. pp. 43-54 .

Record type: Conference or Workshop Item (Paper)

Abstract

We consider a collaborative application scenario in Open Hypermedia Systems. We describe a semantic search algorithm to discover semantically equivalent or related resources across distributed link databases, otherwise known as linkbases. Our approach differs from traditional crawler based search mechanisms because it relies on clustering of semantically related entities. It creates clusters of related semantic entities to expedite the search for resources in a random network. It uses a distance-vector based heuristic to guide the search. Our results confirm that the algorithm yields high search efficiency in collaborative environments where the change in content published by each participant is rapid and random.

Text
sm.pdf - Other
Download (143kB)

More information

Published date: 2003
Additional Information: Event Dates: 20 May, 2003
Venue - Dates: The First Workshop on Semantics in Peer-to-Peer and Grid Computing, Hungary, 2003-05-20
Keywords: open hypermedia, peer-to-peer, search mechanism, simulation
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 259410
URI: http://eprints.soton.ac.uk/id/eprint/259410
PURE UUID: c7bd011a-4fcc-440e-b1b4-fd16aec0b6d3
ORCID for D De Roure: ORCID iD orcid.org/0000-0001-9074-3016
ORCID for W Hall: ORCID iD orcid.org/0000-0003-4327-7811

Catalogue record

Date deposited: 04 Jun 2004
Last modified: 03 Dec 2019 02:08

Export record

Contributors

Author: J Zhou
Author: V Dialani
Author: D De Roure ORCID iD
Author: W Hall ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×