Abstract
Large-scale graphs are becoming critical in various domains such as social network, scientific application, knowledge discovery, and even system software, etc. Many of those use cases require large-scale high-performance graph databases, which are designed for serving continuous updates from the clients, and at the same time, answering complex queries towards the current graph in an on-line manner. Those operations in graph databases, also referred as OLTP (online transaction processing) operations, need specific design and implementation in graph partitioning algorithms. In this study, we designed an incremental online graph partitioning (IOGP), optimized for OLTP workloads. It is designed to achieve better locality, generate balanced partitions, and increase the parallelism for accessing hotspots of the graph. Our evaluation results on both real world and synthetic graphs in both simulation and real system confirm a better performance on graph queries (as much as 2X) with small overheads during graph insertion (less than 10%).
- G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. phSIAM Journal on scientific Computing, 20 (1): 359--392, 1998. Google Scholar
Digital Library
- C. Tsourakakis, C. Gkantsidis, B. Radunovic, and M. Vojnovic. Fennel: Streaming graph partitioning for massive scale graphs. In phProceedings of the 7th ACM international conference on Web search and data mining, pages 333--342. ACM, 2014. Google Scholar
Digital Library
Index Terms
POSTER: IOGP: An Incremental Online Graph Partitioning for Large-Scale Distributed Graph Databases
Recommendations
IOGP: An Incremental Online Graph Partitioning Algorithm for Distributed Graph Databases
HPDC '17: Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed ComputingGraphs have become increasingly important in many applications and domains such as querying relationships in social networks or managing rich metadata generated in scientific computing. Many of these use cases require high-performance distributed graph ...
POSTER: IOGP: An Incremental Online Graph Partitioning for Large-Scale Distributed Graph Databases
PPoPP '17: Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingLarge-scale graphs are becoming critical in various domains such as social network, scientific application, knowledge discovery, and even system software, etc. Many of those use cases require large-scale high-performance graph databases, which are ...
A note on the bichromatic numbers of graphs
For a pair of integers k , l ý0, a graph G is ( k, l )-colorable if its vertices can be partitioned into at most k independent sets and at most l cliques. The bichromatic number ý b ( G ) of G is the least integer r such that for all k ...







Comments