TAPER: query-aware, partition-enhancement for large, heterogenous, graphs
Hugo Firth, Paolo Missier

TL;DR
TAPER is a system that adaptively refines graph partitioning to minimize query-related inter-partition traversals, improving scalability and responsiveness for large, heterogeneous graphs.
Contribution
TAPER introduces an iterative, workload-aware partition adjustment method that enhances existing algorithms for online, query-sensitive graph partitioning.
Findings
Reduces inter-partition traversals by 80% with hash-based partitioning.
Achieves 30% reduction with METIS partitioning.
Operates efficiently within 8 iterations.
Abstract
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 sensitive to a specific query workload, and optimised to minimise inter-partition traversals for that workload. Additionally, it should also be possible to incrementally adjust the partitioning in reaction to changes in the graph topology, the query workload, or both. Because of their complexity, current partitioning algorithms fall short of one or both of these requirements, as they are designed for offline use and as one-off operations. The TAPER system aims to address both requirements, whilst leveraging existing partitioning algorithms. TAPER takes any given initial partitioning as a starting point, and iteratively adjusts it by swapping chosen vertices across partitions, heuristically reducing the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Parallel Computing and Optimization Techniques · Interconnection Networks and Systems
