Worst-Case Optimal Algorithms for Parallel Query Processing

    international conference on database theory, pp. 8:1-8:18, 2016.

    Cited by: 35|Bibtex|Views11|Links
    EI

    Abstract:

    In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with p servers. In contrast to previous work, where upper and lower bounds on the communication were specified for particular structures of data (either data without skew, or data with specific ty...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments