Ceci: Compact embedding cluster index for scalable subgraph matching
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
[PDF][PDF] CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
B Bhattarai, H Liu, HH Huang - 2019 - personal.stevens.edu
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
CECI: Compact embedding cluster index for scalable subgraph matching
B Bhattarai, H Liu, HH Huang - … on Management of Data …, 2019 - researchwithrutgers.com
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
[PDF][PDF] CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
B Bhattarai, H Liu, HH Huang - 2019 - asherliu.github.io
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
[PDF][PDF] CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
B Bhattarai, H Liu, HH Huang - 2019 - academia.edu
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
[PDF][PDF] CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
B Bhattarai, H Liu, HH Huang - 2019 - seas.gwu.edu
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …
[PDF][PDF] CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
B Bhattarai, H Liu, HH Huang - SIGMOD'19: Proceedings of the 2019 …, 2019 - par.nsf.gov
Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …
graph. For large graphs, current solutions face the scalability challenge due to expensive …