Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph

DOI10.1155/2020/8871756zbMATH Open1454.68142OpenAlexW3115350520MaRDI QIDQ2228151FDOQ2228151

Authors: Yunhao Sun, Guanyu Li, Mengmeng Guan, Bo Ning 

Publication date: 16 February 2021

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8871756

Recommendations

• Method for subgraph matching with inclusion degree
• Distributed top-\(k\) subgraph matching
• An approach for approximate subgraph matching in domain knowledge graph
• An approach for approximate subgraph matching in fuzzy RDF graph
• Survey on dynamic graph pattern matching technologies

Mathematics Subject Classification ID

Knowledge representation (68T30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• C-SPARQL: a continuous query language for RDF data streams
• An Algorithm for Subgraph Isomorphism
• Title not available (Why is that?)
• Incremental graph pattern matching
• Title not available (Why is that?)

Cited In (5)

• Survey on dynamic graph pattern matching technologies
• Temporal subgraph matching method for multi-connected temporal graph
• Method for subgraph matching with inclusion degree
• Distributed top-\(k\) subgraph matching
• An approach for approximate subgraph matching in domain knowledge graph

Uses Software

• C-SPARQL
• SPARQL
• Jena

This page was built for publication: Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph

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