Paper Info
Title
Using semijoin programs to solve traversal queries in graph databases
Abstract
Graph data processing is gaining popularity and new solutions are appearing to analyze graphs efficiently. In this paper, we present the prototype for the new query engine of the Sparksee graph database, which is based on an algebra of operations on sets of key-value pairs. The new engine combines some regular relational database operations with some extensions oriented to collection processing and complex graph queries. We study the query plans of graph queries expressed in the new algebra, and find that most graph operations can be efficiently expressed as semijoin programs.
Year
DOI
Venue
2014
10.1145/2621934.2621943
GRADES
Keywords
Field
DocType
design,graphs and networks,experimentation,systems,measurement,performance
Graph operations,Graph database,Tree traversal,Relational database,Computer science,Theoretical computer science,Relational algebra,Graph rewriting,Wait-for graph,Graph (abstract data type)
Conference
Citations 
PageRank 
References 
2
0.36
10
Authors
2
Name
Order
Citations
PageRank
Norbert Martínez-Bazan11065.55
David Domínguez-Sal220.36