Graph Pattern Matching
Published • Jun 22, 2014
NobleIDNI3P40W84R50S87
Authors:,
Andrey Gubichev
Manuel Then
Abstract
This paper presents an empirical study of how a wide spectrum of systems handle the graph pattern matching problem. Our approach is to take the well-known LUBM benchmark, model it across various domains (relational, RDF, property graph), and execute the benchmark queries on the corresponding systems...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!