NDLI: Enumerating subgraph instances using map-reduce

Content Provider	IEEE Xplore Digital Library
Author	Afrati, F.N. Fotakis, D. Ullman, J.D.
Copyright Year	2013
Description	Author affiliation: Stanford Univ., Stanford, CA, USA (Ullman, J.D.) \|\| Nat. Tech. Univ. of Athens, Athens, Greece (Afrati, F.N.; Fotakis, D.)
Abstract	The theme of this paper is how to find all instances of a given “sample” graph in a larger “data graph,” using a single round of map-reduce. For the simplest sample graph, the triangle, we improve upon the best known such algorithm. We then examine the general case, considering both the communication cost between mappers and reducers and the total computation cost at the reducers. To minimize communication cost, we exploit the techniques of [1] for computing multiway joins (evaluating conjunctive queries) in a single map-reduce round. Several methods are shown for translating sample graphs into a union of conjunctive queries with as few queries as possible. We also address the matter of optimizing computation cost. Many serial algorithms are shown to be “convertible,” in the sense that it is possible to partition the data graph, explore each partition in a separate reducer, and have the total computation cost at the reducers be of the same order as the computation cost of the serial algorithm.
Sponsorship	IEEE Comput. Soc.
Starting Page	62
Ending Page	73
File Size	448570
Page Count	12
File Format	PDF
ISBN	9781467349093
ISSN	10636382
e-ISBN	9781467349109
e-ISBN	9781467349086
DOI	10.1109/ICDE.2013.6544814
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-04-08
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Partitioning algorithms Approximation algorithms Complexity theory Silicon Educational institutions Abstracts Probabilistic logic
Content Type	Text
Resource Type	Article

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

Enumerating subgraph instances using map-reduce (2012)

Enumerating Subgraph Instances Using Map-Reduce

Partitioning Spatially Located Computations Using Rectangles

Enumerating subgraph instances using map-reduce (2012)

On the complexity of randomized approximations of nonconvex sets

enList: Automatically Simplifying Privacy Policies

A new partitioning based algorithm for document clustering

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop

Rumor source detection under probabilistic sampling

Enumerating subgraph instances using map-reduce

Similar Documents

Enumerating subgraph instances using map-reduce (2012)

Enumerating Subgraph Instances Using Map-Reduce

Partitioning Spatially Located Computations Using Rectangles

Enumerating subgraph instances using map-reduce (2012)

On the complexity of randomized approximations of nonconvex sets

enList: Automatically Simplifying Privacy Policies

A new partitioning based algorithm for document clustering

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop

Rumor source detection under probabilistic sampling

Enumerating subgraph instances using map-reduce