Querying a Trillion Triples
Share this Session:
  Jans Aasman   Jans Aasman
Franz Inc


Tuesday, June 7, 2011
10:30 AM - 11:20 AM
Level:  Technical - Intermediate

Location:  Plaza A

A 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 are 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.

Jans Aasman started his career as an experimental and cognitive psychologist, earning his PhD in cognitive science with a detailed model of car driver behavior using Lisp and Soar. He has spent most of his professional life in telecommunications research, specializing in intelligent user interfaces and applied artificial intelligence projects. From 1995 to 2004, he was also a part-time professor in the Industrial Design department of the Technical University of Delft. Jans is currently the CEO of Franz Inc., the leading supplier of commercial, persistent, and scalable RDF database products that provide the storage layer for powerful reasoning and ontology modeling capabilities for Semantic Web applications.

Close Window