SilkMoth: An Efficient Method for Finding Related Sets with Maximum Matching Constraints
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Dong Deng, Albert Kim, Samuel Madden, Michael Stonebraker
SilkMoth: An Efficient Method for Finding Related Sets with Maximum Matching Constraints
VLDB, 2017.

VLDB 2017
DBLP
Scholar
?EE?
DOI
Full names Links ISxN
@article{VLDB-2017-DengKMS,
	author        = "Dong Deng and Albert Kim and Samuel Madden and Michael Stonebraker",
	doi           = "10.14778/3115404.3115413",
	ee            = "http://www.vldb.org/pvldb/vol10/p1082-deng.pdf",
	journal       = "{Proceedings of the VLDB Endowment}",
	number        = 10,
	pages         = "1082--1093",
	title         = "{SilkMoth: An Efficient Method for Finding Related Sets with Maximum Matching Constraints}",
	volume        = 10,
	year          = 2017,
}


Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.