Database Paper Browser

Back to papers

SilkMoth: An Efficient Method for Finding Related Sets with Maximum Matching Constraints

Summary: SilkMoth uses set signatures to prune candidates; only signature-matching sets enter the expensive max-matching step. It guarantees exact results, proves NP-hardness of optimal signature selection, and adds two pruning filters plus a triangle-inequality optimization, enabling broader similarity functions with substantial speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11394
Venue
VLDB
Year
2017
Pagerank
5.6428428e-05
Overall Rank
5,179 | 63.98%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers