Efficient algorithms for supergraph query processing on graph databases

DOI10.1007/S10878-009-9221-1MaRDI QIDQ630186zbMATH OpenOpenAlexFDO

Authors Shuo Zhang, Xiaofeng Gao, Weili Wu, Hong Gao, Jianzhong Li

Publication date 17 March 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9221-1

zbMATH Keywords

graph indexingquery processing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Fast processing of graph queries on a large database of small and medium-sized data graphs
• Efficient search in graph databases using cross filtering
• Aggregated search in graph databases: preliminary results
• SQL-based solution for fast graph similarity search
• An efficient approach for mining frequent subgraphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A minimal line property preserving representation of line images
• An Algorithm for Subgraph Isomorphism

Cited in

(5)

• Aggregated search in graph databases: preliminary results
• Fast processing of graph queries on a large database of small and medium-sized data graphs
• SQBC: an efficient subgraph matching method over large and dense graphs
• Modern techniques for querying graph-structured databases
• Efficient search in graph databases using cross filtering

Describes a project that uses

Uses Software

• CloseGraph
• GString
• Fg-index
• XPath
• gSpan

This page was built for publication: Efficient algorithms for supergraph query processing on graph databases

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