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

DOI10.1016/J.JCSS.2016.04.002MaRDI QIDQ295652zbMATHOpenAlexFDO

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

zbMATH Keywords

line graphsapproximate graph matchinggraph indexingquery processingsubgraph matching

Mathematics Subject Classification ID

Database theory (68P15)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 866015 (Why is no real title available?)
• Algorithms for approximate graph matching
• An Algorithm for Subgraph Isomorphism
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Integration of topological measures for eliminating non-specific interactions in protein interaction networks
• Multiset processing. Mathematical, computer science, and molecular computing points of view
• The interchange graph of a finite graph

Cited in

(8)

• SQL-based solution for fast graph similarity search
• Effective graph indexing model for graph containment search
• Method for subgraph matching with inclusion degree
• Utilizing multilevel community center labels for distance querying in large graphs
• ASA-graphs for efficient data representation and processing
• Efficient algorithms for supergraph query processing on graph databases
• Modern techniques for querying graph-structured databases
• scientific article; zbMATH DE number 5033869 (Why is no real title available?)

Describes a project that uses

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)