Sreenivas Gollapudi, Rina Panigrahy. The power of two min-hashes for similarity search among hierarchical data objects. In Maurizio Lenzerini, Domenico Lembo, editors, Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada. pages 211-220, ACM, 2008. [doi]
@inproceedings{GollapudiP08,
title = {The power of two min-hashes for similarity search among hierarchical data objects},
author = {Sreenivas Gollapudi and Rina Panigrahy},
year = {2008},
doi = {10.1145/1376916.1376946},
url = {http://doi.acm.org/10.1145/1376916.1376946},
tags = {data-flow, search},
researchr = {https://researchr.org/publication/GollapudiP08},
cites = {0},
citedby = {0},
pages = {211-220},
booktitle = {Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada},
editor = {Maurizio Lenzerini and Domenico Lembo},
publisher = {ACM},
isbn = {978-1-60558-108-8},
}