Abstract
We consider the problem of query evaluation for tuple independent probabilistic databases and Boolean conjunctive queries with inequalities but without self-joins. We approach this problem as a construction problem for ordered binary decision diagrams (OBDDs): Given a query q and a probabilistic database D, we construct in polynomial time an OBDD such that the probability of q(D) can be computed linearly in the size of that OBDD. This approach is applicable to a large class of queries, including the hierarchical queries, i.e., the Boolean conjunctive queries without self-joins that admit PTIME evaluation on any tuple-independent probabilistic database, hierarchical queries extended with inequalities, and non-hierarchical queries on restricted databases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and Simple Relational Processing of Uncertain Data. In: Proc. ICDE (2008)
Benjelloun, O., Sarma, A.D., Halevy, A., Widom, J.: ULDBs: Databases with Uncertainty and Lineage. In: Proc. VLDB (2006)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers 35(8), 677–691 (1986)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2) (1992)
Dalvi, N., Suciu, D.: “Efficient query evaluation on probabilistic databases”. VLDB Journal 16(4), 523–544 (2007)
Dalvi, N., Suciu, D.: Management of Probabilistic Data: Foundations and Challenges. In: Proc. PODS (2007)
Dalvi, N., Suciu, D.: The Dichotomy of Conjunctive Queries on Probabilistic Structures. In: Proc. PODS (2007)
Darwiche, A.: Decomposable negation normal form. Journal of the ACM 48(4) (2001)
Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: Local vs. global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835. Springer, Heidelberg (2005)
Green, T.J., Tannen, V.: Models for Incomplete and Probabilistic Information. In: Proc. IIDB (2006)
Hayase, K., Imai, H.: OBDDs of a monotone function and of its prime implicants. In: Algorithms and Computation (1996)
Huang, J., Darwiche, A.: Using DPLL for efficient OBDD construction. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
Imielinski, T., Lipski, W.: Incomplete information in relational databases. Journal of ACM 31(4), 761–791 (1984)
Koch, C., Olteanu, D.: Conditioning Probabilistic Databases. In: JDMR (formerly Proc. VLDB), p. 1 (2008)
Lam, M.S., Whaley, J., Livshits, V.B., Martin, M.C., Avots, D., Carbin, M., Unkel, C.: Context-sensitive program analysis as database queries. In: PODS (2005)
Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design. Springer, Heidelberg (1998)
Olteanu, D., Huang, J., Koch, C.: Lazy versus Eager Query Plans for Tuple-Independent Probabilistic Databases. Technical report, Oxford University (2008)
Raedt, L.D., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic Prolog and its application in link discovery. In: Proc. IJCAI (2007)
Robertson, N., Seymour, P.: Graph minors. ii. algorithmic aspects of treewidth. J. of Algorithms 7, 309–322 (1986)
Sen, P., Deshpande, A.: Representing and Querying Correlated Tuples in Probabilistic Databases. In: Proc. ICDE (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olteanu, D., Huang, J. (2008). Using OBDDs for Efficient Query Evaluation on Probabilistic Databases. In: Greco, S., Lukasiewicz, T. (eds) Scalable Uncertainty Management. SUM 2008. Lecture Notes in Computer Science(), vol 5291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87993-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-87993-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87992-3
Online ISBN: 978-3-540-87993-0
eBook Packages: Computer ScienceComputer Science (R0)