Exploiting Data Partitioning To Provide Approximate Results

    Bruhathi Sundarmurthy
    Bruhathi Sundarmurthy

    SIGMOD/PODS '18: International Conference on Management of Data Houston TX USA June, 2018, pp. 1-5, 2018.

    Cited by: 3|Bibtex|Views0|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