A non-factorial algorithm for canonical numbering of a graph
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Journal of Automated Reasoning
Sindice.com: a document-oriented lookup index for open linked data
International Journal of Metadata, Semantics and Ontologies
RDFSync: efficient remote synchronization of RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Characterizing the semantic web on the web
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
An efficient algorithm to compute subsets of points in ℤn
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
A continuous analog for 4-dimensional objects
Annals of Mathematics and Artificial Intelligence
Towards a framework for iteratively signing graph data
Proceedings of the seventh international conference on Knowledge capture
| Hi-index | 0.00 |
This paper presents a hash and a canonicalization algorithm for Notation 3 (N3) and Resource Description Framework (RDF) graphs. The hash algorithm produces, given a graph, a hash value such that the same value would be obtained from any other equivalent graph. Contrary to previous related work, it is well-suited for graphs with blank nodes, variables and subgraphs. The canonicalization algorithm outputs a canonical serialization of a given graph (i.e. a canonical representative of the set of all the graphs that are equivalent to it). Potential applications of these algorithms include, among others, checking graphs for identity, computing differences between graphs and graph synchronization. The former could be especially useful for crawlers that gather RDF/N3 data from the Web, to avoid processing several times graphs that are equivalent. Both algorithms have been evaluated on a big dataset, with more than 29 million triples and several millions of subgraphs and variables.