Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home

Technical Reports

printable version

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

  Click here for full text: PDF

The case for generating URIs by hashing RDF content

Sayers, Craig; Eshghi, Kave


Keyword(s): RDF; URI; hash; semantic web; hashed URI; hashed references

Abstract: In this paper we argue for using hashed URIs to represent RDF content. These URIs are generated by serializing the RDF facts which describe an Object, computing the hash of that serialization, and then using the computed hash as the Object's URI. In this way, the hashed URI serves both as a short-hand notation for all the facts which describe it and as proof that the facts have not changed. This is particularly advantageous for distributed systems since it guarantees consistency while removing any need to trust the underlying storage. If you receive a URI, and later ask for the facts about that URI, you can prove that the returned facts exactly match those which existed at the time the URI was created. Notes:

13 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.