5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DB2017★ 1 cited
Loom: Query-aware Partitioning of Online Graphs
Hugo Firth, Paolo Missier, Jack Aiston
As with general graph processing systems, partitioning data over a cluster of machines improves the scalability of graph database management systems. However, these systems will in…
cs.DB2016
TAPER: query-aware, partition-enhancement for large, heterogenous, graphs
Hugo Firth, Paolo Missier
Graph partitioning has long been seen as a viable approach to address Graph DBMS scalability. A partitioning, however, may introduce extra query processing latency unless it is sen…
cs.DB2014★ 5 cited
ProvGen: generating synthetic PROV graphs with predictable structure
Hugo Firth, Paolo Missier
This paper introduces provGen, a generator aimed at producing large synthetic provenance graphs with predictable properties and of arbitrary size. Synthetic provenance graphs serve…