Data Visualization White Papers
RDF Graph Digest Techniques and Potential Applications
Overview Digests are short digital abbreviations computed from original content. This paper compares existing algorithms for computing the digest of a Resource Description Framework (RDF) graph and discusses potential applications. Digest computation is complicated by blank node relabeling and statement reordering. The authors treat these separately: surveying four techniques for handling blank node identity and three algorithms for dealing with statement ordering. Graph digests are applicable to digital signatures. Other applications include verifying integrity, detecting changes, generating content-based identifiers, and improving efficiency when accessing remote stores.
| Publisher | Hewlett-Packard | File Format | |
|---|---|---|---|
| Date Published | May 2004 | Downloads | 1 |
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
