NDLI: Scalable subgraph enumeration in MapReduce: a cost-oriented approach

Please wait, while we are loading the content...

Scalable subgraph enumeration in MapReduce: a cost-oriented approach

Content Provider	Springer Nature Link
Author	Lai, Longbin Qin, Lu Lin, Xuemin Chang, Lijun
Copyright Year	2017
Abstract	Subgraph enumeration, which aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph, is a fundamental graph problem with a wide range of applications. However, existing sequential algorithms for subgraph enumeration fall short in handling large graphs due to the involvement of computationally intensive subgraph isomorphism operations. Thus, some recent researches focus on solving the problem using MapReduce. Nevertheless, exiting MapReduce approaches are not scalable to handle very large graphs since they either produce a huge number of partial results or consume a large amount of memory. Motivated by this, in this paper, we propose a new algorithm $$\mathsf {Twin}$$ $$\mathsf {Twig}$$ $$\mathsf {Join}$$ based on a left-deep-join framework in MapReduce, in which the basic join unit is a $$\mathsf {Twin}$$ $$\mathsf {Twig}$$ (an edge or two incident edges of a node). We show that in the Erdös–Rényi random graph model, $$\mathsf {Twin}$$ $$\mathsf {Twig}$$ $$\mathsf {Join}$$ is instance optimal in the left-deep-join framework under reasonable assumptions, and we devise an algorithm to compute the optimal join plan. We further discuss how our approach can be adapted to handle the power-law random graph model. Three optimization strategies are explored to improve our algorithm. Ultimately, by aggregating equivalent nodes into a compressed node, we construct the compressed graph, upon which the subgraph enumeration is further improved. We conduct extensive performance studies in several real graphs, one of which contains billions of edges. Our approach significantly outperforms existing solutions in all tests.
Starting Page	421
Ending Page	446
Page Count	26
File Format	PDF
ISSN	10668888
Journal	The VLDB Journal
Volume Number	26
Issue Number	3
e-ISSN	0949877X
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2017-02-21
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	MapReduce Subgraph enumeration Random graph Power-law graph Database Management
Content Type	Text
Resource Type	Article
Subject	Information Systems Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient distributed subgraph similarity matching

AutoG: a visual query autocompletion framework for graph databases

Efficient and scalable labeled subgraph matching using SGMatch

GRAIL: a scalable index for reachability queries in very large graphs

Graph similarity search on large uncertain graph databases

EpiC: an extensible and scalable system for processing Big Data

Subgraph similarity maximal all-matching over a large uncertain graph

High efficiency and quality: large graphs matching

Decorating the cloud: enabling annotation management in MapReduce

Scalable subgraph enumeration in MapReduce: a cost-oriented approach

Similar Documents

Efficient distributed subgraph similarity matching

AutoG: a visual query autocompletion framework for graph databases

Efficient and scalable labeled subgraph matching using SGMatch

GRAIL: a scalable index for reachability queries in very large graphs

Graph similarity search on large uncertain graph databases

EpiC: an extensible and scalable system for processing Big Data

Subgraph similarity maximal all-matching over a large uncertain graph

High efficiency and quality: large graphs matching

Decorating the cloud: enabling annotation management in MapReduce

Scalable subgraph enumeration in MapReduce: a cost-oriented approach