NDLI: Efficient and scalable labeled subgraph matching using SGMatch

Content Provider	Springer Nature Link
Author	Rivero, Carlos R. Jamil, Hasan M.
Copyright Year	2016
Abstract	Graphs are natural candidates for modeling application domains, such as social networks, pattern recognition, citation networks, or protein–protein interactions. One of the most challenging tasks in managing graphs is subgraph matching over data graphs, which attempts to find one-to-one correspondences, called solutions, among the query and data nodes. To compute solutions, most contemporary techniques use backtracking and recursion. An open research question is whether graphs can be matched based on parts and local solutions can be combined to reach a global matching. In this paper, we present an approach based on graph decomposition called SGMatch to match graphs. We represent graphs in smaller units called graphlets and develop a matching technique to leverage this representation. Pruning strategies use a new notion of edge covering called minimum hub cover and metadata, such as statistics and inverted indices, to reduce the number of matching candidates. Our evaluation of SGMatch versus contemporary algorithms, i.e., VF2, GraphQL, QuickSI, GADDI, or SPath, shows that SGMatch substantially improves the performance of current state-of-the-art techniques for larger query graphs with different structures, i.e., cliques, paths or subgraphs.
Starting Page	61
Ending Page	87
Page Count	27
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	51
Issue Number	1
e-ISSN	02193116
Language	English
Publisher	Springer London
Publisher Date	2016-07-05
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Graph management Query processing Subgraph matching Information Systems and Communication Service IT in Business
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Information Systems Human-Computer Interaction Hardware and Architecture Software

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 entity resolution based on subgraph cohesion

A survey of query result diversification

Truss decomposition of uncertain graphs

An efficient graph-mining method for complicated and noisy data with real-world applications

A graph-theoretic approach to optimize keyword queries in relational databases

Dynamic and fast processing of queries on large-scale RDF data

LC-mine: a framework for frequent subgraph mining with local consistency techniques

Extending metric index structures for efficient range query processing

Constrained recommendations for query visualizations

Efficient and scalable labeled subgraph matching using SGMatch

Similar Documents

Efficient entity resolution based on subgraph cohesion

A survey of query result diversification

Truss decomposition of uncertain graphs

An efficient graph-mining method for complicated and noisy data with real-world applications

A graph-theoretic approach to optimize keyword queries in relational databases

Dynamic and fast processing of queries on large-scale RDF data

LC-mine: a framework for frequent subgraph mining with local consistency techniques

Extending metric index structures for efficient range query processing

Constrained recommendations for query visualizations

Efficient and scalable labeled subgraph matching using SGMatch