Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture

    ACM Transactions on Database Systems, Volume 40, Issue 4, 2014, Pages 64-75.

    Cited by: 23|Bibtex|Views23|Links
    EI
    Keywords:
    cloud programmingcoordinationexpressive powerconsistencyrelational transducerMore(3+)

    Abstract:

    The CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the query is monotone. Zinn et al. [2012] extended the framework of relational transducer net...More

    Code:

    Data:

    Your rating :
    0

     

    Best Paper
    Best Paper of PODS, 2014
    Tags
    Comments