LIVE learns monotonic vertex embeddings using a differentiable surrogate objective and a lightweight iLabel index to outperform prior methods in efficiency and pruning for exact subgraph matching.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2verdicts
UNVERDICTED 2representative citing papers
Three new mechanisms for load balancing, GPU caching, and query plan ranking extend GNN-PE to achieve efficient exact subgraph matching on distributed systems.
citing papers explorer
-
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
LIVE learns monotonic vertex embeddings using a differentiable surrogate objective and a lightweight iLabel index to outperform prior methods in efficiency and pruning for exact subgraph matching.
-
Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking
Three new mechanisms for load balancing, GPU caching, and query plan ranking extend GNN-PE to achieve efficient exact subgraph matching on distributed systems.