Database Paper Browser

Back to papers

On Probabilistic Fixpoint and Markov Chain Query Languages

Summary: Generalizes datalog/fixpoint/while so rules fire probabilistically, yielding probabilistic fixpoint/while query languages. Introduces inflationary vs non-inflationary (random-walk/Markov-chain) semantics and analyzes exact/approximate evaluation complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1521
Venue
PODS
Year
2010
Pagerank
7.3215694e-05
Overall Rank
3,251 | 77.39%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
1,158 Simulation of Database-Valued Markov Chains Using SimSQL 2013 SIGMOD 0.0001361064
4,651 Whom to Ask? Jury Selection for Decision Making Tasks on Micro-blog Services 2012 VLDB 6.022931e-05
6,003 Generative Datalog with Continuous Distributions 2020 PODS 5.2415551e-05
6,662 Selective Provenance for Datalog Programs Using Top-K Queries 2015 VLDB 4.9704872e-05
7,878 DBToaster: Agile Views in a Dynamic Data Management System 2011 CIDR 4.6295401e-05
11,158 Generative Datalog with Stable Negation 2023 PODS 4.1945683e-05
12,113 Mob Data Sourcing 2012 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers