Semantics and evaluation of top-k queries in probabilistic databases
- 11 July 2009
- journal article
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 26 (1) , 67-126
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- World-set decompositions: Expressiveness and efficient algorithmsTheoretical Computer Science, 2008
- On the semantics and evaluation of top-k queries in probabilistic databases2008
- OLAP over uncertain and imprecise dataThe VLDB Journal, 2006
- Efficient query evaluation on probabilistic databasesThe VLDB Journal, 2006
- Combining Fuzzy Information from Multiple SystemsJournal of Computer and System Sciences, 1999
- ProbViewACM Transactions on Database Systems, 1997
- A probabilistic relational algebra for the integration of information retrieval and database systemsACM Transactions on Information Systems, 1997
- Query evaluation in probabilistic relational databasesTheoretical Computer Science, 1997
- An analysis of first-order logics of probabilityArtificial Intelligence, 1990
- Incomplete Information in Relational DatabasesJournal of the ACM, 1984