A small-world network model for distributed storage of semantic metadata

Authors:
A. Leist;K. A. Hawick
Affiliations:
Massey University, Albany, Auckland, New Zealand;Massey University, Albany, Auckland, New Zealand
Venue:
AusGrid '09 Proceedings of the Seventh Australasian Symposium on Grid Computing and e-Research - Volume 99
Year:
2009

Citing 6
Cited 0

Small worlds: the dynamics of networks between order and randomness

Small worlds: the dynamics of networks between order and randomness
Nexus: Small Worlds and the Groundbreaking Theory of Networks

Nexus: Small Worlds and the Groundbreaking Theory of Networks
Simulating a computational grid with networked animat agents

ACSW Frontiers '06 Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54
The Semantic Web Revisited

IEEE Intelligent Systems
Accelerating large graph algorithms on the GPU using CUDA

HiPC'07 Proceedings of the 14th international conference on High performance computing
Evaluating conjunctive triple pattern queries over large structured overlay networks

ISWC'06 Proceedings of the 5th international conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

The growing uptake of semantic web and grid ideas is raising the importance of optimising distribution algorithms for semantic metadata. While it is not yet clear how real-world metadata distribution patterns ought to evolve, practical experience of social and technical networks suggests that a small-world pattern is desirable and practical. We explore simulated small-world networks of semantic metadata and some graph parameters and metrics. We discuss the implications of inter- and intra-domain path lengths for semantic queries on web and grid structures.