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

DOI10.1016/j.jcss.2016.04.002zbMath1408.68050OpenAlexW2335877399MaRDI QIDQ295652

Praveen Rao, Anas Katib, Vasil Slavov, Dipali Pal

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

zbMATH Keywords

line graphsquery processingapproximate graph matchinggraph indexingsubgraph matching

Mathematics Subject Classification ID

Database theory (68P15)

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Integration of topological measures for eliminating non-specific interactions in protein interaction networks
• Algorithms for approximate graph matching
• An Algorithm for Subgraph Isomorphism
• 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

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