When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases