Incremental graph pattern matching
DOI10.1145/2489791zbMATH Open1321.68243OpenAlexW2062705952MaRDI QIDQ2943546FDOQ2943546
Authors: Wenfei Fan, Xin Wang, Yinghui Wu 
Publication date: 3 September 2015
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17626352/Fan_Wang_ET_AL_2013_Incremental_Graph_Pattern_Matching.pdf
Recommendations
- Pattern graph change oriented incremental graph pattern matching
- A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
- Graph pattern matching with expressive outerplanar graph patterns
- Efficient pattern matching on big uncertain graphs
- scientific article; zbMATH DE number 1629832
- Constraint satisfaction algorithms for graph pattern matching
- Parallel algorithms for flexible pattern matching on big graphs
- Querying regular graph patterns
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Database theory (68P15) Algorithms on strings (68W32)
Cited In (16)
- Survey on dynamic graph pattern matching technologies
- Discovering rare categories from graph streams
- Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph
- A more efficient simulation algorithm on Kripke structures
- Limited approximate bisimulations and the corresponding rough approximations
- A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
- Pattern graph change oriented incremental graph pattern matching
- Strong simulation
- Host-graph-sensitive RETE nets for incremental graph pattern matching
- Efficient pattern matching on big uncertain graphs
- Hybrid search plan generation for generalized graph pattern matching
- Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
- Node matching computation between two large graphs in linear computational cost
- Linking entities across relations and graphs
- Network alignment by discrete Ollivier-Ricci flow
- Distributed graph pattern matching via bounded dual simulation
This page was built for publication: Incremental graph pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943546)
