XSaiga-1.2.0.0: Getts.hs
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
module Getts where
import Data.List
import Control.Monad
import Debug.Trace
--For endpoint query
import Data.RDF hiding (triple, Triple)
import Database.HSparql.Connection
import Database.HSparql.QueryGenerator
import Data.Text hiding (head, concat, map, zip, drop, length)
import qualified Data.Map as M
import Data.IORef
import System.IO.Unsafe
addUri namespace_uri = (namespace_uri ++)
--getts returns all triples in the triple store that match the given parameters
class TripleStore m where
getts_1 :: m -> (Event, String, String) -> IO [String]
getts_2 :: m -> (Event, String, String) -> IO [String]
getts_3 :: m -> (Event, String, String) -> IO [String]
--getts_image computes the relation [(x,e)] such that e is an event of type ev_type
--and x is a subject of that event. This is a default implementation that can be overridden
--in instances. Output is expected to be sorted. TODO: Update this
getts_image :: m -> String -> String -> IO Image
getts_image ev_data ev_type entity_type = do
evs <- getts_1 ev_data ("?", "type", ev_type)
getts_inverse ev_data entity_type evs
--getts_inverse returns the entities of entity_type of the events in the list evs
getts_inverse :: m -> String -> [Event] -> IO Image
getts_inverse ev_data entity_type evs = do
pairs <- liftM concat $ mapM (\ev -> do
ents <- getts_3 ev_data (ev, entity_type,"?")
return $ zip ents (repeat ev)) evs
return $ condense $ sortFirst pairs
--getts_members returns
getts_members :: m -> String -> IO Image
getts_members ev_data set = do
evs_with_set_as_object <- getts_1 ev_data ("?", "object", set)
evs_with_type_membership <- getts_1 ev_data ("?", "type", "membership")
getts_inverse ev_data "subject" $ intersect evs_with_set_as_object evs_with_type_membership
sortFirst = sortBy (\x y -> compare (fst x) (fst y))
type Event = String
type Triple = (Event, String, String)
type Image = [(String,[Event])]
--For the "In Program" triple store
instance TripleStore [Triple] where
getts_1 ev_data ("?", b, c) = return [x | (x,y,z) <- ev_data, b == y, c == z]
getts_2 ev_data (a, "?", c) = return [y | (x,y,z) <- ev_data, a == x, c == z]
getts_3 ev_data (a, b, "?") = return [z | (x,y,z) <- ev_data, a == x, b == y]
data SPARQLBackend = SPARQL String String deriving (Ord, Eq)
--the String in this instance is to be the endpoint that you wish to query
instance TripleStore SPARQLBackend where
--getts_1 = getts_1''
getts_1 = memoIO getts_1''
where
getts_1'' (SPARQL endpoint namespace_uri) ("?", b, c) = preprocess namespace_uri $ getts_1'(pack "?", pack (addUri namespace_uri b), pack (addUri namespace_uri c))
where
getts_1' :: (t, Text, Text) -> IO [[BindingValue]]
getts_1' (a, b, c) = do
(Just s) <- selectQuery endpoint getts_1_query
return s
where
getts_1_query = do
x <- var
triple x (iriRef b) (iriRef c)
distinct
return SelectQuery { queryVars = [x] }
--getts_2 = getts_2''
getts_2 = memoIO getts_2''
where
getts_2'' (SPARQL endpoint namespace_uri) (a, "?", c) = preprocess namespace_uri $ getts_2'(pack (addUri namespace_uri a), pack "?", pack (addUri namespace_uri c))
where
getts_2' :: (Text, Text, Text) -> IO [[BindingValue]]
getts_2' (a, b, c) = do
(Just s) <- selectQuery endpoint getts_2_query
return s
where
getts_2_query = do
x <- var
triple (iriRef a) x (iriRef c)
distinct
return SelectQuery { queryVars = [x] }
--getts_3 = getts_3''
getts_3 = memoIO getts_3''
where
getts_3'' (SPARQL endpoint namespace_uri) (a, b, "?") = preprocess namespace_uri $ getts_3'(pack (addUri namespace_uri a), pack (addUri namespace_uri b), pack "?")
where
getts_3' :: (Text, Text, Text) -> IO [[BindingValue]]
getts_3' (a, b, c) = do
(Just s) <- selectQuery endpoint getts_3_query
return s
where
getts_3_query = do
x <- var
triple (iriRef a) (iriRef b) x
distinct
return SelectQuery { queryVars = [x] }
--Efficient implementation of getts_image for SPARQL backend
getts_image = memoIO''' getts_image'''
where
getts_image''' (SPARQL endpoint namespace_uri) ev_type en_type = do
m <- selectQuery endpoint query
case m of
(Just res) -> return $ condense $ map (\[x, y] -> (removeUri namespace_uri $ deconstruct x, removeUri namespace_uri $ deconstruct y)) res
Nothing -> return []
where
query :: Query SelectQuery
query = do
sol <- prefix (pack "sol") (iriRef (pack namespace_uri))
ev <- var
subj <- var
triple ev (sol .:. (pack "type")) (sol .:. (pack ev_type))
triple ev (sol .:. (pack en_type)) subj
orderNext subj
distinct
return SelectQuery { queryVars = [subj,ev] }
--Efficient implementation of getts_inverse for SPARQL backend
getts_inverse = memoIO'' getts_inverse''
where
getts_inverse'' (SPARQL endpoint namespace_uri) en_type evs = do
m <- selectQuery endpoint query
case m of
(Just res) -> return $ condense $ map (\[x, y] -> (removeUri namespace_uri $ deconstruct x, removeUri namespace_uri $ deconstruct y)) res
Nothing -> return []
where
query = do
sol <- prefix (pack "sol") (iriRef (pack namespace_uri))
subj <- var
ev <- var
triple ev (sol .:. (pack en_type)) subj
filterExpr $ regex ev $ (pack $ Data.List.intercalate "|" (map (++ "$") evs))
--Data.List.foldr1 Database.HSparql.QueryGenerator.union $ map (\ev -> triple (sol .:. pack(ev)) (sol .:. pack("subject")) subj) evs -- UNION nesting problem
distinct
return SelectQuery { queryVars = [subj,ev] }
--Efficient implementation of getts_members for SPARQL backend
getts_members = memoIO' getts_members'
--getts_members = getts_members'
where
getts_members' (SPARQL endpoint namespace_uri) set = do
m <- selectQuery endpoint query
case m of
(Just res) -> return $ condense $ map (\[x, y] -> (removeUri namespace_uri $ deconstruct x, removeUri namespace_uri $ deconstruct y)) res
Nothing -> return []
where
query :: Query SelectQuery
query = do
sol <- prefix (pack "sol") (iriRef (pack namespace_uri))
ev <- var
subj <- var
triple ev (sol .:. (pack "type")) (sol .:. (pack "membership"))
triple ev (sol .:. (pack "subject")) subj
triple ev (sol .:. (pack "object")) (sol .:. (pack set))
orderNext subj
distinct
return SelectQuery { queryVars = [subj,ev] }
removeUri :: String -> String -> String
removeUri namespace_uri = drop $ length namespace_uri
preprocess :: String -> IO [[BindingValue]] -> IO [String]
preprocess namespace_uri bvals = bvals >>= \x -> return $ map (removeUri namespace_uri . deconstruct) $ concat x
deconstruct :: BindingValue -> String
deconstruct value = do
let (Bound node) = value
case node of
UNode strURI -> unpack strURI
LNode (PlainL strLit) -> unpack strLit
memotable :: IORef (M.Map (SPARQLBackend,(String,String,String)) [String])
memotable = unsafePerformIO $ newIORef M.empty
memoIO ::(SPARQLBackend -> (String, String, String) -> IO [String]) -> SPARQLBackend -> (String, String, String) -> IO [String]
memoIO f a x = do
m <- readIORef memotable
case M.lookup (a,x) m of
Nothing -> f a x >>= \q -> (writeIORef memotable (M.insert (a,x) q m) >> return q)
Just r -> return r
memotable' :: IORef (M.Map (SPARQLBackend,String) Image)
memotable' = unsafePerformIO $ newIORef M.empty
memoIO' ::(SPARQLBackend -> (String) -> IO Image) -> SPARQLBackend -> (String) -> IO Image
memoIO' f a x = do
m <- readIORef memotable'
case M.lookup (a,x) m of
Nothing -> f a x >>= \q -> (writeIORef memotable' (M.insert (a,x) q m) >> return q)
Just r -> return r
memotable'' :: IORef (M.Map (SPARQLBackend,String,[String]) Image)
memotable'' = unsafePerformIO $ newIORef M.empty
memoIO'' ::(SPARQLBackend -> String -> [String] -> IO Image) -> SPARQLBackend -> String -> [String] -> IO Image
memoIO'' f a x y = do
m <- readIORef memotable''
case M.lookup (a,x,y) m of
Nothing -> f a x y >>= \q -> (writeIORef memotable'' (M.insert (a,x,y) q m) >> return q)
Just r -> return r
memotable''' :: IORef (M.Map (SPARQLBackend,String,String) Image)
memotable''' = unsafePerformIO $ newIORef M.empty
memoIO''' ::(SPARQLBackend -> String -> String -> IO Image) -> SPARQLBackend -> String -> String -> IO Image
memoIO''' f a x y = do
m <- readIORef memotable'''
case M.lookup (a,x,y) m of
Nothing -> f a x y >>= \q -> (writeIORef memotable''' (M.insert (a,x,y) q m) >> return q)
Just r -> return r
--Get members of named set
get_members :: (TripleStore m) => m -> String -> IO Image
get_members = getts_members
--Get all subjects of a given event type
get_subjs_of_event_type :: (TripleStore m) => m -> String -> IO Image
get_subjs_of_event_type ev_data ev_type = make_image ev_data ev_type "subject"
{-collect accepts a binary relation as input and computes the image img of each
element x in the projection of the left column of the relation, under the relation,
and returns all of these (x,img) pairs in a list
Note: Since == is an equivalence relation, if multiple elements in the projection
of the left column are in the same equivalence class, only the first member of that
equivalence class that appears in the input list (as the left hand column of a tuple)
will appear in the output (as the left hand column of a tuple).
That is, the first element of that equivalence class that appears in the input list
will be chosen to represent the entire equivalence class in the output.
-}
--Faster collect: runs in n lg n time
collect = condense . sortFirst
--condense computes the image under a sorted relation
--condense runs in O(n) time and is lazy, also is lazy in the list computed in each tuple
--TODO: Use Map.toList/fromList to simplify? Benchmark.
--In particular: Should unstableSortBy be used?
condense :: (Eq a, Ord a) => [(a, a)] -> [(a, [a])]
condense [] = []
condense ((x,y):t) = (x, y:a):(condense r)
where
(a, r) = findall x t
findall x [] = ([], [])
findall x list@((t,y):ts) | x /= t = ([], list)
findall x ((t,y):ts) | x == t = let (a2, t2) = (findall x ts) in (y:a2, t2)
--make_image accepts an event type as input, determines all subjects for
--all events of that type, and computes the image under the relation
--for each subject as described in the collect function
--Arguments: triple store, Event type (i.e. join_rel), Entity type (i.e. subject, object)
make_image :: (TripleStore m) => m -> String -> String -> IO Image
make_image = getts_image