Tractable Lineages on Treelike Instances: Limits and Extensions

    SIGMOD/PODS'16: International Conference on Management of Data San Francisco California USA June, 2016, pp. 355-370, 2016.

    Cited by: 29|Bibtex|Views5|Links
    EI

    Abstract:

    Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using different tools, we showed that query evaluation is linear-time on probabilistic databases for arbitrary mon...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments