2,766 Hits in 5.6 sec

A Survey on Distributed Graph Pattern Matching in Massive Graphs

Sarra Bouhenni, Saïd Yahiaoui, Nadia Nouali-Taboudjemat, Hamamache Kheddouci
2021 ACM Computing Surveys  
Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it impractical for graph pattern matching (GPM) in the context of big data.  ...  This article discusses and proposes a classification of distributed GPM approaches with a narrow focus on the relaxed models.  ...  Edge-centric: In this class of programming models, the parallel program iterates over the graph edges.  ... 
doi:10.1145/3439724 fatcat:vib22wz2zffo3c5alriufetwaa

A distributed vertex-centric approach for pattern matching in massive graphs

Arash Fard, M. Usman Nisar, Lakshmish Ramaswamy, John A. Miller, Matthew Saltz
2013 2013 IEEE International Conference on Big Data  
However, developing scalable and efficient BSP-based algorithms for pattern matching is very challenging because this problem does not naturally align with a vertex-centric programming paradigm.  ...  In recent years, graph processing frameworks such as Pregel have sought to harness shared nothing clusters for processing massive graphs through a vertex-centric, Bulk Synchronous Parallel (BSP) programming  ...  There are also some proposed approaches based on indexing to increase efficiency of answering graph pattern matching queries; for example [17] or [18] .  ... 
doi:10.1109/bigdata.2013.6691601 dblp:conf/bigdataconf/FardNRMS13 fatcat:3rphdyjkvfb2fm2wifm7lnazcq

Techniques for Graph Analytics on Big Data

M. Usman Nisar, Arash Fard, John A. Miller
2013 2013 IEEE International Congress on Big Data  
We study the speedup and communication behavior of three distributed algorithms for inexact graph pattern matching.  ...  The field of graph pattern matching has been of significant importance and has wide-spread applications. Conceptually, we want to find subgraphs that match a pattern in a given graph.  ...  George Karypis and Semih Salihoglu for their generous help and assistance with METIS and GPS, respectively.  ... 
doi:10.1109/bigdata.congress.2013.78 dblp:conf/bigdata/NisarFM13 fatcat:q6bspdibq5fllli732lo53bkzi

SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems [article]

Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan Gómez Luna, Marcin Copik (+6 others)
2021 arXiv   pre-print
However, they also come with nonstraightforward parallelism and complicated memory access patterns.  ...  Set-centric SISA-enhanced algorithms are efficient and outperform hand-tuned baselines, offering more than 10x speedup over the established Bron-Kerbosch algorithm for listing maximal cliques.  ...  We thank Timo Schneider for his immense help with computing infrastructure at SPCL.  ... 
arXiv:2104.07582v2 fatcat:vxkku5ytrjggbher45qthnv564

Towards Efficient Query Processing on Massive Time-Evolving Graphs

Arash Fard, Amir Abdolrashidi, Lakshmish Ramaswamy, John Miller
2012 Proceedings of the 8th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing  
The second is the answering of reachability queries on any snapshot of a TEG and the third is that of processing pattern matching queries in TEGs.  ...  For each problem, we provide a brief literature survey and explain why trivial extensions of static graph techniques are not adequate for TEGs.  ...  Then they adjust this result graph to update it based on the changes in data graph. C. Our Approach We suggest an approach for efficiently processing distributed subgraph matching on BSP framework.  ... 
doi:10.4108/icst.collaboratecom.2012.250532 dblp:conf/colcom/FardARM12 fatcat:74gujymfdrckzodi4tfdurogbe

Reusing Data Reorganization for Efficient SIMD Parallelization of Adaptive Irregular Applications

Peng Jiang, Linchuan Chen, Gagan Agrawal
2016 Proceedings of the 2016 International Conference on Supercomputing - ICS '16  
This indexing approach is first applied on a class of vertex-centric graph algorithms where the set of active vertices varies over the executionthe indexing method helps maintain the set of active edges  ...  In this paper, we propose an indexing method that facilitates the reuse of data reorganization for efficient SIMD parallelization of dynamic irregular applications.  ...  In this paper, we present a method for efficient SIMD parallelization of irregular applications with time varying data access patterns.  ... 
doi:10.1145/2925426.2926285 dblp:conf/ics/JiangCA16 fatcat:zrz5x4g77fadvo3ip6gyo6r2ka

Parallel K-Clique Counting on GPUs [article]

Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-mei Hwu
2022 arXiv   pre-print
It incorporates both vertex-centric and edge-centric parallelization schemes for distributing work across thread blocks, and further partitions work within each thread block to extract fine-grain multi-level  ...  While there has been work on related problems such as finding maximal cliques and generalized sub-graph matching on GPUs, k-clique counting in particular has yet to be explored in depth.  ...  This work was supported in part by the IBM-Illinois Center for Cognitive Computing Systems Research (C3SR).  ... 
arXiv:2104.13209v2 fatcat:okpkslnp6bd2hnbuiwflnxv7ku

Let High-level Graph Queries Be Parallel Efficient: An Approach Over Structural Recursion On Pregel

