Thesis icon

Thesis

Evaluation of relational algebra queries on probabilistic databases: tractability and approximation

Abstract:

Query processing is a core task in probabilistic databases: Given a query and a database that encodes uncertainty in data by means of probability distributions, the problem is to compute possible query answers together with their respective probabilities of being correct. This thesis advances the state of the art in two aspects of query processing in probabilistic databases: complexity analysis and query evaluation techniques. A dichotomy is established for non-repeating, con- junctive rel...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
St Cross College
Role:
Author

Contributors

Division:
MPLS
Department:
Computer Science
Role:
Supervisor
More from this funder
Funding agency for:
Fink, RD
Grant:
FP7- ICT-233599
Publication date:
2014
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Keywords:
Subjects:
UUID:
uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b
Local pid:
ora:10030
Deposit date:
2015-02-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP