Providing support for full relational algebra in probabilistic databases

Authors:
Robert Fink;Dan Olteanu;Swaroop Rath
Affiliations:
Oxford University Computing Laboratory, OX1 3QD, UK;Oxford University Computing Laboratory, OX1 3QD, UK;Oxford University Computing Laboratory, OX1 3QD, UK
Venue:
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Year:
2011

Citing 0
Cited 7

On the optimal approximation of queries using tractable propositional languages

Proceedings of the 14th International Conference on Database Theory
SPROUT2: a squared query engine for uncertain web data

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Conjunctive query answering in probabilistic datalog+/- ontologies

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Answering threshold queries in probabilistic datalog+/-ontologies

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Declarative platform for data sourcing games

Proceedings of the 21st international conference on World Wide Web
Query answering under probabilistic uncertainty in Datalog+ / - ontologies

Annals of Mathematics and Artificial Intelligence
Anytime approximation in probabilistic databases

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extensive work has recently been done on the evaluation of positive queries on probabilistic databases. The case of queries with negation has notoriously been left out, since it raises serious additional challenges to efficient query evaluation.