Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs

Download Now
Provided by: VLD Digital
Topic: Data Centers
Format: PDF
Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. The authors introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators. As reachability queries access the graph elements in a random access pattern, the graph is therefore maintained in the main memory of a cluster of servers to reduce query execution time.
Download Now

Find By Topic