TY - GEN
T1 - On probabilistic fixpoint and Markov chain query languages
AU - Deutch, Daniel
AU - Koch, Christoph
AU - Milo, Tova
PY - 2010/7/23
Y1 - 2010/7/23
N2 - 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.
AB - 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.
KW - Markov chains
KW - probabilistic fixpoint
UR - http://www.scopus.com/inward/record.url?scp=77954729163&partnerID=8YFLogxK
U2 - 10.1145/1807085.1807114
DO - 10.1145/1807085.1807114
M3 - Conference contribution
AN - SCOPUS:77954729163
SN - 9781450300339
T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
SP - 215
EP - 225
BT - PODS'10 - Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
T2 - 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010
Y2 - 6 June 2010 through 11 June 2010
ER -