Data.RDF.Graph.AdjHashMap

A graph implementation mapping hashed S to a mapping of hashed P to hashed O, backed by HashMap.

Documentation

data AdjHashMap

A map-based graph implementation.

This instance of RDF is an adjacency map with each subject mapping to a mapping from a predicate node to to the adjacent nodes via that predicate.

Given the following triples graph::

  (http://example.com/s1,http://example.com/p1,http://example.com/o1)
  (http://example.com/s1,http://example.com/p1,http://example.com/o2)
  (http://example.com/s1,http://example.com/p2,http://example.com/o1)
  (http://example.com/s2,http://example.com/p3,http://example.com/o3)

where

hash "http://example.com/s1" = 1600134414
hash "http://example.com/s2" = 1600134413
hash "http://example.com/p1" = 1616912099
hash "http://example.com/p2" = 1616912096
hash "http://example.com/p3" = 1616912097
hash "http://example.com/o1" = 1935686794
hash "http://example.com/o2" = 1935686793
hash "http://example.com/o3" = 1935686792

the in-memory hashmap representation of the triples graph is:

key:1600134414, value:(key:1616912099, value:[1935686794    -- (../s1,../p1,../o1)
                                             ,1935686793];  -- (../s1,../p1,../o2)
                       key:1616912096, value:[1935686794]); -- (../s1,../p2,../o1)
key:1600134413, value:(key:1616912097, value:[1935686792])  -- (../s1,../p3,../o3)

Worst-case time complexity of the graph functions, with respect to the number of triples, are:

• empty : O(1)
• mkRdf : O(n)
• triplesOf: O(n)
• select : O(n)
• query : O(log n) newtype HashS = HashS (TMaps, Maybe BaseUrl, PrefixMappings) deriving (NFData)

Instances

Generic AdjHashMap

Associated Types

type Rep AdjHashMap :: * -> *

Methods

from :: AdjHashMap -> Rep AdjHashMap x

to :: Rep AdjHashMap x -> AdjHashMap

Binary AdjHashMap

Methods

put :: AdjHashMap -> Put

get :: Get AdjHashMap

putList :: [AdjHashMap] -> Put

NFData AdjHashMap

Methods

rnf :: AdjHashMap -> ()

Rdf AdjHashMap

Methods

baseUrl :: RDF AdjHashMap -> Maybe BaseUrl

prefixMappings :: RDF AdjHashMap -> PrefixMappings

addPrefixMappings :: RDF AdjHashMap -> PrefixMappings -> Bool -> RDF AdjHashMap

empty :: RDF AdjHashMap

mkRdf :: Triples -> Maybe BaseUrl -> PrefixMappings -> RDF AdjHashMap

addTriple :: RDF AdjHashMap -> Triple -> RDF AdjHashMap

removeTriple :: RDF AdjHashMap -> Triple -> RDF AdjHashMap

triplesOf :: RDF AdjHashMap -> Triples

uniqTriplesOf :: RDF AdjHashMap -> Triples

select :: RDF AdjHashMap -> NodeSelector -> NodeSelector -> NodeSelector -> Triples

query :: RDF AdjHashMap -> Maybe Node -> Maybe Node -> Maybe Node -> Triples

showGraph :: RDF AdjHashMap -> String

Generic (RDF AdjHashMap)

Associated Types

type Rep (RDF AdjHashMap) :: * -> *

Methods

from :: RDF AdjHashMap -> Rep (RDF AdjHashMap) x

to :: Rep (RDF AdjHashMap) x -> RDF AdjHashMap

NFData (RDF AdjHashMap)

Methods

rnf :: RDF AdjHashMap -> ()

type Rep AdjHashMap

type Rep AdjHashMap = D1 * (MetaData "AdjHashMap" "Data.RDF.Graph.AdjHashMap" "rdf4h-3.0.4-HCQC390ils5CrJV2mgsNqv" False) (V1 *)

data RDF AdjHashMap

data RDF AdjHashMap = AdjHashMap (TMaps, Maybe BaseUrl, PrefixMappings)

type Rep (RDF AdjHashMap)

type Rep (RDF AdjHashMap)