Exploiting Data Partitioning To Provide Approximate Results

    BeyondMR@SIGMOD, pp. 5:1-5:5, 2018.

    Cited by: 3|Bibtex|Views1|Links
    EI

    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.

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments