Probabilistic Datalog—a logic for powerful retrieval methods
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Approximation algorithms
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Trio: a system for data, uncertainty, and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Query language support for incomplete information in the MayBMS system
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational methods for analyzing human genetic variation
Computational methods for analyzing human genetic variation
A compositional query algebra for second-order logic and uncertain databases
Proceedings of the 12th International Conference on Database Theory
A compositional framework for complex queries over uncertain data
Proceedings of the 12th International Conference on Database Theory
On Query Algebras for Probabilistic Databases
ACM SIGMOD Record
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Declarative platform for data sourcing games
Proceedings of the 21st international conference on World Wide Web
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Query languages for graph databases
ACM SIGMOD Record
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Whom to ask?: jury selection for decision making tasks on micro-blog services
Proceedings of the VLDB Endowment
Simulation of database-valued markov chains using SimSQL
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e.g. datalog rules) can fire probabilistically. We define two possible semantics for such query languages, namely inflationary semantics where the results of each computation step are added to the current database and noninflationary queries that induce a random walk in-between database instances. We then study the complexity of exact and approximate query evaluation under these semantics.