Reproduce “Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Wonseok Shin, Siwoo Song, Kunsoo Park, Wook-Shin Han

FaSTest estimates counts of injective, label- and edge-preserving query-graph embeddings without enumerating them. It filters impossible candidates while retaining valid embeddings, samples the reduced candidate space, and switches to graph sampling when tree sampling struggles. On WordNet-20, its average q-error was 1.81, versus 418.5 for Alley+TPI; ground truth was limited to queries exact counting finished within two hours.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.