{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:21:20Z","timestamp":1776082880291,"version":"3.50.1"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p>Graph processing is becoming increasingly prevalent across many application domains. In spite of this prevalence, there is little research about how graphs are actually used in practice. We conducted an online survey aimed at understanding: (i) the types of graphs users have; (ii) the graph computations users run; (iii) the types of graph software users use; and (iv) the major challenges users face when processing their graphs. We describe the participants' responses to our questions highlighting common patterns and challenges. We further reviewed user feedback in the mailing lists, bug reports, and feature requests in the source repositories of a large suite of software products for processing graphs. Through our review, we were able to answer some new questions that were raised by participants' responses and identify specific challenges that users face when using different classes of graph software. The participants' responses and data we obtained revealed surprising facts about graph processing in practice. In particular, real-world graphs represent a very diverse range of entities and are often very large, and scalability and visualization are undeniably the most pressing challenges faced by participants. We hope these findings can guide future research.<\/jats:p>","DOI":"10.1145\/3186728.3164139","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T10:54:54Z","timestamp":1574247294000},"page":"420-431","source":"Crossref","is-referenced-by-count":126,"title":["The ubiquity of large graphs and surprising challenges of graph processing"],"prefix":"10.14778","volume":"11","author":[{"given":"Siddhartha","family":"Sahu","sequence":"first","affiliation":[{"name":"University of Waterloo"}]},{"given":"Amine","family":"Mhedhbi","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Semih","family":"Salihoglu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Jimmy","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]}],"member":"320","published-online":{"date-parts":[[2017,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-1-4419-6045-0_2","volume-title":"Graph Data Management and Mining: A Survey of Algorithms and Applications","author":"Aggarwal C. C.","year":"2010","unstructured":"C. C. Aggarwal and H. Wang . Graph Data Management and Mining: A Survey of Algorithms and Applications , pages 13 -- 68 . Springer US , 2010 . C. C. Aggarwal and H. Wang. Graph Data Management and Mining: A Survey of Algorithms and Applications, pages 13--68. Springer US, 2010."},{"key":"e_1_2_1_2_1","volume-title":"Foundations of Modern Graph Query Languages. CoRR, abs\/1610.06264","author":"Angles R.","year":"2016","unstructured":"R. Angles , M. Arenas , P. Barcel\u00f3 , A. Hogan , J. L. Reutter , and D. Vrgoc . Foundations of Modern Graph Query Languages. CoRR, abs\/1610.06264 , 2016 . R. Angles, M. Arenas, P. Barcel\u00f3, A. Hogan, J. L. Reutter, and D. Vrgoc. Foundations of Modern Graph Query Languages. CoRR, abs\/1610.06264, 2016."},{"key":"e_1_2_1_3_1","unstructured":"ArrangoDB. https:\/\/www.arangodb.com.  ArrangoDB. https:\/\/www.arangodb.com."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3045390"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-015-0472-6"},{"key":"e_1_2_1_6_1","unstructured":"Basic Linear Algebra Subprograms. http:\/\/www.netlib.org\/blas.  Basic Linear Algebra Subprograms. http:\/\/www.netlib.org\/blas."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647552.729413"},{"key":"e_1_2_1_8_1","unstructured":"Caley Graph Database. https:\/\/cayley.io.  Caley Graph Database. https:\/\/cayley.io."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining","author":"Cao L.","year":"2015","unstructured":"L. Cao , C. Zhang , T. Joachims , G. I. Webb , D. D. Margineantu , and G. Williams , editors . Proceedings of the International Conference on Knowledge Discovery and Data Mining , 2015 . http:\/\/dl.acm.org\/citation.cfm?id=2783258. L. Cao, C. Zhang, T. Joachims, G. I. Webb, D. D. Margineantu, and G. Williams, editors. Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2015. http:\/\/dl.acm.org\/citation.cfm?id=2783258."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_2_1_11_1","unstructured":"Conceptual Graphs. http:\/\/conceptualgraphs.org.  Conceptual Graphs. http:\/\/conceptualgraphs.org."},{"key":"e_1_2_1_12_1","volume-title":"Computer Science Department","author":"Cui W.","year":"2007","unstructured":"W. Cui and H. Qu . A Survey on Graph Visualization. PhD Qualifying Exam Report , Computer Science Department , Hong Kong University of Science and Technology , 2007 . W. Cui and H. Qu. A Survey on Graph Visualization. PhD Qualifying Exam Report, Computer Science Department, Hong Kong University of Science and Technology, 2007."},{"key":"e_1_2_1_13_1","unstructured":"Cytoscape. http:\/\/www.cytoscape.org.  Cytoscape. http:\/\/www.cytoscape.org."},{"key":"e_1_2_1_14_1","unstructured":"DGraph. https:\/\/dgraph.io.  DGraph. https:\/\/dgraph.io."},{"key":"e_1_2_1_15_1","unstructured":"DTD and XSD XML Schemas. https:\/\/www.w3.org\/standards\/xml\/schema.  DTD and XSD XML Schemas. https:\/\/www.w3.org\/standards\/xml\/schema."},{"key":"e_1_2_1_16_1","unstructured":"Elasticsearch X-Pack Graph. https:\/\/www.elastic.co\/products\/x-pack\/graph.  Elasticsearch X-Pack Graph. https:\/\/www.elastic.co\/products\/x-pack\/graph."},{"key":"e_1_2_1_17_1","unstructured":"Apache Flink. https:\/\/flink.apache.org.  Apache Flink. https:\/\/flink.apache.org."},{"key":"e_1_2_1_18_1","unstructured":"Apache Flink User Survey 2016. https:\/\/github.com\/dataArtisans\/flink-user-survey-2016.  Apache Flink User Survey 2016. https:\/\/github.com\/dataArtisans\/flink-user-survey-2016."},{"key":"e_1_2_1_19_1","unstructured":"Gephi. https:\/\/gephi.org.  Gephi. https:\/\/gephi.org."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777"},{"key":"e_1_2_1_21_1","unstructured":"Apache Giraph. https:\/\/giraph.apache.org.  Apache Giraph. https:\/\/giraph.apache.org."},{"key":"e_1_2_1_22_1","unstructured":"Graph for Scala. http:\/\/www.scala-graph.org.  Graph for Scala. http:\/\/www.scala-graph.org."},{"key":"e_1_2_1_23_1","unstructured":"Graph 500 Benchmarks. http:\/\/graph500.org.  Graph 500 Benchmarks. http:\/\/graph500.org."},{"key":"e_1_2_1_24_1","unstructured":"GraphStream. http:\/\/graphstream-project.org.  GraphStream. http:\/\/graphstream-project.org."},{"key":"e_1_2_1_25_1","unstructured":"Graph-tool. https:\/\/graph-tool.skewed.de.  Graph-tool. https:\/\/graph-tool.skewed.de."},{"key":"e_1_2_1_26_1","unstructured":"Graphviz. https:\/\/graphviz.readthedocs.io.  Graphviz. https:\/\/graphviz.readthedocs.io."},{"key":"e_1_2_1_27_1","unstructured":"Apache Spark GraphX. https:\/\/spark.apache.org\/graphx.  Apache Spark GraphX. https:\/\/spark.apache.org\/graphx."},{"key":"e_1_2_1_28_1","unstructured":"Apache TinkerPop. https:\/\/tinkerpop.apache.org.  Apache TinkerPop. https:\/\/tinkerpop.apache.org."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30475-3_35"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1519054"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2457317.2457351"},{"key":"e_1_2_1_33_1","unstructured":"ISO\/IEC Directives Part 1. http:\/\/www.iso.org\/sites\/directives\/directives.html#toc_marker-16.  ISO\/IEC Directives Part 1. http:\/\/www.iso.org\/sites\/directives\/directives.html#toc_marker-16."},{"key":"e_1_2_1_34_1","first-page":"2013","article-title":"editors","volume":"7","author":"Jagadish H. V.","unstructured":"H. V. Jagadish and A. Zhou , editors . PVLDB , Volume 7 , 2013 -- 2014 . http:\/\/www.vldb.org\/pvldb\/vol7.html. H. V. Jagadish and A. Zhou, editors. PVLDB, Volume 7, 2013--2014. http:\/\/www.vldb.org\/pvldb\/vol7.html.","journal-title":"PVLDB"},{"key":"e_1_2_1_35_1","unstructured":"JanusGraph. http:\/\/janusgraph.org.  JanusGraph. http:\/\/janusgraph.org."},{"key":"e_1_2_1_36_1","volume-title":"Querying Knowledge Graphs by Example Entity Tuples. CoRR, abs\/1311.2100","author":"Jayaram N.","year":"2013","unstructured":"N. Jayaram , A. Khan , C. Li , X. Yan , and R. Elmasri . Querying Knowledge Graphs by Example Entity Tuples. CoRR, abs\/1311.2100 , 2013 . N. Jayaram, A. Khan, C. Li, X. Yan, and R. Elmasri. Querying Knowledge Graphs by Example Entity Tuples. CoRR, abs\/1311.2100, 2013."},{"key":"e_1_2_1_37_1","unstructured":"JDBC. http:\/\/www.oracle.com\/technetwork\/java\/overview-141217.html.  JDBC. http:\/\/www.oracle.com\/technetwork\/java\/overview-141217.html."},{"key":"e_1_2_1_38_1","unstructured":"Apache Jena. https:\/\/jena.apache.org.  Apache Jena. https:\/\/jena.apache.org."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287620.1287621"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877"},{"key":"e_1_2_1_41_1","unstructured":"LDBC Benchmarks. http:\/\/ldbcouncil.org\/benchmarks.  LDBC Benchmarks. http:\/\/ldbcouncil.org\/benchmarks."},{"key":"e_1_2_1_42_1","unstructured":"LDBC D6.6.4 Standardization Report. http:\/\/ldbcouncil.org\/sites\/default\/files\/LDBC_D6.6.4.pdf.  LDBC D6.6.4 Standardization Report. http:\/\/ldbcouncil.org\/sites\/default\/files\/LDBC_D6.6.4.pdf."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl529"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_46_1","unstructured":"MATLAB. https:\/\/www.mathworks.com.  MATLAB. https:\/\/www.mathworks.com."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670338"},{"key":"e_1_2_1_48_1","unstructured":"Neo4j. https:\/\/neo4j.com.  Neo4j. https:\/\/neo4j.com."},{"key":"e_1_2_1_49_1","unstructured":"The 2016 State of the Graph Report https:\/\/neo4j.com\/resources\/2016-state-of-the-graph.  The 2016 State of the Graph Report https:\/\/neo4j.com\/resources\/2016-state-of-the-graph."},{"key":"e_1_2_1_50_1","unstructured":"NetworKit. https:\/\/networkit.iti.kit.edu.  NetworKit. https:\/\/networkit.iti.kit.edu."},{"key":"e_1_2_1_51_1","unstructured":"NetworkX. https:\/\/networkx.github.io.  NetworkX. https:\/\/networkx.github.io."},{"key":"e_1_2_1_52_1","unstructured":"openCypher. http:\/\/www.opencypher.org.  openCypher. http:\/\/www.opencypher.org."},{"key":"e_1_2_1_53_1","unstructured":"OrientDB. https:\/\/orientdb.com.  OrientDB. https:\/\/orientdb.com."},{"key":"e_1_2_1_54_1","volume-title":"GraphVista: Interactive Exploration Of Large Graphs. CoRR, abs\/1506.00394","author":"Paradies M.","year":"2015","unstructured":"M. Paradies , M. Rudolf , and W. Lehner . GraphVista: Interactive Exploration Of Large Graphs. CoRR, abs\/1506.00394 , 2015 . M. Paradies, M. Rudolf, and W. Lehner. GraphVista: Interactive Exploration Of Large Graphs. CoRR, abs\/1506.00394, 2015."},{"key":"e_1_2_1_55_1","unstructured":"PGQL\n  : Property Graph Query Language. http:\/\/pgql-lang.org.  PGQL: Property Graph Query Language. http:\/\/pgql-lang.org."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056418"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2909132.2909246"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of International Conference on Requirements Engineering: Foundation for Software Quality","author":"Rath M.","year":"2017","unstructured":"M. Rath , D. Akehurst , C. Borowski , and P. M\u00e4der . Are graph query languages applicable for requirements traceability analysis ? In Proceedings of International Conference on Requirements Engineering: Foundation for Software Quality , 2017 . M. Rath, D. Akehurst, C. Borowski, and P. M\u00e4der. Are graph query languages applicable for requirements traceability analysis? In Proceedings of International Conference on Requirements Engineering: Foundation for Software Quality, 2017."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815072.2815073"},{"key":"e_1_2_1_60_1","volume-title":"Graft: A Debugging Tool For Apache Giraph. Technical report","author":"Salihoglu S.","year":"2014","unstructured":"S. Salihoglu , J. Shin , V. Khanna , B. Q. Truong , and J. Widom . Graft: A Debugging Tool For Apache Giraph. Technical report , Stanford University , 2014 . http:\/\/ilpubs.stanford.edu:8090\/1109\/. S. Salihoglu, J. Shin, V. Khanna, B. Q. Truong, and J. Widom. Graft: A Debugging Tool For Apache Giraph. Technical report, Stanford University, 2014. http:\/\/ilpubs.stanford.edu:8090\/1109\/."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_2_1_62_1","unstructured":"SNAP\n  : Standford Network Analysis Project. https:\/\/snap.stanford.edu.  SNAP: Standford Network Analysis Project. https:\/\/snap.stanford.edu."},{"key":"e_1_2_1_63_1","unstructured":"Lightbend Apache Survey 2015. https:\/\/info.lightbend.com\/COLL-20XX-Spark-Survey-Report_LP.html.  Lightbend Apache Survey 2015. https:\/\/info.lightbend.com\/COLL-20XX-Spark-Survey-Report_LP.html."},{"key":"e_1_2_1_64_1","unstructured":"Sparksee. http:\/\/www.sparsity-technologies.com.  Sparksee. http:\/\/www.sparsity-technologies.com."},{"key":"e_1_2_1_65_1","unstructured":"The TPC-C benchmark. http:\/\/www.tpc.org\/tpcc.  The TPC-C benchmark. http:\/\/www.tpc.org\/tpcc."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12872"},{"key":"e_1_2_1_67_1","unstructured":"OpenLink Virtuoso. https:\/\/virtuoso.openlinksw.com.  OpenLink Virtuoso. https:\/\/virtuoso.openlinksw.com."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12800"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.5555\/3014904"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186728.3164139","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3186728.3164139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:31Z","timestamp":1750273651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186728.3164139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.1145\/3186728.3164139"],"URL":"https:\/\/doi.org\/10.1145\/3186728.3164139","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}