{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:30Z","timestamp":1779174810227,"version":"3.51.4"},"reference-count":166,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,12]]},"abstract":"<jats:p>Due to the growing need to process large graph and network datasets created by modern applications, recent years have witnessed a surging interest in developing big graph platforms. Tens of such big graph systems have already been developed, but there lacks a systematic categorization and comparison of these systems. This article provides a timely and comprehensive survey of existing big graph systems, and summarizes their key ideas and technical contributions from various aspects. In addition to the popular vertex-centric systems which espouse a think-like-a-vertex paradigm for developing parallel graph applications, this survey also covers other programming and computation models, contrasts those against each other, and provides a vision for the future research on big graph analytics platforms. This survey aims to help readers get a systematic picture of the landscape of recent big graph systems, focusing not just on the systems themselves, but also on the key innovations and design philosophies underlying them.<\/jats:p>","DOI":"10.1561\/1900000056","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T09:32:51Z","timestamp":1484213571000},"page":"1-195","source":"Crossref","is-referenced-by-count":75,"title":["Big Graph Analytics Platforms"],"prefix":"10.1108","volume":"7","author":[{"given":"Da","family":"Yan","sequence":"first","affiliation":[{"name":"The University of Alabama at Birmingham"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingyi","family":"Bu","sequence":"additional","affiliation":[{"name":"Couchbase, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Tian","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amol","family":"Deshpande","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"2025121112215061000_ref001","doi-asserted-by":"crossref","DOI":"10.14778\/1920841.1920964","article-title":"On dense pattern mining in graph streams","volume-title":"VLDB","author":"Aggarwal","year":"2010"},{"key":"2025121112215061000_ref002","article-title":"A task taxonomy for network evolution analysis","volume-title":"IEEE Transactions on Visualization and Computer Graphics","author":"Ahn","year":"2014"},{"issue":"14","key":"2025121112215061000_ref003","first-page":"1905","article-title":"Till Westmann. Asterixdb: A scalable, open source BDMS","volume":"7","author":"Alsubaiee","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref004","doi-asserted-by":"crossref","DOI":"10.1145\/1963405.1963495","volume-title":"EP-SPARQL: a unified language for event processing and stream reasoning","author":"Anicic","year":"2011"},{"key":"2025121112215061000_ref005","first-page":"635","article-title":"predicting and recommending links in social networks","volume-title":"Supervised random walks","author":"Backstrom","year":"2011"},{"key":"2025121112215061000_ref006","doi-asserted-by":"crossref","DOI":"10.14778\/1929861.1929864","volume-title":"Fast incremental and personalized pagerank","author":"Bahmani","year":"2010"},{"issue":"3","key":"2025121112215061000_ref007","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","article-title":"A generalization of the differential approach to recursive query evaluation","volume":"4","author":"Balbin","year":"1987","journal-title":"J. Log. Program."},{"key":"2025121112215061000_ref008","first-page":"16","article-title":"An amateur\u2019s introduction to recursive query processing strategies","volume-title":"SIGMOD","author":"Bancilhon","year":"1986"},{"key":"2025121112215061000_ref009","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","volume-title":"VLDB","author":"Bancilhon","year":"1986"},{"key":"2025121112215061000_ref010","doi-asserted-by":"crossref","DOI":"10.1145\/1739041.1739095","article-title":"An execution environment for C-SPARQL queries","volume-title":"EDBT","author":"Barbieri","year":"2010"},{"key":"2025121112215061000_ref011","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical processes on complex networks","author":"Barrat","year":"2008"},{"key":"2025121112215061000_ref012","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1401890.1401898","article-title":"Efficient semi-streaming algorithms for local triangle counting in massive graphs","volume-title":"KDD","author":"Becchetti","year":"2008"},{"key":"2025121112215061000_ref013","first-page":"21","article-title":"Sets and negation in a logic database language (LDL1)","volume-title":"PODS","author":"Beeri","year":"1987"},{"key":"2025121112215061000_ref014","doi-asserted-by":"crossref","DOI":"10.1145\/1150402.1150462","article-title":"A framework for analysis of dynamic social networks","volume-title":"SIGKDD","author":"Berger-Wolf","year":"2006"},{"issue":"7","key":"2025121112215061000_ref015","first-page":"553","article-title":"Hybrid parallelization strategies for large-scale machine learning in systemml","volume":"7","author":"Boehm","year":"2014","journal-title":"PVLDB"},{"issue":"13","key":"2025121112215061000_ref016","first-page":"1425","article-title":"Systemml: Declarative machine learning on spark","volume":"9","author":"Boehm","year":"2016","journal-title":"PVLDB"},{"key":"2025121112215061000_ref017","doi-asserted-by":"crossref","DOI":"10.1109\/ICDE.2011.5767921","article-title":"Hyracks: A flexible and extensible foundation for data-intensive computing","volume-title":"ICDE","author":"Borkar","year":"2011"},{"key":"2025121112215061000_ref018","first-page":"107","article-title":"The anatomy of a large-scale hypertextual web search engine","volume-title":"Proceedings of the Seventh International World-Wide Web Conference (WWW)","author":"Brin","year":"1998"},{"key":"2025121112215061000_ref019","volume-title":"On Software Infrastructure for Scalable Graph Analytics","author":"Bu","year":"2015"},{"issue":"2","key":"2025121112215061000_ref020","first-page":"161","article-title":"Pregelix: Big(ger) graph analytics on a dataflow engine","volume":"8","author":"Bu","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref021","first-page":"363","article-title":"FlumeJava: easy, efficient data-parallel pipelines","volume-title":"PLDI","author":"Chambers","year":"2010"},{"issue":"1","key":"2025121112215061000_ref022","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: Determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Syst."},{"key":"2025121112215061000_ref023","first-page":"34","article-title":"An overview of query optimization in relational systems","volume-title":"PODS","author":"Chaudhuri","year":"1998"},{"key":"2025121112215061000_ref024","first-page":"1131","article-title":"VENUS: vertex-centric streamlined graph computation on a single PC","volume-title":"ICDE","author":"Cheng","year":"2015"},{"key":"2025121112215061000_ref025","first-page":"85","article-title":"Kineograph: taking the pulse of a fast-changing and connected world","volume-title":"EuroSys","author":"Cheng","year":"2012"},{"key":"2025121112215061000_ref026","first-page":"63","article-title":"Yedalog: Exploring knowledge at scale","volume-title":"SNAPL","author":"Chin","year":"2015"},{"issue":"12","key":"2025121112215061000_ref027","first-page":"1804","article-title":"One trillion edges: Graph processing at facebookscale","volume":"8","author":"Ching","year":"2015","journal-title":"PVLDB"},{"key":"2025121112215061000_ref028","article-title":"A selectivity based approach to continuous pattern detection in streaming graphs","volume-title":"EDBT","author":"Choudhury","year":"2015"},{"key":"2025121112215061000_ref029","article-title":"Estimating pagerank on graph streams","volume-title":"PODS","author":"Sarma","year":"2008"},{"key":"2025121112215061000_ref030","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/2960414.2960416","article-title":"GraphFrames: An integrated api for mixing graph and relational queries","volume-title":"Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems, GRADES \u201916","author":"Dave","year":"2016"},{"key":"2025121112215061000_ref031","first-page":"137","article-title":"Mapreduce: Simplified data processing on large clusters","volume-title":"OSDI","author":"Dean","year":"2004"},{"key":"2025121112215061000_ref032","doi-asserted-by":"crossref","DOI":"10.1145\/1644015.1644021","article-title":"Trading off space for passes in graph streaming problems","volume-title":"ACM Trans. Algorithms","author":"Demetrescu","year":"2009"},{"issue":"6","key":"2025121112215061000_ref033","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/129888.129894","article-title":"Parallel database systems: The future of high performance database systems","volume":"35","author":"DeWitt","year":"1992","journal-title":"Commun. ACM"},{"key":"2025121112215061000_ref034","first-page":"181","article-title":"Dyna: Extending datalog for modern AI","volume-title":"Datalog","author":"Eisner","year":"2010"},{"issue":"12","key":"2025121112215061000_ref035","first-page":"960","article-title":"Compressed linear algebra for large-scale machine learning","volume":"9","author":"Elgohary","year":"2016","journal-title":"PVLDB"},{"issue":"3","key":"2025121112215061000_ref036","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1145\/568522.568525","article-title":"A survey of rollback-recovery protocols in message-passing systems","volume":"34","author":"Elnozahy","year":"2002","journal-title":"ACM Comput. Surv."},{"key":"2025121112215061000_ref037","volume-title":"Dynamic Graph Algorithms","author":"Eppstein","year":"1999"},{"key":"2025121112215061000_ref038","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139015165","volume-title":"Graph Algorithms","author":"Even","year":"2011","edition":"2nd"},{"issue":"11","key":"2025121112215061000_ref039","first-page":"1268","article-title":"Spinning fast iterative data flows","volume":"5","author":"Ewen","year":"2012","journal-title":"PVLDB"},{"key":"2025121112215061000_ref040","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-27836-8_46","article-title":"On graph problems in a semi-streaming model","volume-title":"ICALP","author":"Feigenbaum","year":"2004"},{"key":"2025121112215061000_ref041","article-title":"Graph distances in the streaming model: the value of space","volume-title":"SODA","author":"Feigenbaum","year":"2005"},{"key":"2025121112215061000_ref042","first-page":"2:1","article-title":"Mapgraph: A high level API for fast development of high performance graph analytics on gpus","volume-title":"GRADES","author":"Fu","year":"2014"},{"key":"2025121112215061000_ref043","first-page":"556","article-title":"Continuous pattern detection over billion-edge graph using distributed framework","volume-title":"ICDE","author":"Gao","year":"2014"},{"key":"2025121112215061000_ref044","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2013.2297930","article-title":"Disk-based management of interaction graphs","volume-title":"TKDE","author":"Gedik","year":"2014"},{"key":"2025121112215061000_ref045","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/945445.945450","article-title":"The google file system","volume-title":"SOSP","author":"Ghemawat","year":"2003"},{"key":"2025121112215061000_ref046","first-page":"231","article-title":"Systemml: Declarative machine learning on mapreduce","volume-title":"ICDE","author":"Ghoting","year":"2011"},{"key":"2025121112215061000_ref047","volume-title":"Data Warehousing and Knowledge Discovery","author":"Ghrab","year":"2013"},{"key":"2025121112215061000_ref048","first-page":"17","article-title":"Powergraph: Distributed graph-parallel computation on natural graphs","volume-title":"OSDI","author":"Gonzalez","year":"2012"},{"key":"2025121112215061000_ref049","first-page":"599","article-title":"Graphx: Graph processing in a distributed dataflow framework","volume-title":"OSDI","author":"Gonzalez","year":"2014"},{"issue":"2","key":"2025121112215061000_ref050","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","article-title":"Query evaluation techniques for large databases","volume":"25","author":"Graefe","year":"1993","journal-title":"ACM Comput. Surv."},{"key":"2025121112215061000_ref051","doi-asserted-by":"crossref","DOI":"10.1109\/ASONAM.2010.17","article-title":"Tracking the evolution of communities in dynamic social networks","volume-title":"ASONAM","author":"Greene","year":"2010"},{"key":"2025121112215061000_ref052","first-page":"395","article-title":"How well do graph-processing platforms perform? an empirical performance evaluation and analysis","volume-title":"IPDPS","author":"Guo","year":"2014"},{"key":"2025121112215061000_ref053","first-page":"505","article-title":"WTF: the who to follow service at twitter","volume-title":"WWW","author":"Gupta","year":"2013"},{"issue":"9","key":"2025121112215061000_ref054","first-page":"950","article-title":"Giraph unchained: Barrierless asynchronous parallel execution in pregel-like graph processing systems","volume":"8","author":"Han","year":"2015","journal-title":"PVLDB"},{"issue":"12","key":"2025121112215061000_ref055","first-page":"1047","article-title":"An experimental comparison of Pregel-like graph processing systems","volume":"7","author":"Han","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref056","first-page":"1:1","article-title":"Chronos: a graph engine for temporal graph analysis","volume-title":"EuroSys","author":"Han","year":"2014"},{"key":"2025121112215061000_ref057","first-page":"77","article-title":"TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC","volume-title":"KDD","author":"Han","year":"2013"},{"key":"2025121112215061000_ref058","first-page":"1223","article-title":"More effective distributed ML via a stale synchronous parallel parameter server","volume-title":"NIPS","author":"Ho","year":"2013"},{"key":"2025121112215061000_ref059","first-page":"349","article-title":"Green-marl: a DSL for easy and efficient graph analysis","volume-title":"ASPLOS","author":"Hong","year":"2012"},{"key":"2025121112215061000_ref060","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/2581122.2544162","article-title":"Simplifying scalable graph processing with a domain-specific language","volume-title":"CGO","author":"Hong","year":"2014"},{"key":"2025121112215061000_ref061","first-page":"137","article-title":"Resource elasticity for large-scale machine learning","volume-title":"SIGMOD","author":"Huang","year":"2015"},{"key":"2025121112215061000_ref062","doi-asserted-by":"crossref","DOI":"10.1145\/2618243.2618282","article-title":"Efficient temporal shortest path queries on evolving social graphs","volume-title":"SSDBM","author":"Huo","year":"2014"},{"issue":"7","key":"2025121112215061000_ref063","first-page":"541","article-title":"epic: an extensible and scalable system for processing big data","volume":"7","author":"Jiang","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref064","article-title":"Graph analytics using the Vertica relational database","volume-title":"CoRR","author":"Jindal","year":"2014"},{"issue":"13","key":"2025121112215061000_ref065","first-page":"1669","article-title":"VERTEXICA: your relational friend for graph analytics!","volume":"7","author":"Jindal","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref066","volume-title":"Computing and Combinatorics","author":"Jowhari","year":"2005"},{"key":"2025121112215061000_ref067","first-page":"229","article-title":"PEGASUS: A peta-scale graph mining system","volume-title":"ICDM","author":"Kang","year":"2009"},{"key":"2025121112215061000_ref068","first-page":"1091","article-title":"GBASE: a scalable and general graph management system","volume-title":"SIGKDD","author":"Kang","year":"2011"},{"issue":"1","key":"2025121112215061000_ref069","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","article-title":"Multilevel k-way partitioning scheme for irregular graphs","volume":"48","author":"Karypis","year":"1998","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"2025121112215061000_ref070","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"2025121112215061000_ref071","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"Kepner","year":"2011"},{"key":"2025121112215061000_ref072","first-page":"169","article-title":"Mizan: a system for dynamic load balancing in largescale graph processing","volume-title":"EuroSys","author":"Khayyat","year":"2013"},{"key":"2025121112215061000_ref073","first-page":"239","article-title":"Cusha: vertex-centric graph processing on gpus","volume-title":"HPDC","author":"Khorasani","year":"2014"},{"key":"2025121112215061000_ref074","first-page":"997","article-title":"Efficient snapshot retrieval over historical graph data","volume-title":"ICDE","author":"Khurana","year":"2013"},{"key":"2025121112215061000_ref075","first-page":"65","article-title":"Storing and analyzing historical graph data at scale","volume-title":"EDBT","author":"Khurana","year":"2016"},{"key":"2025121112215061000_ref076","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical analysis of network data","author":"Kolaczyk","year":"2009"},{"key":"2025121112215061000_ref077","doi-asserted-by":"crossref","DOI":"10.1145\/2484425.2484434","article-title":"Partial view selection for evolving social graphs","volume-title":"GRADES workshop","author":"Koloniari","year":"2013"},{"key":"2025121112215061000_ref078","article-title":"Impala: A Modern, Open-Source SQL Engine for Hadoop","volume-title":"CIDR","author":"Kornacker","year":"2015"},{"key":"2025121112215061000_ref079","first-page":"31","article-title":"GraphChi: Large-scale graph computation on just a PC","volume-title":"OSDI","author":"Kyrola","year":"2012"},{"key":"2025121112215061000_ref080","article-title":"The G* graph database: efficiently managing large distributed dynamic graphs","volume-title":"Distributed and Parallel Databases","author":"Labouseur","year":"2014"},{"issue":"10","key":"2025121112215061000_ref081","first-page":"974","article-title":"Scalable subgraph enumeration in mapreduce","volume":"8","author":"Lai","year":"2015","journal-title":"PVLDB"},{"key":"2025121112215061000_ref082","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume-title":"NIPS","author":"Leskovec","year":"2012"},{"key":"2025121112215061000_ref083","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1830252.1830263","volume-title":"MLG","author":"Lin","year":"2010"},{"key":"2025121112215061000_ref084","first-page":"33","article-title":"Effective pruning techniques for mining quasi-cliques","volume-title":"ECML\/PKDD Part II","author":"Liu","year":"2008"},{"key":"2025121112215061000_ref085","first-page":"340","article-title":"Graphlab: A new framework for parallel machine learning","volume-title":"UAI","author":"Low","year":"2010"},{"issue":"8","key":"2025121112215061000_ref086","first-page":"716","article-title":"Distributed GraphLab: A framework for machine learning in the cloud","volume":"5","author":"Low","year":"2012","journal-title":"PVLDB"},{"issue":"3","key":"2025121112215061000_ref087","first-page":"281","article-title":"Huanhuan Wu. Large-scale distributed graph computing systems: An experimental evaluation","volume":"8","author":"Lu","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref088","first-page":"363","article-title":"LLAMA: efficient graph analytics using large multiversioned arrays","volume-title":"ICDE","author":"Macko","year":"2015"},{"key":"2025121112215061000_ref089","first-page":"135","article-title":"Pregel: a system for large-scale graph processing","volume-title":"SIGMOD Conference","author":"Malewicz","year":"2010"},{"issue":"4","key":"2025121112215061000_ref090","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00778-012-0299-1","article-title":"Extending the power of datalog recursion","volume":"22","author":"Mazuran","year":"2013","journal-title":"VLDB J."},{"issue":"2","key":"2025121112215061000_ref091","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2818185","article-title":"Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing","volume":"48","author":"McCune","year":"2015","journal-title":"ACM Comput. Surv."},{"key":"2025121112215061000_ref092","volume-title":"HotOS","author":"McSherry","year":"2015"},{"issue":"1","key":"2025121112215061000_ref093","first-page":"330","article-title":"Dremel: Interactive analysis of web-scale datasets","volume":"3","author":"Melnik","year":"2010","journal-title":"PVLDB"},{"key":"2025121112215061000_ref094","unstructured":"Youshan\n              Miao\n            , WentaoHan, KaiweiLi, MingWu, FanYang, LidongZhou, VijayanPrabhakaran, EnhongChen, and WenguangChen. Immortalgraph: A system for storage and analysis of temporal graphs. ACM TOS, July2015. URL http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=242176."},{"issue":"11","key":"2025121112215061000_ref095","first-page":"1280","article-title":"REX: Recursive, delta-based data-centric computation","volume":"5","author":"Mihaylov","year":"2012","journal-title":"PVLDB"},{"key":"2025121112215061000_ref096","first-page":"145","article-title":"Managing large dynamic graphs efficiently","volume-title":"SIGMOD","author":"Mondal","year":"2012"},{"key":"2025121112215061000_ref097","first-page":"1335","article-title":"Eagr: supporting continuous egocentric aggregate queries over large dynamic graphs","volume-title":"SIGMOD","author":"Mondal","year":"2014"},{"key":"2025121112215061000_ref098","first-page":"264","article-title":"The magic of duplicates and aggregates","volume-title":"VLDB","author":"Mumick","year":"1990"},{"key":"2025121112215061000_ref099","first-page":"439","article-title":"Naiad: A timely dataflow system","volume-title":"SOSP","author":"Murray","year":"2013"},{"key":"2025121112215061000_ref100","first-page":"456","article-title":"A lightweight infrastructure for graph analytics","volume-title":"SOSP","author":"Nguyen","year":"2013"},{"key":"2025121112215061000_ref101","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.84.016105","article-title":"Path lengths, correlations, and centrality in temporal networks","volume-title":"Physical Review E","author":"Pan","year":"2011"},{"key":"2025121112215061000_ref102","first-page":"12","article-title":"The tao of parallelism in algorithms","volume-title":"PLDI","author":"Pingali","year":"2011"},{"key":"2025121112215061000_ref103","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/2980523.2980529","article-title":"NScaleSpark: Subgraph-centric graph analytics on Apache Spark","volume-title":"Proceedings of the SIGMOD Workshop on Network Data Analytics (NDA)","author":"Quamar","year":"2016"},{"issue":"2","key":"2025121112215061000_ref104","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00778-015-0405-2","article-title":"NScale: neighborhoodcentric large-scale graph analytics in the cloud","volume":"25","author":"Quamar","year":"2016","journal-title":"VLDB Journal"},{"key":"2025121112215061000_ref105","first-page":"457","article-title":"Using pregel-like large scale graph processing frameworks for social network analysis","volume-title":"ASONAM","author":"Quick","year":"2012"},{"issue":"11","key":"2025121112215061000_ref106","first-page":"726","article-title":"On querying historical evolving graph sequences","volume":"4","author":"Ren","year":"2011","journal-title":"PVLDB"},{"issue":"2","key":"2025121112215061000_ref107","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","article-title":"On dynamic shortest paths problems","volume":"61","author":"Roditty","year":"2011","journal-title":"Algorithmica"},{"key":"2025121112215061000_ref108","first-page":"114","article-title":"Monotonic aggregation in deductive databases","volume-title":"PODS","author":"Ross","year":"1992"},{"key":"2025121112215061000_ref109","first-page":"233","article-title":"Suggesting friends using the implicit social graph","volume-title":"KDD","author":"Roth","year":"2010"},{"key":"2025121112215061000_ref110","first-page":"472","article-title":"X-stream: edge-centric graph processing using streaming partitions","volume-title":"SOSP","author":"Roy","year":"2013"},{"key":"2025121112215061000_ref111","first-page":"410","article-title":"Chaos: scale-out graph processing from secondary storage","volume-title":"SOSP","author":"Roy","year":"2015"},{"key":"2025121112215061000_ref112","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/2484838.2484843","article-title":"GPS: a graph processing system","volume-title":"SSDBM","author":"Salihoglu","year":"2013"},{"issue":"7","key":"2025121112215061000_ref113","first-page":"577","article-title":"Optimizing graph algorithms on pregellike systems","volume":"7","author":"Salihoglu","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref114","first-page":"979","article-title":"Navigating the maze of graph analytics frameworks using massive graph datasets","volume-title":"SIGMOD","author":"Satish","year":"2014"},{"key":"2025121112215061000_ref115","first-page":"1919","article-title":"\u201cAll roads lead to rome\u201d: optimistic recovery for distributed iterative data processing","volume-title":"CIKM","author":"Schelter","year":"2013"},{"key":"2025121112215061000_ref116","first-page":"278","article-title":"Socialite: Datalog extensions for efficient social network analysis","volume-title":"ICDE","author":"Seo","year":"2013"},{"issue":"14","key":"2025121112215061000_ref117","first-page":"1906","article-title":"Distributed socialite: A datalog-based language for large-scale graph analysis","volume":"6","author":"Seo","year":"2013","journal-title":"PVLDB"},{"key":"2025121112215061000_ref118","first-page":"553","article-title":"Catch the wind: Graph workload balancing on cloud","volume-title":"ICDE","author":"Shang","year":"2013"},{"key":"2025121112215061000_ref119","first-page":"505","article-title":"Trinity: a distributed graph engine on a memory cloud","volume-title":"SIGMOD","author":"Shao","year":"2013"},{"issue":"2","key":"2025121112215061000_ref120","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TKDE.2014.2327037","article-title":"PAGE: A partition aware engine for parallel graph computation","volume":"27","author":"Shao","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"2025121112215061000_ref121","first-page":"437","article-title":"Fast failure recovery in distributed graph processing systems","volume":"8","author":"Shen","year":"2014","journal-title":"PVLDB"},{"issue":"1","key":"2025121112215061000_ref122","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An o(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"2025121112215061000_ref123","first-page":"867","article-title":"Optimizing recursive queries with monotonic aggregates in deals","volume-title":"ICDE","author":"Shkapsky","year":"2015"},{"key":"2025121112215061000_ref124","first-page":"135","article-title":"Ligra: a lightweight graph processing framework for shared memory","volume-title":"ACM SIGPLAN Notices","author":"Shun","year":"2013"},{"issue":"13","key":"2025121112215061000_ref125","first-page":"1405","article-title":"Largescale graph analytics in aster 6: Bringing context to big data discovery","volume":"7","author":"Simmen","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref126","first-page":"451","article-title":"Goffish: A sub-graph centric framework for large-scale graph analytics","volume-title":"Euro-Par","author":"Simmhan","year":"2014"},{"key":"2025121112215061000_ref127","doi-asserted-by":"crossref","DOI":"10.14778\/2735496.2735504","article-title":"Event pattern matching over graph streams","volume-title":"VLDB","author":"Song","year":"2014"},{"key":"2025121112215061000_ref128","first-page":"1222","article-title":"Streaming graph partitioning for large distributed graphs","volume-title":"SIGKDD","author":"Stanton","year":"2012"},{"issue":"9","key":"2025121112215061000_ref129","first-page":"788","article-title":"Efficient subgraph matching on billion node graphs","volume":"5","author":"Sun","year":"2012","journal-title":"PVLDB"},{"issue":"11","key":"2025121112215061000_ref130","first-page":"1214","article-title":"Graphmat: High performance graph analytics made productive","volume":"8","author":"Sundaram","year":"2015","journal-title":"PVLDB"},{"key":"2025121112215061000_ref131","first-page":"607","article-title":"Counting triangles and the curse of the last reducer","volume-title":"WWW,","author":"Suri","year":"2011"},{"key":"2025121112215061000_ref132","first-page":"102","article-title":"Lookup tables: Fine-grained partitioning for distributed databases","volume-title":"ICDE","author":"Tatarowicz","year":"2012"},{"key":"2025121112215061000_ref133","first-page":"425","article-title":"Arabesque: a system for distributed graph mining","volume-title":"SOSP","author":"Teixeira","year":"2015"},{"key":"2025121112215061000_ref134","first-page":"996","article-title":"Hive - a petabyte scale data warehouse using hadoop","volume-title":"ICDE","author":"Thusoo","year":"2010"},{"key":"2025121112215061000_ref135","first-page":"1351","article-title":"Scalable and numerically stable descriptive statistics in systemml","volume-title":"ICDE","author":"Tian","year":"2012"},{"issue":"3","key":"2025121112215061000_ref136","first-page":"193","article-title":"From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d","volume":"7","author":"Tian","year":"2013","journal-title":"PVLDB"},{"key":"2025121112215061000_ref137","first-page":"5:1","article-title":"Apache hadoop yarn: Yet another resource negotiator","volume-title":"SOCC","author":"Vavilapalli","year":"2013"},{"key":"2025121112215061000_ref138","doi-asserted-by":"crossref","DOI":"10.14711\/thesis-b1054338","article-title":"Continuous subgraph pattern search over graph streams","volume-title":"ICDE","author":"Wang","year":"2009"},{"issue":"12","key":"2025121112215061000_ref139","first-page":"1542","article-title":"Asynchronous and fault-tolerant recursive datalog evaluation in shared-nothing engines","volume":"8","author":"Wang","year":"2015","journal-title":"PVLDB"},{"key":"2025121112215061000_ref140","first-page":"562","article-title":"Replication-based fault-tolerance for large-scale graph processing","volume-title":"DSN","author":"Wang","year":"2014"},{"key":"2025121112215061000_ref141","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1145\/2806777.2806849","article-title":"Gram: Scaling graph computation to the trillions","volume-title":"SoCC","author":"Wu","year":"2015"},{"key":"2025121112215061000_ref142","first-page":"74","article-title":"Scalable maximum clique computation using mapreduce","volume-title":"ICDE","author":"Xiang","year":"2013"},{"key":"2025121112215061000_ref143","first-page":"194","article-title":"SYNC or ASYNC: time to fuse for distributed graph-parallel computation","volume-title":"PPoPP","author":"Xie","year":"2015"},{"issue":"14","key":"2025121112215061000_ref144","first-page":"2014","article-title":"Fast iterative graph computation with block updates","volume":"6","author":"Xie","year":"2013","journal-title":"PVLDB"},{"key":"2025121112215061000_ref145","first-page":"1143","article-title":"Dynamic interaction graphs with probabilistic edge decay","volume-title":"ICDE","author":"Xie","year":"2015"},{"issue":"12","key":"2025121112215061000_ref146","article-title":"Graphgen: Exploring interesting graphs in relational data","volume":"8","author":"Xirogiannopoulos","year":"2015","journal-title":"PVLDB"},{"issue":"14","key":"2025121112215061000_ref147","first-page":"1981","article-title":"Wilfred Ng. Blogel: A block-centric framework for distributed computation on real-world graphs","volume":"7","author":"Yan","year":"2014","journal-title":"PVLDB"},{"issue":"14","key":"2025121112215061000_ref148","first-page":"1821","article-title":"Pregel algorithms for graph connectivity problems with performance guarantees","volume":"7","author":"Yan","year":"2014","journal-title":"PVLDB"},{"key":"2025121112215061000_ref149","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1145\/2736277.2741096","article-title":"Wilfred Ng. Effective techniques for message reduction and load balancing in distributed graph computation","volume-title":"WWW","author":"Yan","year":"2015"},{"key":"2025121112215061000_ref150","first-page":"2241","article-title":"Big graph analytics systems","volume-title":"SIGMOD","author":"Yan","year":"2016"},{"issue":"7","key":"2025121112215061000_ref151","first-page":"564","article-title":"Wilfred Ng. A general-purpose query-centric framework for querying big graphs","volume":"9","author":"Yan","year":"2016","journal-title":"PVLDB"},{"key":"2025121112215061000_ref152","article-title":"Lightweight fault tolerance in largescale distributed graph processing","volume-title":"CoRR","author":"Yan","year":"2016"},{"key":"2025121112215061000_ref153","article-title":"Huanhuan Wu. Efficient processing of very large graphs in a small cluster","volume-title":"CoRR","author":"Yan","year":"2016"},{"key":"2025121112215061000_ref154","article-title":"Parallel bottom-up evaluation of logic programs: Deals on shared-memory multicore machines","volume-title":"ICLP","author":"Yang","year":"2015"},{"key":"2025121112215061000_ref155","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1145\/1013367.1013519","article-title":"On the temporal dimension of search","volume-title":"WWW Alt","author":"Yu","year":"2004"},{"key":"2025121112215061000_ref156","first-page":"15","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","volume-title":"NSDI","author":"Zaharia","year":"2012"},{"key":"2025121112215061000_ref157","doi-asserted-by":"crossref","DOI":"10.1186\/s40537-016-0060-5","article-title":"Limited random walk algorithm for big graph data clustering","volume-title":"CoRR","author":"Zhang","year":"2016"},{"issue":"8","key":"2025121112215061000_ref158","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1109\/TPDS.2013.235","article-title":"Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation","volume":"25","author":"Zhang","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2025121112215061000_ref159","doi-asserted-by":"crossref","DOI":"10.14778\/2078331.2078335","article-title":"gSketch: on query estimation in graph streams","volume-title":"VLDB","author":"Zhao","year":"2011"},{"key":"2025121112215061000_ref160","first-page":"45","article-title":"Flashgraph: Processing billion-node graphs on an array of commodity ssds","volume-title":"FAST","author":"Zheng","year":"2015"},{"key":"2025121112215061000_ref161","first-page":"283","article-title":"Applying data mining techniques to address disaster information management challenges on mobile devices","volume-title":"KDD","author":"Zheng","year":"2011"},{"issue":"6","key":"2025121112215061000_ref162","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1109\/TPDS.2013.111","article-title":"Medusa: Simplified graph processing on gpus","volume":"25","author":"Zhong","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"2025121112215061000_ref163","first-page":"377","article-title":"Mocgraph: Scalable distributed graph processing using message online computing","volume":"8","author":"Zhou","year":"2014","journal-title":"PVLDB"},{"issue":"11","key":"2025121112215061000_ref164","first-page":"1262","article-title":"Graphtwist: Fast iterative graph computation with two-tier optimizations","volume":"8","author":"Zhou","year":"2015","journal-title":"PVLDB"},{"key":"2025121112215061000_ref165","first-page":"375","article-title":"Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning","volume-title":"USENIX ATC","author":"Zhu","year":"2015"},{"key":"2025121112215061000_ref166","article-title":"Gemini: A computation-centric distributed graph processing system","volume-title":"OSDI","author":"Zhu","year":"2016"}],"container-title":["Foundations and Trends in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/7\/1-2\/1\/11024186\/1900000056en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftdbs\/article-pdf\/7\/1-2\/1\/11024186\/1900000056en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:11:39Z","timestamp":1777471899000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftdbs\/article\/7\/1-2\/1\/1326469\/Big-Graph-Analytics-Platforms"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":166,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1,12]]}},"URL":"https:\/\/doi.org\/10.1561\/1900000056","relation":{},"ISSN":["1931-7883","1931-7891"],"issn-type":[{"value":"1931-7883","type":"print"},{"value":"1931-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,12]]}}}