Hybrid search plan generation for generalized graph pattern matching

DOI10.1016/J.JLAMP.2020.100563MaRDI QIDQ780064zbMATH OpenOpenAlexFDO

Authors Matthias Barkowsky, Holger Giese

Publication date 14 July 2020

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2020.100563

zbMATH Keywords

graph pattern matchingsearch plan generation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Efficient search in graph databases using cross filtering
• Host-graph-sensitive RETE nets for incremental graph pattern matching
• Incremental graph pattern matching
• SQL-based solution for fast graph similarity search
• Efficient pattern matching on big uncertain graphs

Cites work

• An Algorithm for Subgraph Isomorphism
• Fundamentals of algebraic graph transformation
• GrGen: A Fast SPO-Based Graph Rewriting Tool
• Incremental graph pattern matching
• On the operationalization of graph queries with generalized discrimination networks

Cited in

(4)

• Survey on dynamic graph pattern matching technologies
• Preface to the special issue on the 12th international conference on graph transformation
• Efficient pattern matching on big uncertain graphs
• Using regression-match graphs to control search in planning

Describes a project that uses

Uses Software

• Henshin
• GrGen

This page was built for publication: Hybrid search plan generation for generalized graph pattern matching

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