research-article

On probabilistic fixpoint and Markov chain query languages

Authors:

Christoph Koch,

Tova MiloAuthors Info & Claims

PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 215 - 226

https://doi.org/10.1145/1807085.1807114

Published: 06 June 2010 Publication History

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 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.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. U. Nabar, T. Sugihara, and J. Widom. "Trio: A System for Data, Uncertainty, and Lineage". In VLDB, 2006.

Digital Library

[3]

L. Antova, C. Koch, and D. Olteanu. "From Complete to Incomplete Information and Back". In Proc. SIGMOD, 2007.

Digital Library

[4]

L. Antova, C. Koch, and D. Olteanu. "Query Language Support for Incomplete Information in the MayBMS System". In Proc. VLDB, 2007.

Digital Library

[5]

V. Bansal. "Computational Methods for Analyzing Human Genetic Variations". PhD thesis, University of California, San Diego, 2009.

Digital Library

[6]

O. Benjelloun, A. D. Sarma, C. Hayworth, and J. Widom. "An Introduction to ULDBs and the Trio System". IEEE Data Engineering Bulletin, 2006.

[7]

D. P. Bertsekas and J. N. Tsitsiklis. Introduction to Probability. MIT Press, 2008.

[8]

N. Dalvi and D. Suciu. "Efficient query evaluation on probabilistic databases". VLDB Journal, 16(4):523--544, 2007.

Digital Library

[9]

L. De Raedt, A. Kimmig, and H. Toivonen. "ProbLog: A Probabilistic Prolog and Its Application in Link Discovery". In IJCAI, 2007.

Digital Library

[10]

D. Freedman. Markov Chains. Springer-Verlag, 1983.

[11]

N. Fuhr. "Probabilistic Datalog - A Logic For Powerful Retrieval Methods". In Proc. SIGIR, pages 282--290, 1995.

Digital Library

[12]

M. Goetz and C. Koch. "A Compositional Framework for Complex Queries over Uncertain Data". In Proc. ICDT, 2009.

Digital Library

[13]

T. J. Green and V. Tannen. "Models for Incomplete and Probabilistic Information". IEEE Data Eng. Bull., 29(1):17--24, 2006.

[14]

M. Jerrum and A. Sinclair. "The Markov chain Monte Carlo method: an approach to approximate counting and integration". Approximation algorithms for NP-hard problems, 1997.

Digital Library

[15]

C. Koch. "Approximating Predicates and Expressive Queries on Probabilistic Databases". In Proc. PODS, 2008.

Digital Library

[16]

C. Koch. "On Query Algebras for Probabilistic Databases". SIGMOD Record, 37(4):78--85, 2008.

Digital Library

[17]

C. Koch. "A Compositional Query Algebra for Second-Order Logic and Uncertain Databases". In Proc. ICDT, 2009.

Digital Library

[18]

C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.

[19]

D. Randall. "Mixing (a tutorial on Markov Chains)". In FOCS, 2003.

Digital Library

[20]

C. Re, N. Dalvi, and D. Suciu. "Efficient Top-k Query Evaluation on Probabilistic Data". In ICDE, 2007.

[21]

P. Sen and A. Deshpande. "Representing and Querying Correlated Tuples in Probabilistic Databases". In ICDE, 2007.

[22]

D. Sorensen and D. Gianola. "Likelihood, Bayesian, and MCMC Methods in Quantitative Genetics". Springer-Verlag, New York, July 2002.

[23]

Stanford Trio Project. "TriQL - The Trio Query Language", 2006.

[24]

L. Valiant. "The complexity of computing the permanent". Theoretical Computer Science, 8(2):189--201, 1979.

[25]

M. Y. Vardi. "The Complexity of Relational Query Languages". In Proc. STOC, pages 137--146, 1982.

Digital Library

[26]

V. V. Vazirani. Approximation Algorithms. Springer, 2004.

Digital Library

Cited By

Alviano MLanzinger MMorak MPieris AGeerts FNgo HSintos S(2023)Generative Datalog with Stable NegationProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588656(21-32)Online publication date: 18-Jun-2023
Grohe MKaminski BKatoen JLindner P(2022)Generative Datalog with Continuous DistributionsJournal of the ACM10.1145/355910269:6(1-52)Online publication date: 17-Nov-2022
Suciu DOlteanu DRé CKoch C(2022)Probabilistic DatabasesundefinedOnline publication date: 2-Mar-2022
Show More Cited By

Index Terms

On probabilistic fixpoint and Markov chain query languages

Recommendations

Horn clauses and the fixpoint query hierarchy
PODS '82: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

A logic program consists of a set of Horn clauses, and can be used to express a query on relational data bases. It is shown that logic programs express precisely the queries in YE⁺ (the set of queries representable by a fixpoint applied to a positive ...
Query evaluation in deductive databases with alternating fixpoint semantics

First-order formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the well-founded semantics of normal logic programs to general logic programs with arbitrary first-order formulas in rule bodies. ...
Query languages for data exchange: beyond unions of conjunctive queries
ICDT '09: Proceedings of the 12th International Conference on Database Theory

The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms of data complexity). However, this is not the only class with this ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2010

350 pages

ISBN:9781450300339

DOI:10.1145/1807085

General Chair:
Jan Paredaens
University of Antwerp, Belgium
,
Program Chair:
Dirk Van Gucht
Indiana University, USA

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '10

Sponsor:

SIGMOD

SIGMOD/PODS '10: International Conference on Management of Data

June 6 - 11, 2010

Indiana, Indianapolis, USA

Acceptance Rates

PODS '10 Paper Acceptance Rate 27 of 113 submissions, 24%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
247
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)2

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Alviano MLanzinger MMorak MPieris AGeerts FNgo HSintos S(2023)Generative Datalog with Stable NegationProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588656(21-32)Online publication date: 18-Jun-2023
Grohe MKaminski BKatoen JLindner P(2022)Generative Datalog with Continuous DistributionsJournal of the ACM10.1145/355910269:6(1-52)Online publication date: 17-Nov-2022
Suciu DOlteanu DRé CKoch C(2022)Probabilistic DatabasesundefinedOnline publication date: 2-Mar-2022
Grohe MKaminski BKatoen JLindner PSuciu DTao YWei Z(2020)Generative Datalog with Continuous DistributionsProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387659(347-360)Online publication date: 14-Jun-2020
Deutch DGilad AMoskovitch Y(2018)Efficient provenance tracking for datalog using top-k queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-018-0496-727:2(245-269)Online publication date: 1-Apr-2018
BáRány VCate BKimelfeld BOlteanu DVagena Z(2017)Declarative Probabilistic Programming with DatalogACM Transactions on Database Systems10.1145/313270042:4(1-35)Online publication date: 27-Oct-2017
Olteanu DSchaik S(2016)ENFrameACM Transactions on Database Systems10.1145/287720541:1(1-44)Online publication date: 18-Mar-2016
Jin TWang JWen LZou G(2014)Computing Refined Ordering Relations with Uncertainty for Acyclic Process ModelsIEEE Transactions on Services Computing10.1109/TSC.2013.197:3(415-426)Online publication date: Jul-2014
Cai ZVagena ZPerez LArumugam SHaas PJermaine CRoss KSrivastava DPapadias D(2013)Simulation of database-valued markov chains using SimSQLProceedings of the 2013 ACM SIGMOD International Conference on Management of Data10.1145/2463676.2465283(637-648)Online publication date: 22-Jun-2013
Cao CShe JTong YChen L(2012)Whom to ask?Proceedings of the VLDB Endowment10.14778/2350229.23502645:11(1495-1506)Online publication date: 1-Jul-2012
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents