Abstract
Uncertain or imprecise data are pervasive in applications like location-based services, sensor monitoring, and data collection and integration. For these applications, probabilistic databases can be used to store uncertain data, and querying facilities are provided to yield answers with statistical confidence. Given that a limited amount of resources is available to “clean” the database (e.g., by probing some sensor data values to get their latest values), we address the problem of choosing the set of uncertain objects to be cleaned, in order to achieve the best improvement in the quality of query answers. For this purpose, we present the PWS-quality metric, which is a universal measure that quantifies the ambiguity of query answers under the possible world semantics. We study how PWS-quality can be efficiently evaluated for two major query classes: (1) queries that examine the satisfiability of tuples independent of other tuples (e.g., range queries) and (2) queries that require the knowledge of the relative ranking of the tuples (e.g., MAX queries). We then propose a polynomial-time solution to achieve an optimal improvement in PWS-quality. Other fast heuristics are also examined.
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
Notes
- 1.
If s k is less than 1, we conceptually augment a “null” tuple to τ k , whose querying attribute has a value equal to − ∞ and existential probability equal to 1 − s k . This null tuple is only used for completeness in proofs; they do not exist physically.
- 2.
The proof of PMaxQ is similar, and it can be found in [12].
References
Agrawal P, Benjelloun O, Sarma AD, Hayworth C, Nabar S, Sugihara T, Widom J (2006) Trio: a system for data, uncertainty, and lineage. In: Proceedings of the VLDB 2006
Andritsos P, Fuxman A, Miller R (2006) Clean answers over dirty databases: a probabilistic approach. In: Proceedings of the ICDE 2006
Arumugam S, Xu F, Jampani R, Jermaine C, Perez LL, Haas PJ (2010) MCDB-R: risk analysis in the database. In: Proceedings of the VLDB 2010
Barbara D, Garcia-Molina H, Porter D (1992) The management of probabilistic data. IEEE TKDE 4(5):487–502
Benjelloun O, Sarma A, Halevy A, Widom J (2006) ULDBs: databases with uncertainty and lineage. In: Proceedings of the VLDB 2006
Beskales G, Soliman MA, Ilyas IF, Ben-David S (2009) Modeling and querying possible repairs in duplicate detection. In: Proceedings of the VLDB 2009
Böhm C, Pryakhin A, Schubert M (2006) The gauss-tree: efficient object identification in databases of probabilistic feature vectors. In: Proceedings of the ICDE 2006
Chen J, Cheng R (2008) Quality-aware probing of uncertain data with resource constraints. In: Proceedings of the SSDBM 2008
Cheng R, Kalashnikov D, Prabhakar S (2003) Evaluating probabilistic queries over imprecise data. In: Proceedings of the ACM SIGMOD 2003
Cheng R, Xia Y, Prabhakar S, Shah R, Vitter JS (2004) Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proceedings of the VLDB 2004
Cheng R, Chen J, Mokbel M, Chow C (2008) Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In: Proceedings of the ICDE 2008
Cheng R, Chen J, Xie X (2008) Cleaning uncertain data with quality guarantees. In: Proceedings of the VLDB 2008
Cheng R, Lo E, Yang XS, Luk MH, Li X, Xie X (2010) Explore or exploit?: effective strategies for disambiguating large databases. In Proceedings of the VLDB 2010
Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to algorithms. MIT, Cambridge
Dalvi N, Suciu D (2004) Efficient query evaluation on probabilistic databases. In: Proceedings of the VLDB 2004
de Rougemont M (1995) The reliability of queries. In: Proceedings of the PODS 1995
Deshpande A, Guestrin C, Madden S, Hellerstein J, Hong W (2004) Model-driven data acquisition in sensor networks. In: Proceedings of the VLDB 2004
Elmagarmid AK, Ipeirotis PG, Verykios VS (2007) Duplicate record detection: a survey. IEEE Trans Knowl Data Eng 19:1–16
Gradel E, Gurevich Y, Hirsch C (1998) The complexity of query reliability. In: Proceedings of the PODS 1998
Hua M, Pei J, Zhang W, Lin X (2008) Ranking queries on uncertain data: a probabilistic threshold approach. In: Proceedings of the ACM SIGMOD international conference on management of data 2008, pp 673–686
Jampani R, Xu F, Wu M, Perez LL, Jermaine C, Haas PJ (2008) MCDB: a Monte Carlo approach to managing uncertain data. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD’08), pp 687–700
Khoussainova N, Balazinska M, Suciu D (2006) Towards correcting input data errors probabilistically using integrity constraints. In: Proceedings of the MobiDE 2006
Kriegel H, Kunath P, Renz M (2007) Probabilistic nearest-neighbor query on uncertain objects. In: Proceedings of the DASFAA 2007
Li J, Saha B, Deshpande A (2009) A unified approach to ranking in probabilistic databases. In: Proceedings of the VLDB 2009
Lian X, Chen L (2008) Monochromatic and bichromatic reverse skyline search over uncertain databases. In: Proceedings of the SIGMOD 2008
Liu Z, Sia K, Cho J (2005) Cost-efficient processing of min/max queries over distributed sensors with uncertainty. In: Proceedings of the annual ACM symposium on applied computing (SAC) 2005
Nodine M, Vitter J (1995) Greed sort: an optimal sorting algorithm for multiple disks. J ACM 42(4):919–933
Olston C, Jiang J, Widom J (2003) Adaptive filters for continuous queries over distributed data streams. In: Proceedings of the SIGMOD 2003
Pei J, Jiang B, Lin X, Yuan Y (2007) Probabilistic skylines on uncertain data. In: Proceedings of the VLDB 2007
Pfoser D, Jensen C (1999) Capturing the uncertainty of moving-objects representations. In: Proceedings of the SSDBM 1999
Re C, Dalvi N, Suciu D (2007) Efficient top-k query evaluation on probabilistic data. In: Proceedings of the ICDE 2007
Shannon C (1949) The mathematical theory of communication. University of Illinois Press, Urbana
Silberstein A, Braynard R, Ellis C, Munagala K, Yang J (2006) A sampling-based approach to optimizing top-k queries in sensor networks. In: Proceedings of the ICDE 2006
Singh S, Mayfield C, Prabhakar S, Shah R, Hambrusch S (2007) Indexing uncertain categorical data. In: Proceedings of the ICDE 2007
Singh S, Mayfield C, Shah R, Prabhakar S, Hambrusch SE, Neville J, Cheng R (2008) Database Support for probabilistic attributes and tuples. In: Proceedings of the ICDE 2008
Sistla PA, Wolfson O, Chamberlain S, Dao S (1998) Querying the uncertain position of moving objects. In: Temporal databases: research and practice. Springer, Berlin
Soliman M, Ilyas I, Chang K (2007) Top-k query processing in uncertain databases. In: Proceedings of the ICDE 2007
Soliman MA, Ilyas IF (2009) Ranking with uncertain scores. In: Proceedings of the ICDE 2009
Tao Y, Cheng R, Xiao X, Ngai WK, Kao B, Prabhakar S (2005) Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of the VLDB 2005
Yi K, Li F, Srivastava D, Kollios G (2008) Efficient processing of top-k queries in uncertain databases. In: Proceedings of the ICDE 2008
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cheng, R. (2013). Managing Quality of Probabilistic Databases. In: Sadiq, S. (eds) Handbook of Data Quality. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36257-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-36257-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36256-9
Online ISBN: 978-3-642-36257-6
eBook Packages: Computer ScienceComputer Science (R0)