Fast processing of graph queries on a large database of small and medium-sized data graphs

DOI10.1016/J.JCSS.2016.04.002zbMATH Open1408.68050OpenAlexW2335877399MaRDI QIDQ295652FDOQ295652

Authors: Dipali Pal, Praveen Rao, Vasil Slavov, Anas Katib 

Publication date: 13 June 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.04.002

Recommendations

• Efficient algorithms for supergraph query processing on graph databases
• Investigations on Path Indexing for Graph Databases
• SQL-based solution for fast graph similarity search
• Method for subgraph matching with inclusion degree
• Efficient search in graph databases using cross filtering

zbMATH Keywords

line graphsapproximate graph matchinggraph indexingquery processingsubgraph matching

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• An Algorithm for Subgraph Isomorphism
• Title not available (Why is that?)
• Integration of topological measures for eliminating non-specific interactions in protein interaction networks
• Algorithms for approximate graph matching
• Title not available (Why is that?)
• The interchange graph of a finite graph
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Multiset processing. Mathematical, computer science, and molecular computing points of view

Cited In (3)

• Title not available (Why is that?)
• Effective graph indexing model for graph containment search
• Efficient algorithms for supergraph query processing on graph databases

Uses Software

• TALE
• GraphGrep
• Fg-index
• SAPPER
• GADDI
• NeMa
• GString
• SING
• SAGA
• Pathway Commons

This page was built for publication: Fast processing of graph queries on a large database of small and medium-sized data graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295652)