Efficient parallel set-similarity joins using MapReduce

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Rares Vernica University of California, Irvine, Irvine, CA, USA
Michael J. Carey University of California, Irvine, Irvine, CA, USA
Chen Li University of California, Irvine, Irvine, CA, USA
Published in:
Cover Image
 
· Proceeding
SIGMOD '10 Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Pages 495-506
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0032-2 doi>10.1145/1807167.1807222
Efficient parallel set-similarity joins using MapReduce Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 43
· Downloads (12 Months): 296
· Downloads (cumulative): 1,195
· Citation Count: 48


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder