Abstract
The problem of managing and querying inconsistent databases has been deeply investigated in the last few years. Most of the approaches proposed so far rely on the notion of repair (a minimal set of delete/insert operations making the database consistent) and consistent query answer (the answer to a query is given by considering the set of ‘repaired’ databases). Since the problem of consistent query answering is hard in the general case, most of the proposed techniques have an exponential complexity, although for special classes of constraints and queries the problem becomes polynomial. A second problem with most of the proposed approaches is that repairs do not take into account update operations (they consider delete and insert operations only).
This paper presents a general framework where constraints consist of functional dependencies and queries may be expressed by positive relational algebra. The framework allows us to compute certain (i.e. tuples derivable from all or from none of the repaired databases) and uncertain query answers (i.e. tuples derivable from a proper not empty subset of the repaired databases). Each tuple in the answer is associated with a probability, which depends on the number of repaired databases from which the tuple can be derived. In the proposed framework, databases are repaired by means of update operations and repaired databases are stored by means of a “condensed” database, so that all the repaired databases can be derived by “expanding” the unique condensed database. A condensed database can be rewritten into a probabilistic database where each tuple is associated with an event (i.e. a boolean formula) and, thus, a probability value. The probabilistic query answer can be computed by querying the so obtained probabilistic database. As the complexity of querying probabilistic databases is #P-complete, approximate probabilistic answers which are computable in polynomial time are considered.
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1994)
Andritsos, P., Fuxman, A., Miller, R.J.: Clean Answers over Dirty Databases: A Probabilistic Approach. In: Proc. Int. Conf. on Data Engineering, vol. 30 (2006)
Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. Symp. on Principles of Database Systems, pp. 68–79 (1999)
Bohannon, P., Flaster, M., Fan, W., Rastogi, R.: A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification. In: SIGMOD Conference, pp. 143–154 (2005)
Chomicki, J.: Consistent Query Answering: Five Easy Pieces. In: Proc. Int. Conf. on database Theory, pp. 1–17 (2007)
Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information & Compututation 197(1-2), 90–121 (2005)
Dalvi, N., Suciu, D.: Management of Probabilistic Data Foundations and Challenges. In: Proc. ACM Symp. on Principles of Database Systems, pp. 1–12 (2007)
Dalvi, N., Suciu, D.: The Dichotomy of Conjunctive Queries on probabilistic Structures. In: Proc. ACM Symp. on Principles of Database Systems, pp. 293–302 (2007)
Dalvi, N., Suciu, D.: Efficient Query Evaluation on Probabilistic Databases. In: Proc. Int. Conf. on Very Large Data Bases, pp. 864–875 (2005)
Dey, D., Sarkar, S.: A Probabilistic Relational Model and Algebra. ACM Transanctions on Database Systems 21(3), 339–369 (1996)
Fuhr, N.: A Probabilistic Relational Model for the Integration of IR and Databases. In: Int. Conf. on Research and Development in Information Retrieval, pp. 309–317 (1993)
Fuhr, N., Rolleke, T.: A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems. ACM TODS 15(1), 32–66 (1997)
Greco, G., Greco, S., Zumpano, E.: A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE TKDE 15(6), 1389–1408 (2003)
Kahn, J., Linial, N., Samorodnitsky, A.: Inclusion-Exclusion: Exact and Approximate. Combinatorica 16(4), 465–477 (1996)
Linial, N., Nisan, N.: Approximate Inclusion-Exclusion. In: Symposium on the Theory of Computing, pp. 260–270 (1990)
Ullman, J.K.: Principles of Data and Knowledge-Base Systems, vol. 1, 2. Computer Science Press, New York (1988)
Wijsen, J.: Database Repairing Using Updates. ACM Transactions on Database Systems 30(3), 722–768 (2005)
Wijsen, J.: Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies. In: Proc. FQAS Conf., pp. 1–12 (2006)
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
Greco, S., Molinaro, C. (2008). Approximate Probabilistic Query Answering over Inconsistent Databases. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds) Conceptual Modeling - ER 2008. ER 2008. Lecture Notes in Computer Science, vol 5231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87877-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-87877-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87876-6
Online ISBN: 978-3-540-87877-3
eBook Packages: Computer ScienceComputer Science (R0)