Demonstrating Blank Node Matching and RDF/S Comparison Functions
Christina Lantzaki, Yannis Tzitzikas, Dimitris Zeginis · 2013
Bases (for short KBs) is important for aiding humans to understand the evolution of knowledge, and for reducing the amount of data that need to be exchanged and managed over the network in order to build SW synchronization, versioning and replication services [2, 3, 1, 8, 6]. A rather peculiar but quite flexible feature of RDF is that it allows the representation of blank nodes: a blank node (or anonymous resource or bnode) is a node in an RDF graph which is not identified by a URI and is not a literal. Several KBs rely heavily on blank nodes as they are convenient for representing complex attributes (e.g. an attribute address) without having to name explicitly the auxiliary node that connects together the values that constitute the complex value (e.g. the particular street, number and postal code values). Bnodes are also convenient for resources whose identity is unknown but their attributes (either literals or associations with other resources) are known. According to [4], blank nodes is an inevitable reality, e.g. the data fetched from the “hi5.com” domain consist of 87.5 % of blank nodes.