Title
Exploiting Data Partitioning To Provide Approximate Results
Abstract
Co-hash partitioning is a popular partitioning strategy in distributed query processing, where tables are co-located using join predicates. In this paper, we study the benefits of co-hash partitioning for obtaining approximate answers.
Year
DOI
Venue
2018
10.1145/3206333.3206337
SIGMOD/PODS '18: International Conference on Management of Data Houston TX USA June, 2018
DocType
ISBN
Citations 
Conference
978-1-4503-5703-6
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Bruhathi Sundarmurthy161.08
Paraschos Koutris234726.63
Jeffrey F. Naughton383631913.71