When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases.
Ciaran McCreeshPatrick ProsserChristine SolnonJames TrimblePublished in: J. Artif. Intell. Res. (2018)
Keyphrases
- graph databases
- subgraph isomorphism
- graph mining
- maximum common subgraph
- graph isomorphism
- application domains
- query language
- frequent subgraphs
- similarity search
- pattern mining
- regular expressions
- index structure
- hard problems
- structured data
- graph data
- graph model
- real life
- xml databases
- mining algorithm
- graph matching
- greedy algorithm
- complex networks
- database management systems
- high dimensional