Skip to main content
Article thumbnail
Location of Repository

On Probabilistic Fixpoint and Markov Chain Query Languages

By Daniel Deutch, Christoph Koch and Tova Milo

Abstract

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 non-inflationary queries that induce a random walk in-between database instances. We then study the complexity of exact and approximate query evaluation under these semantics

Topics: Statistics] General Terms
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.192.5581
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cornell.edu/%7Ek... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.