BEGIN:VCALENDAR
PRODID:-//hacksw/handcal//NONSGML v1.0//EN
METHOD:PUBLISH
BEGIN:VEVENT
DESCRIPTION:Click for Latest Location Information: http://semtech2011.semanticweb.com/sessionPop.cfm?confid=62&proposalid=4002\nA complex graph database query is a collection of two types of primitive operations: primitives that generate possible solutions and primitives that constrain those solutions by rejecting solutions that \nare invalid.  One approach to a distributed query engine is running each primitive operation in its own process and creating a graph of these processes by linking them together with network streams.  Solutions flow from process to process, some primitives increasing the solution set and some reducing the solution set.  Other processes in the graph perform operations on the solution stream such as sorting values or distributing values to database servers holding the best index for the next step.  All processes potentially running at the same time if they have work to do.  Out of the last process in the graph comes the solution to the query. The concepts we discuss work for SPARQL, Prolog, Common Logic and Social Network Analysis.
DTSTART:20110607T103000
SUMMARY:Querying a Trillion Triples
DTEND:20110607T111959
LOCATION: See Description
END:VEVENT
END:VCALENDAR