Chong Li, Le-Duc Tung, Xiaodong Meng, Zhenjiang Hu
2016 Journal of Information Processing  
Graphs play an important role today in managing big data. Supporting declarative graph queries is one of the most crucial parts for efficiently manipulating graph databases.  ...  Therefore, the complexity in developing efficient structural recursive functions is relaxed by our solution.  ...  It follows the vertex-centric approach where a common function is applied to each vertex. GraphX [16] is built on the Spark cluster computing system * 1 for graphs and graph-parallel computation.  ... 
doi:10.2197/ipsjjip.24.928 fatcat:vex7gd3il5g33iksygvhepzwqy

Parallelisation and Application of AD 3 as a Method for Solving Large Scale Combinatorial Auctions [chapter]

Francisco Cruz-Mencia, Jesus Cerquides, Antonio Espinosa, Juan Carlos Moure, Juan A. Rodriguez-Aguilar
2015 Lecture Notes in Computer Science  
Therefore PAR-AD 3 becomes the algorithm of choice to solve large-scale WDP LP relaxations for hard instances.  ...  The recently proposed Alternate Direction Dual Decomposition algorithm (AD 3 ) has been shown to efficiently solve large-scale LP relaxations.  ...  We have proposed a novel approach to solve the LP relaxation for the WDP.  ... 
doi:10.1007/978-3-319-19282-6_10 fatcat:nyccoq6xe5dy5cgkd3svmvnykm

An analysis of the graph processing landscape

Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
2021 Journal of Big Data  
For these systems focused on processing the bulk of graph elements, common use-cases consist in executing for example algorithms for vertex ranking or community detection, which produce insights on graph  ...  and different definitions related to the potential for a graph to be updated.  ...  Many definitions exist such as PageRank and betweenness centrality, for example. There also heuristics to measure the relevance of edges such as spanning edge betweenness [65] . Pattern matching.  ... 
doi:10.1186/s40537-021-00443-9 pmid:33850687 pmcid:PMC8033100 fatcat:vnwcn2pwszhv3detnwcv6jrthu

GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics [chapter]

Yogesh Simmhan, Alok Kumbhare, Charith Wickramaarachchi, Soonil Nagarkar, Santosh Ravi, Cauligi Raghavendra, Viktor Prasanna
2014 Lecture Notes in Computer Science  
We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation.  ...  In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters.  ...  Better partitioning to balance the sub-graphs can help. The framework is also susceptible to small-world graphs with high edge degrees that have high sub-graph level computational complexity.  ... 
doi:10.1007/978-3-319-09873-9_38 fatcat:5yhseslvtjavtonztczswyvdte

Research Directions for Big Data Graph Analytics

John A. Miller, Lakshmish Ramaswamy, Krys J. Kochut, Arash Fard
2015 2015 IEEE International Congress on Big Data  
Unfortunately, seemingly simple problems, such as finding patterns in a data graph matching a query graph are surprisingly difficult.  ...  Whether it be determination of shortest paths or finding patterns in a data graph matching a query graph, the issue is to find interesting characteristics or information content from graphs.  ...  First, designing parallel graph algorithms whether in the vertex-centric or graph centric paradigms is not straightforward; certain problems such as subgraph pattern matching are notoriously difficult  ... 
doi:10.1109/bigdatacongress.2015.132 dblp:conf/bigdata/MillerRKF15 fatcat:ws7anjfh3nh3lh7aw44cnwo4hm

Towards Reuse of Business Processes Patterns to Design Services [chapter]

Veronica Gacitua-Decar, Claus Pahl
2010 Emerging Web Services Technology Volume III  
Graph-based pattern matching and pattern discovery are proposed to recommend the scope and granularity of services on process-centric description models.  ...  Matching of generalised patterns and hierarchical matching are discussed.  ...  Acknowledgment We want to thanks Lero -The Irish Software Engineering Research Centre and CONICYT (Chile) for supporting this work.  ... 
doi:10.1007/978-3-0346-0104-7_2 dblp:conf/ecows/Gacitua-DecarP08 fatcat:l6f263yihjcgbkvys7w4vivoee

Big Graph Analytics Platforms

Da Yan, Yingyi Bu, Yuanyuan Tian, Amol Deshpande
2017 Foundations and Trends in Databases  
In a recent work, propose a vertex-centric approach for continuous pattern matching for dynamic graphs using Apache Giraph.  ...  Choudhury et al. [2015] investigate a selectivitydriven approach for continuous pattern detection on streaming graphs.  ...  Then, parallel asynchronous I/O requests are submitted to the SSD for those required pages that are not in the buffer pool.  ... 
doi:10.1561/1900000056 fatcat:ucqrtzo4q5g2lpj6dmp7jv3e5m

Combining Vertex-Centric Graph Processing with SPARQL for Large-Scale RDF Data Analytics

Ibrahim Abdelaziz, Razen Harbi, Semih Salihoglu, Panos Kalnis
2017 IEEE Transactions on Parallel and Distributed Systems  
It implements a generic SPARQL operator as a vertex-centric program that interprets SPARQL queries and executes them efficiently using a built-in optimizer.  ...  Spartex builds on existing vertex-centric graph processing frameworks, such as Graphlab or Pregel.  ...  [42] proposed techniques for approximate subgraph pattern matching over vertex-centric frameworks. However, these solutions are approximate, while SPARQL requires exact subgraph pattern matching.  ... 
doi:10.1109/tpds.2017.2720174 fatcat:yolgu6hg75fixgtffmmew57kle
« Previous Showing results 1 — 15 out of 2,766 results