The ubiquity of large graphs and surprising challenges of graph processing: extended survey

Sahu, Siddhartha; Mhedhbi, Amine; Salihoğlu, Semih; Lin, Jimmy; Özsu, M. Tamer

doi:10.1007/s00778-019-00548-x

Cited by 70 publications

(50 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Aside from the numerous applications of GT in CS and SN, the users/developer of GT face several challenges while processing complex graphs. We summarize a few unique technical challenges discussed by Sahu et al [158]. The technical challenges related to graphs are presented in Figure 49 in brief.…”

Section: Summary and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks

Majeed

Rauf

2020

Inventions

View full text Add to dashboard Cite

Graph theory (GT) concepts are potentially applicable in the field of computer science (CS) for many purposes. The unique applications of GT in the CS field such as clustering of web documents, cryptography, and analyzing an algorithm’s execution, among others, are promising applications. Furthermore, GT concepts can be employed to electronic circuit simplifications and analysis. Recently, graphs have been extensively used in social networks (SNs) for many purposes related to modelling and analysis of the SN structures, SN operation modelling, SN user analysis, and many other related aspects. Considering the widespread applications of GT in SNs, this article comprehensively summarizes GT use in the SNs. The goal of this survey paper is twofold. First, we briefly discuss the potential applications of GT in the CS field along with practical examples. Second, we explain the GT uses in the SNs with sufficient concepts and examples to demonstrate the significance of graphs in SN modeling and analysis.

show abstract

Section: Summary and Discussionmentioning

confidence: 99%

“…Inventions 2020, 5, 10 30 of 38 challenges discussed by Sahu et al[158]. The technical challenges related to graphs are presented inFigure 49in brief.…”

mentioning

confidence: 99%

Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks

Majeed

Rauf

2020

Inventions

View full text Add to dashboard Cite

show abstract

“…Pattern-matching is an important use-case of graph query processing [7,21,38]. In essence, such queries evaluate a join graph, shaped by the graph-pattern over one table holding the edges of the graph.…”

Section: Introductionmentioning

confidence: 99%

EdgeFrame

Fuchs

Boncz

Ghit³

2020

Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences &Amp; Systems (GRADES) and Network Dat

View full text Add to dashboard Cite

We describe the design and implementation of EdgeFrame: a graph-specialized Spark DataFrame that caches the edges of a graph in compressed form on all worker nodes of a cluster, and provides a fast and scalable Worst-Case-Optimal Join (WCOJ) that is especially useful for matching of complex and cyclical patterns in large graphs. Our choice to forego shuffle-or communication-based WCOJ is motivated by our analysis of the Shares algorithm for distributed WCOJ, that was proven communication-optimal, but which we show to quickly deteriorate to a full broadcast of all data already with moderately complex graph patterns. Our work shows that specializing WCOJ to a multi-way self-join, and leveraging compressed storage, provides a significant opportunity for better WCOJ performance. Finally, we investigate WCOJ parallelization and load-balancing strategies and show that fine-grained dynamic load-balancing with work-stealing is to be preferred, creating interesting insights and challenges for the future evolution of the Spark scheduler.

show abstract

“…

…”

mentioning

confidence: 99%

Incremental View Maintenance for Property Graph Queries

Szárnyas

2018

Proceedings of the 2018 International Conference on Management of Data

View full text Add to dashboard Cite

Graph processing challenges are common in modern database systems, with the property graph data model gaining widespread adoption [29]. Due to the novelty of the eld, graph databases and frameworks typically provide their own query language, such as Cypher for Neo4j [27], Gremlin for TinkerPop [28] and GraphScript for SAP HANA [24]. These languages often lack a formal background for their data model and semantics [1]. To address this, the openCypher initiative [21] aims to standardise a subset of the Cypher language, for which it currently provides grammar speci cation and a set of acceptance tests to allow vendors to implement their openCypher compatible engine.Incremental view maintenance has been used for decades in relational database systems [4]. In the graph domain, numerous use cases rely on complex queries and require low latency, including nancial fraud detection, source code analysis [32] and checking integrity (or well-formedness) constraints in databases [30]. While these could bene t from incremental evaluation, currently no property graph system provides incremental views. Our research investigates the incremental view maintenance for openCypher queries. A key challenge is that the property graph data model includes lists and maps, and queries can return arbitrarily nested data structures.We propose three desirable properties for an incremental property graph query engine: (IVM) incremental view maintenance, (FGN) ne granularity update operations on nested data structures, (ORD) ordering. Previous research showed that IVM and FGN is possible [19]. However, as stated in [8], "incremental view maintenance [IVM] strategies for data models that preserve order [ORD] remain an open problem to date". While removing support for ordering might seem a plausible workaround, it would pose serious limitations: (1) queries that require top-k results are common [17] and (2) even more importantly, Cypher handles paths as an alternating list of vertices and edges, which must be kept ordered.Therefore, we investigate the following research question: Which practical fragment of the openCypher language is incrementally maintainable?

show abstract

The ubiquity of large graphs and surprising challenges of graph processing: extended survey

Cited by 70 publications

References 25 publications

Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks

Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks

EdgeFrame

Incremental View Maintenance for Property Graph Queries

Contact Info

Product

Resources

About